/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-send-receive.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 14:30:13,107 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 14:30:13,109 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 14:30:13,172 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 14:30:13,173 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 14:30:13,176 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 14:30:13,177 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 14:30:13,180 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 14:30:13,181 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 14:30:13,185 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 14:30:13,186 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 14:30:13,186 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 14:30:13,186 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 14:30:13,187 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 14:30:13,188 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 14:30:13,188 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 14:30:13,189 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 14:30:13,189 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 14:30:13,190 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 14:30:13,191 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 14:30:13,192 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 14:30:13,194 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 14:30:13,197 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 14:30:13,198 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 14:30:13,201 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 14:30:13,201 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 14:30:13,201 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 14:30:13,202 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 14:30:13,202 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 14:30:13,203 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 14:30:13,203 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 14:30:13,203 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 14:30:13,204 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 14:30:13,204 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 14:30:13,205 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 14:30:13,205 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 14:30:13,205 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 14:30:13,205 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 14:30:13,205 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 14:30:13,206 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 14:30:13,206 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 14:30:13,207 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2022-03-15 14:30:13,225 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 14:30:13,225 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 14:30:13,225 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-15 14:30:13,226 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-15 14:30:13,226 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 14:30:13,226 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 14:30:13,226 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 14:30:13,227 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 14:30:13,227 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 14:30:13,227 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 14:30:13,229 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 14:30:13,229 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 14:30:13,229 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 14:30:13,229 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 14:30:13,229 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 14:30:13,230 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 14:30:13,230 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 14:30:13,230 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 14:30:13,230 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 14:30:13,230 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 14:30:13,230 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 14:30:13,230 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 14:30:13,230 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 14:30:13,230 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 14:30:13,231 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 14:30:13,231 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 14:30:13,231 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 14:30:13,232 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-15 14:30:13,232 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 14:30:13,232 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 14:30:13,232 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 14:30:13,232 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-15 14:30:13,232 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 14:30:13,232 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-03-15 14:30:13,428 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 14:30:13,443 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 14:30:13,445 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 14:30:13,445 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 14:30:13,447 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 14:30:13,448 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c [2022-03-15 14:30:13,498 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34e6eb2d3/854ebf34d60349f59109a6f5d3e9bcf7/FLAG79346559a [2022-03-15 14:30:13,842 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 14:30:13,843 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c [2022-03-15 14:30:13,848 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34e6eb2d3/854ebf34d60349f59109a6f5d3e9bcf7/FLAG79346559a [2022-03-15 14:30:13,857 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34e6eb2d3/854ebf34d60349f59109a6f5d3e9bcf7 [2022-03-15 14:30:13,858 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 14:30:13,859 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 14:30:13,860 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 14:30:13,860 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 14:30:13,864 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 14:30:13,864 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 02:30:13" (1/1) ... [2022-03-15 14:30:13,865 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55f9ba25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:30:13, skipping insertion in model container [2022-03-15 14:30:13,865 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 02:30:13" (1/1) ... [2022-03-15 14:30:13,870 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 14:30:13,888 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 14:30:14,052 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-send-receive.wvr.c[3107,3120] [2022-03-15 14:30:14,066 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 14:30:14,074 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 14:30:14,107 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-send-receive.wvr.c[3107,3120] [2022-03-15 14:30:14,109 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 14:30:14,118 INFO L208 MainTranslator]: Completed translation [2022-03-15 14:30:14,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:30:14 WrapperNode [2022-03-15 14:30:14,121 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 14:30:14,122 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 14:30:14,122 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 14:30:14,122 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 14:30:14,127 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:30:14" (1/1) ... [2022-03-15 14:30:14,144 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:30:14" (1/1) ... [2022-03-15 14:30:14,171 INFO L137 Inliner]: procedures = 25, calls = 52, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 161 [2022-03-15 14:30:14,171 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 14:30:14,172 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 14:30:14,172 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 14:30:14,172 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 14:30:14,177 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:30:14" (1/1) ... [2022-03-15 14:30:14,177 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:30:14" (1/1) ... [2022-03-15 14:30:14,189 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:30:14" (1/1) ... [2022-03-15 14:30:14,189 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:30:14" (1/1) ... [2022-03-15 14:30:14,193 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:30:14" (1/1) ... [2022-03-15 14:30:14,196 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:30:14" (1/1) ... [2022-03-15 14:30:14,197 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:30:14" (1/1) ... [2022-03-15 14:30:14,198 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 14:30:14,223 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 14:30:14,223 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 14:30:14,223 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 14:30:14,224 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:30:14" (1/1) ... [2022-03-15 14:30:14,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 14:30:14,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:30:14,261 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-15 14:30:14,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-15 14:30:14,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 14:30:14,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 14:30:14,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 14:30:14,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 14:30:14,306 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 14:30:14,306 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 14:30:14,306 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 14:30:14,306 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 14:30:14,315 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-15 14:30:14,315 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-15 14:30:14,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 14:30:14,315 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-03-15 14:30:14,316 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-03-15 14:30:14,316 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-15 14:30:14,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 14:30:14,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 14:30:14,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 14:30:14,317 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-15 14:30:14,376 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 14:30:14,377 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 14:30:14,673 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 14:30:14,733 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 14:30:14,733 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-03-15 14:30:14,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 02:30:14 BoogieIcfgContainer [2022-03-15 14:30:14,735 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 14:30:14,736 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 14:30:14,736 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 14:30:14,752 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 14:30:14,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 02:30:13" (1/3) ... [2022-03-15 14:30:14,753 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43fac2ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 02:30:14, skipping insertion in model container [2022-03-15 14:30:14,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:30:14" (2/3) ... [2022-03-15 14:30:14,753 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43fac2ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 02:30:14, skipping insertion in model container [2022-03-15 14:30:14,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 02:30:14" (3/3) ... [2022-03-15 14:30:14,754 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-send-receive.wvr.c [2022-03-15 14:30:14,757 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 14:30:14,757 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-15 14:30:14,757 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 14:30:14,758 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 14:30:14,802 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,803 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,803 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,803 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,804 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,804 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,804 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,804 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,804 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,804 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,805 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,805 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,805 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,805 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,805 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,805 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,805 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,806 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,806 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,806 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,807 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~b~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,807 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~b~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,807 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,807 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,807 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,807 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,808 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,808 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,808 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,808 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,808 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,808 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,809 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,809 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,809 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,809 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,809 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,809 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,809 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,810 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,810 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,817 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,818 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,818 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,818 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~b~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,819 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~b~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,819 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~b~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,819 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~b~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,819 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,819 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,819 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,819 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,820 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,820 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,820 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,820 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,820 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,820 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,821 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,821 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,821 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,821 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,821 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,821 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,821 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~b~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,822 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~b~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,822 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~b~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,822 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~b~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,822 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,822 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,823 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,823 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,823 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,823 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,825 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,826 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,826 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,826 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,826 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,826 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,827 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,827 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,827 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,827 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,827 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,828 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~b~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,828 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,828 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,828 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,828 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,828 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,828 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,828 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:30:14,831 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-03-15 14:30:14,878 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 14:30:14,886 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 14:30:14,887 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-03-15 14:30:14,897 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 142 places, 142 transitions, 308 flow [2022-03-15 14:30:15,046 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3113 states, 3112 states have (on average 3.5340616966580978) internal successors, (10998), 3112 states have internal predecessors, (10998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:30:15,056 INFO L276 IsEmpty]: Start isEmpty. Operand has 3113 states, 3112 states have (on average 3.5340616966580978) internal successors, (10998), 3112 states have internal predecessors, (10998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:30:15,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-03-15 14:30:15,094 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:30:15,094 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:30:15,095 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:30:15,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:30:15,098 INFO L85 PathProgramCache]: Analyzing trace with hash 518546796, now seen corresponding path program 1 times [2022-03-15 14:30:15,104 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:30:15,104 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859094580] [2022-03-15 14:30:15,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:30:15,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:30:15,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:30:15,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:30:15,296 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:30:15,296 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859094580] [2022-03-15 14:30:15,296 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859094580] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 14:30:15,296 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 14:30:15,296 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 14:30:15,297 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291691842] [2022-03-15 14:30:15,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 14:30:15,301 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-03-15 14:30:15,302 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:30:15,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-03-15 14:30:15,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-15 14:30:15,331 INFO L87 Difference]: Start difference. First operand has 3113 states, 3112 states have (on average 3.5340616966580978) internal successors, (10998), 3112 states have internal predecessors, (10998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 48.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:30:15,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:30:15,405 INFO L93 Difference]: Finished difference Result 3113 states and 10261 transitions. [2022-03-15 14:30:15,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 14:30:15,408 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 48.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2022-03-15 14:30:15,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:30:15,437 INFO L225 Difference]: With dead ends: 3113 [2022-03-15 14:30:15,437 INFO L226 Difference]: Without dead ends: 2945 [2022-03-15 14:30:15,438 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-15 14:30:15,441 INFO L933 BasicCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 14:30:15,442 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 14:30:15,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2945 states. [2022-03-15 14:30:15,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2945 to 2945. [2022-03-15 14:30:15,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2945 states, 2944 states have (on average 3.297554347826087) internal successors, (9708), 2944 states have internal predecessors, (9708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:30:15,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2945 states to 2945 states and 9708 transitions. [2022-03-15 14:30:15,575 INFO L78 Accepts]: Start accepts. Automaton has 2945 states and 9708 transitions. Word has length 96 [2022-03-15 14:30:15,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:30:15,576 INFO L470 AbstractCegarLoop]: Abstraction has 2945 states and 9708 transitions. [2022-03-15 14:30:15,576 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 48.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:30:15,576 INFO L276 IsEmpty]: Start isEmpty. Operand 2945 states and 9708 transitions. [2022-03-15 14:30:15,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-03-15 14:30:15,585 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:30:15,585 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:30:15,585 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 14:30:15,585 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:30:15,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:30:15,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1430139861, now seen corresponding path program 1 times [2022-03-15 14:30:15,587 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:30:15,587 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701448768] [2022-03-15 14:30:15,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:30:15,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:30:15,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:30:15,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:30:15,745 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:30:15,745 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701448768] [2022-03-15 14:30:15,745 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701448768] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 14:30:15,745 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 14:30:15,745 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 14:30:15,745 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405427954] [2022-03-15 14:30:15,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 14:30:15,750 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 14:30:15,750 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:30:15,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 14:30:15,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-15 14:30:15,751 INFO L87 Difference]: Start difference. First operand 2945 states and 9708 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:30:15,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:30:15,825 INFO L93 Difference]: Finished difference Result 2975 states and 9924 transitions. [2022-03-15 14:30:15,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 14:30:15,826 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2022-03-15 14:30:15,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:30:15,840 INFO L225 Difference]: With dead ends: 2975 [2022-03-15 14:30:15,840 INFO L226 Difference]: Without dead ends: 2975 [2022-03-15 14:30:15,841 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-15 14:30:15,842 INFO L933 BasicCegarLoop]: 135 mSDtfsCounter, 101 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 14:30:15,842 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 313 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 14:30:15,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2975 states. [2022-03-15 14:30:15,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2975 to 2567. [2022-03-15 14:30:15,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2567 states, 2566 states have (on average 3.314886983632112) internal successors, (8506), 2566 states have internal predecessors, (8506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:30:15,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2567 states to 2567 states and 8506 transitions. [2022-03-15 14:30:15,911 INFO L78 Accepts]: Start accepts. Automaton has 2567 states and 8506 transitions. Word has length 96 [2022-03-15 14:30:15,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:30:15,911 INFO L470 AbstractCegarLoop]: Abstraction has 2567 states and 8506 transitions. [2022-03-15 14:30:15,911 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:30:15,911 INFO L276 IsEmpty]: Start isEmpty. Operand 2567 states and 8506 transitions. [2022-03-15 14:30:15,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-03-15 14:30:15,918 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:30:15,918 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:30:15,918 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 14:30:15,918 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:30:15,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:30:15,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1635672389, now seen corresponding path program 2 times [2022-03-15 14:30:15,919 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:30:15,919 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833036510] [2022-03-15 14:30:15,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:30:15,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:30:15,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:30:16,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:30:16,013 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:30:16,013 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833036510] [2022-03-15 14:30:16,013 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833036510] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 14:30:16,013 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 14:30:16,013 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 14:30:16,013 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185543440] [2022-03-15 14:30:16,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 14:30:16,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 14:30:16,014 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:30:16,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 14:30:16,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-15 14:30:16,015 INFO L87 Difference]: Start difference. First operand 2567 states and 8506 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:30:16,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:30:16,084 INFO L93 Difference]: Finished difference Result 3707 states and 12439 transitions. [2022-03-15 14:30:16,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 14:30:16,087 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2022-03-15 14:30:16,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:30:16,108 INFO L225 Difference]: With dead ends: 3707 [2022-03-15 14:30:16,108 INFO L226 Difference]: Without dead ends: 3707 [2022-03-15 14:30:16,111 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-15 14:30:16,113 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 85 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 14:30:16,114 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 292 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 14:30:16,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3707 states. [2022-03-15 14:30:16,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3707 to 2552. [2022-03-15 14:30:16,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2552 states, 2551 states have (on average 3.3171305370442963) internal successors, (8462), 2551 states have internal predecessors, (8462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:30:16,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2552 states to 2552 states and 8462 transitions. [2022-03-15 14:30:16,194 INFO L78 Accepts]: Start accepts. Automaton has 2552 states and 8462 transitions. Word has length 96 [2022-03-15 14:30:16,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:30:16,196 INFO L470 AbstractCegarLoop]: Abstraction has 2552 states and 8462 transitions. [2022-03-15 14:30:16,196 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:30:16,196 INFO L276 IsEmpty]: Start isEmpty. Operand 2552 states and 8462 transitions. [2022-03-15 14:30:16,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-03-15 14:30:16,212 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:30:16,213 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:30:16,213 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 14:30:16,213 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:30:16,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:30:16,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1043909749, now seen corresponding path program 3 times [2022-03-15 14:30:16,214 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:30:16,214 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683844696] [2022-03-15 14:30:16,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:30:16,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:30:16,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:30:16,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:30:16,362 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:30:16,362 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683844696] [2022-03-15 14:30:16,362 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683844696] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 14:30:16,362 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 14:30:16,362 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 14:30:16,363 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052858828] [2022-03-15 14:30:16,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 14:30:16,363 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 14:30:16,363 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:30:16,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 14:30:16,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-15 14:30:16,364 INFO L87 Difference]: Start difference. First operand 2552 states and 8462 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:30:16,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:30:16,483 INFO L93 Difference]: Finished difference Result 6261 states and 21083 transitions. [2022-03-15 14:30:16,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 14:30:16,484 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2022-03-15 14:30:16,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:30:16,501 INFO L225 Difference]: With dead ends: 6261 [2022-03-15 14:30:16,501 INFO L226 Difference]: Without dead ends: 3651 [2022-03-15 14:30:16,502 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-03-15 14:30:16,508 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 237 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 14:30:16,509 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [237 Valid, 354 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 14:30:16,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3651 states. [2022-03-15 14:30:16,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3651 to 2628. [2022-03-15 14:30:16,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2628 states, 2627 states have (on average 3.2401979444232967) internal successors, (8512), 2627 states have internal predecessors, (8512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:30:16,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2628 states to 2628 states and 8512 transitions. [2022-03-15 14:30:16,593 INFO L78 Accepts]: Start accepts. Automaton has 2628 states and 8512 transitions. Word has length 96 [2022-03-15 14:30:16,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:30:16,595 INFO L470 AbstractCegarLoop]: Abstraction has 2628 states and 8512 transitions. [2022-03-15 14:30:16,595 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:30:16,595 INFO L276 IsEmpty]: Start isEmpty. Operand 2628 states and 8512 transitions. [2022-03-15 14:30:16,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-15 14:30:16,601 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:30:16,601 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:30:16,601 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-15 14:30:16,602 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:30:16,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:30:16,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1775513332, now seen corresponding path program 1 times [2022-03-15 14:30:16,605 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:30:16,605 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398935282] [2022-03-15 14:30:16,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:30:16,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:30:16,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:30:16,757 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:30:16,758 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:30:16,758 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398935282] [2022-03-15 14:30:16,758 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398935282] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 14:30:16,758 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 14:30:16,758 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 14:30:16,758 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077427540] [2022-03-15 14:30:16,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 14:30:16,759 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 14:30:16,759 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:30:16,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 14:30:16,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 14:30:16,759 INFO L87 Difference]: Start difference. First operand 2628 states and 8512 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:30:16,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:30:16,793 INFO L93 Difference]: Finished difference Result 2664 states and 8430 transitions. [2022-03-15 14:30:16,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 14:30:16,794 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-15 14:30:16,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:30:16,817 INFO L225 Difference]: With dead ends: 2664 [2022-03-15 14:30:16,817 INFO L226 Difference]: Without dead ends: 2664 [2022-03-15 14:30:16,817 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 14:30:16,818 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 27 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 14:30:16,818 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 156 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 14:30:16,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2664 states. [2022-03-15 14:30:16,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2664 to 2664. [2022-03-15 14:30:16,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2664 states, 2663 states have (on average 3.1656027037176115) internal successors, (8430), 2663 states have internal predecessors, (8430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:30:16,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2664 states to 2664 states and 8430 transitions. [2022-03-15 14:30:16,875 INFO L78 Accepts]: Start accepts. Automaton has 2664 states and 8430 transitions. Word has length 99 [2022-03-15 14:30:16,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:30:16,875 INFO L470 AbstractCegarLoop]: Abstraction has 2664 states and 8430 transitions. [2022-03-15 14:30:16,875 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:30:16,875 INFO L276 IsEmpty]: Start isEmpty. Operand 2664 states and 8430 transitions. [2022-03-15 14:30:16,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-03-15 14:30:16,881 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:30:16,881 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:30:16,881 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-15 14:30:16,881 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:30:16,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:30:16,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1192942030, now seen corresponding path program 1 times [2022-03-15 14:30:16,882 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:30:16,882 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936084219] [2022-03-15 14:30:16,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:30:16,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:30:16,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:30:16,982 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:30:16,982 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:30:16,983 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936084219] [2022-03-15 14:30:16,983 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936084219] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 14:30:16,983 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 14:30:16,983 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-15 14:30:16,983 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327337696] [2022-03-15 14:30:16,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 14:30:16,984 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 14:30:16,985 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:30:16,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 14:30:16,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-03-15 14:30:16,988 INFO L87 Difference]: Start difference. First operand 2664 states and 8430 transitions. Second operand has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:30:17,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:30:17,060 INFO L93 Difference]: Finished difference Result 3417 states and 10384 transitions. [2022-03-15 14:30:17,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 14:30:17,061 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2022-03-15 14:30:17,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:30:17,069 INFO L225 Difference]: With dead ends: 3417 [2022-03-15 14:30:17,069 INFO L226 Difference]: Without dead ends: 2670 [2022-03-15 14:30:17,070 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-03-15 14:30:17,071 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 311 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 14:30:17,071 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [311 Valid, 313 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 14:30:17,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2670 states. [2022-03-15 14:30:17,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2670 to 2665. [2022-03-15 14:30:17,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2665 states, 2664 states have (on average 3.16478978978979) internal successors, (8431), 2664 states have internal predecessors, (8431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:30:17,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2665 states to 2665 states and 8431 transitions. [2022-03-15 14:30:17,125 INFO L78 Accepts]: Start accepts. Automaton has 2665 states and 8431 transitions. Word has length 110 [2022-03-15 14:30:17,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:30:17,125 INFO L470 AbstractCegarLoop]: Abstraction has 2665 states and 8431 transitions. [2022-03-15 14:30:17,125 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:30:17,125 INFO L276 IsEmpty]: Start isEmpty. Operand 2665 states and 8431 transitions. [2022-03-15 14:30:17,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-03-15 14:30:17,131 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:30:17,131 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:30:17,131 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-15 14:30:17,132 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:30:17,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:30:17,132 INFO L85 PathProgramCache]: Analyzing trace with hash 623162093, now seen corresponding path program 1 times [2022-03-15 14:30:17,132 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:30:17,132 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990057150] [2022-03-15 14:30:17,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:30:17,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:30:17,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:30:17,403 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:30:17,404 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:30:17,404 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990057150] [2022-03-15 14:30:17,404 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990057150] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:30:17,404 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102770508] [2022-03-15 14:30:17,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:30:17,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:30:17,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:30:17,406 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 14:30:17,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-15 14:30:17,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:30:17,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 60 conjunts are in the unsatisfiable core [2022-03-15 14:30:17,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:30:17,611 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 14:30:17,651 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-03-15 14:30:17,652 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-03-15 14:30:17,697 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-03-15 14:30:17,697 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 16 treesize of output 22 [2022-03-15 14:30:18,195 INFO L353 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-03-15 14:30:18,195 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 20 treesize of output 30 [2022-03-15 14:30:18,355 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-15 14:30:18,692 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 14:30:18,808 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 14:30:19,045 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-03-15 14:30:19,115 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-03-15 14:30:19,170 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:30:19,171 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:30:19,341 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (and (forall ((v_ArrVal_124 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_124) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (forall ((v_ArrVal_124 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_124) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))))))) (< c_~front~0 0)) is different from false [2022-03-15 14:30:20,746 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:30:20,746 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 100 treesize of output 76 [2022-03-15 14:30:20,758 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:30:20,759 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1496 treesize of output 1432 [2022-03-15 14:30:20,778 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:30:20,778 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 1416 treesize of output 1372 [2022-03-15 14:30:20,789 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1229 treesize of output 1133 [2022-03-15 14:30:20,805 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:30:20,805 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 1260 treesize of output 1156 [2022-03-15 14:30:20,818 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1037 treesize of output 941 [2022-03-15 14:30:27,989 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:30:27,989 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102770508] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:30:27,989 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:30:27,989 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 26, 27] total 61 [2022-03-15 14:30:27,990 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631658772] [2022-03-15 14:30:27,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:30:27,990 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-03-15 14:30:27,990 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:30:27,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-03-15 14:30:27,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=413, Invalid=3099, Unknown=32, NotChecked=116, Total=3660 [2022-03-15 14:30:27,991 INFO L87 Difference]: Start difference. First operand 2665 states and 8431 transitions. Second operand has 61 states, 61 states have (on average 4.721311475409836) internal successors, (288), 61 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:30:32,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:30:32,545 INFO L93 Difference]: Finished difference Result 17744 states and 59027 transitions. [2022-03-15 14:30:32,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-03-15 14:30:32,546 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 4.721311475409836) internal successors, (288), 61 states have internal predecessors, (288), 0 states have call successors, (0), 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 117 [2022-03-15 14:30:32,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:30:32,569 INFO L225 Difference]: With dead ends: 17744 [2022-03-15 14:30:32,569 INFO L226 Difference]: Without dead ends: 9593 [2022-03-15 14:30:32,572 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 203 SyntacticMatches, 4 SemanticMatches, 104 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3473 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=1368, Invalid=9523, Unknown=33, NotChecked=206, Total=11130 [2022-03-15 14:30:32,572 INFO L933 BasicCegarLoop]: 124 mSDtfsCounter, 2718 mSDsluCounter, 3158 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2718 SdHoareTripleChecker+Valid, 2938 SdHoareTripleChecker+Invalid, 2694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1465 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 14:30:32,572 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2718 Valid, 2938 Invalid, 2694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 1040 Invalid, 0 Unknown, 1465 Unchecked, 0.6s Time] [2022-03-15 14:30:32,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9593 states. [2022-03-15 14:30:32,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9593 to 4109. [2022-03-15 14:30:32,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4109 states, 4108 states have (on average 3.057205452775073) internal successors, (12559), 4108 states have internal predecessors, (12559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:30:32,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4109 states to 4109 states and 12559 transitions. [2022-03-15 14:30:32,679 INFO L78 Accepts]: Start accepts. Automaton has 4109 states and 12559 transitions. Word has length 117 [2022-03-15 14:30:32,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:30:32,680 INFO L470 AbstractCegarLoop]: Abstraction has 4109 states and 12559 transitions. [2022-03-15 14:30:32,680 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 4.721311475409836) internal successors, (288), 61 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:30:32,680 INFO L276 IsEmpty]: Start isEmpty. Operand 4109 states and 12559 transitions. [2022-03-15 14:30:32,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-03-15 14:30:32,687 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:30:32,688 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:30:32,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-15 14:30:32,899 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:30:32,900 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:30:32,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:30:32,900 INFO L85 PathProgramCache]: Analyzing trace with hash 869306436, now seen corresponding path program 2 times [2022-03-15 14:30:32,900 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:30:32,900 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560783245] [2022-03-15 14:30:32,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:30:32,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:30:32,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:30:32,946 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 14:30:32,947 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:30:32,947 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560783245] [2022-03-15 14:30:32,947 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560783245] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 14:30:32,947 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 14:30:32,947 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 14:30:32,947 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227636663] [2022-03-15 14:30:32,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 14:30:32,947 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 14:30:32,947 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:30:32,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 14:30:32,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 14:30:32,948 INFO L87 Difference]: Start difference. First operand 4109 states and 12559 transitions. Second operand has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:30:33,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:30:33,007 INFO L93 Difference]: Finished difference Result 9989 states and 31073 transitions. [2022-03-15 14:30:33,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 14:30:33,007 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2022-03-15 14:30:33,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:30:33,032 INFO L225 Difference]: With dead ends: 9989 [2022-03-15 14:30:33,033 INFO L226 Difference]: Without dead ends: 9917 [2022-03-15 14:30:33,033 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 14:30:33,033 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 147 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 14:30:33,033 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 207 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 14:30:33,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9917 states. [2022-03-15 14:30:33,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9917 to 8399. [2022-03-15 14:30:33,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8399 states, 8398 states have (on average 3.1245534651107407) internal successors, (26240), 8398 states have internal predecessors, (26240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:30:33,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8399 states to 8399 states and 26240 transitions. [2022-03-15 14:30:33,214 INFO L78 Accepts]: Start accepts. Automaton has 8399 states and 26240 transitions. Word has length 120 [2022-03-15 14:30:33,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:30:33,214 INFO L470 AbstractCegarLoop]: Abstraction has 8399 states and 26240 transitions. [2022-03-15 14:30:33,214 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:30:33,214 INFO L276 IsEmpty]: Start isEmpty. Operand 8399 states and 26240 transitions. [2022-03-15 14:30:33,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-15 14:30:33,230 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:30:33,230 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:30:33,230 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-15 14:30:33,231 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:30:33,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:30:33,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1680628146, now seen corresponding path program 1 times [2022-03-15 14:30:33,231 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:30:33,231 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008091118] [2022-03-15 14:30:33,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:30:33,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:30:33,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:30:33,279 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-15 14:30:33,280 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:30:33,280 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008091118] [2022-03-15 14:30:33,280 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008091118] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 14:30:33,280 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 14:30:33,280 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 14:30:33,280 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777560517] [2022-03-15 14:30:33,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 14:30:33,280 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 14:30:33,280 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:30:33,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 14:30:33,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 14:30:33,281 INFO L87 Difference]: Start difference. First operand 8399 states and 26240 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:30:33,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:30:33,371 INFO L93 Difference]: Finished difference Result 8199 states and 25593 transitions. [2022-03-15 14:30:33,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 14:30:33,371 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 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 124 [2022-03-15 14:30:33,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:30:33,388 INFO L225 Difference]: With dead ends: 8199 [2022-03-15 14:30:33,388 INFO L226 Difference]: Without dead ends: 8199 [2022-03-15 14:30:33,388 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-03-15 14:30:33,390 INFO L933 BasicCegarLoop]: 118 mSDtfsCounter, 12 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 14:30:33,390 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 223 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 14:30:33,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8199 states. [2022-03-15 14:30:33,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8199 to 8149. [2022-03-15 14:30:33,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8149 states, 8148 states have (on average 3.125306823760432) internal successors, (25465), 8148 states have internal predecessors, (25465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:30:33,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8149 states to 8149 states and 25465 transitions. [2022-03-15 14:30:33,519 INFO L78 Accepts]: Start accepts. Automaton has 8149 states and 25465 transitions. Word has length 124 [2022-03-15 14:30:33,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:30:33,519 INFO L470 AbstractCegarLoop]: Abstraction has 8149 states and 25465 transitions. [2022-03-15 14:30:33,520 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:30:33,520 INFO L276 IsEmpty]: Start isEmpty. Operand 8149 states and 25465 transitions. [2022-03-15 14:30:33,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-03-15 14:30:33,533 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:30:33,533 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-03-15 14:30:33,533 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-15 14:30:33,533 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:30:33,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:30:33,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1813426250, now seen corresponding path program 3 times [2022-03-15 14:30:33,534 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:30:33,534 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370792274] [2022-03-15 14:30:33,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:30:33,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:30:33,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:30:33,601 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 14:30:33,601 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:30:33,601 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370792274] [2022-03-15 14:30:33,601 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370792274] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 14:30:33,601 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 14:30:33,601 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 14:30:33,601 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408609322] [2022-03-15 14:30:33,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 14:30:33,602 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 14:30:33,602 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:30:33,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 14:30:33,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-15 14:30:33,602 INFO L87 Difference]: Start difference. First operand 8149 states and 25465 transitions. Second operand has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:30:33,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:30:33,673 INFO L93 Difference]: Finished difference Result 13321 states and 41453 transitions. [2022-03-15 14:30:33,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 14:30:33,674 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 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 131 [2022-03-15 14:30:33,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:30:33,706 INFO L225 Difference]: With dead ends: 13321 [2022-03-15 14:30:33,707 INFO L226 Difference]: Without dead ends: 13321 [2022-03-15 14:30:33,707 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-15 14:30:33,707 INFO L933 BasicCegarLoop]: 151 mSDtfsCounter, 73 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 14:30:33,708 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 382 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 14:30:33,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13321 states. [2022-03-15 14:30:33,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13321 to 12814. [2022-03-15 14:30:34,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12814 states, 12813 states have (on average 3.1134784984000623) internal successors, (39893), 12813 states have internal predecessors, (39893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:30:34,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12814 states to 12814 states and 39893 transitions. [2022-03-15 14:30:34,131 INFO L78 Accepts]: Start accepts. Automaton has 12814 states and 39893 transitions. Word has length 131 [2022-03-15 14:30:34,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:30:34,132 INFO L470 AbstractCegarLoop]: Abstraction has 12814 states and 39893 transitions. [2022-03-15 14:30:34,132 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:30:34,132 INFO L276 IsEmpty]: Start isEmpty. Operand 12814 states and 39893 transitions. [2022-03-15 14:30:34,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-03-15 14:30:34,154 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:30:34,154 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-03-15 14:30:34,154 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-15 14:30:34,154 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:30:34,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:30:34,155 INFO L85 PathProgramCache]: Analyzing trace with hash 154122346, now seen corresponding path program 1 times [2022-03-15 14:30:34,155 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:30:34,155 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443844374] [2022-03-15 14:30:34,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:30:34,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:30:34,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:30:34,560 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 14:30:34,561 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:30:34,561 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443844374] [2022-03-15 14:30:34,561 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443844374] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:30:34,561 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621602538] [2022-03-15 14:30:34,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:30:34,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:30:34,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:30:34,563 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 14:30:34,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-15 14:30:34,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:30:34,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 21 conjunts are in the unsatisfiable core [2022-03-15 14:30:34,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:30:35,172 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:30:35,172 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:30:35,734 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-15 14:30:35,734 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621602538] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:30:35,734 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:30:35,734 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 9] total 31 [2022-03-15 14:30:35,735 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479556186] [2022-03-15 14:30:35,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:30:35,735 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-03-15 14:30:35,735 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:30:35,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-03-15 14:30:35,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=761, Unknown=0, NotChecked=0, Total=930 [2022-03-15 14:30:35,736 INFO L87 Difference]: Start difference. First operand 12814 states and 39893 transitions. Second operand has 31 states, 31 states have (on average 9.290322580645162) internal successors, (288), 31 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:30:36,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:30:36,401 INFO L93 Difference]: Finished difference Result 14512 states and 46254 transitions. [2022-03-15 14:30:36,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-15 14:30:36,402 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 9.290322580645162) internal successors, (288), 31 states have internal predecessors, (288), 0 states have call successors, (0), 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 131 [2022-03-15 14:30:36,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:30:36,436 INFO L225 Difference]: With dead ends: 14512 [2022-03-15 14:30:36,436 INFO L226 Difference]: Without dead ends: 13555 [2022-03-15 14:30:36,437 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=549, Invalid=1803, Unknown=0, NotChecked=0, Total=2352 [2022-03-15 14:30:36,437 INFO L933 BasicCegarLoop]: 196 mSDtfsCounter, 1174 mSDsluCounter, 1642 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1174 SdHoareTripleChecker+Valid, 1719 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 14:30:36,438 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1174 Valid, 1719 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 14:30:36,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13555 states. [2022-03-15 14:30:36,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13555 to 9707. [2022-03-15 14:30:36,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9707 states, 9706 states have (on average 3.217494333402019) internal successors, (31229), 9706 states have internal predecessors, (31229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:30:36,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9707 states to 9707 states and 31229 transitions. [2022-03-15 14:30:36,753 INFO L78 Accepts]: Start accepts. Automaton has 9707 states and 31229 transitions. Word has length 131 [2022-03-15 14:30:36,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:30:36,753 INFO L470 AbstractCegarLoop]: Abstraction has 9707 states and 31229 transitions. [2022-03-15 14:30:36,753 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 9.290322580645162) internal successors, (288), 31 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:30:36,753 INFO L276 IsEmpty]: Start isEmpty. Operand 9707 states and 31229 transitions. [2022-03-15 14:30:36,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-03-15 14:30:36,773 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:30:36,774 INFO L514 BasicCegarLoop]: trace histogram [2, 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] [2022-03-15 14:30:36,791 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-03-15 14:30:36,990 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,SelfDestructingSolverStorable10 [2022-03-15 14:30:36,991 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:30:36,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:30:36,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1700635271, now seen corresponding path program 2 times [2022-03-15 14:30:36,992 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:30:36,992 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392935727] [2022-03-15 14:30:36,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:30:36,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:30:37,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:30:37,405 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-15 14:30:37,405 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:30:37,405 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392935727] [2022-03-15 14:30:37,405 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392935727] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:30:37,405 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919121459] [2022-03-15 14:30:37,406 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 14:30:37,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:30:37,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:30:37,420 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 14:30:37,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-15 14:30:37,512 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 14:30:37,512 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:30:37,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 63 conjunts are in the unsatisfiable core [2022-03-15 14:30:37,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:30:38,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 14:30:38,734 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 32 treesize of output 32 [2022-03-15 14:30:38,924 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 14:30:38,924 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 14 [2022-03-15 14:30:39,007 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:30:39,007 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:30:39,516 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 14:30:39,516 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 133 treesize of output 134 [2022-03-15 14:30:39,522 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 14:30:39,523 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 71 treesize of output 58 [2022-03-15 14:30:39,528 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 14:30:39,529 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 58 treesize of output 45 [2022-03-15 14:30:41,412 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:30:41,412 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919121459] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:30:41,413 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:30:41,413 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 26, 25] total 59 [2022-03-15 14:30:41,413 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823253565] [2022-03-15 14:30:41,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:30:41,413 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-03-15 14:30:41,413 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:30:41,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-03-15 14:30:41,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=352, Invalid=3069, Unknown=1, NotChecked=0, Total=3422 [2022-03-15 14:30:41,415 INFO L87 Difference]: Start difference. First operand 9707 states and 31229 transitions. Second operand has 59 states, 59 states have (on average 5.813559322033898) internal successors, (343), 59 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:30:54,535 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (or (and (forall ((v_ArrVal_243 (Array Int Int))) (<= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_243) c_~queue~0.base)) (.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select .cse0 (+ c_~queue~0.offset .cse1 4)) (select .cse0 (+ c_~queue~0.offset .cse1)))) 1)) (forall ((v_ArrVal_243 (Array Int Int))) (<= 0 (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_243) c_~queue~0.base)) (.cse3 (* c_~front~0 4))) (+ c_~sum~0 (select .cse2 (+ c_~queue~0.offset .cse3 4)) (select .cse2 (+ c_~queue~0.offset .cse3))))))) (< c_~front~0 0) (<= c_~n~0 (+ c_~front~0 1))) (<= 1 c_~v_assert~0)) is different from false [2022-03-15 14:30:56,359 WARN L838 $PredicateComparison]: unable to prove that (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (or (and (forall ((v_ArrVal_243 (Array Int Int))) (<= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_243) c_~queue~0.base)) (.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select .cse0 (+ c_~queue~0.offset .cse1 4)) (select .cse0 (+ c_~queue~0.offset .cse1)))) 1)) (forall ((v_ArrVal_243 (Array Int Int))) (<= 0 (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_243) c_~queue~0.base)) (.cse3 (* c_~front~0 4))) (+ c_~sum~0 (select .cse2 (+ c_~queue~0.offset .cse3 4)) (select .cse2 (+ c_~queue~0.offset .cse3))))))) (< c_~front~0 0) (<= c_~n~0 (+ c_~front~0 1)))) is different from false [2022-03-15 14:30:57,182 WARN L838 $PredicateComparison]: unable to prove that (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (or (and (forall ((v_ArrVal_243 (Array Int Int))) (<= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_243) c_~queue~0.base)) (.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select .cse0 (+ c_~queue~0.offset .cse1 4)) (select .cse0 (+ c_~queue~0.offset .cse1)))) 1)) (forall ((v_ArrVal_243 (Array Int Int))) (<= 0 (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_243) c_~queue~0.base)) (.cse3 (* c_~front~0 4))) (+ c_~sum~0 (select .cse2 (+ c_~queue~0.offset .cse3 4)) (select .cse2 (+ c_~queue~0.offset .cse3))))))) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0) (<= c_~n~0 (+ c_~front~0 1)))) is different from false [2022-03-15 14:31:07,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:31:07,613 INFO L93 Difference]: Finished difference Result 155715 states and 520813 transitions. [2022-03-15 14:31:07,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 328 states. [2022-03-15 14:31:07,614 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 5.813559322033898) internal successors, (343), 59 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 138 [2022-03-15 14:31:07,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:31:08,272 INFO L225 Difference]: With dead ends: 155715 [2022-03-15 14:31:08,272 INFO L226 Difference]: Without dead ends: 124185 [2022-03-15 14:31:08,284 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 655 GetRequests, 252 SyntacticMatches, 34 SemanticMatches, 369 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 62580 ImplicationChecksByTransitivity, 22.5s TimeCoverageRelationStatistics Valid=13120, Invalid=121836, Unknown=112, NotChecked=2202, Total=137270 [2022-03-15 14:31:08,284 INFO L933 BasicCegarLoop]: 256 mSDtfsCounter, 7117 mSDsluCounter, 10681 mSDsCounter, 0 mSdLazyCounter, 5055 mSolverCounterSat, 963 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7117 SdHoareTripleChecker+Valid, 9720 SdHoareTripleChecker+Invalid, 8418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 963 IncrementalHoareTripleChecker+Valid, 5055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2400 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-03-15 14:31:08,284 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7117 Valid, 9720 Invalid, 8418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [963 Valid, 5055 Invalid, 0 Unknown, 2400 Unchecked, 2.9s Time] [2022-03-15 14:31:08,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124185 states. [2022-03-15 14:31:10,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124185 to 29896. [2022-03-15 14:31:10,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29896 states, 29895 states have (on average 3.205418966382338) internal successors, (95826), 29895 states have internal predecessors, (95826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:31:10,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29896 states to 29896 states and 95826 transitions. [2022-03-15 14:31:10,357 INFO L78 Accepts]: Start accepts. Automaton has 29896 states and 95826 transitions. Word has length 138 [2022-03-15 14:31:10,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:31:10,357 INFO L470 AbstractCegarLoop]: Abstraction has 29896 states and 95826 transitions. [2022-03-15 14:31:10,357 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 5.813559322033898) internal successors, (343), 59 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:31:10,357 INFO L276 IsEmpty]: Start isEmpty. Operand 29896 states and 95826 transitions. [2022-03-15 14:31:10,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-03-15 14:31:10,391 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:31:10,391 INFO L514 BasicCegarLoop]: trace histogram [2, 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] [2022-03-15 14:31:10,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-03-15 14:31:10,607 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:31:10,608 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:31:10,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:31:10,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1880030863, now seen corresponding path program 3 times [2022-03-15 14:31:10,608 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:31:10,608 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605545536] [2022-03-15 14:31:10,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:31:10,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:31:10,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:31:11,654 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:31:11,655 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:31:11,655 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605545536] [2022-03-15 14:31:11,655 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605545536] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:31:11,655 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064494926] [2022-03-15 14:31:11,655 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 14:31:11,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:31:11,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:31:11,656 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 14:31:11,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-15 14:31:11,758 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 14:31:11,758 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:31:11,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 65 conjunts are in the unsatisfiable core [2022-03-15 14:31:11,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:31:13,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 14:31:13,605 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 44 treesize of output 42 [2022-03-15 14:31:13,691 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 14:31:13,691 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 16 [2022-03-15 14:31:13,791 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:31:13,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:31:13,959 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_280 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (forall ((v_ArrVal_280 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))))))) is different from false [2022-03-15 14:31:13,983 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (and (forall ((v_ArrVal_280 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))) 1)) (forall ((v_ArrVal_280 (Array Int Int))) (<= 0 (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1))))))) (< c_~front~0 0)) is different from false [2022-03-15 14:31:14,012 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (and (forall ((v_ArrVal_280 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))) 1)) (forall ((v_ArrVal_280 (Array Int Int))) (<= 0 (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1))))))) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) is different from false [2022-03-15 14:31:14,058 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (and (forall ((v_ArrVal_280 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))) 1)) (forall ((v_ArrVal_280 (Array Int Int))) (<= 0 (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1))))))) (= |c_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) is different from false [2022-03-15 14:31:14,076 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (and (forall ((v_ArrVal_280 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))) 1)) (forall ((v_ArrVal_280 (Array Int Int))) (<= 0 (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1))))))) (= |c_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) is different from false [2022-03-15 14:31:14,112 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (<= c_~n~0 c_~back~0) (and (forall ((v_ArrVal_280 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))) 1)) (forall ((v_ArrVal_280 (Array Int Int))) (<= 0 (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1))))))) (< c_~back~0 0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) is different from false [2022-03-15 14:31:14,219 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 14:31:14,219 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 137 treesize of output 122 [2022-03-15 14:31:14,223 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 59 treesize of output 52 [2022-03-15 14:31:14,226 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 52 treesize of output 45 [2022-03-15 14:31:16,584 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2022-03-15 14:31:16,584 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064494926] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:31:16,584 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:31:16,584 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 29, 28] total 82 [2022-03-15 14:31:16,584 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122409326] [2022-03-15 14:31:16,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:31:16,585 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2022-03-15 14:31:16,585 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:31:16,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2022-03-15 14:31:16,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=473, Invalid=5245, Unknown=6, NotChecked=918, Total=6642 [2022-03-15 14:31:16,586 INFO L87 Difference]: Start difference. First operand 29896 states and 95826 transitions. Second operand has 82 states, 82 states have (on average 4.390243902439025) internal successors, (360), 82 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:31:23,647 WARN L838 $PredicateComparison]: unable to prove that (and (or (<= c_~n~0 c_~front~0) (<= c_~n~0 c_~back~0) (and (forall ((v_ArrVal_280 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))) 1)) (forall ((v_ArrVal_280 (Array Int Int))) (<= 0 (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1))))))) (< c_~back~0 0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) is different from false [2022-03-15 14:31:23,889 WARN L838 $PredicateComparison]: unable to prove that (and (or (<= c_~n~0 c_~front~0) (<= c_~n~0 c_~back~0) (and (forall ((v_ArrVal_280 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))) 1)) (forall ((v_ArrVal_280 (Array Int Int))) (<= 0 (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1))))))) (< c_~back~0 0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= |c_thread1Thread1of1ForFork1_~cond~0#1| 1)) is different from false [2022-03-15 14:31:28,926 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_280 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (forall ((v_ArrVal_280 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (or (< (+ c_~back~0 1) 0) (and (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 c_~sum~0) (<= c_~sum~0 1) (= (* c_~front~0 4) (* c_~back~0 4))) (<= 2 c_~front~0) (<= 1 c_~back~0) (< c_~front~0 0))) is different from false [2022-03-15 14:31:29,557 WARN L838 $PredicateComparison]: unable to prove that (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (forall ((v_ArrVal_280 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (forall ((v_ArrVal_280 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))))))) is different from false [2022-03-15 14:31:32,866 WARN L838 $PredicateComparison]: unable to prove that (and (or (<= c_~n~0 c_~front~0) (<= c_~n~0 c_~back~0) (and (forall ((v_ArrVal_280 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))) 1)) (forall ((v_ArrVal_280 (Array Int Int))) (<= 0 (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1))))))) (< c_~back~0 0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 1 c_~v_assert~0)) is different from false [2022-03-15 14:31:34,029 WARN L838 $PredicateComparison]: unable to prove that (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (or (<= c_~n~0 c_~front~0) (and (forall ((v_ArrVal_280 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))) 1)) (forall ((v_ArrVal_280 (Array Int Int))) (<= 0 (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1))))))) (< c_~front~0 0)) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2022-03-15 14:31:34,238 WARN L838 $PredicateComparison]: unable to prove that (and (or (<= c_~n~0 c_~front~0) (<= c_~n~0 c_~back~0) (and (forall ((v_ArrVal_280 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))) 1)) (forall ((v_ArrVal_280 (Array Int Int))) (<= 0 (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1))))))) (< c_~back~0 0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= |c_thread1Thread1of1ForFork1_~cond~0#1| 1)) is different from false [2022-03-15 14:31:34,539 WARN L838 $PredicateComparison]: unable to prove that (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (or (<= c_~n~0 c_~front~0) (<= c_~n~0 c_~back~0) (and (forall ((v_ArrVal_280 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))) 1)) (forall ((v_ArrVal_280 (Array Int Int))) (<= 0 (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1))))))) (< c_~back~0 0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) is different from false [2022-03-15 14:31:34,609 WARN L838 $PredicateComparison]: unable to prove that (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (or (<= c_~n~0 c_~front~0) (<= c_~n~0 c_~back~0) (and (forall ((v_ArrVal_280 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))) 1)) (forall ((v_ArrVal_280 (Array Int Int))) (<= 0 (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1))))))) (< c_~back~0 0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0))) is different from false [2022-03-15 14:31:39,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:31:39,235 INFO L93 Difference]: Finished difference Result 155239 states and 501360 transitions. [2022-03-15 14:31:39,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 232 states. [2022-03-15 14:31:39,236 INFO L78 Accepts]: Start accepts. Automaton has has 82 states, 82 states have (on average 4.390243902439025) internal successors, (360), 82 states have internal predecessors, (360), 0 states have call successors, (0), 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 138 [2022-03-15 14:31:39,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:31:39,940 INFO L225 Difference]: With dead ends: 155239 [2022-03-15 14:31:39,941 INFO L226 Difference]: Without dead ends: 132526 [2022-03-15 14:31:39,958 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 538 GetRequests, 227 SyntacticMatches, 18 SemanticMatches, 293 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 33111 ImplicationChecksByTransitivity, 19.7s TimeCoverageRelationStatistics Valid=10126, Invalid=68019, Unknown=35, NotChecked=8550, Total=86730 [2022-03-15 14:31:39,958 INFO L933 BasicCegarLoop]: 377 mSDtfsCounter, 7175 mSDsluCounter, 13062 mSDsCounter, 0 mSdLazyCounter, 6827 mSolverCounterSat, 837 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7175 SdHoareTripleChecker+Valid, 11979 SdHoareTripleChecker+Invalid, 14408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 837 IncrementalHoareTripleChecker+Valid, 6827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6744 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-03-15 14:31:39,958 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7175 Valid, 11979 Invalid, 14408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [837 Valid, 6827 Invalid, 0 Unknown, 6744 Unchecked, 3.4s Time] [2022-03-15 14:31:40,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132526 states. [2022-03-15 14:31:41,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132526 to 40085. [2022-03-15 14:31:41,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40085 states, 40084 states have (on average 3.142825067358547) internal successors, (125977), 40084 states have internal predecessors, (125977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:31:42,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40085 states to 40085 states and 125977 transitions. [2022-03-15 14:31:42,079 INFO L78 Accepts]: Start accepts. Automaton has 40085 states and 125977 transitions. Word has length 138 [2022-03-15 14:31:42,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:31:42,079 INFO L470 AbstractCegarLoop]: Abstraction has 40085 states and 125977 transitions. [2022-03-15 14:31:42,079 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 82 states, 82 states have (on average 4.390243902439025) internal successors, (360), 82 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:31:42,080 INFO L276 IsEmpty]: Start isEmpty. Operand 40085 states and 125977 transitions. [2022-03-15 14:31:42,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-03-15 14:31:42,138 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:31:42,138 INFO L514 BasicCegarLoop]: trace histogram [2, 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] [2022-03-15 14:31:42,155 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-03-15 14:31:42,355 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:31:42,355 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:31:42,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:31:42,355 INFO L85 PathProgramCache]: Analyzing trace with hash 412402409, now seen corresponding path program 4 times [2022-03-15 14:31:42,355 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:31:42,356 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872083727] [2022-03-15 14:31:42,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:31:42,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:31:42,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:31:43,629 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:31:43,629 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:31:43,629 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872083727] [2022-03-15 14:31:43,629 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872083727] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:31:43,629 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723256627] [2022-03-15 14:31:43,629 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 14:31:43,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:31:43,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:31:43,631 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 14:31:43,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-15 14:31:43,730 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 14:31:43,730 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:31:43,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 72 conjunts are in the unsatisfiable core [2022-03-15 14:31:43,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:31:43,765 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 14:31:44,080 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-15 14:31:44,080 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-03-15 14:31:45,177 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-03-15 14:31:45,425 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 14:31:45,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 14:31:45,427 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:31:45,427 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 44 treesize of output 19 [2022-03-15 14:31:45,507 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:31:45,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:31:46,302 INFO L353 Elim1Store]: treesize reduction 59, result has 41.0 percent of original size [2022-03-15 14:31:46,302 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 154 treesize of output 144 [2022-03-15 14:31:46,316 INFO L353 Elim1Store]: treesize reduction 37, result has 27.5 percent of original size [2022-03-15 14:31:46,317 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 100 treesize of output 82 [2022-03-15 14:31:50,237 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-03-15 14:31:50,270 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:31:50,271 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723256627] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:31:50,271 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:31:50,271 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 28, 28] total 80 [2022-03-15 14:31:50,271 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476102237] [2022-03-15 14:31:50,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:31:50,271 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2022-03-15 14:31:50,271 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:31:50,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2022-03-15 14:31:50,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=719, Invalid=5600, Unknown=1, NotChecked=0, Total=6320 [2022-03-15 14:31:50,272 INFO L87 Difference]: Start difference. First operand 40085 states and 125977 transitions. Second operand has 80 states, 80 states have (on average 4.3625) internal successors, (349), 80 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:32:14,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:32:14,998 INFO L93 Difference]: Finished difference Result 146908 states and 476864 transitions. [2022-03-15 14:32:14,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 189 states. [2022-03-15 14:32:14,998 INFO L78 Accepts]: Start accepts. Automaton has has 80 states, 80 states have (on average 4.3625) internal successors, (349), 80 states have internal predecessors, (349), 0 states have call successors, (0), 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 138 [2022-03-15 14:32:14,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:32:15,537 INFO L225 Difference]: With dead ends: 146908 [2022-03-15 14:32:15,538 INFO L226 Difference]: Without dead ends: 131893 [2022-03-15 14:32:15,540 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 248 SyntacticMatches, 8 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 24666 ImplicationChecksByTransitivity, 22.4s TimeCoverageRelationStatistics Valid=7134, Invalid=57531, Unknown=105, NotChecked=0, Total=64770 [2022-03-15 14:32:15,540 INFO L933 BasicCegarLoop]: 435 mSDtfsCounter, 4578 mSDsluCounter, 18677 mSDsCounter, 0 mSdLazyCounter, 4798 mSolverCounterSat, 348 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4578 SdHoareTripleChecker+Valid, 16074 SdHoareTripleChecker+Invalid, 13737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 348 IncrementalHoareTripleChecker+Valid, 4798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8591 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-03-15 14:32:15,541 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4578 Valid, 16074 Invalid, 13737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [348 Valid, 4798 Invalid, 0 Unknown, 8591 Unchecked, 2.3s Time] [2022-03-15 14:32:15,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131893 states. [2022-03-15 14:32:17,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131893 to 54438. [2022-03-15 14:32:17,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54438 states, 54437 states have (on average 3.1506512114921836) internal successors, (171512), 54437 states have internal predecessors, (171512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:32:17,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54438 states to 54438 states and 171512 transitions. [2022-03-15 14:32:17,586 INFO L78 Accepts]: Start accepts. Automaton has 54438 states and 171512 transitions. Word has length 138 [2022-03-15 14:32:17,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:32:17,587 INFO L470 AbstractCegarLoop]: Abstraction has 54438 states and 171512 transitions. [2022-03-15 14:32:17,587 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 80 states have (on average 4.3625) internal successors, (349), 80 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:32:17,587 INFO L276 IsEmpty]: Start isEmpty. Operand 54438 states and 171512 transitions. [2022-03-15 14:32:17,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-03-15 14:32:17,652 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:32:17,652 INFO L514 BasicCegarLoop]: trace histogram [2, 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] [2022-03-15 14:32:17,670 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-03-15 14:32:17,864 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-03-15 14:32:17,864 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:32:17,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:32:17,865 INFO L85 PathProgramCache]: Analyzing trace with hash -547652913, now seen corresponding path program 5 times [2022-03-15 14:32:17,865 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:32:17,865 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372718961] [2022-03-15 14:32:17,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:32:17,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:32:17,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:32:19,622 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:32:19,622 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:32:19,622 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372718961] [2022-03-15 14:32:19,623 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372718961] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:32:19,623 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [118386194] [2022-03-15 14:32:19,625 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 14:32:19,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:32:19,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:32:19,627 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 14:32:19,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-15 14:32:19,738 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 14:32:19,738 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:32:19,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 46 conjunts are in the unsatisfiable core [2022-03-15 14:32:19,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:32:19,774 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 14:32:19,933 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-15 14:32:19,934 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-03-15 14:32:20,620 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 48 treesize of output 46 [2022-03-15 14:32:20,690 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 14:32:20,690 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 53 treesize of output 19 [2022-03-15 14:32:20,814 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-15 14:32:20,814 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:32:21,034 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_356 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_356) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (forall ((v_ArrVal_356 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_356) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))))))) is different from false [2022-03-15 14:32:21,266 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 14:32:21,267 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 137 treesize of output 122 [2022-03-15 14:32:21,270 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 59 treesize of output 52 [2022-03-15 14:32:21,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 52 treesize of output 45 [2022-03-15 14:32:22,592 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-03-15 14:32:22,631 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 3 not checked. [2022-03-15 14:32:22,632 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [118386194] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:32:22,632 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:32:22,632 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 18, 17] total 56 [2022-03-15 14:32:22,632 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464535829] [2022-03-15 14:32:22,632 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:32:22,632 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-03-15 14:32:22,632 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:32:22,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-03-15 14:32:22,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=2789, Unknown=2, NotChecked=106, Total=3080 [2022-03-15 14:32:22,633 INFO L87 Difference]: Start difference. First operand 54438 states and 171512 transitions. Second operand has 56 states, 56 states have (on average 6.089285714285714) internal successors, (341), 56 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:32:30,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:32:30,173 INFO L93 Difference]: Finished difference Result 82020 states and 255988 transitions. [2022-03-15 14:32:30,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2022-03-15 14:32:30,173 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 6.089285714285714) internal successors, (341), 56 states have internal predecessors, (341), 0 states have call successors, (0), 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 138 [2022-03-15 14:32:30,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:32:30,574 INFO L225 Difference]: With dead ends: 82020 [2022-03-15 14:32:30,574 INFO L226 Difference]: Without dead ends: 64042 [2022-03-15 14:32:30,575 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 259 SyntacticMatches, 5 SemanticMatches, 130 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4241 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=2232, Invalid=14787, Unknown=15, NotChecked=258, Total=17292 [2022-03-15 14:32:30,575 INFO L933 BasicCegarLoop]: 288 mSDtfsCounter, 3092 mSDsluCounter, 8774 mSDsCounter, 0 mSdLazyCounter, 4175 mSolverCounterSat, 275 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3092 SdHoareTripleChecker+Valid, 8204 SdHoareTripleChecker+Invalid, 5443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 275 IncrementalHoareTripleChecker+Valid, 4175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 993 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-15 14:32:30,575 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3092 Valid, 8204 Invalid, 5443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [275 Valid, 4175 Invalid, 0 Unknown, 993 Unchecked, 1.7s Time] [2022-03-15 14:32:30,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64042 states. [2022-03-15 14:32:31,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64042 to 45306. [2022-03-15 14:32:31,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45306 states, 45305 states have (on average 3.134267740867454) internal successors, (141998), 45305 states have internal predecessors, (141998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:32:31,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45306 states to 45306 states and 141998 transitions. [2022-03-15 14:32:31,984 INFO L78 Accepts]: Start accepts. Automaton has 45306 states and 141998 transitions. Word has length 138 [2022-03-15 14:32:31,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:32:31,984 INFO L470 AbstractCegarLoop]: Abstraction has 45306 states and 141998 transitions. [2022-03-15 14:32:31,984 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 6.089285714285714) internal successors, (341), 56 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:32:31,984 INFO L276 IsEmpty]: Start isEmpty. Operand 45306 states and 141998 transitions. [2022-03-15 14:32:32,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-03-15 14:32:32,035 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:32:32,035 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2022-03-15 14:32:32,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-03-15 14:32:32,248 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-03-15 14:32:32,249 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:32:32,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:32:32,249 INFO L85 PathProgramCache]: Analyzing trace with hash 721946978, now seen corresponding path program 6 times [2022-03-15 14:32:32,249 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:32:32,250 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573534712] [2022-03-15 14:32:32,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:32:32,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:32:32,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:32:32,306 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-15 14:32:32,307 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:32:32,307 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573534712] [2022-03-15 14:32:32,307 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573534712] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:32:32,307 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847007880] [2022-03-15 14:32:32,307 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 14:32:32,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:32:32,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:32:32,324 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 14:32:32,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-15 14:32:32,561 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-03-15 14:32:32,562 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:32:32,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 14:32:32,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:32:32,767 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 14:32:32,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:32:33,265 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-15 14:32:33,265 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [847007880] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:32:33,265 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:32:33,265 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 7] total 11 [2022-03-15 14:32:33,265 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827591183] [2022-03-15 14:32:33,265 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:32:33,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 14:32:33,266 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:32:33,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 14:32:33,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-03-15 14:32:33,266 INFO L87 Difference]: Start difference. First operand 45306 states and 141998 transitions. Second operand has 11 states, 11 states have (on average 20.818181818181817) internal successors, (229), 11 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:32:33,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:32:33,774 INFO L93 Difference]: Finished difference Result 74151 states and 232675 transitions. [2022-03-15 14:32:33,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 14:32:33,775 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 20.818181818181817) internal successors, (229), 11 states have internal predecessors, (229), 0 states have call successors, (0), 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-03-15 14:32:33,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:32:33,969 INFO L225 Difference]: With dead ends: 74151 [2022-03-15 14:32:33,970 INFO L226 Difference]: Without dead ends: 73359 [2022-03-15 14:32:33,970 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2022-03-15 14:32:33,970 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 534 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 14:32:33,970 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [534 Valid, 408 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 14:32:34,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73359 states. [2022-03-15 14:32:35,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73359 to 61265. [2022-03-15 14:32:35,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61265 states, 61264 states have (on average 3.135593496996605) internal successors, (192099), 61264 states have internal predecessors, (192099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:32:35,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61265 states to 61265 states and 192099 transitions. [2022-03-15 14:32:35,608 INFO L78 Accepts]: Start accepts. Automaton has 61265 states and 192099 transitions. Word has length 141 [2022-03-15 14:32:35,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:32:35,609 INFO L470 AbstractCegarLoop]: Abstraction has 61265 states and 192099 transitions. [2022-03-15 14:32:35,609 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 20.818181818181817) internal successors, (229), 11 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:32:35,609 INFO L276 IsEmpty]: Start isEmpty. Operand 61265 states and 192099 transitions. [2022-03-15 14:32:35,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-03-15 14:32:35,875 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:32:35,875 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2022-03-15 14:32:35,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-03-15 14:32:36,099 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:32:36,099 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:32:36,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:32:36,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1877924540, now seen corresponding path program 7 times [2022-03-15 14:32:36,100 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:32:36,100 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091259690] [2022-03-15 14:32:36,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:32:36,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:32:36,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:32:36,420 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-03-15 14:32:36,421 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:32:36,421 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091259690] [2022-03-15 14:32:36,421 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091259690] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:32:36,421 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070158767] [2022-03-15 14:32:36,421 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 14:32:36,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:32:36,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:32:36,423 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-03-15 14:32:36,459 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-03-15 14:32:36,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:32:36,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 78 conjunts are in the unsatisfiable core [2022-03-15 14:32:36,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:32:37,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 14:32:37,795 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2022-03-15 14:32:37,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 14:32:37,955 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:32:37,955 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 42 treesize of output 14 [2022-03-15 14:32:38,044 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:32:38,044 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:32:38,259 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_433 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_433) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (forall ((v_ArrVal_433 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_433) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1))) (<= c_~n~0 c_~front~0) (<= c_~back~0 c_~front~0) (< c_~front~0 0)) is different from false [2022-03-15 14:32:38,545 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 14:32:38,545 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 137 treesize of output 122 [2022-03-15 14:32:38,549 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 59 treesize of output 52 [2022-03-15 14:32:38,551 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 52 treesize of output 45 [2022-03-15 14:32:40,623 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:32:40,623 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2070158767] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:32:40,623 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:32:40,623 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 28, 27] total 65 [2022-03-15 14:32:40,624 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934249127] [2022-03-15 14:32:40,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:32:40,625 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-03-15 14:32:40,625 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:32:40,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-03-15 14:32:40,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=408, Invalid=3627, Unknown=1, NotChecked=124, Total=4160 [2022-03-15 14:32:40,627 INFO L87 Difference]: Start difference. First operand 61265 states and 192099 transitions. Second operand has 65 states, 65 states have (on average 5.661538461538462) internal successors, (368), 65 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-03-15 14:32:47,322 WARN L838 $PredicateComparison]: unable to prove that (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (or (and (forall ((v_ArrVal_433 (Array Int Int))) (<= 0 (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~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_433) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))))) (forall ((v_ArrVal_433 (Array Int Int))) (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_433) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) 1))) (< c_~front~0 0) (<= c_~n~0 (+ c_~front~0 1)))) is different from false [2022-03-15 14:32:48,027 WARN L838 $PredicateComparison]: unable to prove that (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (or (and (forall ((v_ArrVal_433 (Array Int Int))) (<= 0 (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~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_433) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))))) (forall ((v_ArrVal_433 (Array Int Int))) (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_433) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) 1))) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0) (<= c_~n~0 (+ c_~front~0 1)))) is different from false [2022-03-15 14:32:48,262 WARN L838 $PredicateComparison]: unable to prove that (and (or (and (forall ((v_ArrVal_433 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_433) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (forall ((v_ArrVal_433 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_433) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1))) (<= c_~n~0 c_~front~0) (<= c_~back~0 c_~front~0) (< c_~front~0 0)) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (not (< |c_ULTIMATE.start_main_~#t3~0#1.base| |c_#StackHeapBarrier|)) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2022-03-15 14:32:51,379 WARN L838 $PredicateComparison]: unable to prove that (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (or (and (forall ((v_ArrVal_433 (Array Int Int))) (<= 0 (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~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_433) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))))) (forall ((v_ArrVal_433 (Array Int Int))) (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_433) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) 1))) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0) (<= c_~n~0 (+ c_~front~0 1))) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) is different from false [2022-03-15 14:32:51,473 WARN L838 $PredicateComparison]: unable to prove that (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (or (and (forall ((v_ArrVal_433 (Array Int Int))) (<= 0 (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~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_433) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))))) (forall ((v_ArrVal_433 (Array Int Int))) (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_433) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) 1))) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0) (<= c_~n~0 (+ c_~front~0 1))) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2022-03-15 14:32:51,528 WARN L838 $PredicateComparison]: unable to prove that (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (or (and (forall ((v_ArrVal_433 (Array Int Int))) (<= 0 (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~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_433) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))))) (forall ((v_ArrVal_433 (Array Int Int))) (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_433) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) 1))) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0) (<= c_~n~0 (+ c_~front~0 1))) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2022-03-15 14:32:51,749 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (or (and (forall ((v_ArrVal_433 (Array Int Int))) (<= 0 (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~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_433) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))))) (forall ((v_ArrVal_433 (Array Int Int))) (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_433) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) 1))) (< c_~front~0 0) (<= c_~n~0 (+ c_~front~0 1))) (<= 1 c_~v_assert~0)) is different from false [2022-03-15 14:32:52,673 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (or (and (forall ((v_ArrVal_433 (Array Int Int))) (<= 0 (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~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_433) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))))) (forall ((v_ArrVal_433 (Array Int Int))) (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_433) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) 1))) (< c_~front~0 0) (<= c_~n~0 (+ c_~front~0 1))) (<= |c_thread1Thread1of1ForFork1_~cond~0#1| 1)) is different from false [2022-03-15 14:32:53,226 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (or (and (forall ((v_ArrVal_433 (Array Int Int))) (<= 0 (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~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_433) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))))) (forall ((v_ArrVal_433 (Array Int Int))) (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_433) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) 1))) (< c_~front~0 0) (<= c_~n~0 (+ c_~front~0 1))) (<= |c_thread1Thread1of1ForFork1_~cond~0#1| 1) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2022-03-15 14:32:53,603 WARN L838 $PredicateComparison]: unable to prove that (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (or (and (forall ((v_ArrVal_433 (Array Int Int))) (<= 0 (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~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_433) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))))) (forall ((v_ArrVal_433 (Array Int Int))) (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_433) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) 1))) (< c_~front~0 0) (<= c_~n~0 (+ c_~front~0 1))) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2022-03-15 14:32:54,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:32:54,240 INFO L93 Difference]: Finished difference Result 211421 states and 678536 transitions. [2022-03-15 14:32:54,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 191 states. [2022-03-15 14:32:54,240 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 5.661538461538462) internal successors, (368), 65 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 145 [2022-03-15 14:32:54,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:32:55,113 INFO L225 Difference]: With dead ends: 211421 [2022-03-15 14:32:55,113 INFO L226 Difference]: Without dead ends: 183701 [2022-03-15 14:32:55,115 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 255 SyntacticMatches, 6 SemanticMatches, 241 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 20989 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=6380, Invalid=47214, Unknown=42, NotChecked=5170, Total=58806 [2022-03-15 14:32:55,116 INFO L933 BasicCegarLoop]: 318 mSDtfsCounter, 8592 mSDsluCounter, 9576 mSDsCounter, 0 mSdLazyCounter, 4352 mSolverCounterSat, 920 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8592 SdHoareTripleChecker+Valid, 8948 SdHoareTripleChecker+Invalid, 7799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 920 IncrementalHoareTripleChecker+Valid, 4352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2527 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-03-15 14:32:55,116 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8592 Valid, 8948 Invalid, 7799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [920 Valid, 4352 Invalid, 0 Unknown, 2527 Unchecked, 2.2s Time] [2022-03-15 14:32:55,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183701 states. [2022-03-15 14:32:57,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183701 to 76360. [2022-03-15 14:32:57,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76360 states, 76359 states have (on average 3.1070862635707646) internal successors, (237254), 76359 states have internal predecessors, (237254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:32:58,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76360 states to 76360 states and 237254 transitions. [2022-03-15 14:32:58,405 INFO L78 Accepts]: Start accepts. Automaton has 76360 states and 237254 transitions. Word has length 145 [2022-03-15 14:32:58,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:32:58,405 INFO L470 AbstractCegarLoop]: Abstraction has 76360 states and 237254 transitions. [2022-03-15 14:32:58,405 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 5.661538461538462) internal successors, (368), 65 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-03-15 14:32:58,405 INFO L276 IsEmpty]: Start isEmpty. Operand 76360 states and 237254 transitions. [2022-03-15 14:32:58,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-03-15 14:32:58,512 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:32:58,513 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-03-15 14:32:58,533 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-03-15 14:32:58,731 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,SelfDestructingSolverStorable16 [2022-03-15 14:32:58,733 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:32:58,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:32:58,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1807247570, now seen corresponding path program 8 times [2022-03-15 14:32:58,734 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:32:58,734 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882843222] [2022-03-15 14:32:58,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:32:58,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:32:58,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:32:58,954 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 29 proven. 19 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-15 14:32:58,954 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:32:58,954 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882843222] [2022-03-15 14:32:58,954 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882843222] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:32:58,954 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299083214] [2022-03-15 14:32:58,954 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 14:32:58,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:32:58,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:32:58,955 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-03-15 14:32:58,976 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-03-15 14:32:59,076 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 14:32:59,076 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:32:59,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 21 conjunts are in the unsatisfiable core [2022-03-15 14:32:59,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:32:59,793 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 39 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-15 14:32:59,793 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:33:00,891 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 21 proven. 27 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-15 14:33:00,891 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299083214] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:33:00,892 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:33:00,892 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 43 [2022-03-15 14:33:00,892 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134788911] [2022-03-15 14:33:00,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:33:00,892 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-03-15 14:33:00,892 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:33:00,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-03-15 14:33:00,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=334, Invalid=1472, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 14:33:00,893 INFO L87 Difference]: Start difference. First operand 76360 states and 237254 transitions. Second operand has 43 states, 43 states have (on average 7.651162790697675) internal successors, (329), 43 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:33:02,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:33:02,621 INFO L93 Difference]: Finished difference Result 61694 states and 182717 transitions. [2022-03-15 14:33:02,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-03-15 14:33:02,622 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 7.651162790697675) internal successors, (329), 43 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 152 [2022-03-15 14:33:02,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:33:02,750 INFO L225 Difference]: With dead ends: 61694 [2022-03-15 14:33:02,750 INFO L226 Difference]: Without dead ends: 44915 [2022-03-15 14:33:02,751 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1491 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1420, Invalid=4432, Unknown=0, NotChecked=0, Total=5852 [2022-03-15 14:33:02,751 INFO L933 BasicCegarLoop]: 234 mSDtfsCounter, 2650 mSDsluCounter, 2861 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2650 SdHoareTripleChecker+Valid, 2865 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 14:33:02,751 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2650 Valid, 2865 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 14:33:02,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44915 states. [2022-03-15 14:33:03,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44915 to 34379. [2022-03-15 14:33:03,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34379 states, 34378 states have (on average 3.0673104892663914) internal successors, (105448), 34378 states have internal predecessors, (105448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:33:03,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34379 states to 34379 states and 105448 transitions. [2022-03-15 14:33:03,647 INFO L78 Accepts]: Start accepts. Automaton has 34379 states and 105448 transitions. Word has length 152 [2022-03-15 14:33:03,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:33:03,648 INFO L470 AbstractCegarLoop]: Abstraction has 34379 states and 105448 transitions. [2022-03-15 14:33:03,648 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 7.651162790697675) internal successors, (329), 43 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:33:03,648 INFO L276 IsEmpty]: Start isEmpty. Operand 34379 states and 105448 transitions. [2022-03-15 14:33:03,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-03-15 14:33:03,689 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:33:03,689 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-03-15 14:33:03,706 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-03-15 14:33:03,891 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,SelfDestructingSolverStorable17 [2022-03-15 14:33:03,891 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:33:03,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:33:03,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1153836258, now seen corresponding path program 9 times [2022-03-15 14:33:03,892 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:33:03,892 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158400576] [2022-03-15 14:33:03,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:33:03,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:33:03,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:33:04,155 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 33 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:33:04,155 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:33:04,155 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158400576] [2022-03-15 14:33:04,155 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158400576] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:33:04,155 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [650509069] [2022-03-15 14:33:04,155 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 14:33:04,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:33:04,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:33:04,157 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-03-15 14:33:04,162 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-03-15 14:33:04,302 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-03-15 14:33:04,302 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:33:04,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 21 conjunts are in the unsatisfiable core [2022-03-15 14:33:04,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:33:04,949 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 33 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:33:04,950 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:33:05,964 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 28 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:33:05,964 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [650509069] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:33:05,964 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:33:05,964 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 41 [2022-03-15 14:33:05,964 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591302889] [2022-03-15 14:33:05,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:33:05,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-15 14:33:05,965 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:33:05,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-15 14:33:05,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=1366, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 14:33:05,966 INFO L87 Difference]: Start difference. First operand 34379 states and 105448 transitions. Second operand has 41 states, 41 states have (on average 8.341463414634147) internal successors, (342), 41 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:33:06,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:33:06,876 INFO L93 Difference]: Finished difference Result 29470 states and 89761 transitions. [2022-03-15 14:33:06,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-15 14:33:06,876 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 8.341463414634147) internal successors, (342), 41 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 152 [2022-03-15 14:33:06,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:33:06,939 INFO L225 Difference]: With dead ends: 29470 [2022-03-15 14:33:06,939 INFO L226 Difference]: Without dead ends: 26641 [2022-03-15 14:33:06,940 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 974 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=880, Invalid=3152, Unknown=0, NotChecked=0, Total=4032 [2022-03-15 14:33:06,940 INFO L933 BasicCegarLoop]: 177 mSDtfsCounter, 1366 mSDsluCounter, 2188 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1366 SdHoareTripleChecker+Valid, 2242 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 14:33:06,946 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1366 Valid, 2242 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 14:33:07,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26641 states. [2022-03-15 14:33:07,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26641 to 26641. [2022-03-15 14:33:07,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26641 states, 26640 states have (on average 3.108596096096096) internal successors, (82813), 26640 states have internal predecessors, (82813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:33:07,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26641 states to 26641 states and 82813 transitions. [2022-03-15 14:33:07,555 INFO L78 Accepts]: Start accepts. Automaton has 26641 states and 82813 transitions. Word has length 152 [2022-03-15 14:33:07,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:33:07,556 INFO L470 AbstractCegarLoop]: Abstraction has 26641 states and 82813 transitions. [2022-03-15 14:33:07,556 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 8.341463414634147) internal successors, (342), 41 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:33:07,556 INFO L276 IsEmpty]: Start isEmpty. Operand 26641 states and 82813 transitions. [2022-03-15 14:33:07,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-03-15 14:33:07,588 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:33:07,588 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:33:07,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-03-15 14:33:07,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:33:07,807 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:33:07,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:33:07,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1304434893, now seen corresponding path program 10 times [2022-03-15 14:33:07,808 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:33:07,808 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547974023] [2022-03-15 14:33:07,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:33:07,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:33:07,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:33:08,188 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 3 proven. 43 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-03-15 14:33:08,189 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:33:08,189 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547974023] [2022-03-15 14:33:08,189 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547974023] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:33:08,189 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921653034] [2022-03-15 14:33:08,189 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 14:33:08,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:33:08,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:33:08,190 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-03-15 14:33:08,191 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-03-15 14:33:08,322 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 14:33:08,322 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:33:08,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 78 conjunts are in the unsatisfiable core [2022-03-15 14:33:08,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:33:08,358 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 14:33:08,595 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-15 14:33:08,595 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-03-15 14:33:10,430 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-03-15 14:33:11,059 INFO L353 Elim1Store]: treesize reduction 241, result has 4.0 percent of original size [2022-03-15 14:33:11,059 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 68 treesize of output 27 [2022-03-15 14:33:11,125 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 14 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:33:11,125 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:33:11,375 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (and (forall ((v_ArrVal_547 (Array Int Int))) (<= 0 (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_547) c_~queue~0.base)) (.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select .cse0 (+ c_~queue~0.offset .cse1 8)) (select .cse0 (+ c_~queue~0.offset .cse1 4)) (select .cse0 (+ c_~queue~0.offset .cse1)))))) (forall ((v_ArrVal_547 (Array Int Int))) (<= (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_547) c_~queue~0.base)) (.cse3 (* c_~front~0 4))) (+ c_~sum~0 (select .cse2 (+ c_~queue~0.offset .cse3 8)) (select .cse2 (+ c_~queue~0.offset .cse3 4)) (select .cse2 (+ c_~queue~0.offset .cse3)))) 1))) (< c_~front~0 0)) is different from false [2022-03-15 14:33:11,394 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (and (forall ((v_ArrVal_547 (Array Int Int))) (<= 0 (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_547) c_~queue~0.base)) (.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select .cse0 (+ c_~queue~0.offset .cse1 8)) (select .cse0 (+ c_~queue~0.offset .cse1 4)) (select .cse0 (+ c_~queue~0.offset .cse1)))))) (forall ((v_ArrVal_547 (Array Int Int))) (<= (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_547) c_~queue~0.base)) (.cse3 (* c_~front~0 4))) (+ c_~sum~0 (select .cse2 (+ c_~queue~0.offset .cse3 8)) (select .cse2 (+ c_~queue~0.offset .cse3 4)) (select .cse2 (+ c_~queue~0.offset .cse3)))) 1))) (< c_~front~0 0) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1))) is different from false [2022-03-15 14:33:11,424 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (and (forall ((v_ArrVal_547 (Array Int Int))) (<= 0 (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_547) c_~queue~0.base)) (.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select .cse0 (+ c_~queue~0.offset .cse1 8)) (select .cse0 (+ c_~queue~0.offset .cse1 4)) (select .cse0 (+ c_~queue~0.offset .cse1)))))) (forall ((v_ArrVal_547 (Array Int Int))) (<= (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_547) c_~queue~0.base)) (.cse3 (* c_~front~0 4))) (+ c_~sum~0 (select .cse2 (+ c_~queue~0.offset .cse3 8)) (select .cse2 (+ c_~queue~0.offset .cse3 4)) (select .cse2 (+ c_~queue~0.offset .cse3)))) 1))) (= |c_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (< c_~front~0 0) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1))) is different from false [2022-03-15 14:33:11,438 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (and (forall ((v_ArrVal_547 (Array Int Int))) (<= 0 (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_547) c_~queue~0.base)) (.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select .cse0 (+ c_~queue~0.offset .cse1 8)) (select .cse0 (+ c_~queue~0.offset .cse1 4)) (select .cse0 (+ c_~queue~0.offset .cse1)))))) (forall ((v_ArrVal_547 (Array Int Int))) (<= (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_547) c_~queue~0.base)) (.cse3 (* c_~front~0 4))) (+ c_~sum~0 (select .cse2 (+ c_~queue~0.offset .cse3 8)) (select .cse2 (+ c_~queue~0.offset .cse3 4)) (select .cse2 (+ c_~queue~0.offset .cse3)))) 1))) (= |c_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (< c_~front~0 0) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1))) is different from false [2022-03-15 14:33:11,575 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_~back~0_113 Int)) (or (<= c_~n~0 v_~back~0_113) (not (<= (+ c_~back~0 1) v_~back~0_113)) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* v_~back~0_113 4))) 1)) (< v_~back~0_113 0))) (<= c_~n~0 c_~front~0) (and (forall ((v_ArrVal_547 (Array Int Int))) (<= 0 (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_547) c_~queue~0.base)) (.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select .cse0 (+ c_~queue~0.offset .cse1 8)) (select .cse0 (+ c_~queue~0.offset .cse1 4)) (select .cse0 (+ c_~queue~0.offset .cse1)))))) (forall ((v_ArrVal_547 (Array Int Int))) (<= (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_547) c_~queue~0.base)) (.cse3 (* c_~front~0 4))) (+ c_~sum~0 (select .cse2 (+ c_~queue~0.offset .cse3 8)) (select .cse2 (+ c_~queue~0.offset .cse3 4)) (select .cse2 (+ c_~queue~0.offset .cse3)))) 1))) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) is different from false [2022-03-15 14:33:11,791 INFO L353 Elim1Store]: treesize reduction 130, result has 48.2 percent of original size [2022-03-15 14:33:11,792 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 180 treesize of output 224 [2022-03-15 14:33:11,825 INFO L353 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2022-03-15 14:33:11,825 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 89 treesize of output 69 [2022-03-15 14:33:11,834 INFO L353 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2022-03-15 14:33:11,834 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 69 treesize of output 49 [2022-03-15 14:33:16,031 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-03-15 14:33:16,085 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 3 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 28 not checked. [2022-03-15 14:33:16,085 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1921653034] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:33:16,085 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:33:16,085 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 33, 33] total 77 [2022-03-15 14:33:16,085 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36947885] [2022-03-15 14:33:16,085 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:33:16,086 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-03-15 14:33:16,086 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:33:16,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-03-15 14:33:16,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=497, Invalid=4625, Unknown=10, NotChecked=720, Total=5852 [2022-03-15 14:33:16,087 INFO L87 Difference]: Start difference. First operand 26641 states and 82813 transitions. Second operand has 77 states, 77 states have (on average 5.077922077922078) internal successors, (391), 77 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:33:20,340 WARN L838 $PredicateComparison]: unable to prove that (and (or (forall ((v_~back~0_113 Int)) (or (<= c_~n~0 v_~back~0_113) (not (<= (+ c_~back~0 1) v_~back~0_113)) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* v_~back~0_113 4))) 1)) (< v_~back~0_113 0))) (<= c_~n~0 c_~front~0) (and (forall ((v_ArrVal_547 (Array Int Int))) (<= 0 (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_547) c_~queue~0.base)) (.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select .cse0 (+ c_~queue~0.offset .cse1 8)) (select .cse0 (+ c_~queue~0.offset .cse1 4)) (select .cse0 (+ c_~queue~0.offset .cse1)))))) (forall ((v_ArrVal_547 (Array Int Int))) (<= (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_547) c_~queue~0.base)) (.cse3 (* c_~front~0 4))) (+ c_~sum~0 (select .cse2 (+ c_~queue~0.offset .cse3 8)) (select .cse2 (+ c_~queue~0.offset .cse3 4)) (select .cse2 (+ c_~queue~0.offset .cse3)))) 1))) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0))) is different from false [2022-03-15 14:33:24,113 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (<= c_~n~0 c_~front~0)) (.cse1 (and (forall ((v_ArrVal_547 (Array Int Int))) (<= 0 (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_547) c_~queue~0.base)) (.cse5 (* c_~front~0 4))) (+ c_~sum~0 (select .cse4 (+ c_~queue~0.offset .cse5 8)) (select .cse4 (+ c_~queue~0.offset .cse5 4)) (select .cse4 (+ c_~queue~0.offset .cse5)))))) (forall ((v_ArrVal_547 (Array Int Int))) (<= (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_547) c_~queue~0.base)) (.cse7 (* c_~front~0 4))) (+ c_~sum~0 (select .cse6 (+ c_~queue~0.offset .cse7 8)) (select .cse6 (+ c_~queue~0.offset .cse7 4)) (select .cse6 (+ c_~queue~0.offset .cse7)))) 1)))) (.cse2 (< c_~front~0 0)) (.cse3 (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1)))) (and (or .cse0 (<= c_~n~0 c_~back~0) .cse1 (< c_~back~0 0) .cse2 .cse3) (or .cse0 .cse1 (= |c_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) .cse2 .cse3) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)))) is different from false [2022-03-15 14:36:19,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:36:19,332 INFO L93 Difference]: Finished difference Result 525880 states and 1715700 transitions. [2022-03-15 14:36:19,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 724 states. [2022-03-15 14:36:19,333 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 77 states have (on average 5.077922077922078) internal successors, (391), 77 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 159 [2022-03-15 14:36:19,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:36:21,805 INFO L225 Difference]: With dead ends: 525880 [2022-03-15 14:36:21,805 INFO L226 Difference]: Without dead ends: 464954 [2022-03-15 14:36:21,837 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1207 GetRequests, 319 SyntacticMatches, 113 SemanticMatches, 775 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 299944 ImplicationChecksByTransitivity, 160.7s TimeCoverageRelationStatistics Valid=83426, Invalid=506129, Unknown=2603, NotChecked=10794, Total=602952 [2022-03-15 14:36:21,838 INFO L933 BasicCegarLoop]: 1334 mSDtfsCounter, 8332 mSDsluCounter, 44111 mSDsCounter, 0 mSdLazyCounter, 5490 mSolverCounterSat, 957 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8332 SdHoareTripleChecker+Valid, 36289 SdHoareTripleChecker+Invalid, 58664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 957 IncrementalHoareTripleChecker+Valid, 5490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 52217 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-03-15 14:36:21,838 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8332 Valid, 36289 Invalid, 58664 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [957 Valid, 5490 Invalid, 0 Unknown, 52217 Unchecked, 3.5s Time] [2022-03-15 14:36:22,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464954 states. [2022-03-15 14:36:29,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464954 to 96195. [2022-03-15 14:36:30,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96195 states, 96194 states have (on average 3.1802191404869324) internal successors, (305918), 96194 states have internal predecessors, (305918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:36:30,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96195 states to 96195 states and 305918 transitions. [2022-03-15 14:36:30,712 INFO L78 Accepts]: Start accepts. Automaton has 96195 states and 305918 transitions. Word has length 159 [2022-03-15 14:36:30,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:36:30,713 INFO L470 AbstractCegarLoop]: Abstraction has 96195 states and 305918 transitions. [2022-03-15 14:36:30,713 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 77 states have (on average 5.077922077922078) internal successors, (391), 77 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:36:30,713 INFO L276 IsEmpty]: Start isEmpty. Operand 96195 states and 305918 transitions. [2022-03-15 14:36:31,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-03-15 14:36:31,018 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:36:31,018 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:36:31,037 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-03-15 14:36:31,237 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:36:31,237 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:36:31,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:36:31,238 INFO L85 PathProgramCache]: Analyzing trace with hash 728452607, now seen corresponding path program 11 times [2022-03-15 14:36:31,238 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:36:31,238 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318649012] [2022-03-15 14:36:31,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:36:31,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:36:31,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:36:32,352 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 3 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:36:32,353 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:36:32,353 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318649012] [2022-03-15 14:36:32,353 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318649012] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:36:32,353 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254580762] [2022-03-15 14:36:32,353 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 14:36:32,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:36:32,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:36:32,354 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-03-15 14:36:32,380 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-03-15 14:36:32,508 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-03-15 14:36:32,508 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:36:32,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 102 conjunts are in the unsatisfiable core [2022-03-15 14:36:32,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:36:32,544 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 14:36:32,582 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-03-15 14:36:32,582 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-03-15 14:36:32,626 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-03-15 14:36:32,627 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 16 treesize of output 22 [2022-03-15 14:36:33,161 INFO L353 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-03-15 14:36:33,161 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 20 treesize of output 30 [2022-03-15 14:36:33,587 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-15 14:36:33,892 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-15 14:36:34,296 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 14:36:34,410 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 14:36:35,465 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 44 treesize of output 42 [2022-03-15 14:36:35,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 14:36:35,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 14:36:35,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 14:36:35,747 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:36:35,747 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 18 [2022-03-15 14:36:35,848 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 3 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:36:35,848 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:36:36,289 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 c_~front~0))) (or (< .cse0 0) (<= c_~n~0 .cse0) (and (forall ((v_ArrVal_597 (Array Int Int))) (<= 0 (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) c_~queue~0.base)) (.cse2 (* c_~front~0 4))) (+ c_~sum~0 (select .cse1 (+ c_~queue~0.offset .cse2 4)) (select .cse1 (+ c_~queue~0.offset .cse2)) (select .cse1 (+ c_~queue~0.offset .cse2 8)))))) (forall ((v_ArrVal_597 (Array Int Int))) (<= (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) c_~queue~0.base)) (.cse4 (* c_~front~0 4))) (+ c_~sum~0 (select .cse3 (+ c_~queue~0.offset .cse4 4)) (select .cse3 (+ c_~queue~0.offset .cse4)) (select .cse3 (+ c_~queue~0.offset .cse4 8)))) 1))) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1)))) is different from false [2022-03-15 14:36:36,642 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 c_~front~0)) (.cse1 (select |c_#memory_int| c_~queue~0.base)) (.cse2 (* c_~back~0 4))) (or (< .cse0 0) (<= c_~n~0 .cse0) (not (= (+ (select .cse1 (+ c_~queue~0.offset .cse2 4)) 1) 0)) (not (= (select .cse1 (+ c_~queue~0.offset .cse2 8)) 1)) (and (forall ((v_ArrVal_597 (Array Int Int))) (<= 0 (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) c_~queue~0.base)) (.cse4 (* c_~front~0 4))) (+ c_~sum~0 (select .cse3 (+ c_~queue~0.offset .cse4 4)) (select .cse3 (+ c_~queue~0.offset .cse4)) (select .cse3 (+ c_~queue~0.offset .cse4 8)))))) (forall ((v_ArrVal_597 (Array Int Int))) (<= (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) c_~queue~0.base)) (.cse6 (* c_~front~0 4))) (+ c_~sum~0 (select .cse5 (+ c_~queue~0.offset .cse6 4)) (select .cse5 (+ c_~queue~0.offset .cse6)) (select .cse5 (+ c_~queue~0.offset .cse6 8)))) 1))) (not (= (select .cse1 (+ c_~queue~0.offset .cse2)) 1)))) is different from false [2022-03-15 14:36:37,078 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 c_~front~0)) (.cse1 (select |c_#memory_int| c_~queue~0.base)) (.cse2 (* c_~back~0 4))) (or (< .cse0 0) (<= c_~n~0 .cse0) (<= c_~n~0 c_~back~0) (not (= (+ (select .cse1 (+ c_~queue~0.offset .cse2 4)) 1) 0)) (not (= (select .cse1 (+ c_~queue~0.offset .cse2 8)) 1)) (< c_~back~0 0) (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0) (and (forall ((v_ArrVal_597 (Array Int Int))) (<= 0 (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) c_~queue~0.base)) (.cse4 (* c_~front~0 4))) (+ c_~sum~0 (select .cse3 (+ c_~queue~0.offset .cse4 4)) (select .cse3 (+ c_~queue~0.offset .cse4)) (select .cse3 (+ c_~queue~0.offset .cse4 8)))))) (forall ((v_ArrVal_597 (Array Int Int))) (<= (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) c_~queue~0.base)) (.cse6 (* c_~front~0 4))) (+ c_~sum~0 (select .cse5 (+ c_~queue~0.offset .cse6 4)) (select .cse5 (+ c_~queue~0.offset .cse6)) (select .cse5 (+ c_~queue~0.offset .cse6 8)))) 1))) (not (= (select .cse1 (+ c_~queue~0.offset .cse2)) 1)))) is different from false [2022-03-15 14:36:40,236 INFO L353 Elim1Store]: treesize reduction 39, result has 40.0 percent of original size [2022-03-15 14:36:40,236 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 360 treesize of output 205 [2022-03-15 14:36:40,327 INFO L353 Elim1Store]: treesize reduction 140, result has 46.4 percent of original size [2022-03-15 14:36:40,328 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 1684 treesize of output 1648 [2022-03-15 14:36:40,340 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 14:36:40,340 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 14:36:40,341 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 14:36:40,341 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 1085 treesize of output 925 [2022-03-15 14:36:40,426 INFO L353 Elim1Store]: treesize reduction 140, result has 46.4 percent of original size [2022-03-15 14:36:40,427 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 1368 treesize of output 1248 [2022-03-15 14:36:40,518 INFO L353 Elim1Store]: treesize reduction 140, result has 46.4 percent of original size [2022-03-15 14:36:40,519 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 1128 treesize of output 1128 [2022-03-15 14:36:40,548 INFO L353 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2022-03-15 14:36:40,549 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 685 treesize of output 525 [2022-03-15 14:36:56,265 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 4 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 26 not checked. [2022-03-15 14:36:56,265 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254580762] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:36:56,265 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:36:56,266 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 38, 40] total 102 [2022-03-15 14:36:56,266 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010995175] [2022-03-15 14:36:56,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:36:56,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2022-03-15 14:36:56,266 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:36:56,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2022-03-15 14:36:56,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=948, Invalid=8724, Unknown=42, NotChecked=588, Total=10302 [2022-03-15 14:36:56,267 INFO L87 Difference]: Start difference. First operand 96195 states and 305918 transitions. Second operand has 102 states, 102 states have (on average 4.0) internal successors, (408), 102 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:37:04,159 WARN L838 $PredicateComparison]: unable to prove that (and (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (let ((.cse0 (+ 2 c_~front~0))) (or (< .cse0 0) (<= c_~n~0 .cse0) (and (forall ((v_ArrVal_597 (Array Int Int))) (<= 0 (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) c_~queue~0.base)) (.cse2 (* c_~front~0 4))) (+ c_~sum~0 (select .cse1 (+ c_~queue~0.offset .cse2 4)) (select .cse1 (+ c_~queue~0.offset .cse2)) (select .cse1 (+ c_~queue~0.offset .cse2 8)))))) (forall ((v_ArrVal_597 (Array Int Int))) (<= (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) c_~queue~0.base)) (.cse4 (* c_~front~0 4))) (+ c_~sum~0 (select .cse3 (+ c_~queue~0.offset .cse4 4)) (select .cse3 (+ c_~queue~0.offset .cse4)) (select .cse3 (+ c_~queue~0.offset .cse4 8)))) 1))) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1))))) is different from false [2022-03-15 14:37:09,209 WARN L838 $PredicateComparison]: unable to prove that (and (let ((.cse0 (+ 2 c_~front~0))) (or (< .cse0 0) (<= c_~n~0 .cse0) (and (forall ((v_ArrVal_597 (Array Int Int))) (<= 0 (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) c_~queue~0.base)) (.cse2 (* c_~front~0 4))) (+ c_~sum~0 (select .cse1 (+ c_~queue~0.offset .cse2 4)) (select .cse1 (+ c_~queue~0.offset .cse2)) (select .cse1 (+ c_~queue~0.offset .cse2 8)))))) (forall ((v_ArrVal_597 (Array Int Int))) (<= (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) c_~queue~0.base)) (.cse4 (* c_~front~0 4))) (+ c_~sum~0 (select .cse3 (+ c_~queue~0.offset .cse4 4)) (select .cse3 (+ c_~queue~0.offset .cse4)) (select .cse3 (+ c_~queue~0.offset .cse4 8)))) 1))))) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0))) is different from false [2022-03-15 14:37:09,743 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_~queue~0.base))) (and (or (<= c_~n~0 c_~front~0) (let ((.cse0 (+ c_~sum~0 (select .cse1 (+ c_~queue~0.offset (* c_~front~0 4)))))) (and (<= .cse0 1) (<= 0 .cse0))) (< c_~front~0 0)) (let ((.cse2 (+ 2 c_~front~0))) (or (< .cse2 0) (<= c_~n~0 .cse2) (and (forall ((v_ArrVal_597 (Array Int Int))) (<= 0 (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) c_~queue~0.base)) (.cse4 (* c_~front~0 4))) (+ c_~sum~0 (select .cse3 (+ c_~queue~0.offset .cse4 4)) (select .cse3 (+ c_~queue~0.offset .cse4)) (select .cse3 (+ c_~queue~0.offset .cse4 8)))))) (forall ((v_ArrVal_597 (Array Int Int))) (<= (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) c_~queue~0.base)) (.cse6 (* c_~front~0 4))) (+ c_~sum~0 (select .cse5 (+ c_~queue~0.offset .cse6 4)) (select .cse5 (+ c_~queue~0.offset .cse6)) (select .cse5 (+ c_~queue~0.offset .cse6 8)))) 1))) (not (= (select .cse1 (+ c_~queue~0.offset (* c_~back~0 4))) 1)))))) is different from false [2022-03-15 14:37:16,460 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse11 (+ 2 c_~front~0)) (.cse5 (select |c_#memory_int| c_~queue~0.base)) (.cse6 (* c_~front~0 4))) (let ((.cse1 (select .cse5 (+ c_~queue~0.offset .cse6))) (.cse2 (< .cse11 0)) (.cse3 (<= c_~n~0 .cse11))) (and (or (<= c_~n~0 c_~front~0) (let ((.cse0 (+ c_~sum~0 .cse1))) (and (<= .cse0 1) (<= 0 .cse0))) (< c_~front~0 0)) (or .cse2 .cse3 (let ((.cse4 (+ c_~sum~0 (select .cse5 (+ c_~queue~0.offset .cse6 8)) .cse1 (select .cse5 (+ c_~queue~0.offset .cse6 4))))) (and (<= 0 .cse4) (<= .cse4 1)))) (or .cse2 .cse3 (and (forall ((v_ArrVal_597 (Array Int Int))) (<= 0 (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) c_~queue~0.base)) (.cse8 (* c_~front~0 4))) (+ c_~sum~0 (select .cse7 (+ c_~queue~0.offset .cse8 4)) (select .cse7 (+ c_~queue~0.offset .cse8)) (select .cse7 (+ c_~queue~0.offset .cse8 8)))))) (forall ((v_ArrVal_597 (Array Int Int))) (<= (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) c_~queue~0.base)) (.cse10 (* c_~front~0 4))) (+ c_~sum~0 (select .cse9 (+ c_~queue~0.offset .cse10 4)) (select .cse9 (+ c_~queue~0.offset .cse10)) (select .cse9 (+ c_~queue~0.offset .cse10 8)))) 1))) (not (= (select .cse5 (+ c_~queue~0.offset (* c_~back~0 4))) 1)))))) is different from false [2022-03-15 14:37:20,875 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse28 (+ 2 c_~front~0)) (.cse8 (select |c_#memory_int| c_~queue~0.base)) (.cse9 (* c_~front~0 4))) (let ((.cse1 (select .cse8 (+ c_~queue~0.offset .cse9))) (.cse3 (select .cse8 (+ c_~queue~0.offset .cse9 4))) (.cse5 (< .cse28 0)) (.cse6 (<= c_~n~0 .cse28)) (.cse20 (<= c_~n~0 c_~back~0)) (.cse21 (< c_~back~0 0))) (and (or (<= c_~n~0 c_~front~0) (let ((.cse0 (+ c_~sum~0 .cse1))) (and (<= .cse0 1) (<= 0 .cse0))) (< c_~front~0 0)) (let ((.cse4 (+ c_~front~0 1))) (or (let ((.cse2 (+ c_~sum~0 .cse1 .cse3))) (and (<= .cse2 1) (<= 0 .cse2))) (< .cse4 0) (<= c_~n~0 .cse4))) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (or .cse5 .cse6 (let ((.cse7 (+ c_~sum~0 (select .cse8 (+ c_~queue~0.offset .cse9 8)) .cse1 .cse3))) (and (<= 0 .cse7) (<= .cse7 1)))) (or .cse5 .cse6 (and (forall ((v_ArrVal_597 (Array Int Int))) (<= 0 (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) c_~queue~0.base)) (.cse11 (* c_~front~0 4))) (+ c_~sum~0 (select .cse10 (+ c_~queue~0.offset .cse11 4)) (select .cse10 (+ c_~queue~0.offset .cse11)) (select .cse10 (+ c_~queue~0.offset .cse11 8)))))) (forall ((v_ArrVal_597 (Array Int Int))) (<= (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) c_~queue~0.base)) (.cse13 (* c_~front~0 4))) (+ c_~sum~0 (select .cse12 (+ c_~queue~0.offset .cse13 4)) (select .cse12 (+ c_~queue~0.offset .cse13)) (select .cse12 (+ c_~queue~0.offset .cse13 8)))) 1))) (not (= (select .cse8 (+ c_~queue~0.offset (* c_~back~0 4))) 1))) (or .cse5 .cse6 (forall ((v_ArrVal_595 (Array Int Int)) (v_ArrVal_596 (Array Int Int))) (let ((.cse14 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596) |c_ULTIMATE.start_main_#t~ret9#1.base|)) (.cse15 (* c_~back~0 4))) (or (not (= (select .cse14 (+ .cse15 |c_ULTIMATE.start_main_#t~ret9#1.offset|)) 1)) (not (= (+ (select .cse14 (+ .cse15 |c_ULTIMATE.start_main_#t~ret9#1.offset| 4)) 1) 0)) (and (forall ((v_ArrVal_597 (Array Int Int))) (<= (let ((.cse16 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) |c_ULTIMATE.start_main_#t~ret9#1.base|)) (.cse17 (* c_~front~0 4))) (+ c_~sum~0 (select .cse16 (+ .cse17 8 |c_ULTIMATE.start_main_#t~ret9#1.offset|)) (select .cse16 (+ .cse17 |c_ULTIMATE.start_main_#t~ret9#1.offset| 4)) (select .cse16 (+ .cse17 |c_ULTIMATE.start_main_#t~ret9#1.offset|)))) 1)) (forall ((v_ArrVal_597 (Array Int Int))) (<= 0 (let ((.cse18 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) |c_ULTIMATE.start_main_#t~ret9#1.base|)) (.cse19 (* c_~front~0 4))) (+ c_~sum~0 (select .cse18 (+ .cse19 8 |c_ULTIMATE.start_main_#t~ret9#1.offset|)) (select .cse18 (+ .cse19 |c_ULTIMATE.start_main_#t~ret9#1.offset| 4)) (select .cse18 (+ .cse19 |c_ULTIMATE.start_main_#t~ret9#1.offset|))))))) (not (= (select .cse14 (+ .cse15 8 |c_ULTIMATE.start_main_#t~ret9#1.offset|)) 1))))) .cse20 .cse21) (or .cse5 .cse6 .cse20 (forall ((v_ArrVal_595 (Array Int Int)) (v_ArrVal_596 (Array Int Int))) (let ((.cse22 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (.cse23 (* c_~back~0 4))) (or (not (= (select .cse22 (+ .cse23 8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 1)) (not (= (+ (select .cse22 (+ .cse23 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) 1) 0)) (not (= (select .cse22 (+ .cse23 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 1)) (and (forall ((v_ArrVal_597 (Array Int Int))) (<= (let ((.cse24 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (.cse25 (* c_~front~0 4))) (+ c_~sum~0 (select .cse24 (+ .cse25 8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (select .cse24 (+ .cse25 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (select .cse24 (+ .cse25 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)))) 1)) (forall ((v_ArrVal_597 (Array Int Int))) (<= 0 (let ((.cse26 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (.cse27 (* c_~front~0 4))) (+ c_~sum~0 (select .cse26 (+ .cse27 8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (select .cse26 (+ .cse27 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (select .cse26 (+ .cse27 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)))))))))) .cse21)))) is different from false [2022-03-15 14:37:29,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:37:29,997 INFO L93 Difference]: Finished difference Result 464543 states and 1523195 transitions. [2022-03-15 14:37:29,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 223 states. [2022-03-15 14:37:29,997 INFO L78 Accepts]: Start accepts. Automaton has has 102 states, 102 states have (on average 4.0) internal successors, (408), 102 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 159 [2022-03-15 14:37:29,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:37:31,957 INFO L225 Difference]: With dead ends: 464543 [2022-03-15 14:37:31,958 INFO L226 Difference]: Without dead ends: 383324 [2022-03-15 14:37:31,961 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 626 GetRequests, 275 SyntacticMatches, 51 SemanticMatches, 300 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 39477 ImplicationChecksByTransitivity, 31.9s TimeCoverageRelationStatistics Valid=6362, Invalid=79567, Unknown=245, NotChecked=4728, Total=90902 [2022-03-15 14:37:31,965 INFO L933 BasicCegarLoop]: 586 mSDtfsCounter, 3881 mSDsluCounter, 26764 mSDsCounter, 0 mSdLazyCounter, 5831 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3881 SdHoareTripleChecker+Valid, 25002 SdHoareTripleChecker+Invalid, 18339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 5831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 12350 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-03-15 14:37:31,965 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3881 Valid, 25002 Invalid, 18339 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [158 Valid, 5831 Invalid, 0 Unknown, 12350 Unchecked, 2.9s Time] [2022-03-15 14:37:32,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383324 states. [2022-03-15 14:37:40,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383324 to 191838. [2022-03-15 14:37:40,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191838 states, 191837 states have (on average 3.174742098760927) internal successors, (609033), 191837 states have internal predecessors, (609033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:37:41,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191838 states to 191838 states and 609033 transitions. [2022-03-15 14:37:41,360 INFO L78 Accepts]: Start accepts. Automaton has 191838 states and 609033 transitions. Word has length 159 [2022-03-15 14:37:41,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:37:41,361 INFO L470 AbstractCegarLoop]: Abstraction has 191838 states and 609033 transitions. [2022-03-15 14:37:41,361 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 102 states, 102 states have (on average 4.0) internal successors, (408), 102 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:37:41,361 INFO L276 IsEmpty]: Start isEmpty. Operand 191838 states and 609033 transitions. [2022-03-15 14:37:41,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-03-15 14:37:41,867 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:37:41,867 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:37:41,884 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-03-15 14:37:42,086 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,SelfDestructingSolverStorable20 [2022-03-15 14:37:42,086 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:37:42,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:37:42,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1555767355, now seen corresponding path program 12 times [2022-03-15 14:37:42,087 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:37:42,087 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265401518] [2022-03-15 14:37:42,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:37:42,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:37:42,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:37:42,977 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 3 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:37:42,977 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:37:42,977 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265401518] [2022-03-15 14:37:42,977 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265401518] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:37:42,977 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166546842] [2022-03-15 14:37:42,977 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 14:37:42,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:37:42,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:37:42,979 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-03-15 14:37:42,979 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-03-15 14:37:43,102 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-03-15 14:37:43,102 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:37:43,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 58 conjunts are in the unsatisfiable core [2022-03-15 14:37:43,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:37:44,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 14:37:44,433 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 56 treesize of output 52 [2022-03-15 14:37:44,589 INFO L353 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2022-03-15 14:37:44,589 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 70 treesize of output 18 [2022-03-15 14:37:44,677 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 3 proven. 56 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-03-15 14:37:44,677 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:37:44,893 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_638 (Array Int Int))) (<= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_638) c_~queue~0.base)) (.cse1 (* c_~front~0 4))) (+ (select .cse0 (+ c_~queue~0.offset .cse1)) c_~sum~0 (select .cse0 (+ c_~queue~0.offset .cse1 4)))) 1)) (forall ((v_ArrVal_638 (Array Int Int))) (<= 0 (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_638) c_~queue~0.base)) (.cse3 (* c_~front~0 4))) (+ (select .cse2 (+ c_~queue~0.offset .cse3)) c_~sum~0 (select .cse2 (+ c_~queue~0.offset .cse3 4))))))) is different from false [2022-03-15 14:37:44,912 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_638 (Array Int Int))) (<= (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_638) c_~queue~0.base)) (.cse0 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)) (select .cse1 (+ c_~queue~0.offset .cse0 8)) (select .cse1 (+ c_~queue~0.offset .cse0 4)))) 1)) (forall ((v_ArrVal_638 (Array Int Int))) (<= 0 (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_638) c_~queue~0.base)) (.cse2 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse2)) (select .cse3 (+ c_~queue~0.offset .cse2 8)) (select .cse3 (+ c_~queue~0.offset .cse2 4))))))) is different from false [2022-03-15 14:37:45,322 INFO L353 Elim1Store]: treesize reduction 140, result has 46.4 percent of original size [2022-03-15 14:37:45,322 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 186 treesize of output 212 [2022-03-15 14:37:45,331 INFO L353 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-03-15 14:37:45,331 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 77 treesize of output 63 [2022-03-15 14:37:45,338 INFO L353 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-03-15 14:37:45,338 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 63 treesize of output 49 [2022-03-15 14:37:46,300 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 3 proven. 35 refuted. 0 times theorem prover too weak. 24 trivial. 8 not checked. [2022-03-15 14:37:46,301 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166546842] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:37:46,301 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:37:46,301 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 22, 20] total 68 [2022-03-15 14:37:46,301 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616842791] [2022-03-15 14:37:46,307 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:37:46,308 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-03-15 14:37:46,308 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:37:46,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-03-15 14:37:46,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=3975, Unknown=2, NotChecked=258, Total=4556 [2022-03-15 14:37:46,309 INFO L87 Difference]: Start difference. First operand 191838 states and 609033 transitions. Second operand has 68 states, 68 states have (on average 5.735294117647059) internal successors, (390), 68 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:37:54,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:37:54,455 INFO L93 Difference]: Finished difference Result 291170 states and 932910 transitions. [2022-03-15 14:37:54,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-03-15 14:37:54,455 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 5.735294117647059) internal successors, (390), 68 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 159 [2022-03-15 14:37:54,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:37:55,459 INFO L225 Difference]: With dead ends: 291170 [2022-03-15 14:37:55,460 INFO L226 Difference]: Without dead ends: 209744 [2022-03-15 14:37:55,460 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 292 SyntacticMatches, 5 SemanticMatches, 135 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 5144 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=2066, Invalid=16030, Unknown=2, NotChecked=534, Total=18632 [2022-03-15 14:37:55,461 INFO L933 BasicCegarLoop]: 301 mSDtfsCounter, 3429 mSDsluCounter, 8857 mSDsCounter, 0 mSdLazyCounter, 5077 mSolverCounterSat, 407 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3429 SdHoareTripleChecker+Valid, 8329 SdHoareTripleChecker+Invalid, 7125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 407 IncrementalHoareTripleChecker+Valid, 5077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1641 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-03-15 14:37:55,461 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3429 Valid, 8329 Invalid, 7125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [407 Valid, 5077 Invalid, 0 Unknown, 1641 Unchecked, 2.2s Time] [2022-03-15 14:37:55,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209744 states. [2022-03-15 14:37:58,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209744 to 144930. [2022-03-15 14:37:59,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144930 states, 144929 states have (on average 3.0706621863119183) internal successors, (445028), 144929 states have internal predecessors, (445028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:37:59,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144930 states to 144930 states and 445028 transitions. [2022-03-15 14:37:59,961 INFO L78 Accepts]: Start accepts. Automaton has 144930 states and 445028 transitions. Word has length 159 [2022-03-15 14:37:59,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:37:59,962 INFO L470 AbstractCegarLoop]: Abstraction has 144930 states and 445028 transitions. [2022-03-15 14:37:59,962 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 5.735294117647059) internal successors, (390), 68 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:37:59,962 INFO L276 IsEmpty]: Start isEmpty. Operand 144930 states and 445028 transitions. [2022-03-15 14:38:00,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-03-15 14:38:00,105 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:38:00,105 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:38:00,122 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-03-15 14:38:00,322 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,SelfDestructingSolverStorable21 [2022-03-15 14:38:00,323 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:38:00,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:38:00,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1376371763, now seen corresponding path program 13 times [2022-03-15 14:38:00,323 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:38:00,323 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821764940] [2022-03-15 14:38:00,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:38:00,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:38:00,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:38:00,745 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 3 proven. 43 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-03-15 14:38:00,745 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:38:00,745 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821764940] [2022-03-15 14:38:00,745 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821764940] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:38:00,745 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890014081] [2022-03-15 14:38:00,745 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 14:38:00,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:38:00,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:38:00,746 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-03-15 14:38:00,747 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-03-15 14:38:00,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:38:00,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 83 conjunts are in the unsatisfiable core [2022-03-15 14:38:00,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:38:00,894 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 14:38:01,062 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-15 14:38:01,062 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-03-15 14:38:02,504 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 67 treesize of output 61 [2022-03-15 14:38:02,621 INFO L353 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2022-03-15 14:38:02,621 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 70 treesize of output 18 [2022-03-15 14:38:02,703 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:38:02,704 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:38:02,885 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (and (forall ((v_ArrVal_680 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_680) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (forall ((v_ArrVal_680 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_680) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1))) (<= c_~back~0 c_~front~0) (< c_~front~0 0)) is different from false [2022-03-15 14:38:02,915 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~front~0 1))) (or (<= c_~back~0 .cse0) (< .cse0 0) (<= c_~n~0 .cse0) (and (forall ((v_ArrVal_680 (Array Int Int))) (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_680) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) 1)) (forall ((v_ArrVal_680 (Array Int Int))) (<= 0 (let ((.cse2 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse2)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_680) c_~queue~0.base) (+ c_~queue~0.offset .cse2 4))))))))) is different from false [2022-03-15 14:38:03,430 INFO L353 Elim1Store]: treesize reduction 140, result has 46.4 percent of original size [2022-03-15 14:38:03,430 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 190 treesize of output 198 [2022-03-15 14:38:03,436 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-03-15 14:38:03,439 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 49 [2022-03-15 14:38:05,454 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-03-15 14:38:05,508 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 2 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-03-15 14:38:05,508 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890014081] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:38:05,508 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:38:05,508 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 31, 30] total 71 [2022-03-15 14:38:05,508 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818900897] [2022-03-15 14:38:05,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:38:05,509 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2022-03-15 14:38:05,509 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:38:05,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2022-03-15 14:38:05,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=541, Invalid=4157, Unknown=2, NotChecked=270, Total=4970 [2022-03-15 14:38:05,510 INFO L87 Difference]: Start difference. First operand 144930 states and 445028 transitions. Second operand has 71 states, 71 states have (on average 5.619718309859155) internal successors, (399), 71 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:38:06,878 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_~front~0 4))) (let ((.cse8 (< 3 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse7 (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_45| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_45|) 0)) (and (<= c_~sum~0 0) (<= 0 (+ c_~sum~0 1)) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_45|)) (= (* c_~front~0 4) (* c_~back~0 4)))))) (.cse3 (<= c_~sum~0 0)) (.cse4 (<= 0 (+ c_~sum~0 1))) (.cse5 (= .cse1 (* c_~back~0 4))) (.cse6 (<= c_~n~0 (+ 2 c_~front~0))) (.cse2 (< c_~front~0 0))) (and (<= 1 c_~sum~0) (or (<= c_~n~0 c_~front~0) (<= c_~back~0 c_~front~0) (let ((.cse0 (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1))))) (and (<= .cse0 1) (<= 0 .cse0))) .cse2) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) (or (and .cse3 .cse4 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) .cse5) .cse6 .cse2) (or .cse6 (< 3 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse7 .cse2) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (or .cse6 (and .cse3 .cse4 .cse5 (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|))) .cse2) (<= 1 c_~v_assert~0) (or .cse6 (and (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) .cse3 .cse4 .cse5) .cse2) (or .cse6 (and .cse3 .cse4 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base|)) .cse5) .cse8 .cse2) (or .cse6 .cse8 .cse7 .cse2) (or .cse6 (and .cse3 .cse4 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_main_#t~ret9#1.base|)) .cse5) .cse2) (<= c_~sum~0 1) (or .cse6 (and (forall ((v_ArrVal_680 (Array Int Int))) (<= (let ((.cse10 (select |c_#memory_int| c_~queue~0.base)) (.cse9 (* c_~front~0 4))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_680) c_~queue~0.base) (+ c_~queue~0.offset .cse9 8)) c_~sum~0 (select .cse10 (+ c_~queue~0.offset .cse9)) (select .cse10 (+ c_~queue~0.offset .cse9 4)))) 1)) (forall ((v_ArrVal_680 (Array Int Int))) (<= 0 (let ((.cse12 (select |c_#memory_int| c_~queue~0.base)) (.cse11 (* c_~front~0 4))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_680) c_~queue~0.base) (+ c_~queue~0.offset .cse11 8)) c_~sum~0 (select .cse12 (+ c_~queue~0.offset .cse11)) (select .cse12 (+ c_~queue~0.offset .cse11 4))))))) .cse2)))) is different from false [2022-03-15 14:38:07,278 WARN L838 $PredicateComparison]: unable to prove that (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (or (<= c_~n~0 (+ 2 c_~front~0)) (and (forall ((v_ArrVal_680 (Array Int Int))) (<= (let ((.cse1 (select |c_#memory_int| c_~queue~0.base)) (.cse0 (* c_~front~0 4))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_680) c_~queue~0.base) (+ c_~queue~0.offset .cse0 8)) c_~sum~0 (select .cse1 (+ c_~queue~0.offset .cse0)) (select .cse1 (+ c_~queue~0.offset .cse0 4)))) 1)) (forall ((v_ArrVal_680 (Array Int Int))) (<= 0 (let ((.cse3 (select |c_#memory_int| c_~queue~0.base)) (.cse2 (* c_~front~0 4))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_680) c_~queue~0.base) (+ c_~queue~0.offset .cse2 8)) c_~sum~0 (select .cse3 (+ c_~queue~0.offset .cse2)) (select .cse3 (+ c_~queue~0.offset .cse2 4))))))) (< c_~front~0 0))) is different from false [2022-03-15 14:38:07,575 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (< 3 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse5 (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_45| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_45|) 0)) (and (<= c_~sum~0 0) (<= 0 (+ c_~sum~0 1)) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_45|)) (= (* c_~front~0 4) (* c_~back~0 4)))))) (.cse0 (<= c_~sum~0 0)) (.cse1 (<= 0 (+ c_~sum~0 1))) (.cse2 (= (* c_~front~0 4) (* c_~back~0 4))) (.cse3 (<= c_~n~0 (+ 2 c_~front~0))) (.cse4 (< c_~front~0 0))) (and (<= 1 c_~sum~0) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) (or (and .cse0 .cse1 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) .cse2) .cse3 .cse4) (or .cse3 (< 3 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse5 .cse4) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (or .cse3 (and .cse0 .cse1 .cse2 (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|))) .cse4) (<= 1 c_~v_assert~0) (or .cse3 (and (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) .cse0 .cse1 .cse2) .cse4) (or .cse3 (and .cse0 .cse1 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base|)) .cse2) .cse6 .cse4) (or .cse3 .cse6 .cse5 .cse4) (or .cse3 (and .cse0 .cse1 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_main_#t~ret9#1.base|)) .cse2) .cse4) (<= c_~sum~0 1) (or .cse3 (and (forall ((v_ArrVal_680 (Array Int Int))) (<= (let ((.cse8 (select |c_#memory_int| c_~queue~0.base)) (.cse7 (* c_~front~0 4))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_680) c_~queue~0.base) (+ c_~queue~0.offset .cse7 8)) c_~sum~0 (select .cse8 (+ c_~queue~0.offset .cse7)) (select .cse8 (+ c_~queue~0.offset .cse7 4)))) 1)) (forall ((v_ArrVal_680 (Array Int Int))) (<= 0 (let ((.cse10 (select |c_#memory_int| c_~queue~0.base)) (.cse9 (* c_~front~0 4))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_680) c_~queue~0.base) (+ c_~queue~0.offset .cse9 8)) c_~sum~0 (select .cse10 (+ c_~queue~0.offset .cse9)) (select .cse10 (+ c_~queue~0.offset .cse9 4))))))) .cse4))) is different from false [2022-03-15 14:38:08,175 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_~front~0 4)) (.cse9 (* c_~back~0 4))) (let ((.cse1 (select |c_#memory_int| c_~queue~0.base)) (.cse4 (<= c_~n~0 (+ 2 c_~front~0))) (.cse10 (<= c_~sum~0 0)) (.cse11 (<= 0 (+ c_~sum~0 1))) (.cse12 (= .cse2 .cse9)) (.cse3 (< c_~front~0 0))) (and (<= 1 c_~sum~0) (or (<= c_~n~0 c_~front~0) (<= c_~back~0 c_~front~0) (let ((.cse0 (+ c_~sum~0 (select .cse1 (+ c_~queue~0.offset .cse2))))) (and (<= .cse0 1) (<= 0 .cse0))) .cse3) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (or .cse4 (and (forall ((v_ArrVal_680 (Array Int Int))) (<= (let ((.cse6 (select |c_#memory_int| c_~queue~0.base)) (.cse5 (* c_~front~0 4))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_680) c_~queue~0.base) (+ c_~queue~0.offset .cse5 8)) c_~sum~0 (select .cse6 (+ c_~queue~0.offset .cse5)) (select .cse6 (+ c_~queue~0.offset .cse5 4)))) 1)) (forall ((v_ArrVal_680 (Array Int Int))) (<= 0 (let ((.cse8 (select |c_#memory_int| c_~queue~0.base)) (.cse7 (* c_~front~0 4))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_680) c_~queue~0.base) (+ c_~queue~0.offset .cse7 8)) c_~sum~0 (select .cse8 (+ c_~queue~0.offset .cse7)) (select .cse8 (+ c_~queue~0.offset .cse7 4))))))) .cse3 (not (= (select .cse1 (+ c_~queue~0.offset .cse9)) 1))) (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) (or (and .cse10 .cse11 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) .cse12) .cse4 .cse3) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (or .cse4 (and .cse10 .cse11 .cse12 (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|))) .cse3) (<= 1 c_~v_assert~0) (or .cse4 (and (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) .cse10 .cse11 .cse12) .cse3) (or .cse4 (and .cse10 .cse11 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base|)) .cse12) (< 3 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse3) (or .cse4 (and .cse10 .cse11 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_main_#t~ret9#1.base|)) .cse12) .cse3) (<= c_~sum~0 1)))) is different from false [2022-03-15 14:38:08,271 WARN L838 $PredicateComparison]: unable to prove that (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (let ((.cse0 (select |c_#memory_int| c_~queue~0.base)) (.cse1 (* c_~back~0 4))) (or (<= c_~n~0 (+ 2 c_~front~0)) (not (= (select .cse0 (+ c_~queue~0.offset .cse1 4)) 1)) (and (forall ((v_ArrVal_680 (Array Int Int))) (<= (let ((.cse3 (select |c_#memory_int| c_~queue~0.base)) (.cse2 (* c_~front~0 4))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_680) c_~queue~0.base) (+ c_~queue~0.offset .cse2 8)) c_~sum~0 (select .cse3 (+ c_~queue~0.offset .cse2)) (select .cse3 (+ c_~queue~0.offset .cse2 4)))) 1)) (forall ((v_ArrVal_680 (Array Int Int))) (<= 0 (let ((.cse5 (select |c_#memory_int| c_~queue~0.base)) (.cse4 (* c_~front~0 4))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_680) c_~queue~0.base) (+ c_~queue~0.offset .cse4 8)) c_~sum~0 (select .cse5 (+ c_~queue~0.offset .cse4)) (select .cse5 (+ c_~queue~0.offset .cse4 4))))))) (not (= (+ (select .cse0 (+ c_~queue~0.offset .cse1)) 1) 0)) (< c_~front~0 0)))) is different from false [2022-03-15 14:38:08,422 WARN L838 $PredicateComparison]: unable to prove that (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (or (<= c_~n~0 (+ 2 c_~front~0)) (and (forall ((v_ArrVal_680 (Array Int Int))) (<= (let ((.cse1 (select |c_#memory_int| c_~queue~0.base)) (.cse0 (* c_~front~0 4))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_680) c_~queue~0.base) (+ c_~queue~0.offset .cse0 8)) c_~sum~0 (select .cse1 (+ c_~queue~0.offset .cse0)) (select .cse1 (+ c_~queue~0.offset .cse0 4)))) 1)) (forall ((v_ArrVal_680 (Array Int Int))) (<= 0 (let ((.cse3 (select |c_#memory_int| c_~queue~0.base)) (.cse2 (* c_~front~0 4))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_680) c_~queue~0.base) (+ c_~queue~0.offset .cse2 8)) c_~sum~0 (select .cse3 (+ c_~queue~0.offset .cse2)) (select .cse3 (+ c_~queue~0.offset .cse2 4))))))) (< c_~front~0 0) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1)))) is different from false [2022-03-15 14:38:08,470 WARN L838 $PredicateComparison]: unable to prove that (and (let ((.cse0 (+ c_~front~0 1))) (or (<= c_~back~0 .cse0) (< .cse0 0) (<= c_~n~0 .cse0) (and (forall ((v_ArrVal_680 (Array Int Int))) (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_680) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) 1)) (forall ((v_ArrVal_680 (Array Int Int))) (<= 0 (let ((.cse2 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse2)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_680) c_~queue~0.base) (+ c_~queue~0.offset .cse2 4))))))))) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2022-03-15 14:38:08,869 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (* c_~back~0 4))) (let ((.cse0 (<= c_~n~0 (+ 2 c_~front~0))) (.cse7 (<= c_~sum~0 0)) (.cse8 (<= 0 (+ c_~sum~0 1))) (.cse9 (= (* c_~front~0 4) .cse6)) (.cse5 (< c_~front~0 0))) (and (<= 1 c_~sum~0) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (or .cse0 (and (forall ((v_ArrVal_680 (Array Int Int))) (<= (let ((.cse2 (select |c_#memory_int| c_~queue~0.base)) (.cse1 (* c_~front~0 4))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_680) c_~queue~0.base) (+ c_~queue~0.offset .cse1 8)) c_~sum~0 (select .cse2 (+ c_~queue~0.offset .cse1)) (select .cse2 (+ c_~queue~0.offset .cse1 4)))) 1)) (forall ((v_ArrVal_680 (Array Int Int))) (<= 0 (let ((.cse4 (select |c_#memory_int| c_~queue~0.base)) (.cse3 (* c_~front~0 4))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_680) c_~queue~0.base) (+ c_~queue~0.offset .cse3 8)) c_~sum~0 (select .cse4 (+ c_~queue~0.offset .cse3)) (select .cse4 (+ c_~queue~0.offset .cse3 4))))))) .cse5 (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse6)) 1))) (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (or .cse0 (and .cse7 .cse8 .cse9 (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|))) .cse5) (<= 1 c_~v_assert~0) (or .cse0 (and (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) .cse7 .cse8 .cse9) .cse5) (or .cse0 (and .cse7 .cse8 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base|)) .cse9) (< 3 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse5) (or .cse0 (and .cse7 .cse8 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_main_#t~ret9#1.base|)) .cse9) .cse5) (<= c_~sum~0 1)))) is different from false [2022-03-15 14:38:08,924 WARN L838 $PredicateComparison]: unable to prove that (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (let ((.cse0 (+ c_~front~0 1))) (or (<= c_~back~0 .cse0) (< .cse0 0) (<= c_~n~0 .cse0) (and (forall ((v_ArrVal_680 (Array Int Int))) (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_680) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) 1)) (forall ((v_ArrVal_680 (Array Int Int))) (<= 0 (let ((.cse2 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse2)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_680) c_~queue~0.base) (+ c_~queue~0.offset .cse2 4)))))))))) is different from false [2022-03-15 14:38:10,094 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (<= c_~sum~0 0)) (.cse1 (<= 0 (+ c_~sum~0 1))) (.cse2 (= (* c_~front~0 4) (* c_~back~0 4))) (.cse3 (<= c_~n~0 (+ 2 c_~front~0))) (.cse4 (< c_~front~0 0))) (and (<= 1 c_~sum~0) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) (or (and .cse0 .cse1 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) .cse2) .cse3 .cse4) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (or .cse3 (and .cse0 .cse1 .cse2 (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|))) .cse4) (<= 1 c_~v_assert~0) (or .cse3 (and (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) .cse0 .cse1 .cse2) .cse4) (or .cse3 (and .cse0 .cse1 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base|)) .cse2) (< 3 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse4) (or .cse3 (and .cse0 .cse1 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_main_#t~ret9#1.base|)) .cse2) .cse4) (<= c_~sum~0 1) (or .cse3 (and (forall ((v_ArrVal_680 (Array Int Int))) (<= (let ((.cse6 (select |c_#memory_int| c_~queue~0.base)) (.cse5 (* c_~front~0 4))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_680) c_~queue~0.base) (+ c_~queue~0.offset .cse5 8)) c_~sum~0 (select .cse6 (+ c_~queue~0.offset .cse5)) (select .cse6 (+ c_~queue~0.offset .cse5 4)))) 1)) (forall ((v_ArrVal_680 (Array Int Int))) (<= 0 (let ((.cse8 (select |c_#memory_int| c_~queue~0.base)) (.cse7 (* c_~front~0 4))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_680) c_~queue~0.base) (+ c_~queue~0.offset .cse7 8)) c_~sum~0 (select .cse8 (+ c_~queue~0.offset .cse7)) (select .cse8 (+ c_~queue~0.offset .cse7 4))))))) .cse4))) is different from false [2022-03-15 14:38:11,295 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (<= c_~n~0 (+ 2 c_~front~0))) (.cse1 (<= c_~sum~0 0)) (.cse2 (<= 0 (+ c_~sum~0 1))) (.cse3 (= (* c_~front~0 4) (* c_~back~0 4))) (.cse0 (< c_~front~0 0))) (and (or (<= c_~n~0 c_~front~0) (and (forall ((v_ArrVal_680 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_680) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (forall ((v_ArrVal_680 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_680) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1))) (<= c_~back~0 c_~front~0) .cse0) (<= 1 c_~sum~0) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) (or (and .cse1 .cse2 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) .cse3) .cse4 .cse0) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (or .cse4 (and .cse1 .cse2 .cse3 (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|))) .cse0) (let ((.cse5 (+ c_~front~0 1))) (or (<= c_~back~0 .cse5) (< .cse5 0) (<= c_~n~0 .cse5) (and (forall ((v_ArrVal_680 (Array Int Int))) (<= (let ((.cse6 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse6)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_680) c_~queue~0.base) (+ c_~queue~0.offset .cse6 4)))) 1)) (forall ((v_ArrVal_680 (Array Int Int))) (<= 0 (let ((.cse7 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse7)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_680) c_~queue~0.base) (+ c_~queue~0.offset .cse7 4))))))))) (<= 1 c_~v_assert~0) (or .cse4 (and (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) .cse1 .cse2 .cse3) .cse0) (or .cse4 (and .cse1 .cse2 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base|)) .cse3) (< 3 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse0) (or .cse4 (and .cse1 .cse2 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_main_#t~ret9#1.base|)) .cse3) .cse0) (<= c_~sum~0 1))) is different from false [2022-03-15 14:38:11,486 WARN L838 $PredicateComparison]: unable to prove that (and (or (<= c_~n~0 c_~front~0) (and (forall ((v_ArrVal_680 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_680) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (forall ((v_ArrVal_680 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_680) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1))) (<= c_~back~0 c_~front~0) (< c_~front~0 0)) (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) (let ((.cse0 (+ c_~front~0 1))) (or (<= c_~back~0 .cse0) (< .cse0 0) (<= c_~n~0 .cse0) (and (forall ((v_ArrVal_680 (Array Int Int))) (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_680) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) 1)) (forall ((v_ArrVal_680 (Array Int Int))) (<= 0 (let ((.cse2 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse2)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_680) c_~queue~0.base) (+ c_~queue~0.offset .cse2 4))))))))) (<= 1 c_~v_assert~0)) is different from false [2022-03-15 14:38:12,017 WARN L838 $PredicateComparison]: unable to prove that (and (or (<= c_~n~0 c_~front~0) (and (forall ((v_ArrVal_680 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_680) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (forall ((v_ArrVal_680 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_680) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1))) (<= c_~back~0 c_~front~0) (< c_~front~0 0)) (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (let ((.cse0 (+ c_~front~0 1))) (or (<= c_~back~0 .cse0) (< .cse0 0) (<= c_~n~0 .cse0) (and (forall ((v_ArrVal_680 (Array Int Int))) (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_680) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) 1)) (forall ((v_ArrVal_680 (Array Int Int))) (<= 0 (let ((.cse2 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse2)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_680) c_~queue~0.base) (+ c_~queue~0.offset .cse2 4)))))))))) is different from false [2022-03-15 14:38:12,020 WARN L838 $PredicateComparison]: unable to prove that (and (or (<= c_~n~0 c_~front~0) (and (forall ((v_ArrVal_680 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_680) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (forall ((v_ArrVal_680 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_680) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1))) (<= c_~back~0 c_~front~0) (< c_~front~0 0)) (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0))) is different from false [2022-03-15 14:38:13,193 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (<= c_~n~0 (+ 2 c_~front~0))) (.cse1 (<= c_~sum~0 0)) (.cse2 (<= 0 (+ c_~sum~0 1))) (.cse3 (= (* c_~front~0 4) (* c_~back~0 4))) (.cse0 (< c_~front~0 0))) (and (or (<= c_~n~0 c_~front~0) (and (forall ((v_ArrVal_680 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_680) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (forall ((v_ArrVal_680 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_680) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1))) (<= c_~back~0 c_~front~0) .cse0) (<= 1 c_~sum~0) (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (or (and .cse1 .cse2 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) .cse3) .cse4 .cse0) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (or .cse4 (and .cse1 .cse2 .cse3 (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|))) .cse0) (let ((.cse5 (+ c_~front~0 1))) (or (<= c_~back~0 .cse5) (< .cse5 0) (<= c_~n~0 .cse5) (and (forall ((v_ArrVal_680 (Array Int Int))) (<= (let ((.cse6 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse6)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_680) c_~queue~0.base) (+ c_~queue~0.offset .cse6 4)))) 1)) (forall ((v_ArrVal_680 (Array Int Int))) (<= 0 (let ((.cse7 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse7)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_680) c_~queue~0.base) (+ c_~queue~0.offset .cse7 4))))))))) (or .cse4 (and (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) .cse1 .cse2 .cse3) .cse0) (or .cse4 (and .cse1 .cse2 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base|)) .cse3) (< 3 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse0) (or .cse4 (and .cse1 .cse2 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_main_#t~ret9#1.base|)) .cse3) .cse0) (<= c_~sum~0 1))) is different from false [2022-03-15 14:38:13,397 WARN L838 $PredicateComparison]: unable to prove that (and (or (<= c_~n~0 c_~front~0) (and (forall ((v_ArrVal_680 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_680) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (forall ((v_ArrVal_680 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_680) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1))) (<= c_~back~0 c_~front~0) (< c_~front~0 0)) (let ((.cse0 (+ c_~front~0 1))) (or (<= c_~back~0 .cse0) (< .cse0 0) (<= c_~n~0 .cse0) (and (forall ((v_ArrVal_680 (Array Int Int))) (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_680) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) 1)) (forall ((v_ArrVal_680 (Array Int Int))) (<= 0 (let ((.cse2 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse2)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_680) c_~queue~0.base) (+ c_~queue~0.offset .cse2 4)))))))))) is different from false [2022-03-15 14:38:13,658 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (<= c_~n~0 (+ 2 c_~front~0))) (.cse1 (<= c_~sum~0 0)) (.cse2 (<= 0 (+ c_~sum~0 1))) (.cse3 (= (* c_~front~0 4) (* c_~back~0 4))) (.cse0 (< c_~front~0 0))) (and (or (<= c_~n~0 c_~front~0) (and (forall ((v_ArrVal_680 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_680) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (forall ((v_ArrVal_680 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_680) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1))) (<= c_~back~0 c_~front~0) .cse0) (<= 1 c_~sum~0) (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (or (and .cse1 .cse2 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) .cse3) .cse4 .cse0) (or .cse4 (and .cse1 .cse2 .cse3 (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|))) .cse0) (let ((.cse5 (+ c_~front~0 1))) (or (<= c_~back~0 .cse5) (< .cse5 0) (<= c_~n~0 .cse5) (and (forall ((v_ArrVal_680 (Array Int Int))) (<= (let ((.cse6 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse6)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_680) c_~queue~0.base) (+ c_~queue~0.offset .cse6 4)))) 1)) (forall ((v_ArrVal_680 (Array Int Int))) (<= 0 (let ((.cse7 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse7)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_680) c_~queue~0.base) (+ c_~queue~0.offset .cse7 4))))))))) (or .cse4 (and (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) .cse1 .cse2 .cse3) .cse0) (or .cse4 (and .cse1 .cse2 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base|)) .cse3) (< 3 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse0) (or .cse4 (and .cse1 .cse2 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_main_#t~ret9#1.base|)) .cse3) .cse0) (<= c_~sum~0 1))) is different from false