/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-prod-cons.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.abstract-por-f0ea240 [2022-02-10 23:00:37,212 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-10 23:00:37,213 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-10 23:00:37,258 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-10 23:00:37,259 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-10 23:00:37,259 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-10 23:00:37,260 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-10 23:00:37,262 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-10 23:00:37,263 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-10 23:00:37,264 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-10 23:00:37,264 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-10 23:00:37,265 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-10 23:00:37,265 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-10 23:00:37,265 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-10 23:00:37,266 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-10 23:00:37,267 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-10 23:00:37,267 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-10 23:00:37,268 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-10 23:00:37,269 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-10 23:00:37,270 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-10 23:00:37,271 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-10 23:00:37,276 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-10 23:00:37,278 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-10 23:00:37,279 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-10 23:00:37,282 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-10 23:00:37,282 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-10 23:00:37,283 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-10 23:00:37,283 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-10 23:00:37,283 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-10 23:00:37,284 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-10 23:00:37,284 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-10 23:00:37,284 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-10 23:00:37,285 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-10 23:00:37,285 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-10 23:00:37,286 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-10 23:00:37,286 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-10 23:00:37,286 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-10 23:00:37,286 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-10 23:00:37,286 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-10 23:00:37,287 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-10 23:00:37,287 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-10 23:00:37,291 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2022-02-10 23:00:37,314 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-10 23:00:37,314 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-10 23:00:37,314 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-10 23:00:37,314 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-10 23:00:37,315 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-10 23:00:37,315 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-10 23:00:37,315 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-10 23:00:37,315 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-10 23:00:37,315 INFO L138 SettingsManager]: * Use SBE=true [2022-02-10 23:00:37,315 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-10 23:00:37,315 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-10 23:00:37,315 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-10 23:00:37,316 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-10 23:00:37,316 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-10 23:00:37,316 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-10 23:00:37,316 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-10 23:00:37,316 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-10 23:00:37,316 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-10 23:00:37,316 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-10 23:00:37,316 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-10 23:00:37,316 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-10 23:00:37,316 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-10 23:00:37,316 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-10 23:00:37,316 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-10 23:00:37,316 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-10 23:00:37,317 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-10 23:00:37,317 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-10 23:00:37,317 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-10 23:00:37,317 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-10 23:00:37,317 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-10 23:00:37,317 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-10 23:00:37,317 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-10 23:00:37,317 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-10 23:00:37,317 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-02-10 23:00:37,504 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-10 23:00:37,520 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-10 23:00:37,521 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-10 23:00:37,522 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-10 23:00:37,523 INFO L275 PluginConnector]: CDTParser initialized [2022-02-10 23:00:37,524 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-prod-cons.wvr.c [2022-02-10 23:00:37,568 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb4dfd454/058ae2bbb0f44dbeb9041d5b8f5c25dd/FLAGe35c7894f [2022-02-10 23:00:37,945 INFO L306 CDTParser]: Found 1 translation units. [2022-02-10 23:00:37,946 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-prod-cons.wvr.c [2022-02-10 23:00:37,950 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb4dfd454/058ae2bbb0f44dbeb9041d5b8f5c25dd/FLAGe35c7894f [2022-02-10 23:00:37,964 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb4dfd454/058ae2bbb0f44dbeb9041d5b8f5c25dd [2022-02-10 23:00:37,965 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-10 23:00:37,966 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-10 23:00:37,969 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-10 23:00:37,969 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-10 23:00:37,972 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-10 23:00:37,972 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.02 11:00:37" (1/1) ... [2022-02-10 23:00:37,973 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b97cfd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:00:37, skipping insertion in model container [2022-02-10 23:00:37,973 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.02 11:00:37" (1/1) ... [2022-02-10 23:00:37,978 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-10 23:00:37,997 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-10 23:00:38,134 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-prod-cons.wvr.c[3056,3069] [2022-02-10 23:00:38,138 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-10 23:00:38,143 INFO L203 MainTranslator]: Completed pre-run [2022-02-10 23:00:38,162 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-prod-cons.wvr.c[3056,3069] [2022-02-10 23:00:38,165 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-10 23:00:38,174 INFO L208 MainTranslator]: Completed translation [2022-02-10 23:00:38,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:00:38 WrapperNode [2022-02-10 23:00:38,175 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-10 23:00:38,178 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-10 23:00:38,178 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-10 23:00:38,178 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-10 23:00:38,184 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:00:38" (1/1) ... [2022-02-10 23:00:38,198 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:00:38" (1/1) ... [2022-02-10 23:00:38,222 INFO L137 Inliner]: procedures = 25, calls = 50, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 166 [2022-02-10 23:00:38,223 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-10 23:00:38,223 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-10 23:00:38,223 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-10 23:00:38,223 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-10 23:00:38,229 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:00:38" (1/1) ... [2022-02-10 23:00:38,229 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:00:38" (1/1) ... [2022-02-10 23:00:38,231 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:00:38" (1/1) ... [2022-02-10 23:00:38,231 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:00:38" (1/1) ... [2022-02-10 23:00:38,235 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:00:38" (1/1) ... [2022-02-10 23:00:38,237 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:00:38" (1/1) ... [2022-02-10 23:00:38,238 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:00:38" (1/1) ... [2022-02-10 23:00:38,244 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-10 23:00:38,244 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-10 23:00:38,244 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-10 23:00:38,244 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-10 23:00:38,245 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:00:38" (1/1) ... [2022-02-10 23:00:38,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-10 23:00:38,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:00:38,271 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-10 23:00:38,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-10 23:00:38,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-10 23:00:38,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-10 23:00:38,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-10 23:00:38,294 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-10 23:00:38,294 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-02-10 23:00:38,294 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-02-10 23:00:38,294 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-02-10 23:00:38,294 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-02-10 23:00:38,295 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-02-10 23:00:38,295 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-02-10 23:00:38,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-10 23:00:38,295 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-02-10 23:00:38,295 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-02-10 23:00:38,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-10 23:00:38,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-10 23:00:38,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-10 23:00:38,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-10 23:00:38,296 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-02-10 23:00:38,364 INFO L234 CfgBuilder]: Building ICFG [2022-02-10 23:00:38,365 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-10 23:00:38,585 INFO L275 CfgBuilder]: Performing block encoding [2022-02-10 23:00:38,628 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-10 23:00:38,628 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-10 23:00:38,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 11:00:38 BoogieIcfgContainer [2022-02-10 23:00:38,630 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-10 23:00:38,632 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-10 23:00:38,632 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-10 23:00:38,634 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-10 23:00:38,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.02 11:00:37" (1/3) ... [2022-02-10 23:00:38,635 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7118549f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.02 11:00:38, skipping insertion in model container [2022-02-10 23:00:38,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:00:38" (2/3) ... [2022-02-10 23:00:38,635 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7118549f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.02 11:00:38, skipping insertion in model container [2022-02-10 23:00:38,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 11:00:38" (3/3) ... [2022-02-10 23:00:38,636 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-prod-cons.wvr.c [2022-02-10 23:00:38,641 WARN L154 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-10 23:00:38,641 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-10 23:00:38,641 INFO L168 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-10 23:00:38,641 INFO L538 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-10 23:00:38,690 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork1_~w~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,690 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork1_~w~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,690 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork1_~w~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,691 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork1_~w~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,691 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork1_~w~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,692 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork1_~w~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,692 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,692 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,692 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,693 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,693 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,693 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,693 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,693 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,694 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,695 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,695 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,695 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork1_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,695 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,696 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork1_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,696 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,696 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork1_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,696 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,697 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork1_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,697 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork1_~w~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,698 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,698 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork1_~w~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,698 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,698 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,698 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork1_~w~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,698 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,699 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork1_~w~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,700 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,700 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,701 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_~temp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,701 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_~temp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,701 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,701 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,701 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,702 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,702 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,702 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,702 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,702 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,702 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,703 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,703 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,703 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,703 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,703 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_~temp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,703 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,704 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,704 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,704 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,704 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_~temp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,704 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,705 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_~temp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,705 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_~temp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,706 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,706 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,706 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,706 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,706 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,706 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,713 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,713 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,714 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,714 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork1_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,715 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,715 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork1_~w~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,715 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork1_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,715 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,715 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,715 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,715 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,716 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,716 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_~temp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,716 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,717 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,717 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,717 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,717 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,717 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:00:38,727 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-02-10 23:00:38,767 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-10 23:00:38,773 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-10 23:00:38,774 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-02-10 23:00:38,787 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 155 places, 156 transitions, 336 flow [2022-02-10 23:00:38,902 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2453 states, 2452 states have (on average 3.480016313213703) internal successors, (8533), 2452 states have internal predecessors, (8533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:00:38,912 INFO L276 IsEmpty]: Start isEmpty. Operand has 2453 states, 2452 states have (on average 3.480016313213703) internal successors, (8533), 2452 states have internal predecessors, (8533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:00:38,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-02-10 23:00:38,937 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:00:38,938 INFO L515 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:00:38,939 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-10 23:00:38,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:00:38,945 INFO L85 PathProgramCache]: Analyzing trace with hash -2134475998, now seen corresponding path program 1 times [2022-02-10 23:00:38,952 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:00:38,952 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422798448] [2022-02-10 23:00:38,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:00:38,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:00:39,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:00:39,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:00:39,128 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:00:39,129 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422798448] [2022-02-10 23:00:39,129 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422798448] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:00:39,129 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:00:39,129 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-10 23:00:39,130 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449420004] [2022-02-10 23:00:39,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:00:39,134 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-10 23:00:39,134 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:00:39,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-10 23:00:39,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-10 23:00:39,165 INFO L87 Difference]: Start difference. First operand has 2453 states, 2452 states have (on average 3.480016313213703) internal successors, (8533), 2452 states have internal predecessors, (8533), 0 states have call successors, (0), 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 56.0) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:00:39,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:00:39,240 INFO L93 Difference]: Finished difference Result 2453 states and 8070 transitions. [2022-02-10 23:00:39,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-10 23:00:39,242 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 56.0) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2022-02-10 23:00:39,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:00:39,276 INFO L225 Difference]: With dead ends: 2453 [2022-02-10 23:00:39,276 INFO L226 Difference]: Without dead ends: 2449 [2022-02-10 23:00:39,277 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-10 23:00:39,280 INFO L934 BasicCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-10 23:00:39,281 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-10 23:00:39,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2449 states. [2022-02-10 23:00:39,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2449 to 2449. [2022-02-10 23:00:39,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2449 states, 2448 states have (on average 3.2949346405228757) internal successors, (8066), 2448 states have internal predecessors, (8066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:00:39,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2449 states to 2449 states and 8066 transitions. [2022-02-10 23:00:39,449 INFO L78 Accepts]: Start accepts. Automaton has 2449 states and 8066 transitions. Word has length 112 [2022-02-10 23:00:39,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:00:39,449 INFO L470 AbstractCegarLoop]: Abstraction has 2449 states and 8066 transitions. [2022-02-10 23:00:39,450 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 56.0) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:00:39,450 INFO L276 IsEmpty]: Start isEmpty. Operand 2449 states and 8066 transitions. [2022-02-10 23:00:39,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-02-10 23:00:39,459 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:00:39,459 INFO L515 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:00:39,459 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-10 23:00:39,460 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-10 23:00:39,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:00:39,461 INFO L85 PathProgramCache]: Analyzing trace with hash -198236285, now seen corresponding path program 1 times [2022-02-10 23:00:39,462 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:00:39,462 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46744381] [2022-02-10 23:00:39,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:00:39,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:00:39,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:00:39,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:00:39,842 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:00:39,842 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46744381] [2022-02-10 23:00:39,842 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46744381] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:00:39,842 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:00:39,842 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-10 23:00:39,843 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717338952] [2022-02-10 23:00:39,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:00:39,844 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-10 23:00:39,844 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:00:39,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-10 23:00:39,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-02-10 23:00:39,845 INFO L87 Difference]: Start difference. First operand 2449 states and 8066 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:00:40,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:00:40,047 INFO L93 Difference]: Finished difference Result 3433 states and 11469 transitions. [2022-02-10 23:00:40,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-10 23:00:40,047 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2022-02-10 23:00:40,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:00:40,058 INFO L225 Difference]: With dead ends: 3433 [2022-02-10 23:00:40,058 INFO L226 Difference]: Without dead ends: 2164 [2022-02-10 23:00:40,061 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2022-02-10 23:00:40,062 INFO L934 BasicCegarLoop]: 135 mSDtfsCounter, 336 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-10 23:00:40,063 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [336 Valid, 475 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-10 23:00:40,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2164 states. [2022-02-10 23:00:40,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2164 to 2164. [2022-02-10 23:00:40,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2164 states, 2163 states have (on average 3.1673601479426723) internal successors, (6851), 2163 states have internal predecessors, (6851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:00:40,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2164 states to 2164 states and 6851 transitions. [2022-02-10 23:00:40,114 INFO L78 Accepts]: Start accepts. Automaton has 2164 states and 6851 transitions. Word has length 112 [2022-02-10 23:00:40,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:00:40,115 INFO L470 AbstractCegarLoop]: Abstraction has 2164 states and 6851 transitions. [2022-02-10 23:00:40,116 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:00:40,116 INFO L276 IsEmpty]: Start isEmpty. Operand 2164 states and 6851 transitions. [2022-02-10 23:00:40,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-02-10 23:00:40,124 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:00:40,125 INFO L515 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:00:40,125 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-10 23:00:40,125 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-10 23:00:40,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:00:40,126 INFO L85 PathProgramCache]: Analyzing trace with hash -50241742, now seen corresponding path program 1 times [2022-02-10 23:00:40,126 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:00:40,126 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987109413] [2022-02-10 23:00:40,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:00:40,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:00:40,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:00:40,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:00:40,236 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:00:40,236 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987109413] [2022-02-10 23:00:40,236 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987109413] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:00:40,236 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [883095620] [2022-02-10 23:00:40,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:00:40,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:00:40,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:00:40,238 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 23:00:40,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-10 23:00:40,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:00:40,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-10 23:00:40,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:00:40,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:00:40,597 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 23:00:40,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:00:40,736 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [883095620] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 23:00:40,736 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 23:00:40,736 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 8 [2022-02-10 23:00:40,737 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279550537] [2022-02-10 23:00:40,737 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 23:00:40,737 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-10 23:00:40,737 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:00:40,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-10 23:00:40,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-10 23:00:40,738 INFO L87 Difference]: Start difference. First operand 2164 states and 6851 transitions. Second operand has 8 states, 8 states have (on average 23.25) internal successors, (186), 8 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:00:40,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:00:40,812 INFO L93 Difference]: Finished difference Result 2869 states and 9286 transitions. [2022-02-10 23:00:40,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-10 23:00:40,813 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 23.25) internal successors, (186), 8 states have internal predecessors, (186), 0 states have call successors, (0), 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 116 [2022-02-10 23:00:40,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:00:40,823 INFO L225 Difference]: With dead ends: 2869 [2022-02-10 23:00:40,823 INFO L226 Difference]: Without dead ends: 2305 [2022-02-10 23:00:40,823 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 228 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-02-10 23:00:40,824 INFO L934 BasicCegarLoop]: 141 mSDtfsCounter, 346 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-10 23:00:40,824 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [346 Valid, 446 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-10 23:00:40,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2305 states. [2022-02-10 23:00:40,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2305 to 2305. [2022-02-10 23:00:40,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2305 states, 2304 states have (on average 3.1236979166666665) internal successors, (7197), 2304 states have internal predecessors, (7197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:00:40,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2305 states to 2305 states and 7197 transitions. [2022-02-10 23:00:40,903 INFO L78 Accepts]: Start accepts. Automaton has 2305 states and 7197 transitions. Word has length 116 [2022-02-10 23:00:40,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:00:40,903 INFO L470 AbstractCegarLoop]: Abstraction has 2305 states and 7197 transitions. [2022-02-10 23:00:40,904 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 23.25) internal successors, (186), 8 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:00:40,904 INFO L276 IsEmpty]: Start isEmpty. Operand 2305 states and 7197 transitions. [2022-02-10 23:00:40,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-02-10 23:00:40,909 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:00:40,909 INFO L515 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:00:40,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-10 23:00:41,127 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:00:41,128 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-10 23:00:41,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:00:41,128 INFO L85 PathProgramCache]: Analyzing trace with hash 102358740, now seen corresponding path program 2 times [2022-02-10 23:00:41,128 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:00:41,129 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067305656] [2022-02-10 23:00:41,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:00:41,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:00:41,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:00:41,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:00:41,217 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:00:41,217 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067305656] [2022-02-10 23:00:41,217 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067305656] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:00:41,217 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:00:41,217 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-10 23:00:41,217 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078684702] [2022-02-10 23:00:41,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:00:41,217 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-10 23:00:41,218 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:00:41,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-10 23:00:41,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-10 23:00:41,219 INFO L87 Difference]: Start difference. First operand 2305 states and 7197 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:00:41,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:00:41,244 INFO L93 Difference]: Finished difference Result 2493 states and 7603 transitions. [2022-02-10 23:00:41,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-10 23:00:41,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 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 116 [2022-02-10 23:00:41,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:00:41,254 INFO L225 Difference]: With dead ends: 2493 [2022-02-10 23:00:41,254 INFO L226 Difference]: Without dead ends: 2343 [2022-02-10 23:00:41,256 INFO L933 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-02-10 23:00:41,261 INFO L934 BasicCegarLoop]: 122 mSDtfsCounter, 25 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-10 23:00:41,261 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 180 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-10 23:00:41,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2343 states. [2022-02-10 23:00:41,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2343 to 2343. [2022-02-10 23:00:41,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2343 states, 2342 states have (on average 3.066609735269001) internal successors, (7182), 2342 states have internal predecessors, (7182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:00:41,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2343 states to 2343 states and 7182 transitions. [2022-02-10 23:00:41,311 INFO L78 Accepts]: Start accepts. Automaton has 2343 states and 7182 transitions. Word has length 116 [2022-02-10 23:00:41,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:00:41,312 INFO L470 AbstractCegarLoop]: Abstraction has 2343 states and 7182 transitions. [2022-02-10 23:00:41,312 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:00:41,312 INFO L276 IsEmpty]: Start isEmpty. Operand 2343 states and 7182 transitions. [2022-02-10 23:00:41,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-02-10 23:00:41,318 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:00:41,318 INFO L515 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:00:41,318 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-10 23:00:41,318 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-10 23:00:41,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:00:41,324 INFO L85 PathProgramCache]: Analyzing trace with hash 743330443, now seen corresponding path program 1 times [2022-02-10 23:00:41,324 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:00:41,325 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903199655] [2022-02-10 23:00:41,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:00:41,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:00:41,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:00:41,376 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-10 23:00:41,376 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:00:41,376 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903199655] [2022-02-10 23:00:41,376 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903199655] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:00:41,377 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:00:41,377 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-10 23:00:41,377 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280144832] [2022-02-10 23:00:41,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:00:41,377 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-10 23:00:41,377 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:00:41,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-10 23:00:41,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-10 23:00:41,378 INFO L87 Difference]: Start difference. First operand 2343 states and 7182 transitions. Second operand has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:00:41,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:00:41,456 INFO L93 Difference]: Finished difference Result 2594 states and 7748 transitions. [2022-02-10 23:00:41,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-10 23:00:41,456 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 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-02-10 23:00:41,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:00:41,466 INFO L225 Difference]: With dead ends: 2594 [2022-02-10 23:00:41,467 INFO L226 Difference]: Without dead ends: 2349 [2022-02-10 23:00:41,467 INFO L933 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-02-10 23:00:41,467 INFO L934 BasicCegarLoop]: 115 mSDtfsCounter, 334 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-10 23:00:41,467 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [334 Valid, 355 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-10 23:00:41,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2349 states. [2022-02-10 23:00:41,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2349 to 2344. [2022-02-10 23:00:41,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2344 states, 2343 states have (on average 3.0657276995305165) internal successors, (7183), 2343 states have internal predecessors, (7183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:00:41,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2344 states to 2344 states and 7183 transitions. [2022-02-10 23:00:41,522 INFO L78 Accepts]: Start accepts. Automaton has 2344 states and 7183 transitions. Word has length 123 [2022-02-10 23:00:41,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:00:41,522 INFO L470 AbstractCegarLoop]: Abstraction has 2344 states and 7183 transitions. [2022-02-10 23:00:41,522 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:00:41,522 INFO L276 IsEmpty]: Start isEmpty. Operand 2344 states and 7183 transitions. [2022-02-10 23:00:41,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-02-10 23:00:41,528 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:00:41,528 INFO L515 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:00:41,528 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-10 23:00:41,528 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-10 23:00:41,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:00:41,529 INFO L85 PathProgramCache]: Analyzing trace with hash -129850157, now seen corresponding path program 1 times [2022-02-10 23:00:41,529 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:00:41,529 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849203198] [2022-02-10 23:00:41,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:00:41,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:00:41,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:00:42,359 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:00:42,359 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:00:42,360 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849203198] [2022-02-10 23:00:42,360 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849203198] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:00:42,360 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937677777] [2022-02-10 23:00:42,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:00:42,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:00:42,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:00:42,361 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 23:00:42,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-10 23:00:42,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:00:42,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 51 conjunts are in the unsatisfiable core [2022-02-10 23:00:42,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:00:43,332 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-02-10 23:00:43,847 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-10 23:00:44,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:00:44,400 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-02-10 23:00:44,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:00:44,535 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-02-10 23:00:44,680 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-02-10 23:00:44,847 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:00:44,847 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 23:00:45,012 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_121 (Array Int Int))) (<= (+ c_~d~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_121) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) c_~W~0)) is different from false [2022-02-10 23:00:45,055 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_120 (Array Int Int)) (v_ArrVal_121 (Array Int Int))) (<= (+ c_~d~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_120) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_121) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) c_~W~0)) is different from false [2022-02-10 23:00:46,258 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 23:00:46,258 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 50 [2022-02-10 23:00:46,267 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 23:00:46,268 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 362 treesize of output 354 [2022-02-10 23:00:46,273 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 314 treesize of output 266 [2022-02-10 23:00:46,284 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 23:00:46,284 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 290 treesize of output 288 [2022-02-10 23:00:46,290 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 254 treesize of output 230 [2022-02-10 23:00:47,717 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-02-10 23:00:47,717 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [937677777] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 23:00:47,717 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 23:00:47,717 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 31, 31] total 81 [2022-02-10 23:00:47,717 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534221346] [2022-02-10 23:00:47,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 23:00:47,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2022-02-10 23:00:47,718 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:00:47,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2022-02-10 23:00:47,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=484, Invalid=5660, Unknown=26, NotChecked=310, Total=6480 [2022-02-10 23:00:47,720 INFO L87 Difference]: Start difference. First operand 2344 states and 7183 transitions. Second operand has 81 states, 81 states have (on average 4.049382716049383) internal successors, (328), 81 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:00:55,609 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (* c_~back~0 4))) (let ((.cse1 (forall ((v_ArrVal_120 (Array Int Int)) (v_ArrVal_121 (Array Int Int))) (<= (+ c_~d~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_120) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_121) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) c_~W~0))) (.cse0 (mod c_~v_assert~0 256)) (.cse2 (not (< c_~back~0 c_~n~0))) (.cse3 (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse5)) 1))) (.cse4 (not (<= 0 c_~back~0)))) (and (not (<= .cse0 0)) (= c_~d~0 0) (or .cse1 .cse2 .cse3 .cse4) .cse1 (or (<= 1 c_~back~0) (< c_~back~0 0) (and (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= c_~d~0 0) (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (= (* c_~front~0 4) .cse5))) (or (= .cse0 0) .cse2 (forall ((v_ArrVal_120 (Array Int Int)) (v_ArrVal_121 (Array Int Int))) (<= (+ c_~d~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_120) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_121) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) .cse3 .cse4)))) is different from false [2022-02-10 23:00:58,845 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_120 (Array Int Int)) (v_ArrVal_121 (Array Int Int))) (<= (+ c_~d~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_120) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_121) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) c_~W~0)) (or (<= 1 c_~back~0) (< c_~back~0 0) (and (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= c_~d~0 0) (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (= (* c_~front~0 4) (* c_~back~0 4))))) is different from false [2022-02-10 23:00:59,175 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_120 (Array Int Int)) (v_ArrVal_121 (Array Int Int))) (<= (+ c_~d~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_120) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_121) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) c_~W~0))) (.cse1 (* c_~back~0 4))) (and (not (<= (mod c_~v_assert~0 256) 0)) (or .cse0 (not (< c_~back~0 c_~n~0)) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)) 1)) (not (<= 0 c_~back~0))) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) .cse0 (or (<= 1 c_~back~0) (< c_~back~0 0) (and (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= c_~d~0 0) (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (= (* c_~front~0 4) .cse1))))) is different from false [2022-02-10 23:00:59,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:00:59,757 INFO L93 Difference]: Finished difference Result 20348 states and 64283 transitions. [2022-02-10 23:00:59,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2022-02-10 23:00:59,757 INFO L78 Accepts]: Start accepts. Automaton has has 81 states, 81 states have (on average 4.049382716049383) internal successors, (328), 81 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 130 [2022-02-10 23:00:59,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:00:59,821 INFO L225 Difference]: With dead ends: 20348 [2022-02-10 23:00:59,821 INFO L226 Difference]: Without dead ends: 15059 [2022-02-10 23:00:59,827 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 217 SyntacticMatches, 27 SemanticMatches, 178 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12092 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=3587, Invalid=26746, Unknown=137, NotChecked=1750, Total=32220 [2022-02-10 23:00:59,828 INFO L934 BasicCegarLoop]: 272 mSDtfsCounter, 4545 mSDsluCounter, 11211 mSDsCounter, 0 mSdLazyCounter, 4124 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4545 SdHoareTripleChecker+Valid, 9977 SdHoareTripleChecker+Invalid, 8197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 4124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3853 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-02-10 23:00:59,828 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [4545 Valid, 9977 Invalid, 8197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 4124 Invalid, 0 Unknown, 3853 Unchecked, 2.2s Time] [2022-02-10 23:00:59,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15059 states. [2022-02-10 23:01:00,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15059 to 3680. [2022-02-10 23:01:00,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3680 states, 3679 states have (on average 2.9766240826311496) internal successors, (10951), 3679 states have internal predecessors, (10951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:01:00,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3680 states to 3680 states and 10951 transitions. [2022-02-10 23:01:00,031 INFO L78 Accepts]: Start accepts. Automaton has 3680 states and 10951 transitions. Word has length 130 [2022-02-10 23:01:00,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:01:00,031 INFO L470 AbstractCegarLoop]: Abstraction has 3680 states and 10951 transitions. [2022-02-10 23:01:00,032 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 81 states have (on average 4.049382716049383) internal successors, (328), 81 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:01:00,032 INFO L276 IsEmpty]: Start isEmpty. Operand 3680 states and 10951 transitions. [2022-02-10 23:01:00,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-02-10 23:01:00,040 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:01:00,040 INFO L515 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:01:00,060 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-02-10 23:01:00,257 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-02-10 23:01:00,258 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-10 23:01:00,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:01:00,258 INFO L85 PathProgramCache]: Analyzing trace with hash 526565270, now seen corresponding path program 2 times [2022-02-10 23:01:00,258 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:01:00,259 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578950094] [2022-02-10 23:01:00,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:01:00,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:01:00,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:01:00,433 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:01:00,433 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:01:00,433 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578950094] [2022-02-10 23:01:00,434 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578950094] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:01:00,434 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198791657] [2022-02-10 23:01:00,434 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-10 23:01:00,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:01:00,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:01:00,435 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 23:01:00,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-10 23:01:00,516 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-10 23:01:00,517 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:01:00,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-10 23:01:00,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:01:00,725 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-10 23:01:00,725 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 23:01:01,077 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-10 23:01:01,077 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1198791657] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 23:01:01,077 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 23:01:01,077 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 5] total 16 [2022-02-10 23:01:01,078 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140638407] [2022-02-10 23:01:01,078 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 23:01:01,078 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-10 23:01:01,078 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:01:01,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-10 23:01:01,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-02-10 23:01:01,079 INFO L87 Difference]: Start difference. First operand 3680 states and 10951 transitions. Second operand has 16 states, 16 states have (on average 18.75) internal successors, (300), 16 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-02-10 23:01:01,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:01:01,484 INFO L93 Difference]: Finished difference Result 12206 states and 37480 transitions. [2022-02-10 23:01:01,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-10 23:01:01,485 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 18.75) internal successors, (300), 16 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 134 [2022-02-10 23:01:01,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:01:01,548 INFO L225 Difference]: With dead ends: 12206 [2022-02-10 23:01:01,548 INFO L226 Difference]: Without dead ends: 11468 [2022-02-10 23:01:01,548 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=227, Invalid=529, Unknown=0, NotChecked=0, Total=756 [2022-02-10 23:01:01,550 INFO L934 BasicCegarLoop]: 170 mSDtfsCounter, 1263 mSDsluCounter, 1028 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1263 SdHoareTripleChecker+Valid, 1134 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-10 23:01:01,550 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [1263 Valid, 1134 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-10 23:01:01,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11468 states. [2022-02-10 23:01:01,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11468 to 7088. [2022-02-10 23:01:01,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7088 states, 7087 states have (on average 2.995908000564414) internal successors, (21232), 7087 states have internal predecessors, (21232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:01:01,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7088 states to 7088 states and 21232 transitions. [2022-02-10 23:01:01,732 INFO L78 Accepts]: Start accepts. Automaton has 7088 states and 21232 transitions. Word has length 134 [2022-02-10 23:01:01,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:01:01,732 INFO L470 AbstractCegarLoop]: Abstraction has 7088 states and 21232 transitions. [2022-02-10 23:01:01,732 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 18.75) internal successors, (300), 16 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-02-10 23:01:01,732 INFO L276 IsEmpty]: Start isEmpty. Operand 7088 states and 21232 transitions. [2022-02-10 23:01:01,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-02-10 23:01:01,757 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:01:01,757 INFO L515 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:01:01,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-10 23:01:01,963 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-02-10 23:01:01,963 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-10 23:01:01,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:01:01,964 INFO L85 PathProgramCache]: Analyzing trace with hash -2146157939, now seen corresponding path program 3 times [2022-02-10 23:01:01,964 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:01:01,964 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185625887] [2022-02-10 23:01:01,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:01:01,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:01:01,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:01:03,104 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:01:03,104 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:01:03,104 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185625887] [2022-02-10 23:01:03,104 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185625887] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:01:03,105 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112770746] [2022-02-10 23:01:03,105 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-10 23:01:03,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:01:03,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:01:03,106 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 23:01:03,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-10 23:01:03,196 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-02-10 23:01:03,196 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:01:03,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 35 conjunts are in the unsatisfiable core [2022-02-10 23:01:03,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:01:04,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:01:04,295 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-02-10 23:01:04,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:01:04,387 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-02-10 23:01:04,468 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-02-10 23:01:04,583 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 23:01:04,583 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 23:01:04,715 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_191 (Array Int Int))) (<= (+ c_~d~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_191) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) c_~W~0)) is different from false [2022-02-10 23:01:04,753 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_191 (Array Int Int)) (v_ArrVal_190 (Array Int Int))) (<= (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_190) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_191) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))) c_~d~0) c_~W~0)) is different from false [2022-02-10 23:01:04,799 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 23:01:04,799 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 174 treesize of output 166 [2022-02-10 23:01:04,803 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 122 [2022-02-10 23:01:04,806 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 110 [2022-02-10 23:01:05,982 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 1 not checked. [2022-02-10 23:01:05,982 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112770746] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 23:01:05,982 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 23:01:05,982 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 23, 23] total 66 [2022-02-10 23:01:05,983 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45525974] [2022-02-10 23:01:05,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 23:01:05,984 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-02-10 23:01:05,984 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:01:05,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-02-10 23:01:05,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=3701, Unknown=2, NotChecked=250, Total=4290 [2022-02-10 23:01:05,985 INFO L87 Difference]: Start difference. First operand 7088 states and 21232 transitions. Second operand has 66 states, 66 states have (on average 5.0606060606060606) internal successors, (334), 66 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:01:14,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:01:14,122 INFO L93 Difference]: Finished difference Result 12250 states and 36989 transitions. [2022-02-10 23:01:14,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-02-10 23:01:14,122 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 5.0606060606060606) internal successors, (334), 66 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 137 [2022-02-10 23:01:14,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:01:14,147 INFO L225 Difference]: With dead ends: 12250 [2022-02-10 23:01:14,147 INFO L226 Difference]: Without dead ends: 10747 [2022-02-10 23:01:14,150 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 238 SyntacticMatches, 7 SemanticMatches, 122 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 4316 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=2558, Invalid=12210, Unknown=2, NotChecked=482, Total=15252 [2022-02-10 23:01:14,150 INFO L934 BasicCegarLoop]: 209 mSDtfsCounter, 2980 mSDsluCounter, 6545 mSDsCounter, 0 mSdLazyCounter, 2453 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2980 SdHoareTripleChecker+Valid, 6053 SdHoareTripleChecker+Invalid, 4030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 2453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1476 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-02-10 23:01:14,150 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [2980 Valid, 6053 Invalid, 4030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 2453 Invalid, 0 Unknown, 1476 Unchecked, 1.2s Time] [2022-02-10 23:01:14,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10747 states. [2022-02-10 23:01:14,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10747 to 6736. [2022-02-10 23:01:14,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6736 states, 6735 states have (on average 3.0157386785449147) internal successors, (20311), 6735 states have internal predecessors, (20311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:01:14,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6736 states to 6736 states and 20311 transitions. [2022-02-10 23:01:14,290 INFO L78 Accepts]: Start accepts. Automaton has 6736 states and 20311 transitions. Word has length 137 [2022-02-10 23:01:14,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:01:14,290 INFO L470 AbstractCegarLoop]: Abstraction has 6736 states and 20311 transitions. [2022-02-10 23:01:14,290 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 5.0606060606060606) internal successors, (334), 66 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:01:14,290 INFO L276 IsEmpty]: Start isEmpty. Operand 6736 states and 20311 transitions. [2022-02-10 23:01:14,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-02-10 23:01:14,302 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:01:14,302 INFO L515 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:01:14,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-10 23:01:14,519 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-02-10 23:01:14,519 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-10 23:01:14,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:01:14,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1470367235, now seen corresponding path program 4 times [2022-02-10 23:01:14,520 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:01:14,520 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595908488] [2022-02-10 23:01:14,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:01:14,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:01:14,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:01:14,584 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-10 23:01:14,584 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:01:14,584 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595908488] [2022-02-10 23:01:14,584 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595908488] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:01:14,584 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569481880] [2022-02-10 23:01:14,584 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-10 23:01:14,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:01:14,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:01:14,585 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 23:01:14,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-10 23:01:14,654 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-10 23:01:14,654 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:01:14,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-10 23:01:14,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:01:14,945 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-10 23:01:14,945 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 23:01:15,239 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-10 23:01:15,240 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1569481880] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 23:01:15,240 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 23:01:15,240 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2022-02-10 23:01:15,240 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425380364] [2022-02-10 23:01:15,240 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 23:01:15,240 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-02-10 23:01:15,240 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:01:15,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-10 23:01:15,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2022-02-10 23:01:15,241 INFO L87 Difference]: Start difference. First operand 6736 states and 20311 transitions. Second operand has 19 states, 19 states have (on average 12.368421052631579) internal successors, (235), 19 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:01:15,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:01:15,405 INFO L93 Difference]: Finished difference Result 5761 states and 16994 transitions. [2022-02-10 23:01:15,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-10 23:01:15,405 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 12.368421052631579) internal successors, (235), 19 states have internal predecessors, (235), 0 states have call successors, (0), 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 141 [2022-02-10 23:01:15,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:01:15,416 INFO L225 Difference]: With dead ends: 5761 [2022-02-10 23:01:15,416 INFO L226 Difference]: Without dead ends: 4914 [2022-02-10 23:01:15,418 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 272 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-02-10 23:01:15,419 INFO L934 BasicCegarLoop]: 133 mSDtfsCounter, 676 mSDsluCounter, 890 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 972 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-10 23:01:15,419 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [676 Valid, 972 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-10 23:01:15,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4914 states. [2022-02-10 23:01:15,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4914 to 4909. [2022-02-10 23:01:15,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4909 states, 4908 states have (on average 3.021801140994295) internal successors, (14831), 4908 states have internal predecessors, (14831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:01:15,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4909 states to 4909 states and 14831 transitions. [2022-02-10 23:01:15,519 INFO L78 Accepts]: Start accepts. Automaton has 4909 states and 14831 transitions. Word has length 141 [2022-02-10 23:01:15,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:01:15,519 INFO L470 AbstractCegarLoop]: Abstraction has 4909 states and 14831 transitions. [2022-02-10 23:01:15,519 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 12.368421052631579) internal successors, (235), 19 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:01:15,520 INFO L276 IsEmpty]: Start isEmpty. Operand 4909 states and 14831 transitions. [2022-02-10 23:01:15,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-02-10 23:01:15,528 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:01:15,528 INFO L515 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:01:15,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-10 23:01:15,745 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-02-10 23:01:15,745 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-10 23:01:15,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:01:15,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1959922121, now seen corresponding path program 5 times [2022-02-10 23:01:15,745 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:01:15,745 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551161154] [2022-02-10 23:01:15,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:01:15,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:01:15,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:01:17,021 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:01:17,022 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:01:17,022 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551161154] [2022-02-10 23:01:17,022 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551161154] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:01:17,022 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617470887] [2022-02-10 23:01:17,022 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-10 23:01:17,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:01:17,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:01:17,027 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 23:01:17,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-10 23:01:17,108 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-02-10 23:01:17,108 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:01:17,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 68 conjunts are in the unsatisfiable core [2022-02-10 23:01:17,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:01:17,163 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-10 23:01:17,195 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-10 23:01:17,195 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-02-10 23:01:17,643 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-02-10 23:01:17,644 INFO L387 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 16 treesize of output 18 [2022-02-10 23:01:19,294 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-02-10 23:01:19,486 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-02-10 23:01:20,062 INFO L353 Elim1Store]: treesize reduction 48, result has 5.9 percent of original size [2022-02-10 23:01:20,062 INFO L387 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-02-10 23:01:20,234 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:01:20,234 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 23:01:20,642 WARN L838 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (forall ((v_ArrVal_263 (Array Int Int))) (<= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_263) c_~queue~0.base)) (.cse1 (* c_~front~0 4))) (+ (select .cse0 (+ c_~queue~0.offset .cse1)) c_~d~0 (select .cse0 (+ c_~queue~0.offset .cse1 4)))) c_~W~0))) is different from false [2022-02-10 23:01:20,669 WARN L838 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (forall ((v_ArrVal_263 (Array Int Int)) (v_ArrVal_262 (Array Int Int))) (<= (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_262) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_263) c_~queue~0.base)) (.cse1 (* c_~front~0 4))) (+ c_~d~0 (select .cse0 (+ c_~queue~0.offset .cse1)) (select .cse0 (+ c_~queue~0.offset .cse1 4)))) c_~W~0))) is different from false [2022-02-10 23:01:21,136 INFO L353 Elim1Store]: treesize reduction 47, result has 53.0 percent of original size [2022-02-10 23:01:21,137 INFO L387 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 153 [2022-02-10 23:01:21,144 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-02-10 23:01:21,145 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 67 [2022-02-10 23:01:21,152 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-02-10 23:01:21,152 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2022-02-10 23:01:25,042 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2022-02-10 23:01:25,064 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-02-10 23:01:25,065 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [617470887] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 23:01:25,065 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 23:01:25,065 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 36, 36] total 97 [2022-02-10 23:01:25,065 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878445559] [2022-02-10 23:01:25,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 23:01:25,065 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 97 states [2022-02-10 23:01:25,065 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:01:25,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2022-02-10 23:01:25,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=637, Invalid=8299, Unknown=2, NotChecked=374, Total=9312 [2022-02-10 23:01:25,066 INFO L87 Difference]: Start difference. First operand 4909 states and 14831 transitions. Second operand has 97 states, 97 states have (on average 3.9278350515463916) internal successors, (381), 97 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:02:13,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:02:13,029 INFO L93 Difference]: Finished difference Result 62321 states and 195898 transitions. [2022-02-10 23:02:13,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 273 states. [2022-02-10 23:02:13,029 INFO L78 Accepts]: Start accepts. Automaton has has 97 states, 97 states have (on average 3.9278350515463916) internal successors, (381), 97 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2022-02-10 23:02:13,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:02:13,215 INFO L225 Difference]: With dead ends: 62321 [2022-02-10 23:02:13,216 INFO L226 Difference]: Without dead ends: 56090 [2022-02-10 23:02:13,225 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 792 GetRequests, 326 SyntacticMatches, 106 SemanticMatches, 360 ConstructedPredicates, 2 IntricatePredicates, 7 DeprecatedPredicates, 62514 ImplicationChecksByTransitivity, 42.2s TimeCoverageRelationStatistics Valid=17220, Invalid=112026, Unknown=2, NotChecked=1434, Total=130682 [2022-02-10 23:02:13,225 INFO L934 BasicCegarLoop]: 668 mSDtfsCounter, 7877 mSDsluCounter, 32900 mSDsCounter, 0 mSdLazyCounter, 11563 mSolverCounterSat, 724 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7877 SdHoareTripleChecker+Valid, 28138 SdHoareTripleChecker+Invalid, 27887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 724 IncrementalHoareTripleChecker+Valid, 11563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 15600 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-02-10 23:02:13,226 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [7877 Valid, 28138 Invalid, 27887 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [724 Valid, 11563 Invalid, 0 Unknown, 15600 Unchecked, 5.7s Time] [2022-02-10 23:02:13,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56090 states. [2022-02-10 23:02:14,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56090 to 18837. [2022-02-10 23:02:14,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18837 states, 18836 states have (on average 3.2380016988744957) internal successors, (60991), 18836 states have internal predecessors, (60991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:02:14,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18837 states to 18837 states and 60991 transitions. [2022-02-10 23:02:14,099 INFO L78 Accepts]: Start accepts. Automaton has 18837 states and 60991 transitions. Word has length 148 [2022-02-10 23:02:14,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:02:14,100 INFO L470 AbstractCegarLoop]: Abstraction has 18837 states and 60991 transitions. [2022-02-10 23:02:14,100 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 97 states, 97 states have (on average 3.9278350515463916) internal successors, (381), 97 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:02:14,100 INFO L276 IsEmpty]: Start isEmpty. Operand 18837 states and 60991 transitions. [2022-02-10 23:02:14,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-02-10 23:02:14,137 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:02:14,137 INFO L515 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:02:14,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-02-10 23:02:14,355 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-02-10 23:02:14,355 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-10 23:02:14,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:02:14,356 INFO L85 PathProgramCache]: Analyzing trace with hash -864539759, now seen corresponding path program 6 times [2022-02-10 23:02:14,356 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:02:14,356 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83350808] [2022-02-10 23:02:14,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:02:14,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:02:14,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:02:15,831 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:02:15,832 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:02:15,832 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83350808] [2022-02-10 23:02:15,832 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83350808] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:02:15,832 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291599953] [2022-02-10 23:02:15,832 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-10 23:02:15,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:02:15,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:02:15,833 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 23:02:15,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-02-10 23:02:15,974 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-02-10 23:02:15,974 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:02:15,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 61 conjunts are in the unsatisfiable core [2022-02-10 23:02:15,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:02:18,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:02:18,019 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-02-10 23:02:18,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:02:18,179 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-02-10 23:02:18,670 INFO L353 Elim1Store]: treesize reduction 48, result has 5.9 percent of original size [2022-02-10 23:02:18,670 INFO L387 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-02-10 23:02:18,833 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:02:18,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 23:02:19,087 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_301 (Array Int Int))) (<= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_301) c_~queue~0.base)) (.cse1 (* c_~front~0 4))) (+ c_~d~0 (select .cse0 (+ c_~queue~0.offset .cse1 4)) (select .cse0 (+ c_~queue~0.offset .cse1)))) c_~W~0)) is different from false [2022-02-10 23:02:19,108 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_300 (Array Int Int)) (v_ArrVal_301 (Array Int Int))) (<= (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_300) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_301) c_~queue~0.base)) (.cse1 (* c_~front~0 4))) (+ c_~d~0 (select .cse0 (+ c_~queue~0.offset .cse1)) (select .cse0 (+ c_~queue~0.offset .cse1 4)))) c_~W~0)) is different from false [2022-02-10 23:02:19,652 INFO L353 Elim1Store]: treesize reduction 47, result has 53.0 percent of original size [2022-02-10 23:02:19,653 INFO L387 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 153 [2022-02-10 23:02:19,660 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-02-10 23:02:19,660 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 67 [2022-02-10 23:02:19,667 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-02-10 23:02:19,667 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2022-02-10 23:02:23,523 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-02-10 23:02:23,523 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291599953] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 23:02:23,523 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 23:02:23,523 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 36, 36] total 98 [2022-02-10 23:02:23,523 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002490958] [2022-02-10 23:02:23,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 23:02:23,524 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2022-02-10 23:02:23,524 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:02:23,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2022-02-10 23:02:23,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=8460, Unknown=2, NotChecked=378, Total=9506 [2022-02-10 23:02:23,526 INFO L87 Difference]: Start difference. First operand 18837 states and 60991 transitions. Second operand has 98 states, 98 states have (on average 3.8877551020408165) internal successors, (381), 98 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:02:57,364 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse10 (* c_~back~0 4))) (let ((.cse15 (<= c_~d~0 0)) (.cse2 (<= c_~n~0 (+ c_~back~0 1))) (.cse12 (= (* c_~front~0 4) .cse10))) (let ((.cse1 (or .cse2 .cse12)) (.cse13 (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (.cse3 (or .cse15 .cse2)) (.cse4 (or (<= c_~n~0 (+ 2 c_~front~0)) .cse2)) (.cse14 (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|))) (let ((.cse7 (< 2 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse8 (forall ((v_ArrVal_300 (Array Int Int)) (v_ArrVal_301 (Array Int Int))) (<= (let ((.cse18 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_300) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_301) c_~queue~0.base)) (.cse19 (* c_~front~0 4))) (+ c_~d~0 (select .cse18 (+ c_~queue~0.offset .cse19)) (select .cse18 (+ c_~queue~0.offset .cse19 4)))) c_~W~0))) (.cse6 (and .cse1 (or .cse2 .cse13) .cse3 .cse4 (or .cse14 .cse2))) (.cse0 (= (mod c_~v_assert~0 256) 0)) (.cse5 (< c_~back~0 0)) (.cse9 (<= |c_thread1Thread1of1ForFork1_~w~0#1| 1)) (.cse16 (or (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t2~0#1.base|)) .cse2)) (.cse17 (or .cse2 (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|))))) (and (= (+ (* (- 1) c_~v_assert~0) |c_thread2Thread1of1ForFork2_~cond~1#1|) 0) (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= |c_thread2Thread1of1ForFork2_~temp~0#1| 1) (or .cse0 (and .cse1 (or (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|) .cse2) .cse3 (or .cse2 (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_ULTIMATE.start_main_~#t3~0#1.base|)) .cse4) .cse5) (or .cse0 (and .cse1 (or (not (<= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_main_#t~ret9#1.base|)) .cse2) .cse3 (or (not (<= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_main_#t~ret9#1.base|)) .cse2) .cse4) .cse5) (or .cse0 .cse6 .cse7 .cse5) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (or .cse0 .cse5 (and (or (< |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| |c_ULTIMATE.start_main_~#t3~0#1.base|) .cse2) .cse1 .cse3 (or (< |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|) .cse2) .cse4)) (or .cse0 .cse7 .cse5 (and .cse1 .cse3 .cse4 (or (< |c_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |c_ULTIMATE.start_main_~#t3~0#1.base|) .cse2) (or (< |c_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|) .cse2))) (or .cse0 .cse8 .cse9 (not (< c_~back~0 c_~n~0)) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse10)) 1)) (not (<= 0 c_~back~0))) (<= c_~d~0 1) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) .cse8 (<= 1 c_~v_assert~0) (or .cse0 (< 2 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse6 .cse5) (or .cse5 (let ((.cse11 (<= 1 c_~back~0))) (and (or .cse11 .cse12) (or .cse11 .cse13) (or .cse14 .cse11) (or .cse11 .cse15)))) (= |c_thread2Thread1of1ForFork2_~temp~0#1| 1) (or (and .cse16 .cse1 .cse17 .cse3 .cse4) .cse0 .cse5) (or .cse0 .cse5 .cse9 (and .cse16 (or .cse2 (<= (+ c_~d~0 2) c_~W~0)) .cse1 .cse17 .cse4)) (< 1 c_~W~0) (<= (+ c_~d~0 1) c_~W~0)))))) is different from false [2022-02-10 23:02:57,919 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse14 (<= c_~d~0 0)) (.cse2 (<= c_~n~0 (+ c_~back~0 1))) (.cse11 (= (* c_~front~0 4) (* c_~back~0 4)))) (let ((.cse1 (or .cse2 .cse11)) (.cse12 (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (.cse3 (or .cse14 .cse2)) (.cse4 (or (<= c_~n~0 (+ 2 c_~front~0)) .cse2)) (.cse13 (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|))) (let ((.cse7 (< 2 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse6 (and .cse1 (or .cse2 .cse12) .cse3 .cse4 (or .cse13 .cse2))) (.cse0 (= (mod c_~v_assert~0 256) 0)) (.cse5 (< c_~back~0 0)) (.cse15 (or (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t2~0#1.base|)) .cse2)) (.cse16 (or .cse2 (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|))))) (and (= (+ (* (- 1) c_~v_assert~0) |c_thread2Thread1of1ForFork2_~cond~1#1|) 0) (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (or .cse0 (and .cse1 (or (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|) .cse2) .cse3 (or .cse2 (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_ULTIMATE.start_main_~#t3~0#1.base|)) .cse4) .cse5) (or .cse0 (and .cse1 (or (not (<= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_main_#t~ret9#1.base|)) .cse2) .cse3 (or (not (<= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_main_#t~ret9#1.base|)) .cse2) .cse4) .cse5) (or .cse0 .cse6 .cse7 .cse5) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (or .cse0 .cse5 (and (or (< |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| |c_ULTIMATE.start_main_~#t3~0#1.base|) .cse2) .cse1 .cse3 (or (< |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|) .cse2) .cse4)) (or .cse0 .cse7 .cse5 (and .cse1 .cse3 .cse4 (or (< |c_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |c_ULTIMATE.start_main_~#t3~0#1.base|) .cse2) (or (< |c_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|) .cse2))) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (forall ((v_ArrVal_300 (Array Int Int)) (v_ArrVal_301 (Array Int Int))) (<= (let ((.cse8 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_300) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_301) c_~queue~0.base)) (.cse9 (* c_~front~0 4))) (+ c_~d~0 (select .cse8 (+ c_~queue~0.offset .cse9)) (select .cse8 (+ c_~queue~0.offset .cse9 4)))) c_~W~0)) (<= 1 c_~v_assert~0) (or .cse0 (< 2 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse6 .cse5) (or .cse5 (let ((.cse10 (<= 1 c_~back~0))) (and (or .cse10 .cse11) (or .cse10 .cse12) (or .cse13 .cse10) (or .cse10 .cse14)))) (or (and .cse15 .cse1 .cse16 .cse3 .cse4) .cse0 .cse5) (or .cse0 .cse5 (<= |c_thread1Thread1of1ForFork1_~w~0#1| 1) (and .cse15 (or .cse2 (<= (+ c_~d~0 2) c_~W~0)) .cse1 .cse16 .cse4)))))) is different from false [2022-02-10 23:02:58,248 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_300 (Array Int Int)) (v_ArrVal_301 (Array Int Int))) (<= (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_300) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_301) c_~queue~0.base)) (.cse2 (* c_~front~0 4))) (+ c_~d~0 (select .cse1 (+ c_~queue~0.offset .cse2)) (select .cse1 (+ c_~queue~0.offset .cse2 4)))) c_~W~0)))) (and (or (= (mod c_~v_assert~0 256) 0) .cse0 (not (< c_~back~0 c_~n~0)) (<= |c_thread1Thread1of1ForFork1_#t~post1#1| 1) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1)) (not (<= 0 c_~back~0))) .cse0)) is different from false [2022-02-10 23:02:59,226 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_300 (Array Int Int)) (v_ArrVal_301 (Array Int Int))) (<= (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_300) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_301) c_~queue~0.base)) (.cse2 (* c_~front~0 4))) (+ c_~d~0 (select .cse1 (+ c_~queue~0.offset .cse2)) (select .cse1 (+ c_~queue~0.offset .cse2 4)))) c_~W~0)))) (and (or (= (mod c_~v_assert~0 256) 0) .cse0 (not (< 0 |c_thread1Thread1of1ForFork1_~w~0#1|)) (not (< c_~back~0 c_~n~0)) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1)) (not (<= 0 c_~back~0))) .cse0)) is different from false [2022-02-10 23:02:59,884 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse10 (* c_~back~0 4))) (let ((.cse15 (<= c_~d~0 0)) (.cse2 (<= c_~n~0 (+ c_~back~0 1))) (.cse12 (= (* c_~front~0 4) .cse10))) (let ((.cse1 (or .cse2 .cse12)) (.cse13 (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (.cse3 (or .cse15 .cse2)) (.cse4 (or (<= c_~n~0 (+ 2 c_~front~0)) .cse2)) (.cse14 (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|))) (let ((.cse7 (< 2 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse8 (forall ((v_ArrVal_300 (Array Int Int)) (v_ArrVal_301 (Array Int Int))) (<= (let ((.cse18 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_300) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_301) c_~queue~0.base)) (.cse19 (* c_~front~0 4))) (+ c_~d~0 (select .cse18 (+ c_~queue~0.offset .cse19)) (select .cse18 (+ c_~queue~0.offset .cse19 4)))) c_~W~0))) (.cse6 (and .cse1 (or .cse2 .cse13) .cse3 .cse4 (or .cse14 .cse2))) (.cse0 (= (mod c_~v_assert~0 256) 0)) (.cse5 (< c_~back~0 0)) (.cse9 (<= |c_thread1Thread1of1ForFork1_~w~0#1| 1)) (.cse16 (or (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t2~0#1.base|)) .cse2)) (.cse17 (or .cse2 (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|))))) (and (= (+ (* (- 1) c_~v_assert~0) |c_thread2Thread1of1ForFork2_~cond~1#1|) 0) (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (or .cse0 (and .cse1 (or (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|) .cse2) .cse3 (or .cse2 (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_ULTIMATE.start_main_~#t3~0#1.base|)) .cse4) .cse5) (or .cse0 (and .cse1 (or (not (<= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_main_#t~ret9#1.base|)) .cse2) .cse3 (or (not (<= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_main_#t~ret9#1.base|)) .cse2) .cse4) .cse5) (or .cse0 .cse6 .cse7 .cse5) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (or .cse0 .cse5 (and (or (< |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| |c_ULTIMATE.start_main_~#t3~0#1.base|) .cse2) .cse1 .cse3 (or (< |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|) .cse2) .cse4)) (or .cse0 .cse7 .cse5 (and .cse1 .cse3 .cse4 (or (< |c_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |c_ULTIMATE.start_main_~#t3~0#1.base|) .cse2) (or (< |c_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|) .cse2))) (or .cse0 .cse8 .cse9 (not (< c_~back~0 c_~n~0)) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse10)) 1)) (not (<= 0 c_~back~0))) (<= c_~d~0 2) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) .cse8 (<= 1 c_~v_assert~0) (or .cse0 (< 2 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse6 .cse5) (or .cse5 (let ((.cse11 (<= 1 c_~back~0))) (and (or .cse11 .cse12) (or .cse11 .cse13) (or .cse14 .cse11) (or .cse11 .cse15)))) (or (and .cse16 .cse1 .cse17 .cse3 .cse4) .cse0 .cse5) (or .cse0 .cse5 .cse9 (and .cse16 (or .cse2 (<= (+ c_~d~0 2) c_~W~0)) .cse1 .cse17 .cse4)) (< 1 c_~W~0)))))) is different from false [2022-02-10 23:03:02,578 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_300 (Array Int Int)) (v_ArrVal_301 (Array Int Int))) (<= (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_300) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_301) c_~queue~0.base)) (.cse1 (* c_~front~0 4))) (+ c_~d~0 (select .cse0 (+ c_~queue~0.offset .cse1)) (select .cse0 (+ c_~queue~0.offset .cse1 4)))) c_~W~0)) (or (< c_~back~0 0) (let ((.cse2 (<= 1 c_~back~0))) (and (or .cse2 (= (* c_~front~0 4) (* c_~back~0 4))) (or .cse2 (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (or (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) .cse2) (or .cse2 (<= c_~d~0 0)))))) is different from false [2022-02-10 23:03:03,847 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_300 (Array Int Int)) (v_ArrVal_301 (Array Int Int))) (<= (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_300) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_301) c_~queue~0.base)) (.cse1 (* c_~front~0 4))) (+ c_~d~0 (select .cse0 (+ c_~queue~0.offset .cse1)) (select .cse0 (+ c_~queue~0.offset .cse1 4)))) c_~W~0)) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (or (< c_~back~0 0) (let ((.cse2 (<= 1 c_~back~0))) (and (or .cse2 (= (* c_~front~0 4) (* c_~back~0 4))) (or .cse2 (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (or (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) .cse2) (or .cse2 (<= c_~d~0 0)))))) is different from false [2022-02-10 23:03:04,037 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse10 (* c_~back~0 4))) (let ((.cse15 (<= c_~d~0 0)) (.cse2 (<= c_~n~0 (+ c_~back~0 1))) (.cse12 (= (* c_~front~0 4) .cse10))) (let ((.cse1 (or .cse2 .cse12)) (.cse13 (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (.cse3 (or .cse15 .cse2)) (.cse4 (or (<= c_~n~0 (+ 2 c_~front~0)) .cse2)) (.cse14 (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|))) (let ((.cse7 (< 2 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse8 (forall ((v_ArrVal_300 (Array Int Int)) (v_ArrVal_301 (Array Int Int))) (<= (let ((.cse18 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_300) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_301) c_~queue~0.base)) (.cse19 (* c_~front~0 4))) (+ c_~d~0 (select .cse18 (+ c_~queue~0.offset .cse19)) (select .cse18 (+ c_~queue~0.offset .cse19 4)))) c_~W~0))) (.cse6 (and .cse1 (or .cse2 .cse13) .cse3 .cse4 (or .cse14 .cse2))) (.cse0 (= (mod c_~v_assert~0 256) 0)) (.cse5 (< c_~back~0 0)) (.cse9 (<= |c_thread1Thread1of1ForFork1_~w~0#1| 1)) (.cse16 (or (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t2~0#1.base|)) .cse2)) (.cse17 (or .cse2 (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|))))) (and (= (+ (* (- 1) c_~v_assert~0) |c_thread2Thread1of1ForFork2_~cond~1#1|) 0) (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (or .cse0 (and .cse1 (or (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|) .cse2) .cse3 (or .cse2 (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_ULTIMATE.start_main_~#t3~0#1.base|)) .cse4) .cse5) (or .cse0 (and .cse1 (or (not (<= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_main_#t~ret9#1.base|)) .cse2) .cse3 (or (not (<= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_main_#t~ret9#1.base|)) .cse2) .cse4) .cse5) (or .cse0 .cse6 .cse7 .cse5) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (or .cse0 .cse5 (and (or (< |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| |c_ULTIMATE.start_main_~#t3~0#1.base|) .cse2) .cse1 .cse3 (or (< |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|) .cse2) .cse4)) (or .cse0 .cse7 .cse5 (and .cse1 .cse3 .cse4 (or (< |c_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |c_ULTIMATE.start_main_~#t3~0#1.base|) .cse2) (or (< |c_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|) .cse2))) (or .cse0 .cse8 .cse9 (not (< c_~back~0 c_~n~0)) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse10)) 1)) (not (<= 0 c_~back~0))) (<= (+ c_~d~0 |c_thread2Thread1of1ForFork2_~temp~0#1|) c_~W~0) (<= c_~d~0 2) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) .cse8 (<= 1 c_~v_assert~0) (or .cse0 (< 2 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse6 .cse5) (or .cse5 (let ((.cse11 (<= 1 c_~back~0))) (and (or .cse11 .cse12) (or .cse11 .cse13) (or .cse14 .cse11) (or .cse11 .cse15)))) (or (and .cse16 .cse1 .cse17 .cse3 .cse4) .cse0 .cse5) (or .cse0 .cse5 .cse9 (and .cse16 (or .cse2 (<= (+ c_~d~0 2) c_~W~0)) .cse1 .cse17 .cse4)) (< 1 c_~W~0)))))) is different from false [2022-02-10 23:03:05,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:03:05,483 INFO L93 Difference]: Finished difference Result 96174 states and 313453 transitions. [2022-02-10 23:03:05,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2022-02-10 23:03:05,483 INFO L78 Accepts]: Start accepts. Automaton has has 98 states, 98 states have (on average 3.8877551020408165) internal successors, (381), 98 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2022-02-10 23:03:05,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:03:05,758 INFO L225 Difference]: With dead ends: 96174 [2022-02-10 23:03:05,758 INFO L226 Difference]: Without dead ends: 92664 [2022-02-10 23:03:05,761 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 627 GetRequests, 259 SyntacticMatches, 87 SemanticMatches, 281 ConstructedPredicates, 10 IntricatePredicates, 11 DeprecatedPredicates, 34578 ImplicationChecksByTransitivity, 39.3s TimeCoverageRelationStatistics Valid=11246, Invalid=62909, Unknown=141, NotChecked=5510, Total=79806 [2022-02-10 23:03:05,761 INFO L934 BasicCegarLoop]: 493 mSDtfsCounter, 8202 mSDsluCounter, 20678 mSDsCounter, 0 mSdLazyCounter, 7914 mSolverCounterSat, 974 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8202 SdHoareTripleChecker+Valid, 18199 SdHoareTripleChecker+Invalid, 21615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 974 IncrementalHoareTripleChecker+Valid, 7914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 12727 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-02-10 23:03:05,761 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [8202 Valid, 18199 Invalid, 21615 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [974 Valid, 7914 Invalid, 0 Unknown, 12727 Unchecked, 4.0s Time] [2022-02-10 23:03:06,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92664 states. [2022-02-10 23:03:07,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92664 to 24955. [2022-02-10 23:03:07,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24955 states, 24954 states have (on average 3.2728620662018115) internal successors, (81671), 24954 states have internal predecessors, (81671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:03:07,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24955 states to 24955 states and 81671 transitions. [2022-02-10 23:03:07,195 INFO L78 Accepts]: Start accepts. Automaton has 24955 states and 81671 transitions. Word has length 148 [2022-02-10 23:03:07,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:03:07,196 INFO L470 AbstractCegarLoop]: Abstraction has 24955 states and 81671 transitions. [2022-02-10 23:03:07,196 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 98 states, 98 states have (on average 3.8877551020408165) internal successors, (381), 98 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:03:07,196 INFO L276 IsEmpty]: Start isEmpty. Operand 24955 states and 81671 transitions. [2022-02-10 23:03:07,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-02-10 23:03:07,236 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:03:07,236 INFO L515 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:03:07,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-02-10 23:03:07,451 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-02-10 23:03:07,452 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-10 23:03:07,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:03:07,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1443540091, now seen corresponding path program 7 times [2022-02-10 23:03:07,452 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:03:07,452 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661213813] [2022-02-10 23:03:07,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:03:07,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:03:07,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:03:08,546 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:03:08,546 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:03:08,546 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661213813] [2022-02-10 23:03:08,546 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661213813] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:03:08,546 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391455813] [2022-02-10 23:03:08,546 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-02-10 23:03:08,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:03:08,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:03:08,548 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 23:03:08,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-02-10 23:03:08,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:03:08,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 72 conjunts are in the unsatisfiable core [2022-02-10 23:03:08,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:03:08,719 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-10 23:03:08,752 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-02-10 23:03:08,753 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-02-10 23:03:09,186 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-02-10 23:03:09,186 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-02-10 23:03:10,726 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-02-10 23:03:10,875 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-02-10 23:03:11,231 INFO L353 Elim1Store]: treesize reduction 48, result has 5.9 percent of original size [2022-02-10 23:03:11,231 INFO L387 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-02-10 23:03:11,373 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:03:11,373 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 23:03:11,597 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_341 (Array Int Int))) (<= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_341) c_~queue~0.base)) (.cse1 (* c_~front~0 4))) (+ c_~d~0 (select .cse0 (+ c_~queue~0.offset .cse1 4)) (select .cse0 (+ c_~queue~0.offset .cse1)))) c_~W~0)) is different from false [2022-02-10 23:03:11,613 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_340 (Array Int Int)) (v_ArrVal_341 (Array Int Int))) (<= (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_340) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_341) c_~queue~0.base)) (.cse1 (* c_~front~0 4))) (+ (select .cse0 (+ c_~queue~0.offset .cse1 4)) (select .cse0 (+ c_~queue~0.offset .cse1)) c_~d~0)) c_~W~0)) is different from false [2022-02-10 23:03:11,954 INFO L353 Elim1Store]: treesize reduction 47, result has 53.0 percent of original size [2022-02-10 23:03:11,954 INFO L387 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 153 [2022-02-10 23:03:11,963 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-02-10 23:03:11,963 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 67 [2022-02-10 23:03:11,971 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-02-10 23:03:11,971 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2022-02-10 23:03:15,818 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-02-10 23:03:15,819 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2022-02-10 23:03:15,843 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-02-10 23:03:15,843 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391455813] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 23:03:15,843 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 23:03:15,844 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 36, 36] total 97 [2022-02-10 23:03:15,844 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484184198] [2022-02-10 23:03:15,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 23:03:15,844 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 97 states [2022-02-10 23:03:15,844 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:03:15,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2022-02-10 23:03:15,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=674, Invalid=8262, Unknown=2, NotChecked=374, Total=9312 [2022-02-10 23:03:15,845 INFO L87 Difference]: Start difference. First operand 24955 states and 81671 transitions. Second operand has 97 states, 97 states have (on average 3.865979381443299) internal successors, (375), 97 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:03:36,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:03:36,070 INFO L93 Difference]: Finished difference Result 48303 states and 153878 transitions. [2022-02-10 23:03:36,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2022-02-10 23:03:36,071 INFO L78 Accepts]: Start accepts. Automaton has has 97 states, 97 states have (on average 3.865979381443299) internal successors, (375), 97 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2022-02-10 23:03:36,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:03:36,191 INFO L225 Difference]: With dead ends: 48303 [2022-02-10 23:03:36,191 INFO L226 Difference]: Without dead ends: 47394 [2022-02-10 23:03:36,193 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 260 SyntacticMatches, 38 SemanticMatches, 200 ConstructedPredicates, 2 IntricatePredicates, 3 DeprecatedPredicates, 14892 ImplicationChecksByTransitivity, 19.6s TimeCoverageRelationStatistics Valid=5252, Invalid=34508, Unknown=48, NotChecked=794, Total=40602 [2022-02-10 23:03:36,193 INFO L934 BasicCegarLoop]: 401 mSDtfsCounter, 4772 mSDsluCounter, 16829 mSDsCounter, 0 mSdLazyCounter, 6181 mSolverCounterSat, 338 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4772 SdHoareTripleChecker+Valid, 14801 SdHoareTripleChecker+Invalid, 13272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 338 IncrementalHoareTripleChecker+Valid, 6181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6753 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-02-10 23:03:36,193 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [4772 Valid, 14801 Invalid, 13272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [338 Valid, 6181 Invalid, 0 Unknown, 6753 Unchecked, 2.7s Time] [2022-02-10 23:03:36,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47394 states. [2022-02-10 23:03:36,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47394 to 24347. [2022-02-10 23:03:36,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24347 states, 24346 states have (on average 3.266696787973384) internal successors, (79531), 24346 states have internal predecessors, (79531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:03:36,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24347 states to 24347 states and 79531 transitions. [2022-02-10 23:03:36,879 INFO L78 Accepts]: Start accepts. Automaton has 24347 states and 79531 transitions. Word has length 148 [2022-02-10 23:03:36,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:03:36,880 INFO L470 AbstractCegarLoop]: Abstraction has 24347 states and 79531 transitions. [2022-02-10 23:03:36,880 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 97 states, 97 states have (on average 3.865979381443299) internal successors, (375), 97 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:03:36,880 INFO L276 IsEmpty]: Start isEmpty. Operand 24347 states and 79531 transitions. [2022-02-10 23:03:36,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-02-10 23:03:36,920 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:03:36,920 INFO L515 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:03:36,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-02-10 23:03:37,135 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-02-10 23:03:37,136 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-10 23:03:37,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:03:37,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1715784193, now seen corresponding path program 8 times [2022-02-10 23:03:37,136 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:03:37,136 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241686977] [2022-02-10 23:03:37,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:03:37,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:03:37,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:03:38,205 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:03:38,206 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:03:38,206 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241686977] [2022-02-10 23:03:38,206 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241686977] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:03:38,206 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473595433] [2022-02-10 23:03:38,206 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-10 23:03:38,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:03:38,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:03:38,207 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 23:03:38,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-02-10 23:03:38,291 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-10 23:03:38,291 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:03:38,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 71 conjunts are in the unsatisfiable core [2022-02-10 23:03:38,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:03:38,971 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-02-10 23:03:39,154 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-02-10 23:03:39,635 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-10 23:03:40,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:03:40,374 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-02-10 23:03:40,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:03:40,529 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-02-10 23:03:40,964 INFO L353 Elim1Store]: treesize reduction 48, result has 5.9 percent of original size [2022-02-10 23:03:40,964 INFO L387 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-02-10 23:03:41,096 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:03:41,096 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 23:03:41,318 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_384 (Array Int Int))) (<= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_384) c_~queue~0.base)) (.cse1 (* c_~front~0 4))) (+ c_~d~0 (select .cse0 (+ c_~queue~0.offset .cse1)) (select .cse0 (+ c_~queue~0.offset .cse1 4)))) c_~W~0)) is different from false [2022-02-10 23:03:41,333 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_384 (Array Int Int)) (v_ArrVal_383 (Array Int Int))) (<= (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_383) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_384) c_~queue~0.base)) (.cse1 (* c_~front~0 4))) (+ c_~d~0 (select .cse0 (+ c_~queue~0.offset .cse1)) (select .cse0 (+ c_~queue~0.offset .cse1 4)))) c_~W~0)) is different from false [2022-02-10 23:03:44,102 INFO L353 Elim1Store]: treesize reduction 39, result has 40.0 percent of original size [2022-02-10 23:03:44,102 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 152 treesize of output 97 [2022-02-10 23:03:44,138 INFO L353 Elim1Store]: treesize reduction 47, result has 53.0 percent of original size [2022-02-10 23:03:44,139 INFO L387 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 998 treesize of output 966 [2022-02-10 23:03:44,152 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 23:03:44,152 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 433 treesize of output 329 [2022-02-10 23:03:44,195 INFO L353 Elim1Store]: treesize reduction 47, result has 53.0 percent of original size [2022-02-10 23:03:44,195 INFO L387 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 810 treesize of output 798 [2022-02-10 23:03:44,214 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-02-10 23:03:44,215 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 710 treesize of output 502 [2022-02-10 23:03:46,975 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-02-10 23:03:46,975 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [473595433] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 23:03:46,975 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 23:03:46,975 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 38, 39] total 102 [2022-02-10 23:03:46,975 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015918059] [2022-02-10 23:03:46,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 23:03:46,976 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2022-02-10 23:03:46,976 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:03:46,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2022-02-10 23:03:46,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=760, Invalid=9126, Unknown=22, NotChecked=394, Total=10302 [2022-02-10 23:03:46,977 INFO L87 Difference]: Start difference. First operand 24347 states and 79531 transitions. Second operand has 102 states, 102 states have (on average 3.6862745098039214) internal successors, (376), 102 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:04:01,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:04:01,891 INFO L93 Difference]: Finished difference Result 63720 states and 208353 transitions. [2022-02-10 23:04:01,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2022-02-10 23:04:01,892 INFO L78 Accepts]: Start accepts. Automaton has has 102 states, 102 states have (on average 3.6862745098039214) internal successors, (376), 102 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2022-02-10 23:04:01,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:04:02,070 INFO L225 Difference]: With dead ends: 63720 [2022-02-10 23:04:02,070 INFO L226 Difference]: Without dead ends: 60948 [2022-02-10 23:04:02,072 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 481 GetRequests, 249 SyntacticMatches, 28 SemanticMatches, 204 ConstructedPredicates, 2 IntricatePredicates, 3 DeprecatedPredicates, 15418 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=4627, Invalid=36771, Unknown=22, NotChecked=810, Total=42230 [2022-02-10 23:04:02,072 INFO L934 BasicCegarLoop]: 348 mSDtfsCounter, 4558 mSDsluCounter, 17472 mSDsCounter, 0 mSdLazyCounter, 7146 mSolverCounterSat, 340 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4558 SdHoareTripleChecker+Valid, 15631 SdHoareTripleChecker+Invalid, 12855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 340 IncrementalHoareTripleChecker+Valid, 7146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5369 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-02-10 23:04:02,072 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [4558 Valid, 15631 Invalid, 12855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [340 Valid, 7146 Invalid, 0 Unknown, 5369 Unchecked, 3.0s Time] [2022-02-10 23:04:02,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60948 states. [2022-02-10 23:04:02,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60948 to 27280. [2022-02-10 23:04:02,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27280 states, 27279 states have (on average 3.2549213680853404) internal successors, (88791), 27279 states have internal predecessors, (88791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:04:02,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27280 states to 27280 states and 88791 transitions. [2022-02-10 23:04:02,845 INFO L78 Accepts]: Start accepts. Automaton has 27280 states and 88791 transitions. Word has length 148 [2022-02-10 23:04:02,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:04:02,846 INFO L470 AbstractCegarLoop]: Abstraction has 27280 states and 88791 transitions. [2022-02-10 23:04:02,846 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 102 states, 102 states have (on average 3.6862745098039214) internal successors, (376), 102 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:04:02,846 INFO L276 IsEmpty]: Start isEmpty. Operand 27280 states and 88791 transitions. [2022-02-10 23:04:03,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-02-10 23:04:03,127 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:04:03,141 INFO L515 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:04:03,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-02-10 23:04:03,349 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-02-10 23:04:03,349 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-10 23:04:03,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:04:03,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1475957881, now seen corresponding path program 9 times [2022-02-10 23:04:03,350 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:04:03,350 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584162279] [2022-02-10 23:04:03,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:04:03,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:04:03,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:04:05,047 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:04:05,047 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:04:05,047 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584162279] [2022-02-10 23:04:05,047 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584162279] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:04:05,047 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280935673] [2022-02-10 23:04:05,048 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-10 23:04:05,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:04:05,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:04:05,049 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 23:04:05,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-02-10 23:04:05,159 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-02-10 23:04:05,159 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:04:05,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 60 conjunts are in the unsatisfiable core [2022-02-10 23:04:05,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:04:05,199 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-10 23:04:05,233 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-02-10 23:04:05,233 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-02-10 23:04:05,509 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-10 23:04:05,509 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-10 23:04:06,505 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-02-10 23:04:06,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:04:06,691 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2022-02-10 23:04:06,811 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-02-10 23:04:06,812 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 13 [2022-02-10 23:04:06,958 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-10 23:04:06,959 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 23:04:07,128 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_424 (Array Int Int))) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_424) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))) c_~d~0 |c_thread2Thread1of1ForFork2_~temp~0#1|) c_~W~0)) is different from false [2022-02-10 23:04:07,135 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_424 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ c_~d~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_424) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))) c_~W~0)) is different from false [2022-02-10 23:04:07,159 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_423 (Array Int Int))) (<= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_423)) (.cse1 (* c_~front~0 4))) (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_424) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) c_~d~0 (select (select .cse0 c_~queue~0.base) (+ c_~queue~0.offset .cse1)))) c_~W~0)) is different from false [2022-02-10 23:04:07,457 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-02-10 23:04:07,457 INFO L387 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 259 treesize of output 244 [2022-02-10 23:04:07,464 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-02-10 23:04:07,465 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 184 treesize of output 146 [2022-02-10 23:04:07,467 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 118 [2022-02-10 23:04:08,917 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 23:04:08,919 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 23:04:08,919 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2022-02-10 23:04:08,940 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 8 not checked. [2022-02-10 23:04:08,940 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1280935673] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 23:04:08,940 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 23:04:08,941 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 27, 25] total 81 [2022-02-10 23:04:08,941 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500843281] [2022-02-10 23:04:08,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 23:04:08,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2022-02-10 23:04:08,941 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:04:08,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2022-02-10 23:04:08,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=5671, Unknown=3, NotChecked=462, Total=6480 [2022-02-10 23:04:08,942 INFO L87 Difference]: Start difference. First operand 27280 states and 88791 transitions. Second operand has 81 states, 81 states have (on average 4.432098765432099) internal successors, (359), 81 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:04:47,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:04:47,983 INFO L93 Difference]: Finished difference Result 122600 states and 396247 transitions. [2022-02-10 23:04:47,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 256 states. [2022-02-10 23:04:47,984 INFO L78 Accepts]: Start accepts. Automaton has has 81 states, 81 states have (on average 4.432098765432099) internal successors, (359), 81 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2022-02-10 23:04:47,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:04:48,494 INFO L225 Difference]: With dead ends: 122600 [2022-02-10 23:04:48,495 INFO L226 Difference]: Without dead ends: 103211 [2022-02-10 23:04:48,499 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 648 GetRequests, 294 SyntacticMatches, 30 SemanticMatches, 324 ConstructedPredicates, 3 IntricatePredicates, 4 DeprecatedPredicates, 42530 ImplicationChecksByTransitivity, 31.5s TimeCoverageRelationStatistics Valid=10946, Invalid=93069, Unknown=3, NotChecked=1932, Total=105950 [2022-02-10 23:04:48,500 INFO L934 BasicCegarLoop]: 505 mSDtfsCounter, 7271 mSDsluCounter, 25581 mSDsCounter, 0 mSdLazyCounter, 14146 mSolverCounterSat, 795 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7271 SdHoareTripleChecker+Valid, 22608 SdHoareTripleChecker+Invalid, 23153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 795 IncrementalHoareTripleChecker+Valid, 14146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8212 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2022-02-10 23:04:48,500 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [7271 Valid, 22608 Invalid, 23153 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [795 Valid, 14146 Invalid, 0 Unknown, 8212 Unchecked, 7.1s Time] [2022-02-10 23:04:48,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103211 states. [2022-02-10 23:04:49,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103211 to 35997. [2022-02-10 23:04:49,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35997 states, 35996 states have (on average 3.2472774752750304) internal successors, (116889), 35996 states have internal predecessors, (116889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:04:49,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35997 states to 35997 states and 116889 transitions. [2022-02-10 23:04:49,917 INFO L78 Accepts]: Start accepts. Automaton has 35997 states and 116889 transitions. Word has length 148 [2022-02-10 23:04:49,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:04:49,918 INFO L470 AbstractCegarLoop]: Abstraction has 35997 states and 116889 transitions. [2022-02-10 23:04:49,918 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 81 states have (on average 4.432098765432099) internal successors, (359), 81 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:04:49,918 INFO L276 IsEmpty]: Start isEmpty. Operand 35997 states and 116889 transitions. [2022-02-10 23:04:49,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-02-10 23:04:49,972 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:04:49,972 INFO L515 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:04:49,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-02-10 23:04:50,172 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-02-10 23:04:50,173 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-10 23:04:50,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:04:50,174 INFO L85 PathProgramCache]: Analyzing trace with hash -790466885, now seen corresponding path program 10 times [2022-02-10 23:04:50,174 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:04:50,174 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044766009] [2022-02-10 23:04:50,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:04:50,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:04:50,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:04:51,198 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:04:51,198 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:04:51,198 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044766009] [2022-02-10 23:04:51,198 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044766009] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:04:51,199 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957947569] [2022-02-10 23:04:51,199 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-10 23:04:51,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:04:51,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:04:51,200 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 23:04:51,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-02-10 23:04:51,287 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-10 23:04:51,287 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:04:51,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 68 conjunts are in the unsatisfiable core [2022-02-10 23:04:51,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:04:51,324 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-10 23:04:51,353 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-10 23:04:51,354 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-02-10 23:04:51,788 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-10 23:04:51,788 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-02-10 23:04:53,223 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-02-10 23:04:53,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:04:53,614 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2022-02-10 23:04:53,714 INFO L353 Elim1Store]: treesize reduction 48, result has 5.9 percent of original size [2022-02-10 23:04:53,715 INFO L387 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-02-10 23:04:53,871 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:04:53,872 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 23:04:54,032 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_464 (Array Int Int))) (<= (+ c_~d~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_464) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) c_~W~0)) is different from false [2022-02-10 23:04:54,036 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_464 (Array Int Int))) (<= (+ c_~d~0 |c_thread2Thread1of1ForFork2_~temp~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_464) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) c_~W~0)) is different from false [2022-02-10 23:04:54,045 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_464 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ c_~d~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_464) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))) c_~W~0)) is different from false [2022-02-10 23:04:54,068 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_463 (Array Int Int)) (v_ArrVal_464 (Array Int Int))) (<= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_463)) (.cse1 (* c_~front~0 4))) (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_464) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) c_~d~0 (select (select .cse0 c_~queue~0.base) (+ c_~queue~0.offset .cse1)))) c_~W~0)) is different from false [2022-02-10 23:04:54,426 INFO L353 Elim1Store]: treesize reduction 47, result has 53.0 percent of original size [2022-02-10 23:04:54,426 INFO L387 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 258 treesize of output 244 [2022-02-10 23:04:54,436 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-02-10 23:04:54,436 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 184 treesize of output 146 [2022-02-10 23:04:54,441 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 118 [2022-02-10 23:05:01,290 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 23:05:01,291 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-02-10 23:05:01,312 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-02-10 23:05:01,312 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957947569] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 23:05:01,312 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 23:05:01,312 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 36, 36] total 97 [2022-02-10 23:05:01,312 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312142221] [2022-02-10 23:05:01,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 23:05:01,313 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 97 states [2022-02-10 23:05:01,313 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:05:01,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2022-02-10 23:05:01,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=650, Invalid=7917, Unknown=5, NotChecked=740, Total=9312 [2022-02-10 23:05:01,314 INFO L87 Difference]: Start difference. First operand 35997 states and 116889 transitions. Second operand has 97 states, 97 states have (on average 3.7938144329896906) internal successors, (368), 97 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:05:24,348 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (<= c_~d~0 0)) (.cse2 (<= c_~n~0 (+ c_~back~0 1)))) (let ((.cse4 (= (mod c_~v_assert~0 256) 0)) (.cse1 (or .cse6 .cse2)) (.cse7 (or (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t2~0#1.base|)) .cse2)) (.cse8 (or .cse2 (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|)))) (.cse0 (or (<= c_~front~0 c_~back~0) .cse2)) (.cse3 (or (<= c_~n~0 (+ 2 c_~front~0)) .cse2)) (.cse5 (< c_~back~0 0)) (.cse11 (+ |c_#StackHeapBarrier| 1))) (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (or (and .cse0 .cse1 (or .cse2 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) .cse3 (or (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) .cse2)) .cse4 .cse5) (= c_~d~0 0) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (or .cse4 (and (or (not (= |c_ULTIMATE.start_main_#t~ret9#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) .cse2) .cse0 .cse1 .cse3 (or .cse2 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_main_#t~ret9#1.base|)))) .cse5) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base|) 1) (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (or .cse2 (not (= |c_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|))) .cse0 .cse1 (or .cse2 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base|))) .cse3) .cse4 (< 2 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse5) .cse6 (or (and .cse7 .cse8 .cse0 .cse1 .cse3) .cse4 .cse5) (<= c_~d~0 c_~W~0) (<= 1 c_~v_assert~0) (or .cse4 (and (or .cse2 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) .cse0 (or .cse2 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) .cse1 .cse3) .cse5) (or (and .cse7 (or .cse2 (<= (+ c_~d~0 2) c_~W~0)) .cse8 .cse0 .cse3) .cse5 (<= |c_thread1Thread1of1ForFork1_~w~0#1| 1)) (forall ((v_ArrVal_463 (Array Int Int)) (v_ArrVal_464 (Array Int Int))) (<= (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_463)) (.cse10 (* c_~front~0 4))) (+ (select (select (store .cse9 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_464) c_~queue~0.base) (+ c_~queue~0.offset .cse10 4)) c_~d~0 (select (select .cse9 c_~queue~0.base) (+ c_~queue~0.offset .cse10)))) c_~W~0)) (<= .cse11 |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= .cse11 |c_ULTIMATE.start_main_~#t3~0#1.base|)))) is different from false [2022-02-10 23:05:26,881 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse9 (<= c_~d~0 0)) (.cse6 (<= c_~n~0 (+ c_~back~0 1)))) (let ((.cse1 (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_33| Int)) (or (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_33| |c_#StackHeapBarrier|)) (let ((.cse15 (<= c_~n~0 (+ c_~back~0 1)))) (and (or .cse15 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_33|))) (or (<= c_~front~0 c_~back~0) .cse15) (or (<= c_~d~0 0) .cse15) (or (<= c_~n~0 (+ 2 c_~front~0)) .cse15) (or (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_33|)) .cse15))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_33|) 0))))) (.cse2 (< 2 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse0 (= (mod c_~v_assert~0 256) 0)) (.cse5 (or .cse9 .cse6)) (.cse10 (or (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t2~0#1.base|)) .cse6)) (.cse11 (or .cse6 (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|)))) (.cse4 (or (<= c_~front~0 c_~back~0) .cse6)) (.cse7 (or (<= c_~n~0 (+ 2 c_~front~0)) .cse6)) (.cse3 (< c_~back~0 0)) (.cse8 (forall ((v_ArrVal_463 (Array Int Int)) (v_ArrVal_464 (Array Int Int))) (<= (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_463)) (.cse14 (* c_~front~0 4))) (+ (select (select (store .cse13 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_464) c_~queue~0.base) (+ c_~queue~0.offset .cse14 4)) c_~d~0 (select (select .cse13 c_~queue~0.base) (+ c_~queue~0.offset .cse14)))) c_~W~0))) (.cse12 (+ |c_#StackHeapBarrier| 1))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse0 (< 2 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse1 .cse3) (or (and .cse4 .cse5 (or .cse6 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) .cse7 (or (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) .cse6)) .cse0 .cse3) (= c_~d~0 0) (or .cse8 (not (< c_~back~0 c_~n~0)) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1)) (not (<= 0 c_~back~0))) (<= c_~v_assert~0 1) (or .cse0 (and (or (not (= |c_ULTIMATE.start_main_#t~ret9#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) .cse6) .cse4 .cse5 .cse7 (or .cse6 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_main_#t~ret9#1.base|)))) .cse3) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base|) 1) (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (or .cse6 (not (= |c_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|))) .cse4 .cse5 (or .cse6 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base|))) .cse7) .cse0 .cse2 .cse3) .cse9 (or (and .cse10 .cse11 .cse4 .cse5 .cse7) .cse0 .cse3) (<= c_~d~0 c_~W~0) (<= 1 c_~v_assert~0) (or .cse0 (and (or .cse6 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) .cse4 (or .cse6 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) .cse5 .cse7) .cse3) (or (and .cse10 (or .cse6 (<= (+ c_~d~0 2) c_~W~0)) .cse11 .cse4 .cse7) .cse3 (<= |c_thread1Thread1of1ForFork1_~w~0#1| 1)) .cse8 (<= .cse12 |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= .cse12 |c_ULTIMATE.start_main_~#t3~0#1.base|)))) is different from false [2022-02-10 23:05:27,006 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_463 (Array Int Int)) (v_ArrVal_464 (Array Int Int))) (<= (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_463)) (.cse2 (* c_~front~0 4))) (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_464) c_~queue~0.base) (+ c_~queue~0.offset .cse2 4)) c_~d~0 (select (select .cse1 c_~queue~0.base) (+ c_~queue~0.offset .cse2)))) c_~W~0)))) (and (or (not (< 0 |c_thread1Thread1of1ForFork1_~w~0#1|)) .cse0 (not (< c_~back~0 c_~n~0)) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1)) (not (<= 0 c_~back~0))) .cse0)) is different from false [2022-02-10 23:05:32,083 WARN L838 $PredicateComparison]: unable to prove that (and (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (forall ((v_ArrVal_463 (Array Int Int)) (v_ArrVal_464 (Array Int Int))) (<= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_463)) (.cse1 (* c_~front~0 4))) (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_464) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) c_~d~0 (select (select .cse0 c_~queue~0.base) (+ c_~queue~0.offset .cse1)))) c_~W~0))) is different from false [2022-02-10 23:05:32,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:05:32,858 INFO L93 Difference]: Finished difference Result 96360 states and 307119 transitions. [2022-02-10 23:05:32,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2022-02-10 23:05:32,858 INFO L78 Accepts]: Start accepts. Automaton has has 97 states, 97 states have (on average 3.7938144329896906) internal successors, (368), 97 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2022-02-10 23:05:32,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:05:33,133 INFO L225 Difference]: With dead ends: 96360 [2022-02-10 23:05:33,133 INFO L226 Difference]: Without dead ends: 95280 [2022-02-10 23:05:33,135 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 570 GetRequests, 261 SyntacticMatches, 64 SemanticMatches, 245 ConstructedPredicates, 8 IntricatePredicates, 7 DeprecatedPredicates, 24690 ImplicationChecksByTransitivity, 31.3s TimeCoverageRelationStatistics Valid=7918, Invalid=48981, Unknown=15, NotChecked=3848, Total=60762 [2022-02-10 23:05:33,136 INFO L934 BasicCegarLoop]: 451 mSDtfsCounter, 4377 mSDsluCounter, 22287 mSDsCounter, 0 mSdLazyCounter, 8143 mSolverCounterSat, 323 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4377 SdHoareTripleChecker+Valid, 18895 SdHoareTripleChecker+Invalid, 22199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 323 IncrementalHoareTripleChecker+Valid, 8143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 13733 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-02-10 23:05:33,136 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [4377 Valid, 18895 Invalid, 22199 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [323 Valid, 8143 Invalid, 0 Unknown, 13733 Unchecked, 3.6s Time] [2022-02-10 23:05:33,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95280 states. [2022-02-10 23:05:34,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95280 to 39510. [2022-02-10 23:05:34,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39510 states, 39509 states have (on average 3.2510820319420892) internal successors, (128447), 39509 states have internal predecessors, (128447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:05:34,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39510 states to 39510 states and 128447 transitions. [2022-02-10 23:05:34,447 INFO L78 Accepts]: Start accepts. Automaton has 39510 states and 128447 transitions. Word has length 148 [2022-02-10 23:05:34,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:05:34,447 INFO L470 AbstractCegarLoop]: Abstraction has 39510 states and 128447 transitions. [2022-02-10 23:05:34,447 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 97 states, 97 states have (on average 3.7938144329896906) internal successors, (368), 97 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:05:34,447 INFO L276 IsEmpty]: Start isEmpty. Operand 39510 states and 128447 transitions. [2022-02-10 23:05:34,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-02-10 23:05:34,509 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:05:34,509 INFO L515 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:05:34,525 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-02-10 23:05:34,711 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-02-10 23:05:34,711 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-10 23:05:34,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:05:34,712 INFO L85 PathProgramCache]: Analyzing trace with hash 606033631, now seen corresponding path program 11 times [2022-02-10 23:05:34,712 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:05:34,712 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671092307] [2022-02-10 23:05:34,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:05:34,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:05:34,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:05:35,867 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:05:35,867 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:05:35,867 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671092307] [2022-02-10 23:05:35,867 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671092307] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:05:35,867 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77400600] [2022-02-10 23:05:35,867 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-10 23:05:35,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:05:35,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:05:35,868 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 23:05:35,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-02-10 23:05:35,963 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-02-10 23:05:35,963 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:05:35,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 69 conjunts are in the unsatisfiable core [2022-02-10 23:05:35,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:05:36,885 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-02-10 23:05:37,384 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-10 23:05:38,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:05:38,193 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-02-10 23:05:38,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:05:38,612 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2022-02-10 23:05:38,842 INFO L353 Elim1Store]: treesize reduction 48, result has 5.9 percent of original size [2022-02-10 23:05:38,842 INFO L387 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-02-10 23:05:38,997 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:05:38,997 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 23:05:39,515 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_505 (Array Int Int))) (<= (+ c_~d~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_505) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) c_~W~0)) (= (mod c_~v_assert~0 256) 0)) is different from false [2022-02-10 23:05:39,526 WARN L838 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (forall ((v_ArrVal_505 (Array Int Int))) (<= (+ c_~d~0 |c_thread2Thread1of1ForFork2_~temp~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_505) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) c_~W~0))) is different from false [2022-02-10 23:05:39,532 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_505 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ c_~d~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_505) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))) c_~W~0)) (= (mod c_~v_assert~0 256) 0)) is different from false [2022-02-10 23:05:39,570 WARN L838 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_505 (Array Int Int))) (<= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_504)) (.cse1 (* c_~front~0 4))) (+ c_~d~0 (select (select .cse0 c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_505) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) c_~W~0))) is different from false [2022-02-10 23:05:41,493 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 23:05:41,493 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 81 [2022-02-10 23:05:41,535 INFO L353 Elim1Store]: treesize reduction 47, result has 53.0 percent of original size [2022-02-10 23:05:41,535 INFO L387 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 1958 treesize of output 1794 [2022-02-10 23:05:41,563 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 23:05:41,564 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1694 treesize of output 1390 [2022-02-10 23:05:41,577 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1390 treesize of output 1166 [2022-02-10 23:05:41,622 INFO L353 Elim1Store]: treesize reduction 47, result has 53.0 percent of original size [2022-02-10 23:05:41,623 INFO L387 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 1214 treesize of output 1102 [2022-02-10 23:07:32,973 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-02-10 23:07:32,973 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [77400600] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 23:07:32,973 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 23:07:32,974 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 38, 38] total 102 [2022-02-10 23:07:32,974 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354988651] [2022-02-10 23:07:32,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 23:07:32,974 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2022-02-10 23:07:32,974 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:07:32,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2022-02-10 23:07:32,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=735, Invalid=8774, Unknown=13, NotChecked=780, Total=10302 [2022-02-10 23:07:32,975 INFO L87 Difference]: Start difference. First operand 39510 states and 128447 transitions. Second operand has 102 states, 102 states have (on average 3.6176470588235294) internal successors, (369), 102 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:07:56,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:07:56,835 INFO L93 Difference]: Finished difference Result 85041 states and 274992 transitions. [2022-02-10 23:07:56,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2022-02-10 23:07:56,835 INFO L78 Accepts]: Start accepts. Automaton has has 102 states, 102 states have (on average 3.6176470588235294) internal successors, (369), 102 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2022-02-10 23:07:56,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:07:57,071 INFO L225 Difference]: With dead ends: 85041 [2022-02-10 23:07:57,071 INFO L226 Difference]: Without dead ends: 83052 [2022-02-10 23:07:57,074 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 528 GetRequests, 262 SyntacticMatches, 38 SemanticMatches, 228 ConstructedPredicates, 4 IntricatePredicates, 7 DeprecatedPredicates, 20016 ImplicationChecksByTransitivity, 22.8s TimeCoverageRelationStatistics Valid=7144, Invalid=43709, Unknown=13, NotChecked=1804, Total=52670 [2022-02-10 23:07:57,074 INFO L934 BasicCegarLoop]: 348 mSDtfsCounter, 5994 mSDsluCounter, 16444 mSDsCounter, 0 mSdLazyCounter, 7413 mSolverCounterSat, 491 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5994 SdHoareTripleChecker+Valid, 14164 SdHoareTripleChecker+Invalid, 17351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 491 IncrementalHoareTripleChecker+Valid, 7413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9447 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-02-10 23:07:57,074 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [5994 Valid, 14164 Invalid, 17351 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [491 Valid, 7413 Invalid, 0 Unknown, 9447 Unchecked, 3.5s Time] [2022-02-10 23:07:57,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83052 states. [2022-02-10 23:07:58,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83052 to 51908. [2022-02-10 23:07:58,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51908 states, 51907 states have (on average 3.2919644749263104) internal successors, (170876), 51907 states have internal predecessors, (170876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:07:58,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51908 states to 51908 states and 170876 transitions. [2022-02-10 23:07:58,415 INFO L78 Accepts]: Start accepts. Automaton has 51908 states and 170876 transitions. Word has length 148 [2022-02-10 23:07:58,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:07:58,416 INFO L470 AbstractCegarLoop]: Abstraction has 51908 states and 170876 transitions. [2022-02-10 23:07:58,416 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 102 states, 102 states have (on average 3.6176470588235294) internal successors, (369), 102 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:07:58,416 INFO L276 IsEmpty]: Start isEmpty. Operand 51908 states and 170876 transitions. [2022-02-10 23:07:58,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-02-10 23:07:58,493 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:07:58,493 INFO L515 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:07:58,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-02-10 23:07:58,694 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-02-10 23:07:58,694 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-10 23:07:58,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:07:58,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1817232215, now seen corresponding path program 12 times [2022-02-10 23:07:58,695 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:07:58,695 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051747966] [2022-02-10 23:07:58,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:07:58,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:07:58,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:08:00,188 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:08:00,188 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:08:00,188 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051747966] [2022-02-10 23:08:00,188 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051747966] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:08:00,188 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508985932] [2022-02-10 23:08:00,188 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-10 23:08:00,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:08:00,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:08:00,189 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 23:08:00,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-02-10 23:08:00,449 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-02-10 23:08:00,449 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:08:00,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 70 conjunts are in the unsatisfiable core [2022-02-10 23:08:00,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:08:01,430 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-02-10 23:08:01,974 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-10 23:08:02,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:08:02,754 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-02-10 23:08:03,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:08:03,061 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2022-02-10 23:08:03,152 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-02-10 23:08:03,152 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 13 [2022-02-10 23:08:03,335 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:08:03,335 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 23:08:03,521 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_546 (Array Int Int))) (<= (+ c_~d~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_546) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) c_~W~0)) is different from false [2022-02-10 23:08:03,527 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_546 (Array Int Int))) (<= (+ c_~d~0 |c_thread2Thread1of1ForFork2_~temp~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_546) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) c_~W~0)) is different from false [2022-02-10 23:08:03,531 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_546 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ c_~d~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_546) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))) c_~W~0)) is different from false [2022-02-10 23:08:03,553 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_545 (Array Int Int))) (<= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_545)) (.cse1 (* c_~front~0 4))) (+ (select (select .cse0 c_~queue~0.base) (+ c_~queue~0.offset .cse1)) c_~d~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_546) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) c_~W~0)) is different from false [2022-02-10 23:08:05,226 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 23:08:05,226 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 82 [2022-02-10 23:08:05,258 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-02-10 23:08:05,259 INFO L387 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 1960 treesize of output 1795 [2022-02-10 23:08:05,269 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1694 treesize of output 1470 [2022-02-10 23:08:05,279 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 23:08:05,280 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1470 treesize of output 1166 [2022-02-10 23:08:05,324 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-02-10 23:08:05,324 INFO L387 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 1215 treesize of output 1102 [2022-02-10 23:08:08,938 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-02-10 23:08:08,939 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [508985932] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 23:08:08,939 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 23:08:08,939 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 38, 38] total 102 [2022-02-10 23:08:08,939 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118850478] [2022-02-10 23:08:08,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 23:08:08,939 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2022-02-10 23:08:08,939 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:08:08,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2022-02-10 23:08:08,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=765, Invalid=8727, Unknown=30, NotChecked=780, Total=10302 [2022-02-10 23:08:08,941 INFO L87 Difference]: Start difference. First operand 51908 states and 170876 transitions. Second operand has 102 states, 102 states have (on average 3.6666666666666665) internal successors, (374), 102 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:08:22,810 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_~back~0 4)) (.cse0 (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_545 (Array Int Int))) (<= (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_545)) (.cse3 (* c_~front~0 4))) (+ (select (select .cse2 c_~queue~0.base) (+ c_~queue~0.offset .cse3)) c_~d~0 (select (select (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_546) c_~queue~0.base) (+ c_~queue~0.offset .cse3 4)))) c_~W~0)))) (and (or (= (mod c_~v_assert~0 256) 0) (<= |c_thread1Thread1of1ForFork1_~w~0#1| 1) (not (< c_~back~0 c_~n~0)) .cse0 (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)) 1)) (not (<= 0 c_~back~0))) (or (<= 1 c_~back~0) (and (not (< |c_ULTIMATE.start_main_~#t2~0#1.base| |c_#StackHeapBarrier|)) (<= c_~d~0 0) (not (< |c_ULTIMATE.start_main_~#t3~0#1.base| |c_#StackHeapBarrier|)) (= (* c_~front~0 4) .cse1)) (< c_~back~0 0)) .cse0)) is different from false [2022-02-10 23:08:23,986 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_545 (Array Int Int))) (<= (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_545)) (.cse2 (* c_~front~0 4))) (+ (select (select .cse1 c_~queue~0.base) (+ c_~queue~0.offset .cse2)) c_~d~0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_546) c_~queue~0.base) (+ c_~queue~0.offset .cse2 4)))) c_~W~0)))) (and (or (= (mod c_~v_assert~0 256) 0) (not (< c_~back~0 c_~n~0)) (<= |c_thread1Thread1of1ForFork1_#t~post1#1| 1) .cse0 (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1)) (not (<= 0 c_~back~0))) .cse0)) is different from false [2022-02-10 23:08:25,251 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_545 (Array Int Int))) (<= (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_545)) (.cse2 (* c_~front~0 4))) (+ (select (select .cse1 c_~queue~0.base) (+ c_~queue~0.offset .cse2)) c_~d~0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_546) c_~queue~0.base) (+ c_~queue~0.offset .cse2 4)))) c_~W~0)))) (and (or (= (mod c_~v_assert~0 256) 0) (not (< 0 |c_thread1Thread1of1ForFork1_~w~0#1|)) (not (< c_~back~0 c_~n~0)) .cse0 (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1)) (not (<= 0 c_~back~0))) .cse0)) is different from false [2022-02-10 23:08:37,138 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_546 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ c_~d~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_546) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))) c_~W~0)) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0))) is different from false [2022-02-10 23:08:54,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:08:54,077 INFO L93 Difference]: Finished difference Result 175513 states and 570767 transitions. [2022-02-10 23:08:54,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 219 states. [2022-02-10 23:08:54,078 INFO L78 Accepts]: Start accepts. Automaton has has 102 states, 102 states have (on average 3.6666666666666665) internal successors, (374), 102 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2022-02-10 23:08:54,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:08:54,582 INFO L225 Difference]: With dead ends: 175513 [2022-02-10 23:08:54,582 INFO L226 Difference]: Without dead ends: 156520 [2022-02-10 23:08:54,585 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 703 GetRequests, 264 SyntacticMatches, 140 SemanticMatches, 299 ConstructedPredicates, 8 IntricatePredicates, 3 DeprecatedPredicates, 48725 ImplicationChecksByTransitivity, 41.1s TimeCoverageRelationStatistics Valid=11696, Invalid=73746, Unknown=146, NotChecked=4712, Total=90300 [2022-02-10 23:08:54,585 INFO L934 BasicCegarLoop]: 482 mSDtfsCounter, 8397 mSDsluCounter, 23689 mSDsCounter, 0 mSdLazyCounter, 10174 mSolverCounterSat, 692 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8397 SdHoareTripleChecker+Valid, 20382 SdHoareTripleChecker+Invalid, 21016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 692 IncrementalHoareTripleChecker+Valid, 10174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 10150 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-02-10 23:08:54,585 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [8397 Valid, 20382 Invalid, 21016 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [692 Valid, 10174 Invalid, 0 Unknown, 10150 Unchecked, 5.0s Time] [2022-02-10 23:08:54,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156520 states. [2022-02-10 23:08:56,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156520 to 59947. [2022-02-10 23:08:57,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59947 states, 59946 states have (on average 3.2635205017849396) internal successors, (195635), 59946 states have internal predecessors, (195635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:08:57,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59947 states to 59947 states and 195635 transitions. [2022-02-10 23:08:57,282 INFO L78 Accepts]: Start accepts. Automaton has 59947 states and 195635 transitions. Word has length 148 [2022-02-10 23:08:57,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:08:57,282 INFO L470 AbstractCegarLoop]: Abstraction has 59947 states and 195635 transitions. [2022-02-10 23:08:57,282 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 102 states, 102 states have (on average 3.6666666666666665) internal successors, (374), 102 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:08:57,282 INFO L276 IsEmpty]: Start isEmpty. Operand 59947 states and 195635 transitions. [2022-02-10 23:08:57,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-02-10 23:08:57,482 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:08:57,482 INFO L515 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:08:57,498 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-02-10 23:08:57,682 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-02-10 23:08:57,683 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-10 23:08:57,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:08:57,683 INFO L85 PathProgramCache]: Analyzing trace with hash -103590325, now seen corresponding path program 13 times [2022-02-10 23:08:57,683 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:08:57,683 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461074055] [2022-02-10 23:08:57,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:08:57,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:08:57,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:08:59,652 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:08:59,652 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:08:59,652 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461074055] [2022-02-10 23:08:59,652 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461074055] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:08:59,652 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766461187] [2022-02-10 23:08:59,652 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-02-10 23:08:59,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:08:59,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:08:59,653 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 23:08:59,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-02-10 23:08:59,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:08:59,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 71 conjunts are in the unsatisfiable core [2022-02-10 23:08:59,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:08:59,792 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-10 23:08:59,827 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-10 23:08:59,827 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-02-10 23:09:00,238 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-02-10 23:09:00,238 INFO L387 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 16 treesize of output 18 [2022-02-10 23:09:01,660 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-02-10 23:09:01,820 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-02-10 23:09:02,201 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-02-10 23:09:02,202 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 13 [2022-02-10 23:09:02,371 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:09:02,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 23:09:03,330 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-02-10 23:09:03,330 INFO L387 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 198 treesize of output 216 [2022-02-10 23:09:03,348 INFO L353 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2022-02-10 23:09:03,349 INFO L387 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 160 treesize of output 146 [2022-02-10 23:09:03,373 INFO L353 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2022-02-10 23:09:03,374 INFO L387 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 93 treesize of output 99 [2022-02-10 23:09:06,879 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2022-02-10 23:09:06,899 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 16 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:09:06,900 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [766461187] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 23:09:06,900 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 23:09:06,900 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 101 [2022-02-10 23:09:06,900 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849739335] [2022-02-10 23:09:06,900 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 23:09:06,900 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 101 states [2022-02-10 23:09:06,900 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:09:06,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2022-02-10 23:09:06,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=753, Invalid=9298, Unknown=49, NotChecked=0, Total=10100 [2022-02-10 23:09:06,901 INFO L87 Difference]: Start difference. First operand 59947 states and 195635 transitions. Second operand has 101 states, 101 states have (on average 3.594059405940594) internal successors, (363), 101 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-02-10 23:09:46,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:09:46,810 INFO L93 Difference]: Finished difference Result 186224 states and 585545 transitions. [2022-02-10 23:09:46,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 289 states. [2022-02-10 23:09:46,811 INFO L78 Accepts]: Start accepts. Automaton has has 101 states, 101 states have (on average 3.594059405940594) internal successors, (363), 101 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 148 [2022-02-10 23:09:46,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:09:47,382 INFO L225 Difference]: With dead ends: 186224 [2022-02-10 23:09:47,382 INFO L226 Difference]: Without dead ends: 161177 [2022-02-10 23:09:47,387 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 649 GetRequests, 271 SyntacticMatches, 4 SemanticMatches, 374 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55134 ImplicationChecksByTransitivity, 35.2s TimeCoverageRelationStatistics Valid=15922, Invalid=124501, Unknown=577, NotChecked=0, Total=141000 [2022-02-10 23:09:47,387 INFO L934 BasicCegarLoop]: 363 mSDtfsCounter, 9131 mSDsluCounter, 23996 mSDsCounter, 0 mSdLazyCounter, 8896 mSolverCounterSat, 873 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9131 SdHoareTripleChecker+Valid, 18960 SdHoareTripleChecker+Invalid, 28261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 873 IncrementalHoareTripleChecker+Valid, 8896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 18492 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-02-10 23:09:47,387 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [9131 Valid, 18960 Invalid, 28261 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [873 Valid, 8896 Invalid, 0 Unknown, 18492 Unchecked, 4.9s Time] [2022-02-10 23:09:47,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161177 states. [2022-02-10 23:09:49,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161177 to 56591. [2022-02-10 23:09:50,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56591 states, 56590 states have (on average 3.234016610708606) internal successors, (183013), 56590 states have internal predecessors, (183013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:09:50,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56591 states to 56591 states and 183013 transitions. [2022-02-10 23:09:50,218 INFO L78 Accepts]: Start accepts. Automaton has 56591 states and 183013 transitions. Word has length 148 [2022-02-10 23:09:50,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:09:50,219 INFO L470 AbstractCegarLoop]: Abstraction has 56591 states and 183013 transitions. [2022-02-10 23:09:50,219 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 101 states, 101 states have (on average 3.594059405940594) internal successors, (363), 101 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-02-10 23:09:50,219 INFO L276 IsEmpty]: Start isEmpty. Operand 56591 states and 183013 transitions. [2022-02-10 23:09:50,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-02-10 23:09:50,479 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:09:50,479 INFO L515 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:09:50,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-02-10 23:09:50,679 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-02-10 23:09:50,679 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-10 23:09:50,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:09:50,680 INFO L85 PathProgramCache]: Analyzing trace with hash -2060821907, now seen corresponding path program 14 times [2022-02-10 23:09:50,680 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:09:50,680 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296578156] [2022-02-10 23:09:50,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:09:50,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:09:50,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:09:51,839 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:09:51,839 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:09:51,840 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296578156] [2022-02-10 23:09:51,840 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296578156] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:09:51,840 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2144381342] [2022-02-10 23:09:51,840 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-10 23:09:51,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:09:51,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:09:51,841 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 23:09:51,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-02-10 23:09:51,938 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-10 23:09:51,939 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:09:51,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 71 conjunts are in the unsatisfiable core [2022-02-10 23:09:51,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:09:53,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:09:53,851 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-02-10 23:09:54,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:09:54,005 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-02-10 23:09:54,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:09:54,431 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 23:09:54,431 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 13 [2022-02-10 23:09:54,576 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:09:54,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 23:09:55,461 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-02-10 23:09:55,462 INFO L387 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 404 treesize of output 396 [2022-02-10 23:09:55,468 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 23:09:55,477 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 23:09:55,478 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 243 treesize of output 238 [2022-02-10 23:09:55,483 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 23:09:55,495 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 23:09:55,496 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 300 treesize of output 255 [2022-02-10 23:09:58,891 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 18 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:09:58,891 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2144381342] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 23:09:58,891 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 23:09:58,892 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 36, 36] total 97 [2022-02-10 23:09:58,892 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219314882] [2022-02-10 23:09:58,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 23:09:58,892 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 97 states [2022-02-10 23:09:58,892 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:09:58,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2022-02-10 23:09:58,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=781, Invalid=8474, Unknown=57, NotChecked=0, Total=9312 [2022-02-10 23:09:58,893 INFO L87 Difference]: Start difference. First operand 56591 states and 183013 transitions. Second operand has 97 states, 97 states have (on average 3.783505154639175) internal successors, (367), 97 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:10:58,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:10:58,544 INFO L93 Difference]: Finished difference Result 218591 states and 692438 transitions. [2022-02-10 23:10:58,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 457 states. [2022-02-10 23:10:58,544 INFO L78 Accepts]: Start accepts. Automaton has has 97 states, 97 states have (on average 3.783505154639175) internal successors, (367), 97 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2022-02-10 23:10:58,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:10:59,348 INFO L225 Difference]: With dead ends: 218591 [2022-02-10 23:10:59,349 INFO L226 Difference]: Without dead ends: 184673 [2022-02-10 23:10:59,359 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 798 GetRequests, 260 SyntacticMatches, 2 SemanticMatches, 536 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130739 ImplicationChecksByTransitivity, 49.3s TimeCoverageRelationStatistics Valid=36026, Invalid=252411, Unknown=469, NotChecked=0, Total=288906 [2022-02-10 23:10:59,360 INFO L934 BasicCegarLoop]: 454 mSDtfsCounter, 10151 mSDsluCounter, 32742 mSDsCounter, 0 mSdLazyCounter, 14677 mSolverCounterSat, 1174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10151 SdHoareTripleChecker+Valid, 27560 SdHoareTripleChecker+Invalid, 29797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1174 IncrementalHoareTripleChecker+Valid, 14677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 13946 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2022-02-10 23:10:59,360 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [10151 Valid, 27560 Invalid, 29797 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1174 Valid, 14677 Invalid, 0 Unknown, 13946 Unchecked, 7.8s Time] [2022-02-10 23:10:59,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184673 states. [2022-02-10 23:11:01,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184673 to 56311. [2022-02-10 23:11:01,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56311 states, 56310 states have (on average 3.229746048659208) internal successors, (181867), 56310 states have internal predecessors, (181867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:11:02,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56311 states to 56311 states and 181867 transitions. [2022-02-10 23:11:02,201 INFO L78 Accepts]: Start accepts. Automaton has 56311 states and 181867 transitions. Word has length 148 [2022-02-10 23:11:02,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:11:02,201 INFO L470 AbstractCegarLoop]: Abstraction has 56311 states and 181867 transitions. [2022-02-10 23:11:02,201 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 97 states, 97 states have (on average 3.783505154639175) internal successors, (367), 97 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:11:02,201 INFO L276 IsEmpty]: Start isEmpty. Operand 56311 states and 181867 transitions. [2022-02-10 23:11:02,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-02-10 23:11:02,293 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:11:02,294 INFO L515 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:11:02,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-02-10 23:11:02,494 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-02-10 23:11:02,495 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-10 23:11:02,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:11:02,495 INFO L85 PathProgramCache]: Analyzing trace with hash 659079269, now seen corresponding path program 15 times [2022-02-10 23:11:02,495 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:11:02,495 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314986149] [2022-02-10 23:11:02,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:11:02,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:11:02,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:11:04,023 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:11:04,023 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:11:04,024 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314986149] [2022-02-10 23:11:04,024 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314986149] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:11:04,024 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396791137] [2022-02-10 23:11:04,024 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-10 23:11:04,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:11:04,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:11:04,025 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 23:11:04,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-02-10 23:11:04,135 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-02-10 23:11:04,136 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:11:04,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 71 conjunts are in the unsatisfiable core [2022-02-10 23:11:04,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:11:05,163 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-02-10 23:11:05,700 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-10 23:11:06,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:11:06,398 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-02-10 23:11:06,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:11:06,756 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2022-02-10 23:11:06,955 INFO L353 Elim1Store]: treesize reduction 48, result has 5.9 percent of original size [2022-02-10 23:11:06,955 INFO L387 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-02-10 23:11:07,136 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:11:07,136 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 23:11:10,846 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 23:11:10,846 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 123 treesize of output 87 [2022-02-10 23:11:10,885 INFO L353 Elim1Store]: treesize reduction 47, result has 53.0 percent of original size [2022-02-10 23:11:10,886 INFO L387 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 4032 treesize of output 3674 [2022-02-10 23:11:10,911 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 23:11:10,911 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3598 treesize of output 3175 [2022-02-10 23:11:10,933 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 23:11:10,946 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 23:11:10,946 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 3158 treesize of output 2588 [2022-02-10 23:11:10,970 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 23:11:10,974 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 23:11:10,991 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 23:11:10,992 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 2578 treesize of output 2336 Received shutdown request... [2022-02-10 23:13:31,929 WARN L244 SmtUtils]: Removed 2 from assertion stack [2022-02-10 23:13:31,930 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-02-10 23:13:31,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-02-10 23:13:31,958 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-02-10 23:13:31,958 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-02-10 23:13:32,131 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-02-10 23:13:32,131 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was analyzing trace of length 149 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 1 for 10ms.. [2022-02-10 23:13:32,132 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 4 remaining) [2022-02-10 23:13:32,132 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 4 remaining) [2022-02-10 23:13:32,133 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATION (0 of 4 remaining) [2022-02-10 23:13:32,134 INFO L733 BasicCegarLoop]: Path program histogram: [15, 2, 1, 1, 1] [2022-02-10 23:13:32,136 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-02-10 23:13:32,136 INFO L184 ceAbstractionStarter]: Computing trace abstraction results [2022-02-10 23:13:32,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.02 11:13:32 BasicIcfg [2022-02-10 23:13:32,137 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-10 23:13:32,137 INFO L158 Benchmark]: Toolchain (without parser) took 774171.30ms. Allocated memory was 192.9MB in the beginning and 4.5GB in the end (delta: 4.3GB). Free memory was 141.8MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 3.9GB. Max. memory is 8.0GB. [2022-02-10 23:13:32,137 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 192.9MB. Free memory was 158.0MB in the beginning and 157.8MB in the end (delta: 151.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-02-10 23:13:32,138 INFO L158 Benchmark]: CACSL2BoogieTranslator took 205.66ms. Allocated memory is still 192.9MB. Free memory was 141.5MB in the beginning and 167.4MB in the end (delta: -25.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-02-10 23:13:32,138 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.39ms. Allocated memory is still 192.9MB. Free memory was 167.4MB in the beginning and 165.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-10 23:13:32,138 INFO L158 Benchmark]: Boogie Preprocessor took 20.57ms. Allocated memory is still 192.9MB. Free memory was 165.3MB in the beginning and 163.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-10 23:13:32,138 INFO L158 Benchmark]: RCFGBuilder took 386.04ms. Allocated memory is still 192.9MB. Free memory was 163.7MB in the beginning and 143.8MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-02-10 23:13:32,138 INFO L158 Benchmark]: TraceAbstraction took 773504.88ms. Allocated memory was 192.9MB in the beginning and 4.5GB in the end (delta: 4.3GB). Free memory was 143.3MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 3.9GB. Max. memory is 8.0GB. [2022-02-10 23:13:32,138 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.10ms. Allocated memory is still 192.9MB. Free memory was 158.0MB in the beginning and 157.8MB in the end (delta: 151.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 205.66ms. Allocated memory is still 192.9MB. Free memory was 141.5MB in the beginning and 167.4MB in the end (delta: -25.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.39ms. Allocated memory is still 192.9MB. Free memory was 167.4MB in the beginning and 165.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.57ms. Allocated memory is still 192.9MB. Free memory was 165.3MB in the beginning and 163.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 386.04ms. Allocated memory is still 192.9MB. Free memory was 163.7MB in the beginning and 143.8MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 773504.88ms. Allocated memory was 192.9MB in the beginning and 4.5GB in the end (delta: 4.3GB). Free memory was 143.3MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 3.9GB. 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: 116]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was analyzing trace of length 149 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 1 for 10ms.. - TimeoutResultAtElement [Line: 110]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 149 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 1 for 10ms.. - TimeoutResultAtElement [Line: 109]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 149 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 1 for 10ms.. - TimeoutResultAtElement [Line: 108]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 149 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 1 for 10ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 173 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 773.4s, OverallIterations: 20, TraceHistogramMax: 2, PathProgramHistogramMax: 15, EmptinessCheckTime: 1.3s, AutomataDifference: 389.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 81235 SdHoareTripleChecker+Valid, 51.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 81235 mSDsluCounter, 219057 SdHoareTripleChecker+Invalid, 43.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 119758 IncrementalHoareTripleChecker+Unchecked, 253302 mSDsCounter, 7123 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 103479 IncrementalHoareTripleChecker+Invalid, 230360 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7123 mSolverCounterUnsat, 5937 mSDtfsCounter, 103479 mSolverCounterSat, 0.8s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7935 GetRequests, 3932 SyntacticMatches, 572 SemanticMatches, 3431 ConstructedPredicates, 46 IntricatePredicates, 45 DeprecatedPredicates, 465958 ImplicationChecksByTransitivity, 347.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59947occurred in iteration=17, InterpolantAutomatonStates: 2453, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 17.2s AutomataMinimizationTime, 19 MinimizatonAttempts, 665106 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 209.7s InterpolantComputationTime, 4739 NumberOfCodeBlocks, 4716 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 6828 ConstructedInterpolants, 749 QuantifiedInterpolants, 145094 SizeOfPredicates, 473 NumberOfNonLiveVariables, 5138 ConjunctsInSsa, 792 ConjunctsInUnsatCore, 49 InterpolantComputations, 4 PerfectInterpolantSequences, 121/840 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