/usr/bin/java -Xmx16000000000 -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-dev-bc79526 [2022-01-18 02:48:56,990 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-18 02:48:56,992 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-18 02:48:57,053 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-18 02:48:57,054 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-18 02:48:57,055 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-18 02:48:57,055 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-18 02:48:57,056 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-18 02:48:57,057 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-18 02:48:57,061 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-18 02:48:57,062 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-18 02:48:57,065 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-18 02:48:57,065 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-18 02:48:57,067 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-18 02:48:57,068 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-18 02:48:57,071 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-18 02:48:57,071 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-18 02:48:57,072 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-18 02:48:57,073 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-18 02:48:57,077 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-18 02:48:57,077 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-18 02:48:57,078 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-18 02:48:57,079 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-18 02:48:57,080 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-18 02:48:57,083 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-18 02:48:57,083 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-18 02:48:57,083 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-18 02:48:57,084 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-18 02:48:57,085 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-18 02:48:57,085 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-18 02:48:57,085 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-18 02:48:57,086 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-18 02:48:57,087 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-18 02:48:57,087 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-18 02:48:57,088 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-18 02:48:57,088 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-18 02:48:57,089 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-18 02:48:57,089 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-18 02:48:57,089 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-18 02:48:57,090 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-18 02:48:57,090 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-18 02:48:57,091 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2022-01-18 02:48:57,112 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-18 02:48:57,113 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-18 02:48:57,113 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-18 02:48:57,113 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-18 02:48:57,114 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-18 02:48:57,114 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-18 02:48:57,114 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-18 02:48:57,114 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-18 02:48:57,114 INFO L138 SettingsManager]: * Use SBE=true [2022-01-18 02:48:57,114 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-18 02:48:57,115 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-18 02:48:57,115 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-18 02:48:57,115 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-18 02:48:57,115 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-18 02:48:57,115 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-18 02:48:57,115 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-18 02:48:57,115 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-18 02:48:57,115 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-18 02:48:57,116 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-18 02:48:57,116 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-18 02:48:57,116 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-18 02:48:57,116 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-18 02:48:57,116 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-18 02:48:57,116 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-18 02:48:57,117 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-18 02:48:57,117 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-18 02:48:57,117 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-18 02:48:57,117 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-18 02:48:57,117 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-18 02:48:57,117 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-18 02:48:57,117 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-18 02:48:57,117 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-18 02:48:57,118 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-18 02:48:57,118 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-01-18 02:48:57,278 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-18 02:48:57,301 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-18 02:48:57,303 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-18 02:48:57,304 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-18 02:48:57,308 INFO L275 PluginConnector]: CDTParser initialized [2022-01-18 02:48:57,309 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-01-18 02:48:57,370 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce5fd374d/58e52ac1eb47401b8c348c12693c1b34/FLAG9b59e9619 [2022-01-18 02:48:57,721 INFO L306 CDTParser]: Found 1 translation units. [2022-01-18 02:48:57,721 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c [2022-01-18 02:48:57,725 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce5fd374d/58e52ac1eb47401b8c348c12693c1b34/FLAG9b59e9619 [2022-01-18 02:48:57,734 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce5fd374d/58e52ac1eb47401b8c348c12693c1b34 [2022-01-18 02:48:57,736 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-18 02:48:57,737 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-18 02:48:57,738 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-18 02:48:57,738 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-18 02:48:57,740 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-18 02:48:57,740 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.01 02:48:57" (1/1) ... [2022-01-18 02:48:57,741 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@272dad06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 02:48:57, skipping insertion in model container [2022-01-18 02:48:57,741 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.01 02:48:57" (1/1) ... [2022-01-18 02:48:57,748 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-18 02:48:57,760 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-18 02:48:57,913 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-01-18 02:48:57,917 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-18 02:48:57,922 INFO L203 MainTranslator]: Completed pre-run [2022-01-18 02:48:57,938 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-01-18 02:48:57,940 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-18 02:48:57,951 INFO L208 MainTranslator]: Completed translation [2022-01-18 02:48:57,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 02:48:57 WrapperNode [2022-01-18 02:48:57,952 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-18 02:48:57,953 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-18 02:48:57,953 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-18 02:48:57,953 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-18 02:48:57,957 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 02:48:57" (1/1) ... [2022-01-18 02:48:57,962 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 02:48:57" (1/1) ... [2022-01-18 02:48:57,979 INFO L137 Inliner]: procedures = 25, calls = 52, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 161 [2022-01-18 02:48:57,979 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-18 02:48:57,980 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-18 02:48:57,980 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-18 02:48:57,980 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-18 02:48:57,987 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 02:48:57" (1/1) ... [2022-01-18 02:48:57,987 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 02:48:57" (1/1) ... [2022-01-18 02:48:57,989 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 02:48:57" (1/1) ... [2022-01-18 02:48:57,989 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 02:48:57" (1/1) ... [2022-01-18 02:48:57,994 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 02:48:57" (1/1) ... [2022-01-18 02:48:57,997 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 02:48:57" (1/1) ... [2022-01-18 02:48:57,998 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 02:48:57" (1/1) ... [2022-01-18 02:48:58,000 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-18 02:48:58,001 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-18 02:48:58,001 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-18 02:48:58,001 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-18 02:48:58,001 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 02:48:57" (1/1) ... [2022-01-18 02:48:58,016 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-18 02:48:58,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:48:58,032 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-18 02:48:58,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-18 02:48:58,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-18 02:48:58,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-18 02:48:58,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-18 02:48:58,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-18 02:48:58,057 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-01-18 02:48:58,057 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-01-18 02:48:58,058 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-01-18 02:48:58,058 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-01-18 02:48:58,058 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-01-18 02:48:58,058 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-01-18 02:48:58,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-18 02:48:58,058 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-18 02:48:58,058 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-18 02:48:58,058 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-18 02:48:58,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-18 02:48:58,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-18 02:48:58,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-18 02:48:58,059 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-18 02:48:58,115 INFO L234 CfgBuilder]: Building ICFG [2022-01-18 02:48:58,116 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-18 02:48:58,334 INFO L275 CfgBuilder]: Performing block encoding [2022-01-18 02:48:58,372 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-18 02:48:58,373 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-01-18 02:48:58,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 02:48:58 BoogieIcfgContainer [2022-01-18 02:48:58,374 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-18 02:48:58,376 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-18 02:48:58,376 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-18 02:48:58,378 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-18 02:48:58,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.01 02:48:57" (1/3) ... [2022-01-18 02:48:58,379 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4139202 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 02:48:58, skipping insertion in model container [2022-01-18 02:48:58,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 02:48:57" (2/3) ... [2022-01-18 02:48:58,379 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4139202 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 02:48:58, skipping insertion in model container [2022-01-18 02:48:58,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 02:48:58" (3/3) ... [2022-01-18 02:48:58,380 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-send-receive.wvr.c [2022-01-18 02:48:58,383 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-01-18 02:48:58,383 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-18 02:48:58,383 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-18 02:48:58,384 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-18 02:48:58,412 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,412 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,412 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,413 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,413 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,413 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,413 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,413 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,413 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,413 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,414 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,414 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,414 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,414 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,414 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,414 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,415 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,415 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,415 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,415 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,415 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~b~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,416 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~b~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,416 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,416 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,416 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,416 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,416 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,416 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,417 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,417 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,417 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,417 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,417 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,417 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,418 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,418 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,418 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,418 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,418 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,418 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,418 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,418 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,418 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,418 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,419 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~b~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,419 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~b~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,419 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~b~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,419 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~b~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,419 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,419 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,419 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,420 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,420 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,420 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,420 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,420 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,420 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,420 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,421 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,421 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,421 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,421 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,421 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,421 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,421 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~b~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,421 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~b~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,422 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~b~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,422 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~b~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,422 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,422 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,422 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,423 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,423 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,423 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,425 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,425 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,426 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,426 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,426 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,426 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,426 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,426 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,426 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,427 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,427 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,427 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~b~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,427 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,427 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,427 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,427 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,427 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,427 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,428 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:48:58,432 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-01-18 02:48:58,458 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-18 02:48:58,463 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-18 02:48:58,463 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-01-18 02:48:58,472 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 142 places, 142 transitions, 308 flow [2022-01-18 02:48:58,604 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-01-18 02:48:58,613 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-01-18 02:48:58,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-01-18 02:48:58,639 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:48:58,640 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-01-18 02:48:58,641 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 02:48:58,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:48:58,644 INFO L85 PathProgramCache]: Analyzing trace with hash 518546796, now seen corresponding path program 1 times [2022-01-18 02:48:58,650 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:48:58,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470999167] [2022-01-18 02:48:58,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:48:58,651 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:48:58,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:48:58,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:48:58,834 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:48:58,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470999167] [2022-01-18 02:48:58,835 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470999167] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 02:48:58,835 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 02:48:58,835 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-18 02:48:58,836 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154667114] [2022-01-18 02:48:58,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 02:48:58,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-18 02:48:58,840 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:48:58,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-18 02:48:58,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-18 02:48:58,869 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-01-18 02:48:58,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:48:58,938 INFO L93 Difference]: Finished difference Result 3113 states and 10261 transitions. [2022-01-18 02:48:58,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-18 02:48:58,940 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-01-18 02:48:58,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:48:58,979 INFO L225 Difference]: With dead ends: 3113 [2022-01-18 02:48:58,980 INFO L226 Difference]: Without dead ends: 2945 [2022-01-18 02:48:58,981 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-18 02:48:58,983 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-01-18 02:48:58,984 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-01-18 02:48:59,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2945 states. [2022-01-18 02:48:59,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2945 to 2945. [2022-01-18 02:48:59,093 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-01-18 02:48:59,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2945 states to 2945 states and 9708 transitions. [2022-01-18 02:48:59,106 INFO L78 Accepts]: Start accepts. Automaton has 2945 states and 9708 transitions. Word has length 96 [2022-01-18 02:48:59,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:48:59,107 INFO L470 AbstractCegarLoop]: Abstraction has 2945 states and 9708 transitions. [2022-01-18 02:48:59,107 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-01-18 02:48:59,108 INFO L276 IsEmpty]: Start isEmpty. Operand 2945 states and 9708 transitions. [2022-01-18 02:48:59,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-01-18 02:48:59,117 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:48:59,117 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-01-18 02:48:59,118 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-18 02:48:59,118 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 02:48:59,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:48:59,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1430139861, now seen corresponding path program 1 times [2022-01-18 02:48:59,121 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:48:59,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931969683] [2022-01-18 02:48:59,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:48:59,122 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:48:59,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:48:59,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:48:59,286 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:48:59,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931969683] [2022-01-18 02:48:59,286 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931969683] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 02:48:59,287 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 02:48:59,287 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-18 02:48:59,287 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673566559] [2022-01-18 02:48:59,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 02:48:59,288 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-18 02:48:59,289 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:48:59,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-18 02:48:59,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-18 02:48:59,289 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-01-18 02:48:59,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:48:59,388 INFO L93 Difference]: Finished difference Result 2975 states and 9924 transitions. [2022-01-18 02:48:59,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-18 02:48:59,388 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-01-18 02:48:59,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:48:59,403 INFO L225 Difference]: With dead ends: 2975 [2022-01-18 02:48:59,403 INFO L226 Difference]: Without dead ends: 2975 [2022-01-18 02:48:59,406 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-01-18 02:48:59,407 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-01-18 02:48:59,408 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-01-18 02:48:59,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2975 states. [2022-01-18 02:48:59,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2975 to 2567. [2022-01-18 02:48:59,477 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-01-18 02:48:59,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2567 states to 2567 states and 8506 transitions. [2022-01-18 02:48:59,486 INFO L78 Accepts]: Start accepts. Automaton has 2567 states and 8506 transitions. Word has length 96 [2022-01-18 02:48:59,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:48:59,488 INFO L470 AbstractCegarLoop]: Abstraction has 2567 states and 8506 transitions. [2022-01-18 02:48:59,489 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-01-18 02:48:59,489 INFO L276 IsEmpty]: Start isEmpty. Operand 2567 states and 8506 transitions. [2022-01-18 02:48:59,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-01-18 02:48:59,495 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:48:59,495 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-01-18 02:48:59,495 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-18 02:48:59,496 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 02:48:59,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:48:59,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1635672389, now seen corresponding path program 2 times [2022-01-18 02:48:59,496 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:48:59,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348929744] [2022-01-18 02:48:59,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:48:59,497 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:48:59,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:48:59,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:48:59,603 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:48:59,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348929744] [2022-01-18 02:48:59,604 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348929744] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 02:48:59,604 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 02:48:59,604 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-18 02:48:59,604 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447762949] [2022-01-18 02:48:59,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 02:48:59,604 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-18 02:48:59,604 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:48:59,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-18 02:48:59,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-18 02:48:59,605 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-01-18 02:48:59,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:48:59,674 INFO L93 Difference]: Finished difference Result 3707 states and 12439 transitions. [2022-01-18 02:48:59,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-18 02:48:59,676 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-01-18 02:48:59,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:48:59,697 INFO L225 Difference]: With dead ends: 3707 [2022-01-18 02:48:59,697 INFO L226 Difference]: Without dead ends: 3707 [2022-01-18 02:48:59,697 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-01-18 02:48:59,702 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-01-18 02:48:59,703 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-01-18 02:48:59,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3707 states. [2022-01-18 02:48:59,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3707 to 2552. [2022-01-18 02:48:59,800 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-01-18 02:48:59,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2552 states to 2552 states and 8462 transitions. [2022-01-18 02:48:59,808 INFO L78 Accepts]: Start accepts. Automaton has 2552 states and 8462 transitions. Word has length 96 [2022-01-18 02:48:59,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:48:59,810 INFO L470 AbstractCegarLoop]: Abstraction has 2552 states and 8462 transitions. [2022-01-18 02:48:59,810 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-01-18 02:48:59,810 INFO L276 IsEmpty]: Start isEmpty. Operand 2552 states and 8462 transitions. [2022-01-18 02:48:59,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-01-18 02:48:59,819 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:48:59,819 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-01-18 02:48:59,819 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-18 02:48:59,820 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 02:48:59,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:48:59,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1043909749, now seen corresponding path program 3 times [2022-01-18 02:48:59,820 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:48:59,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228507523] [2022-01-18 02:48:59,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:48:59,821 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:48:59,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:48:59,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:48:59,958 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:48:59,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228507523] [2022-01-18 02:48:59,959 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228507523] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 02:48:59,959 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 02:48:59,959 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-18 02:48:59,959 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304774695] [2022-01-18 02:48:59,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 02:48:59,960 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-18 02:48:59,960 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:48:59,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-18 02:48:59,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-18 02:48:59,960 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-01-18 02:49:00,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:49:00,064 INFO L93 Difference]: Finished difference Result 6261 states and 21083 transitions. [2022-01-18 02:49:00,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-18 02:49:00,065 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-01-18 02:49:00,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:49:00,081 INFO L225 Difference]: With dead ends: 6261 [2022-01-18 02:49:00,081 INFO L226 Difference]: Without dead ends: 3651 [2022-01-18 02:49:00,082 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-01-18 02:49:00,086 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.0s IncrementalHoareTripleChecker+Time [2022-01-18 02:49:00,087 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.0s Time] [2022-01-18 02:49:00,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3651 states. [2022-01-18 02:49:00,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3651 to 2628. [2022-01-18 02:49:00,140 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-01-18 02:49:00,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2628 states to 2628 states and 8512 transitions. [2022-01-18 02:49:00,148 INFO L78 Accepts]: Start accepts. Automaton has 2628 states and 8512 transitions. Word has length 96 [2022-01-18 02:49:00,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:49:00,149 INFO L470 AbstractCegarLoop]: Abstraction has 2628 states and 8512 transitions. [2022-01-18 02:49:00,149 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-01-18 02:49:00,150 INFO L276 IsEmpty]: Start isEmpty. Operand 2628 states and 8512 transitions. [2022-01-18 02:49:00,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-18 02:49:00,155 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:49:00,155 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-01-18 02:49:00,156 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-18 02:49:00,156 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 02:49:00,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:49:00,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1775513332, now seen corresponding path program 1 times [2022-01-18 02:49:00,157 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:49:00,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990752725] [2022-01-18 02:49:00,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:49:00,157 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:49:00,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:49:00,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:49:00,225 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:49:00,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990752725] [2022-01-18 02:49:00,225 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990752725] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 02:49:00,225 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 02:49:00,226 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-18 02:49:00,226 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957404185] [2022-01-18 02:49:00,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 02:49:00,226 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-18 02:49:00,226 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:49:00,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-18 02:49:00,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-18 02:49:00,227 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-01-18 02:49:00,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:49:00,252 INFO L93 Difference]: Finished difference Result 2664 states and 8430 transitions. [2022-01-18 02:49:00,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-18 02:49:00,253 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-01-18 02:49:00,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:49:00,263 INFO L225 Difference]: With dead ends: 2664 [2022-01-18 02:49:00,264 INFO L226 Difference]: Without dead ends: 2664 [2022-01-18 02:49:00,264 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-18 02:49:00,264 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-01-18 02:49:00,264 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-01-18 02:49:00,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2664 states. [2022-01-18 02:49:00,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2664 to 2664. [2022-01-18 02:49:00,302 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-01-18 02:49:00,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2664 states to 2664 states and 8430 transitions. [2022-01-18 02:49:00,308 INFO L78 Accepts]: Start accepts. Automaton has 2664 states and 8430 transitions. Word has length 99 [2022-01-18 02:49:00,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:49:00,308 INFO L470 AbstractCegarLoop]: Abstraction has 2664 states and 8430 transitions. [2022-01-18 02:49:00,309 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-01-18 02:49:00,309 INFO L276 IsEmpty]: Start isEmpty. Operand 2664 states and 8430 transitions. [2022-01-18 02:49:00,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-18 02:49:00,314 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:49:00,314 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-01-18 02:49:00,314 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-18 02:49:00,314 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 02:49:00,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:49:00,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1192942030, now seen corresponding path program 1 times [2022-01-18 02:49:00,315 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:49:00,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653088393] [2022-01-18 02:49:00,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:49:00,315 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:49:00,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:49:00,466 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:49:00,466 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:49:00,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653088393] [2022-01-18 02:49:00,466 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653088393] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 02:49:00,466 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 02:49:00,466 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-18 02:49:00,466 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458355593] [2022-01-18 02:49:00,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 02:49:00,468 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-18 02:49:00,468 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:49:00,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-18 02:49:00,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-01-18 02:49:00,471 INFO L87 Difference]: Start difference. First operand 2664 states and 8430 transitions. Second operand has 10 states, 10 states have (on average 11.0) internal successors, (110), 10 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:49:00,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:49:00,694 INFO L93 Difference]: Finished difference Result 3417 states and 10384 transitions. [2022-01-18 02:49:00,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-18 02:49:00,695 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.0) internal successors, (110), 10 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-01-18 02:49:00,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:49:00,705 INFO L225 Difference]: With dead ends: 3417 [2022-01-18 02:49:00,705 INFO L226 Difference]: Without dead ends: 2670 [2022-01-18 02:49:00,705 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2022-01-18 02:49:00,706 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 421 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-18 02:49:00,706 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [421 Valid, 666 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-18 02:49:00,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2670 states. [2022-01-18 02:49:00,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2670 to 2665. [2022-01-18 02:49:00,743 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-01-18 02:49:00,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2665 states to 2665 states and 8431 transitions. [2022-01-18 02:49:00,749 INFO L78 Accepts]: Start accepts. Automaton has 2665 states and 8431 transitions. Word has length 110 [2022-01-18 02:49:00,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:49:00,750 INFO L470 AbstractCegarLoop]: Abstraction has 2665 states and 8431 transitions. [2022-01-18 02:49:00,750 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.0) internal successors, (110), 10 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:49:00,750 INFO L276 IsEmpty]: Start isEmpty. Operand 2665 states and 8431 transitions. [2022-01-18 02:49:00,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-01-18 02:49:00,755 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:49:00,755 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-01-18 02:49:00,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-18 02:49:00,755 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 02:49:00,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:49:00,756 INFO L85 PathProgramCache]: Analyzing trace with hash 623162093, now seen corresponding path program 1 times [2022-01-18 02:49:00,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:49:00,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460154835] [2022-01-18 02:49:00,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:49:00,756 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:49:00,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:49:00,992 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:49:00,992 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:49:00,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460154835] [2022-01-18 02:49:00,992 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460154835] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:49:00,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636291893] [2022-01-18 02:49:00,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:49:00,992 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:49:00,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:49:00,994 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 02:49:00,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-18 02:49:01,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:49:01,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 60 conjunts are in the unsatisfiable core [2022-01-18 02:49:01,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:49:01,138 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-01-18 02:49:01,167 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-18 02:49:01,168 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-01-18 02:49:01,203 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-18 02:49:01,203 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-01-18 02:49:01,690 INFO L353 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-01-18 02:49:01,691 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-01-18 02:49:01,836 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-01-18 02:49:02,158 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-01-18 02:49:02,253 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-01-18 02:49:02,483 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-01-18 02:49:02,554 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-01-18 02:49:02,616 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:49:02,616 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:49:02,772 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-01-18 02:49:02,899 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))))))) (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 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-01-18 02:49:04,163 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:49:04,163 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 76 [2022-01-18 02:49:04,185 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:49:04,186 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-01-18 02:49:04,210 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:49:04,211 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-01-18 02:49:04,228 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-01-18 02:49:04,243 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:49:04,244 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-01-18 02:49:04,256 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-01-18 02:49:11,095 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-01-18 02:49:11,095 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636291893] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:49:11,095 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:49:11,095 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 26, 27] total 61 [2022-01-18 02:49:11,095 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190878921] [2022-01-18 02:49:11,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:49:11,096 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-01-18 02:49:11,096 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:49:11,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-01-18 02:49:11,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=405, Invalid=3005, Unknown=20, NotChecked=230, Total=3660 [2022-01-18 02:49:11,098 INFO L87 Difference]: Start difference. First operand 2665 states and 8431 transitions. Second operand has 61 states, 61 states have (on average 4.737704918032787) internal successors, (289), 61 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:49:13,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:49:13,615 INFO L93 Difference]: Finished difference Result 17245 states and 57586 transitions. [2022-01-18 02:49:13,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-01-18 02:49:13,615 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 4.737704918032787) internal successors, (289), 61 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 117 [2022-01-18 02:49:13,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:49:13,640 INFO L225 Difference]: With dead ends: 17245 [2022-01-18 02:49:13,640 INFO L226 Difference]: Without dead ends: 9094 [2022-01-18 02:49:13,642 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 195 SyntacticMatches, 5 SemanticMatches, 99 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3073 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1472, Invalid=8218, Unknown=20, NotChecked=390, Total=10100 [2022-01-18 02:49:13,642 INFO L933 BasicCegarLoop]: 124 mSDtfsCounter, 3041 mSDsluCounter, 2536 mSDsCounter, 0 mSdLazyCounter, 827 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3041 SdHoareTripleChecker+Valid, 2335 SdHoareTripleChecker+Invalid, 2740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1731 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-18 02:49:13,643 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3041 Valid, 2335 Invalid, 2740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 827 Invalid, 0 Unknown, 1731 Unchecked, 0.5s Time] [2022-01-18 02:49:13,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9094 states. [2022-01-18 02:49:13,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9094 to 4109. [2022-01-18 02:49:13,744 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-01-18 02:49:13,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4109 states to 4109 states and 12559 transitions. [2022-01-18 02:49:13,754 INFO L78 Accepts]: Start accepts. Automaton has 4109 states and 12559 transitions. Word has length 117 [2022-01-18 02:49:13,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:49:13,754 INFO L470 AbstractCegarLoop]: Abstraction has 4109 states and 12559 transitions. [2022-01-18 02:49:13,755 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 4.737704918032787) internal successors, (289), 61 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:49:13,755 INFO L276 IsEmpty]: Start isEmpty. Operand 4109 states and 12559 transitions. [2022-01-18 02:49:13,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-01-18 02:49:13,764 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:49:13,764 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-01-18 02:49:13,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-01-18 02:49:13,979 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-01-18 02:49:13,979 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 02:49:13,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:49:13,980 INFO L85 PathProgramCache]: Analyzing trace with hash 869306436, now seen corresponding path program 2 times [2022-01-18 02:49:13,980 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:49:13,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975781294] [2022-01-18 02:49:13,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:49:13,980 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:49:14,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:49:14,035 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 02:49:14,035 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:49:14,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975781294] [2022-01-18 02:49:14,035 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975781294] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 02:49:14,035 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 02:49:14,035 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-18 02:49:14,036 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459683442] [2022-01-18 02:49:14,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 02:49:14,036 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-18 02:49:14,036 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:49:14,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-18 02:49:14,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-18 02:49:14,036 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-01-18 02:49:14,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:49:14,095 INFO L93 Difference]: Finished difference Result 9989 states and 31073 transitions. [2022-01-18 02:49:14,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-18 02:49:14,095 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-01-18 02:49:14,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:49:14,119 INFO L225 Difference]: With dead ends: 9989 [2022-01-18 02:49:14,119 INFO L226 Difference]: Without dead ends: 9917 [2022-01-18 02:49:14,119 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-01-18 02:49:14,119 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-01-18 02:49:14,120 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-01-18 02:49:14,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9917 states. [2022-01-18 02:49:14,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9917 to 8399. [2022-01-18 02:49:14,274 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-01-18 02:49:14,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8399 states to 8399 states and 26240 transitions. [2022-01-18 02:49:14,293 INFO L78 Accepts]: Start accepts. Automaton has 8399 states and 26240 transitions. Word has length 120 [2022-01-18 02:49:14,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:49:14,294 INFO L470 AbstractCegarLoop]: Abstraction has 8399 states and 26240 transitions. [2022-01-18 02:49:14,294 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-01-18 02:49:14,294 INFO L276 IsEmpty]: Start isEmpty. Operand 8399 states and 26240 transitions. [2022-01-18 02:49:14,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-18 02:49:14,309 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:49:14,309 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-01-18 02:49:14,309 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-18 02:49:14,309 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 02:49:14,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:49:14,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1680628146, now seen corresponding path program 1 times [2022-01-18 02:49:14,310 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:49:14,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669430916] [2022-01-18 02:49:14,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:49:14,310 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:49:14,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:49:14,358 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-18 02:49:14,358 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:49:14,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669430916] [2022-01-18 02:49:14,358 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669430916] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 02:49:14,358 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 02:49:14,358 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-18 02:49:14,358 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903933904] [2022-01-18 02:49:14,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 02:49:14,359 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-18 02:49:14,359 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:49:14,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-18 02:49:14,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-18 02:49:14,359 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-01-18 02:49:14,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:49:14,398 INFO L93 Difference]: Finished difference Result 8199 states and 25593 transitions. [2022-01-18 02:49:14,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-18 02:49:14,399 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-01-18 02:49:14,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:49:14,416 INFO L225 Difference]: With dead ends: 8199 [2022-01-18 02:49:14,416 INFO L226 Difference]: Without dead ends: 8199 [2022-01-18 02:49:14,417 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-01-18 02:49:14,418 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-01-18 02:49:14,418 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-01-18 02:49:14,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8199 states. [2022-01-18 02:49:14,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8199 to 8149. [2022-01-18 02:49:14,578 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-01-18 02:49:14,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8149 states to 8149 states and 25465 transitions. [2022-01-18 02:49:14,599 INFO L78 Accepts]: Start accepts. Automaton has 8149 states and 25465 transitions. Word has length 124 [2022-01-18 02:49:14,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:49:14,600 INFO L470 AbstractCegarLoop]: Abstraction has 8149 states and 25465 transitions. [2022-01-18 02:49:14,600 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-01-18 02:49:14,600 INFO L276 IsEmpty]: Start isEmpty. Operand 8149 states and 25465 transitions. [2022-01-18 02:49:14,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-01-18 02:49:14,614 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:49:14,614 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-01-18 02:49:14,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-18 02:49:14,615 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 02:49:14,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:49:14,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1813426250, now seen corresponding path program 3 times [2022-01-18 02:49:14,615 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:49:14,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281079877] [2022-01-18 02:49:14,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:49:14,616 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:49:14,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:49:14,703 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-18 02:49:14,703 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:49:14,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281079877] [2022-01-18 02:49:14,703 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281079877] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 02:49:14,704 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 02:49:14,704 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-18 02:49:14,704 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782743000] [2022-01-18 02:49:14,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 02:49:14,704 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-18 02:49:14,704 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:49:14,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-18 02:49:14,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-18 02:49:14,705 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-01-18 02:49:14,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:49:14,780 INFO L93 Difference]: Finished difference Result 13321 states and 41453 transitions. [2022-01-18 02:49:14,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-18 02:49:14,781 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-01-18 02:49:14,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:49:14,814 INFO L225 Difference]: With dead ends: 13321 [2022-01-18 02:49:14,814 INFO L226 Difference]: Without dead ends: 13321 [2022-01-18 02:49:14,814 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-01-18 02:49:14,815 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-01-18 02:49:14,815 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-01-18 02:49:14,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13321 states. [2022-01-18 02:49:14,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13321 to 12814. [2022-01-18 02:49:15,008 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-01-18 02:49:15,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12814 states to 12814 states and 39893 transitions. [2022-01-18 02:49:15,038 INFO L78 Accepts]: Start accepts. Automaton has 12814 states and 39893 transitions. Word has length 131 [2022-01-18 02:49:15,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:49:15,038 INFO L470 AbstractCegarLoop]: Abstraction has 12814 states and 39893 transitions. [2022-01-18 02:49:15,038 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-01-18 02:49:15,038 INFO L276 IsEmpty]: Start isEmpty. Operand 12814 states and 39893 transitions. [2022-01-18 02:49:15,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-01-18 02:49:15,057 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:49:15,057 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-01-18 02:49:15,057 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-18 02:49:15,057 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 02:49:15,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:49:15,058 INFO L85 PathProgramCache]: Analyzing trace with hash 154122346, now seen corresponding path program 1 times [2022-01-18 02:49:15,058 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:49:15,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28265628] [2022-01-18 02:49:15,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:49:15,058 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:49:15,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:49:15,386 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-18 02:49:15,387 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:49:15,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28265628] [2022-01-18 02:49:15,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28265628] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:49:15,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [867420726] [2022-01-18 02:49:15,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:49:15,387 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:49:15,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:49:15,388 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 02:49:15,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-18 02:49:15,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:49:15,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 21 conjunts are in the unsatisfiable core [2022-01-18 02:49:15,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:49:15,916 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:49:15,917 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:49:16,418 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-18 02:49:16,419 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [867420726] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:49:16,419 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:49:16,419 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 9] total 31 [2022-01-18 02:49:16,419 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439102331] [2022-01-18 02:49:16,419 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:49:16,419 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-01-18 02:49:16,419 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:49:16,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-01-18 02:49:16,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=761, Unknown=0, NotChecked=0, Total=930 [2022-01-18 02:49:16,420 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-01-18 02:49:17,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:49:17,058 INFO L93 Difference]: Finished difference Result 14512 states and 46254 transitions. [2022-01-18 02:49:17,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-01-18 02:49:17,058 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-01-18 02:49:17,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:49:17,092 INFO L225 Difference]: With dead ends: 14512 [2022-01-18 02:49:17,092 INFO L226 Difference]: Without dead ends: 13555 [2022-01-18 02:49:17,093 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=549, Invalid=1803, Unknown=0, NotChecked=0, Total=2352 [2022-01-18 02:49:17,093 INFO L933 BasicCegarLoop]: 196 mSDtfsCounter, 1377 mSDsluCounter, 1785 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1377 SdHoareTripleChecker+Valid, 1854 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-18 02:49:17,093 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1377 Valid, 1854 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-18 02:49:17,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13555 states. [2022-01-18 02:49:17,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13555 to 9707. [2022-01-18 02:49:17,249 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-01-18 02:49:17,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9707 states to 9707 states and 31229 transitions. [2022-01-18 02:49:17,270 INFO L78 Accepts]: Start accepts. Automaton has 9707 states and 31229 transitions. Word has length 131 [2022-01-18 02:49:17,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:49:17,270 INFO L470 AbstractCegarLoop]: Abstraction has 9707 states and 31229 transitions. [2022-01-18 02:49:17,270 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-01-18 02:49:17,270 INFO L276 IsEmpty]: Start isEmpty. Operand 9707 states and 31229 transitions. [2022-01-18 02:49:17,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-01-18 02:49:17,284 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:49:17,284 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-01-18 02:49:17,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-18 02:49:17,495 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-01-18 02:49:17,495 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 02:49:17,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:49:17,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1700635271, now seen corresponding path program 2 times [2022-01-18 02:49:17,496 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:49:17,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496105406] [2022-01-18 02:49:17,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:49:17,496 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:49:17,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:49:17,745 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-18 02:49:17,745 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:49:17,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496105406] [2022-01-18 02:49:17,745 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496105406] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:49:17,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293444295] [2022-01-18 02:49:17,745 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-18 02:49:17,745 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:49:17,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:49:17,746 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 02:49:17,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-18 02:49:17,825 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-18 02:49:17,825 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 02:49:17,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 63 conjunts are in the unsatisfiable core [2022-01-18 02:49:17,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:49:18,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 02:49:18,936 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-01-18 02:49:19,095 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-01-18 02:49:19,096 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-01-18 02:49:19,171 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:49:19,171 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:49:19,686 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-01-18 02:49:19,686 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-01-18 02:49:19,697 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-01-18 02:49:19,698 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-01-18 02:49:19,704 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-01-18 02:49:19,704 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-01-18 02:49:21,468 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:49:21,469 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293444295] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:49:21,469 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:49:21,469 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 26, 25] total 61 [2022-01-18 02:49:21,469 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816960868] [2022-01-18 02:49:21,469 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:49:21,469 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-01-18 02:49:21,470 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:49:21,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-01-18 02:49:21,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=3296, Unknown=2, NotChecked=0, Total=3660 [2022-01-18 02:49:21,471 INFO L87 Difference]: Start difference. First operand 9707 states and 31229 transitions. Second operand has 61 states, 61 states have (on average 5.786885245901639) internal successors, (353), 61 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:49:25,829 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))) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) is different from false [2022-01-18 02:49:35,266 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-01-18 02:49:36,450 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-01-18 02:49:36,973 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-01-18 02:49:44,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:49:44,719 INFO L93 Difference]: Finished difference Result 150060 states and 500962 transitions. [2022-01-18 02:49:44,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 314 states. [2022-01-18 02:49:44,720 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 5.786885245901639) internal successors, (353), 61 states have internal predecessors, (353), 0 states have call successors, (0), 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-01-18 02:49:44,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:49:45,267 INFO L225 Difference]: With dead ends: 150060 [2022-01-18 02:49:45,268 INFO L226 Difference]: Without dead ends: 111672 [2022-01-18 02:49:45,291 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 638 GetRequests, 250 SyntacticMatches, 29 SemanticMatches, 359 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 58502 ImplicationChecksByTransitivity, 19.8s TimeCoverageRelationStatistics Valid=12312, Invalid=114680, Unknown=116, NotChecked=2852, Total=129960 [2022-01-18 02:49:45,292 INFO L933 BasicCegarLoop]: 256 mSDtfsCounter, 6829 mSDsluCounter, 12200 mSDsCounter, 0 mSdLazyCounter, 5266 mSolverCounterSat, 865 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6829 SdHoareTripleChecker+Valid, 11005 SdHoareTripleChecker+Invalid, 9765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 865 IncrementalHoareTripleChecker+Valid, 5266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3634 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-01-18 02:49:45,308 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6829 Valid, 11005 Invalid, 9765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [865 Valid, 5266 Invalid, 0 Unknown, 3634 Unchecked, 2.9s Time] [2022-01-18 02:49:45,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111672 states. [2022-01-18 02:49:46,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111672 to 22249. [2022-01-18 02:49:46,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22249 states, 22248 states have (on average 3.1395181589356347) internal successors, (69848), 22248 states have internal predecessors, (69848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:49:46,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22249 states to 22249 states and 69848 transitions. [2022-01-18 02:49:46,599 INFO L78 Accepts]: Start accepts. Automaton has 22249 states and 69848 transitions. Word has length 138 [2022-01-18 02:49:46,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:49:46,599 INFO L470 AbstractCegarLoop]: Abstraction has 22249 states and 69848 transitions. [2022-01-18 02:49:46,599 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 5.786885245901639) internal successors, (353), 61 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:49:46,599 INFO L276 IsEmpty]: Start isEmpty. Operand 22249 states and 69848 transitions. [2022-01-18 02:49:46,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-01-18 02:49:46,628 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:49:46,629 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-01-18 02:49:46,645 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-01-18 02:49:46,844 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-01-18 02:49:46,845 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 02:49:46,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:49:46,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1880030863, now seen corresponding path program 3 times [2022-01-18 02:49:46,846 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:49:46,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593043726] [2022-01-18 02:49:46,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:49:46,846 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:49:46,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:49:47,114 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-18 02:49:47,114 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:49:47,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593043726] [2022-01-18 02:49:47,114 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593043726] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:49:47,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233696034] [2022-01-18 02:49:47,114 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-18 02:49:47,114 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:49:47,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:49:47,115 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 02:49:47,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-18 02:49:47,203 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-01-18 02:49:47,203 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 02:49:47,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 65 conjunts are in the unsatisfiable core [2022-01-18 02:49:47,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:49:48,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 02:49:48,675 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-01-18 02:49:48,750 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-01-18 02:49:48,750 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-01-18 02:49:48,841 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:49:48,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:49:48,990 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-01-18 02:49:49,017 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-01-18 02:49:49,045 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-01-18 02:49:49,087 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-01-18 02:49:49,105 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-01-18 02:49:49,141 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-01-18 02:49:49,252 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-01-18 02:49:49,252 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-01-18 02:49:49,257 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-01-18 02:49:49,261 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-01-18 02:49:51,371 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2022-01-18 02:49:51,371 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [233696034] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:49:51,371 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:49:51,371 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 29, 28] total 65 [2022-01-18 02:49:51,372 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339870954] [2022-01-18 02:49:51,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:49:51,372 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-01-18 02:49:51,372 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:49:51,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-01-18 02:49:51,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=389, Invalid=3051, Unknown=6, NotChecked=714, Total=4160 [2022-01-18 02:49:51,373 INFO L87 Difference]: Start difference. First operand 22249 states and 69848 transitions. Second operand has 65 states, 65 states have (on average 5.276923076923077) internal successors, (343), 65 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:50:00,732 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) (= c_~sum~0 0)) is different from false [2022-01-18 02:50:01,005 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-01-18 02:50:01,320 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-01-18 02:50:01,323 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) (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 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_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-01-18 02:50:01,939 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-01-18 02:50:02,369 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-01-18 02:50:06,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:50:06,719 INFO L93 Difference]: Finished difference Result 129878 states and 419277 transitions. [2022-01-18 02:50:06,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 205 states. [2022-01-18 02:50:06,720 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 5.276923076923077) internal successors, (343), 65 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-01-18 02:50:06,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:50:07,033 INFO L225 Difference]: With dead ends: 129878 [2022-01-18 02:50:07,033 INFO L226 Difference]: Without dead ends: 101989 [2022-01-18 02:50:07,035 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 518 GetRequests, 232 SyntacticMatches, 38 SemanticMatches, 248 ConstructedPredicates, 12 IntricatePredicates, 3 DeprecatedPredicates, 26325 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=7490, Invalid=48919, Unknown=45, NotChecked=5796, Total=62250 [2022-01-18 02:50:07,036 INFO L933 BasicCegarLoop]: 272 mSDtfsCounter, 6446 mSDsluCounter, 8423 mSDsCounter, 0 mSdLazyCounter, 4495 mSolverCounterSat, 830 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6446 SdHoareTripleChecker+Valid, 7844 SdHoareTripleChecker+Invalid, 12905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 830 IncrementalHoareTripleChecker+Valid, 4495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7580 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-01-18 02:50:07,036 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6446 Valid, 7844 Invalid, 12905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [830 Valid, 4495 Invalid, 0 Unknown, 7580 Unchecked, 2.3s Time] [2022-01-18 02:50:07,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101989 states. [2022-01-18 02:50:08,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101989 to 27060. [2022-01-18 02:50:08,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27060 states, 27059 states have (on average 3.1211057319191395) internal successors, (84454), 27059 states have internal predecessors, (84454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:50:08,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27060 states to 27060 states and 84454 transitions. [2022-01-18 02:50:08,539 INFO L78 Accepts]: Start accepts. Automaton has 27060 states and 84454 transitions. Word has length 138 [2022-01-18 02:50:08,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:50:08,539 INFO L470 AbstractCegarLoop]: Abstraction has 27060 states and 84454 transitions. [2022-01-18 02:50:08,539 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 5.276923076923077) internal successors, (343), 65 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:50:08,539 INFO L276 IsEmpty]: Start isEmpty. Operand 27060 states and 84454 transitions. [2022-01-18 02:50:08,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-01-18 02:50:08,572 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:50:08,573 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-01-18 02:50:08,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-18 02:50:08,773 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-01-18 02:50:08,773 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 02:50:08,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:50:08,774 INFO L85 PathProgramCache]: Analyzing trace with hash 167751433, now seen corresponding path program 4 times [2022-01-18 02:50:08,774 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:50:08,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28606584] [2022-01-18 02:50:08,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:50:08,774 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:50:08,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:50:09,181 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:50:09,181 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:50:09,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28606584] [2022-01-18 02:50:09,181 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28606584] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:50:09,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879411835] [2022-01-18 02:50:09,181 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-18 02:50:09,182 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:50:09,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:50:09,183 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 02:50:09,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-18 02:50:09,265 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-18 02:50:09,265 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 02:50:09,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 66 conjunts are in the unsatisfiable core [2022-01-18 02:50:09,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:50:09,300 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-01-18 02:50:09,520 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 02:50:09,521 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-01-18 02:50:10,784 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 43 treesize of output 41 [2022-01-18 02:50:11,007 INFO L353 Elim1Store]: treesize reduction 93, result has 7.0 percent of original size [2022-01-18 02:50:11,007 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 49 treesize of output 22 [2022-01-18 02:50:11,067 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:50:11,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:50:11,202 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_318 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_318) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (forall ((v_ArrVal_318 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_318) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1))) is different from false [2022-01-18 02:50:11,215 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (and (forall ((v_ArrVal_318 (Array Int Int))) (<= 0 (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_318) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))))) (forall ((v_ArrVal_318 (Array Int Int))) (<= (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_318) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)))) 1))) (< c_~front~0 0)) is different from false [2022-01-18 02:50:11,248 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (and (forall ((v_ArrVal_318 (Array Int Int))) (<= 0 (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_318) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))))) (forall ((v_ArrVal_318 (Array Int Int))) (<= (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_318) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)))) 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-01-18 02:50:11,292 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (= |c_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (and (forall ((v_ArrVal_318 (Array Int Int))) (<= 0 (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_318) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))))) (forall ((v_ArrVal_318 (Array Int Int))) (<= (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_318) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)))) 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-01-18 02:50:11,308 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (and (forall ((v_ArrVal_318 (Array Int Int))) (<= 0 (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_318) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))))) (forall ((v_ArrVal_318 (Array Int Int))) (<= (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_318) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)))) 1))) (= |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-01-18 02:50:11,346 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (<= c_~n~0 c_~back~0) (and (forall ((v_ArrVal_318 (Array Int Int))) (<= 0 (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_318) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))))) (forall ((v_ArrVal_318 (Array Int Int))) (<= (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_318) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)))) 1))) (< 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-01-18 02:50:11,457 INFO L353 Elim1Store]: treesize reduction 47, result has 53.0 percent of original size [2022-01-18 02:50:11,457 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 136 treesize of output 122 [2022-01-18 02:50:11,476 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-01-18 02:50:11,480 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-01-18 02:50:15,402 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-01-18 02:50:15,435 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2022-01-18 02:50:15,436 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1879411835] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:50:15,436 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:50:15,436 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 28, 28] total 73 [2022-01-18 02:50:15,438 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054541898] [2022-01-18 02:50:15,438 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:50:15,439 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-01-18 02:50:15,439 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:50:15,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-01-18 02:50:15,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=389, Invalid=4051, Unknown=6, NotChecked=810, Total=5256 [2022-01-18 02:50:15,439 INFO L87 Difference]: Start difference. First operand 27060 states and 84454 transitions. Second operand has 73 states, 73 states have (on average 4.780821917808219) internal successors, (349), 73 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-01-18 02:50:19,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:50:19,835 INFO L93 Difference]: Finished difference Result 62754 states and 195287 transitions. [2022-01-18 02:50:19,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-01-18 02:50:19,835 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 73 states have (on average 4.780821917808219) internal successors, (349), 73 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-01-18 02:50:19,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:50:20,010 INFO L225 Difference]: With dead ends: 62754 [2022-01-18 02:50:20,011 INFO L226 Difference]: Without dead ends: 62754 [2022-01-18 02:50:20,012 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 236 SyntacticMatches, 11 SemanticMatches, 136 ConstructedPredicates, 6 IntricatePredicates, 2 DeprecatedPredicates, 5626 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=2026, Invalid=15284, Unknown=6, NotChecked=1590, Total=18906 [2022-01-18 02:50:20,012 INFO L933 BasicCegarLoop]: 278 mSDtfsCounter, 2781 mSDsluCounter, 9471 mSDsCounter, 0 mSdLazyCounter, 2186 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2781 SdHoareTripleChecker+Valid, 8848 SdHoareTripleChecker+Invalid, 6414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 2186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4132 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-18 02:50:20,012 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2781 Valid, 8848 Invalid, 6414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 2186 Invalid, 0 Unknown, 4132 Unchecked, 0.9s Time] [2022-01-18 02:50:20,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62754 states. [2022-01-18 02:50:20,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62754 to 27339. [2022-01-18 02:50:20,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27339 states, 27338 states have (on average 3.1221376838100814) internal successors, (85353), 27338 states have internal predecessors, (85353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:50:20,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27339 states to 27339 states and 85353 transitions. [2022-01-18 02:50:20,785 INFO L78 Accepts]: Start accepts. Automaton has 27339 states and 85353 transitions. Word has length 138 [2022-01-18 02:50:20,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:50:20,785 INFO L470 AbstractCegarLoop]: Abstraction has 27339 states and 85353 transitions. [2022-01-18 02:50:20,786 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 4.780821917808219) internal successors, (349), 73 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-01-18 02:50:20,786 INFO L276 IsEmpty]: Start isEmpty. Operand 27339 states and 85353 transitions. [2022-01-18 02:50:20,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-01-18 02:50:20,819 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:50:20,819 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-01-18 02:50:20,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-18 02:50:21,035 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-01-18 02:50:21,036 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 02:50:21,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:50:21,036 INFO L85 PathProgramCache]: Analyzing trace with hash -2012835211, now seen corresponding path program 5 times [2022-01-18 02:50:21,036 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:50:21,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021104454] [2022-01-18 02:50:21,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:50:21,036 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:50:21,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:50:21,320 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-18 02:50:21,321 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:50:21,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021104454] [2022-01-18 02:50:21,321 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021104454] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:50:21,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110292550] [2022-01-18 02:50:21,321 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-18 02:50:21,321 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:50:21,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:50:21,323 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 02:50:21,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-18 02:50:21,414 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-01-18 02:50:21,414 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 02:50:21,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 71 conjunts are in the unsatisfiable core [2022-01-18 02:50:21,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:50:21,446 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-01-18 02:50:21,676 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 02:50:21,676 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-01-18 02:50:22,751 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 45 treesize of output 43 [2022-01-18 02:50:22,886 INFO L353 Elim1Store]: treesize reduction 99, result has 6.6 percent of original size [2022-01-18 02:50:22,886 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 20 [2022-01-18 02:50:22,961 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:50:22,961 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:50:23,199 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-01-18 02:50:23,218 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (and (forall ((v_ArrVal_356 (Array Int Int))) (<= (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_356) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))) 1)) (forall ((v_ArrVal_356 (Array Int Int))) (<= 0 (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_356) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4))))))) (<= c_~back~0 c_~front~0) (< c_~front~0 0)) is different from false [2022-01-18 02:50:23,236 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (<= (+ c_~back~0 1) c_~front~0) (and (forall ((v_ArrVal_356 (Array Int Int))) (<= (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_356) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))) 1)) (forall ((v_ArrVal_356 (Array Int Int))) (<= 0 (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_356) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4))))))) (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-01-18 02:50:23,281 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (<= (+ c_~back~0 1) c_~front~0) (and (forall ((v_ArrVal_356 (Array Int Int))) (<= (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_356) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))) 1)) (forall ((v_ArrVal_356 (Array Int Int))) (<= 0 (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_356) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4))))))) (= |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-01-18 02:50:23,300 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (<= (+ c_~back~0 1) c_~front~0) (and (forall ((v_ArrVal_356 (Array Int Int))) (<= (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_356) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))) 1)) (forall ((v_ArrVal_356 (Array Int Int))) (<= 0 (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_356) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4))))))) (= |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-01-18 02:50:23,338 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~back~0) (<= (+ c_~back~0 1) c_~front~0) (and (forall ((v_ArrVal_356 (Array Int Int))) (<= (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_356) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))) 1)) (forall ((v_ArrVal_356 (Array Int Int))) (<= 0 (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_356) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4))))))) (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-01-18 02:50:23,436 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-01-18 02:50:23,437 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-01-18 02:50:23,442 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 52 [2022-01-18 02:50:23,447 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-01-18 02:50:25,627 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-01-18 02:50:25,658 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2022-01-18 02:50:25,659 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1110292550] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:50:25,659 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:50:25,659 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 29, 28] total 67 [2022-01-18 02:50:25,659 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805353308] [2022-01-18 02:50:25,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:50:25,660 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-01-18 02:50:25,660 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:50:25,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-01-18 02:50:25,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=380, Invalid=3298, Unknown=6, NotChecked=738, Total=4422 [2022-01-18 02:50:25,661 INFO L87 Difference]: Start difference. First operand 27339 states and 85353 transitions. Second operand has 67 states, 67 states have (on average 5.164179104477612) internal successors, (346), 67 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:50:35,357 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) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (or (<= c_~n~0 c_~back~0) (<= (+ c_~back~0 1) c_~front~0) (and (forall ((v_ArrVal_356 (Array Int Int))) (<= (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_356) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))) 1)) (forall ((v_ArrVal_356 (Array Int Int))) (<= 0 (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_356) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4))))))) (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_~sum~0 1)) is different from false [2022-01-18 02:50:35,548 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) (<= 1 c_~v_assert~0) (or (<= c_~n~0 c_~back~0) (<= (+ c_~back~0 1) c_~front~0) (and (forall ((v_ArrVal_356 (Array Int Int))) (<= (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_356) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))) 1)) (forall ((v_ArrVal_356 (Array Int Int))) (<= 0 (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_356) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4))))))) (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-01-18 02:50:40,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:50:40,239 INFO L93 Difference]: Finished difference Result 104613 states and 326175 transitions. [2022-01-18 02:50:40,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 181 states. [2022-01-18 02:50:40,239 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 5.164179104477612) internal successors, (346), 67 states have internal predecessors, (346), 0 states have call successors, (0), 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-01-18 02:50:40,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:50:40,576 INFO L225 Difference]: With dead ends: 104613 [2022-01-18 02:50:40,576 INFO L226 Difference]: Without dead ends: 104613 [2022-01-18 02:50:40,580 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 551 GetRequests, 263 SyntacticMatches, 60 SemanticMatches, 228 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 23728 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=7006, Invalid=42079, Unknown=9, NotChecked=3576, Total=52670 [2022-01-18 02:50:40,581 INFO L933 BasicCegarLoop]: 322 mSDtfsCounter, 4706 mSDsluCounter, 10101 mSDsCounter, 0 mSdLazyCounter, 5036 mSolverCounterSat, 671 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4706 SdHoareTripleChecker+Valid, 9329 SdHoareTripleChecker+Invalid, 12611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 671 IncrementalHoareTripleChecker+Valid, 5036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6904 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-01-18 02:50:40,581 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4706 Valid, 9329 Invalid, 12611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [671 Valid, 5036 Invalid, 0 Unknown, 6904 Unchecked, 2.4s Time] [2022-01-18 02:50:40,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104613 states. [2022-01-18 02:50:42,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104613 to 39517. [2022-01-18 02:50:42,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39517 states, 39516 states have (on average 3.1518119242838343) internal successors, (124547), 39516 states have internal predecessors, (124547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:50:42,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39517 states to 39517 states and 124547 transitions. [2022-01-18 02:50:42,213 INFO L78 Accepts]: Start accepts. Automaton has 39517 states and 124547 transitions. Word has length 138 [2022-01-18 02:50:42,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:50:42,213 INFO L470 AbstractCegarLoop]: Abstraction has 39517 states and 124547 transitions. [2022-01-18 02:50:42,213 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 5.164179104477612) internal successors, (346), 67 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:50:42,214 INFO L276 IsEmpty]: Start isEmpty. Operand 39517 states and 124547 transitions. [2022-01-18 02:50:42,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-01-18 02:50:42,263 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:50:42,263 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-01-18 02:50:42,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-01-18 02:50:42,471 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-01-18 02:50:42,471 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 02:50:42,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:50:42,472 INFO L85 PathProgramCache]: Analyzing trace with hash 412402409, now seen corresponding path program 6 times [2022-01-18 02:50:42,472 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:50:42,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870242769] [2022-01-18 02:50:42,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:50:42,472 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:50:42,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:50:43,100 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:50:43,101 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:50:43,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870242769] [2022-01-18 02:50:43,101 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870242769] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:50:43,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2067038863] [2022-01-18 02:50:43,101 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-18 02:50:43,101 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:50:43,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:50:43,102 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 02:50:43,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-18 02:50:43,293 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-01-18 02:50:43,293 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 02:50:43,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 63 conjunts are in the unsatisfiable core [2022-01-18 02:50:43,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:50:44,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 02:50:44,342 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-01-18 02:50:44,538 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-01-18 02:50:44,538 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-01-18 02:50:44,622 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:50:44,622 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:50:45,453 INFO L353 Elim1Store]: treesize reduction 64, result has 37.9 percent of original size [2022-01-18 02:50:45,454 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 156 treesize of output 143 [2022-01-18 02:50:45,465 INFO L353 Elim1Store]: treesize reduction 41, result has 22.6 percent of original size [2022-01-18 02:50:45,465 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 101 treesize of output 80 [2022-01-18 02:50:47,342 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:50:47,343 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2067038863] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:50:47,343 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:50:47,343 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 25] total 71 [2022-01-18 02:50:47,343 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312699291] [2022-01-18 02:50:47,343 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:50:47,343 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2022-01-18 02:50:47,343 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:50:47,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2022-01-18 02:50:47,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=521, Invalid=4448, Unknown=1, NotChecked=0, Total=4970 [2022-01-18 02:50:47,344 INFO L87 Difference]: Start difference. First operand 39517 states and 124547 transitions. Second operand has 71 states, 71 states have (on average 5.070422535211268) internal successors, (360), 71 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-01-18 02:51:07,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:51:07,949 INFO L93 Difference]: Finished difference Result 191780 states and 630580 transitions. [2022-01-18 02:51:07,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 270 states. [2022-01-18 02:51:07,950 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 71 states have (on average 5.070422535211268) internal successors, (360), 71 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-01-18 02:51:07,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:51:08,584 INFO L225 Difference]: With dead ends: 191780 [2022-01-18 02:51:08,584 INFO L226 Difference]: Without dead ends: 147092 [2022-01-18 02:51:08,588 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 565 GetRequests, 231 SyntacticMatches, 6 SemanticMatches, 328 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47507 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=10493, Invalid=98038, Unknown=39, NotChecked=0, Total=108570 [2022-01-18 02:51:08,588 INFO L933 BasicCegarLoop]: 223 mSDtfsCounter, 8807 mSDsluCounter, 8243 mSDsCounter, 0 mSdLazyCounter, 4261 mSolverCounterSat, 1089 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8807 SdHoareTripleChecker+Valid, 7546 SdHoareTripleChecker+Invalid, 6214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1089 IncrementalHoareTripleChecker+Valid, 4261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 864 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-01-18 02:51:08,588 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8807 Valid, 7546 Invalid, 6214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1089 Valid, 4261 Invalid, 0 Unknown, 864 Unchecked, 2.4s Time] [2022-01-18 02:51:08,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147092 states. [2022-01-18 02:51:10,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147092 to 47649. [2022-01-18 02:51:10,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47649 states, 47648 states have (on average 3.1143174949630623) internal successors, (148391), 47648 states have internal predecessors, (148391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:51:10,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47649 states to 47649 states and 148391 transitions. [2022-01-18 02:51:10,726 INFO L78 Accepts]: Start accepts. Automaton has 47649 states and 148391 transitions. Word has length 138 [2022-01-18 02:51:10,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:51:10,726 INFO L470 AbstractCegarLoop]: Abstraction has 47649 states and 148391 transitions. [2022-01-18 02:51:10,726 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 5.070422535211268) internal successors, (360), 71 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-01-18 02:51:10,726 INFO L276 IsEmpty]: Start isEmpty. Operand 47649 states and 148391 transitions. [2022-01-18 02:51:10,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-01-18 02:51:10,782 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:51:10,782 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-01-18 02:51:10,800 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-18 02:51:10,991 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-01-18 02:51:10,992 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 02:51:10,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:51:10,992 INFO L85 PathProgramCache]: Analyzing trace with hash -547652913, now seen corresponding path program 7 times [2022-01-18 02:51:10,992 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:51:10,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5410899] [2022-01-18 02:51:10,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:51:10,992 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:51:11,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:51:12,299 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:51:12,299 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:51:12,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5410899] [2022-01-18 02:51:12,299 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5410899] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:51:12,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229011758] [2022-01-18 02:51:12,300 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-18 02:51:12,300 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:51:12,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:51:12,301 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 02:51:12,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-01-18 02:51:12,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:51:12,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 69 conjunts are in the unsatisfiable core [2022-01-18 02:51:12,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:51:13,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 02:51:13,808 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2022-01-18 02:51:13,907 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-01-18 02:51:13,907 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-01-18 02:51:14,006 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:51:14,006 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:51:14,212 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_430 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_430) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (forall ((v_ArrVal_430 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_430) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1))) (<= c_~n~0 c_~front~0) (< c_~front~0 0)) is different from false [2022-01-18 02:51:14,243 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_430 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_430) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (forall ((v_ArrVal_430 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_430) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1))) (<= c_~n~0 c_~front~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-01-18 02:51:14,273 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_430 (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_430) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))))) (forall ((v_ArrVal_430 (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_430) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) 1))) (<= c_~back~0 c_~front~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) (<= c_~n~0 (+ c_~front~0 1))) is different from false [2022-01-18 02:51:14,449 INFO L353 Elim1Store]: treesize reduction 64, result has 37.9 percent of original size [2022-01-18 02:51:14,449 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 108 [2022-01-18 02:51:14,453 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-01-18 02:51:14,458 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-01-18 02:51:16,286 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2022-01-18 02:51:16,286 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229011758] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:51:16,286 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:51:16,286 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 26, 25] total 76 [2022-01-18 02:51:16,286 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142371780] [2022-01-18 02:51:16,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:51:16,287 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2022-01-18 02:51:16,287 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:51:16,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2022-01-18 02:51:16,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=469, Invalid=4796, Unknown=3, NotChecked=432, Total=5700 [2022-01-18 02:51:16,288 INFO L87 Difference]: Start difference. First operand 47649 states and 148391 transitions. Second operand has 76 states, 76 states have (on average 4.7631578947368425) internal successors, (362), 76 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:51:22,422 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (or (and (forall ((v_ArrVal_430 (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_430) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))))) (forall ((v_ArrVal_430 (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_430) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) 1))) (<= c_~back~0 c_~front~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) (<= c_~n~0 (+ c_~front~0 1)))) is different from false [2022-01-18 02:51:22,678 WARN L838 $PredicateComparison]: unable to prove that (and (or (and (forall ((v_ArrVal_430 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_430) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (forall ((v_ArrVal_430 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_430) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1))) (<= c_~n~0 c_~front~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)) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2022-01-18 02:51:22,683 WARN L838 $PredicateComparison]: unable to prove that (and (<= 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) (or (and (forall ((v_ArrVal_430 (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_430) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))))) (forall ((v_ArrVal_430 (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_430) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) 1))) (<= c_~back~0 c_~front~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) (<= c_~n~0 (+ c_~front~0 1)))) is different from false [2022-01-18 02:51:27,394 WARN L838 $PredicateComparison]: unable to prove that (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (or (and (forall ((v_ArrVal_430 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_430) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (forall ((v_ArrVal_430 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_430) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1))) (<= c_~n~0 c_~front~0) (< c_~front~0 0))) is different from false [2022-01-18 02:51:31,919 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (not (< |c_ULTIMATE.start_main_~#t3~0#1.base| |c_#StackHeapBarrier|))) (.cse3 (* c_~back~0 4)) (.cse4 (< c_~front~0 0)) (.cse1 (<= 0 c_~sum~0)) (.cse2 (<= c_~sum~0 1))) (and (or (and .cse0 .cse1 .cse2 (= (* c_~front~0 4) .cse3)) (<= (+ c_~back~0 1) c_~front~0) .cse4 (<= 1 c_~front~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) .cse0 (<= 1 c_~v_assert~0) (or (and (forall ((v_ArrVal_430 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_430) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (forall ((v_ArrVal_430 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_430) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1))) (<= c_~n~0 c_~front~0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse3)) 1) 0)) .cse4) .cse1 .cse2)) is different from false [2022-01-18 02:51:32,138 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) (<= 1 c_~v_assert~0) (or (and (forall ((v_ArrVal_430 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_430) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (forall ((v_ArrVal_430 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_430) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1))) (<= c_~n~0 c_~front~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-01-18 02:51:32,358 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) (<= 1 c_~v_assert~0) (or (and (forall ((v_ArrVal_430 (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_430) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))))) (forall ((v_ArrVal_430 (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_430) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) 1))) (<= c_~back~0 c_~front~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) (<= c_~n~0 (+ c_~front~0 1)))) is different from false [2022-01-18 02:51:33,599 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) (<= 1 c_~v_assert~0) (or (and (forall ((v_ArrVal_430 (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_430) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))))) (forall ((v_ArrVal_430 (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_430) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) 1))) (<= c_~back~0 c_~front~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) (<= c_~n~0 (+ c_~front~0 1))) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2022-01-18 02:51:34,032 WARN L838 $PredicateComparison]: unable to prove that (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (or (and (forall ((v_ArrVal_430 (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_430) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))))) (forall ((v_ArrVal_430 (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_430) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) 1))) (<= c_~back~0 c_~front~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) (<= c_~n~0 (+ c_~front~0 1)))) is different from false [2022-01-18 02:51:36,392 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) (or (and (forall ((v_ArrVal_430 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_430) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (forall ((v_ArrVal_430 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_430) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1))) (<= c_~n~0 c_~front~0) (< c_~front~0 0)) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 1 c_~v_assert~0)) is different from false [2022-01-18 02:51:37,432 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) (or (and (forall ((v_ArrVal_430 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_430) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (forall ((v_ArrVal_430 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_430) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1))) (<= c_~n~0 c_~front~0) (< c_~front~0 0)) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2022-01-18 02:51:39,759 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_~queue~0.base)) (.cse2 (* c_~front~0 4)) (.cse6 (* c_~back~0 4)) (.cse3 (< c_~front~0 0)) (.cse7 (<= c_~n~0 (+ c_~front~0 1)))) (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (or (<= c_~n~0 c_~front~0) (let ((.cse0 (+ c_~sum~0 (select .cse1 (+ c_~queue~0.offset .cse2))))) (and (<= .cse0 1) (<= 0 .cse0))) .cse3) (or (and (forall ((v_ArrVal_430 (Array Int Int))) (<= 0 (let ((.cse4 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse4)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_430) c_~queue~0.base) (+ c_~queue~0.offset .cse4 4)))))) (forall ((v_ArrVal_430 (Array Int Int))) (<= (let ((.cse5 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse5)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_430) c_~queue~0.base) (+ c_~queue~0.offset .cse5 4)))) 1))) (<= c_~back~0 c_~front~0) (not (= (+ (select .cse1 (+ c_~queue~0.offset .cse6)) 1) 0)) .cse3 .cse7) (or (<= (+ c_~back~0 1) c_~front~0) (and (<= 0 c_~sum~0) (<= c_~sum~0 1) (= .cse2 .cse6) (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|))) (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0) .cse3 .cse7))) is different from false [2022-01-18 02:51:41,176 WARN L838 $PredicateComparison]: unable to prove that (and (or (and (forall ((v_ArrVal_430 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_430) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (forall ((v_ArrVal_430 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_430) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1))) (<= c_~n~0 c_~front~0) (< c_~front~0 0)) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= |c_thread1Thread1of1ForFork1_~cond~0#1| 1) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2022-01-18 02:51:41,827 WARN L838 $PredicateComparison]: unable to prove that (and (or (and (forall ((v_ArrVal_430 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_430) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (forall ((v_ArrVal_430 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_430) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1))) (<= c_~n~0 c_~front~0) (< c_~front~0 0)) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2022-01-18 02:51:42,749 WARN L838 $PredicateComparison]: unable to prove that (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (or (and (forall ((v_ArrVal_430 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_430) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (forall ((v_ArrVal_430 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_430) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1))) (<= c_~n~0 c_~front~0) (< c_~front~0 0)) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2022-01-18 02:51:45,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:51:45,527 INFO L93 Difference]: Finished difference Result 299834 states and 961976 transitions. [2022-01-18 02:51:45,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 311 states. [2022-01-18 02:51:45,528 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 76 states have (on average 4.7631578947368425) internal successors, (362), 76 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 138 [2022-01-18 02:51:45,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:51:46,575 INFO L225 Difference]: With dead ends: 299834 [2022-01-18 02:51:46,575 INFO L226 Difference]: Without dead ends: 250789 [2022-01-18 02:51:46,579 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 621 GetRequests, 230 SyntacticMatches, 21 SemanticMatches, 370 ConstructedPredicates, 18 IntricatePredicates, 0 DeprecatedPredicates, 54414 ImplicationChecksByTransitivity, 25.3s TimeCoverageRelationStatistics Valid=12171, Invalid=112537, Unknown=326, NotChecked=12978, Total=138012 [2022-01-18 02:51:46,580 INFO L933 BasicCegarLoop]: 275 mSDtfsCounter, 7191 mSDsluCounter, 11432 mSDsCounter, 0 mSdLazyCounter, 6167 mSolverCounterSat, 882 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7191 SdHoareTripleChecker+Valid, 10481 SdHoareTripleChecker+Invalid, 12976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 882 IncrementalHoareTripleChecker+Valid, 6167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5927 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-01-18 02:51:46,580 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7191 Valid, 10481 Invalid, 12976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [882 Valid, 6167 Invalid, 0 Unknown, 5927 Unchecked, 3.2s Time] [2022-01-18 02:51:46,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250789 states. [2022-01-18 02:51:49,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250789 to 63256. [2022-01-18 02:51:49,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63256 states, 63255 states have (on average 3.088024662082049) internal successors, (195333), 63255 states have internal predecessors, (195333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:51:49,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63256 states to 63256 states and 195333 transitions. [2022-01-18 02:51:49,746 INFO L78 Accepts]: Start accepts. Automaton has 63256 states and 195333 transitions. Word has length 138 [2022-01-18 02:51:49,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:51:49,746 INFO L470 AbstractCegarLoop]: Abstraction has 63256 states and 195333 transitions. [2022-01-18 02:51:49,746 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 76 states have (on average 4.7631578947368425) internal successors, (362), 76 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:51:49,747 INFO L276 IsEmpty]: Start isEmpty. Operand 63256 states and 195333 transitions. [2022-01-18 02:51:49,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-01-18 02:51:49,817 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:51:49,817 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-01-18 02:51:49,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-01-18 02:51:50,019 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-01-18 02:51:50,020 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 02:51:50,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:51:50,020 INFO L85 PathProgramCache]: Analyzing trace with hash 721946978, now seen corresponding path program 8 times [2022-01-18 02:51:50,020 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:51:50,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411267234] [2022-01-18 02:51:50,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:51:50,020 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:51:50,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:51:50,085 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-18 02:51:50,086 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:51:50,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411267234] [2022-01-18 02:51:50,086 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411267234] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:51:50,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422707718] [2022-01-18 02:51:50,086 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-18 02:51:50,086 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:51:50,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:51:50,087 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 02:51:50,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-01-18 02:51:50,481 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-18 02:51:50,481 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 02:51:50,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-18 02:51:50,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:51:50,723 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-18 02:51:50,723 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:51:51,100 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-18 02:51:51,100 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1422707718] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:51:51,101 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:51:51,101 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 7] total 11 [2022-01-18 02:51:51,101 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483610471] [2022-01-18 02:51:51,101 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:51:51,101 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-18 02:51:51,101 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:51:51,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-18 02:51:51,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-01-18 02:51:51,102 INFO L87 Difference]: Start difference. First operand 63256 states and 195333 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-01-18 02:51:51,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:51:51,784 INFO L93 Difference]: Finished difference Result 101749 states and 315414 transitions. [2022-01-18 02:51:51,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-18 02:51:51,784 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-01-18 02:51:51,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:51:52,207 INFO L225 Difference]: With dead ends: 101749 [2022-01-18 02:51:52,207 INFO L226 Difference]: Without dead ends: 101677 [2022-01-18 02:51:52,208 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2022-01-18 02:51:52,208 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 513 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-18 02:51:52,209 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [513 Valid, 368 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-18 02:51:52,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101677 states. [2022-01-18 02:51:53,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101677 to 88542. [2022-01-18 02:51:54,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88542 states, 88541 states have (on average 3.1010379372268213) internal successors, (274569), 88541 states have internal predecessors, (274569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:51:54,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88542 states to 88542 states and 274569 transitions. [2022-01-18 02:51:54,296 INFO L78 Accepts]: Start accepts. Automaton has 88542 states and 274569 transitions. Word has length 141 [2022-01-18 02:51:54,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:51:54,297 INFO L470 AbstractCegarLoop]: Abstraction has 88542 states and 274569 transitions. [2022-01-18 02:51:54,297 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-01-18 02:51:54,297 INFO L276 IsEmpty]: Start isEmpty. Operand 88542 states and 274569 transitions. [2022-01-18 02:51:54,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-01-18 02:51:54,719 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:51:54,719 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-01-18 02:51:54,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-01-18 02:51:54,919 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-01-18 02:51:54,920 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 02:51:54,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:51:54,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1948735542, now seen corresponding path program 9 times [2022-01-18 02:51:54,920 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:51:54,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548434921] [2022-01-18 02:51:54,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:51:54,920 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:51:54,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:51:55,991 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:51:55,992 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:51:55,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548434921] [2022-01-18 02:51:55,992 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548434921] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:51:55,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [510104452] [2022-01-18 02:51:55,992 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-18 02:51:55,992 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:51:55,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:51:55,993 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 02:51:55,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-01-18 02:51:56,196 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-01-18 02:51:56,197 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 02:51:56,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 56 conjunts are in the unsatisfiable core [2022-01-18 02:51:56,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:51:56,226 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-01-18 02:51:56,343 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 02:51:56,344 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-01-18 02:51:57,174 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-01-18 02:51:57,228 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-01-18 02:51:57,228 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-01-18 02:51:57,313 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-18 02:51:57,314 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:51:57,467 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_508 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_508) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (forall ((v_ArrVal_508 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_508) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1))) is different from false [2022-01-18 02:51:57,485 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_508 (Array Int Int))) (<= (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_508) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))) 1)) (forall ((v_ArrVal_508 (Array Int Int))) (<= 0 (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_508) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4))))))) is different from false [2022-01-18 02:51:57,627 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-01-18 02:51:57,627 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-01-18 02:51:57,630 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-01-18 02:51:57,633 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-01-18 02:51:58,742 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-01-18 02:51:58,785 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 5 not checked. [2022-01-18 02:51:58,786 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [510104452] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:51:58,786 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:51:58,786 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 20, 17] total 62 [2022-01-18 02:51:58,786 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070961258] [2022-01-18 02:51:58,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:51:58,786 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-01-18 02:51:58,786 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:51:58,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-01-18 02:51:58,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=3250, Unknown=2, NotChecked=234, Total=3782 [2022-01-18 02:51:58,787 INFO L87 Difference]: Start difference. First operand 88542 states and 274569 transitions. Second operand has 62 states, 62 states have (on average 5.629032258064516) internal successors, (349), 62 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-01-18 02:52:14,731 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_508 (Array Int Int))) (<= (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_508) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))) 1)) (<= 0 c_~sum~0) (<= c_~sum~0 1) (forall ((v_ArrVal_508 (Array Int Int))) (<= 0 (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_508) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4))))))) is different from false [2022-01-18 02:52:14,735 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (and (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= .cse0 1) (forall ((v_ArrVal_508 (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_508) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) 1)) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 0 .cse0) (forall ((v_ArrVal_508 (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_508) c_~queue~0.base) (+ c_~queue~0.offset .cse2 4)))))) (= c_~sum~0 0))) is different from false [2022-01-18 02:52:15,317 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (forall ((v_ArrVal_508 (Array Int Int))) (<= (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_508) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))) 1)) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 0 c_~sum~0) (<= c_~sum~0 1) (forall ((v_ArrVal_508 (Array Int Int))) (<= 0 (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_508) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4))))))) is different from false [2022-01-18 02:52:16,001 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_508 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_508) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (forall ((v_ArrVal_508 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_508) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2022-01-18 02:52:16,974 WARN L838 $PredicateComparison]: unable to prove that (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (forall ((v_ArrVal_508 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_508) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (forall ((v_ArrVal_508 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_508) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1))) is different from false [2022-01-18 02:52:18,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:52:18,024 INFO L93 Difference]: Finished difference Result 332465 states and 1043825 transitions. [2022-01-18 02:52:18,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 255 states. [2022-01-18 02:52:18,025 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 5.629032258064516) internal successors, (349), 62 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 145 [2022-01-18 02:52:18,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:52:19,002 INFO L225 Difference]: With dead ends: 332465 [2022-01-18 02:52:19,002 INFO L226 Difference]: Without dead ends: 270019 [2022-01-18 02:52:19,005 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 609 GetRequests, 277 SyntacticMatches, 34 SemanticMatches, 298 ConstructedPredicates, 7 IntricatePredicates, 5 DeprecatedPredicates, 40529 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=9828, Invalid=75687, Unknown=69, NotChecked=4116, Total=89700 [2022-01-18 02:52:19,005 INFO L933 BasicCegarLoop]: 391 mSDtfsCounter, 3106 mSDsluCounter, 12998 mSDsCounter, 0 mSdLazyCounter, 6729 mSolverCounterSat, 249 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3106 SdHoareTripleChecker+Valid, 12078 SdHoareTripleChecker+Invalid, 10258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 249 IncrementalHoareTripleChecker+Valid, 6729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3280 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-01-18 02:52:19,005 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3106 Valid, 12078 Invalid, 10258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [249 Valid, 6729 Invalid, 0 Unknown, 3280 Unchecked, 3.0s Time] [2022-01-18 02:52:19,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270019 states. [2022-01-18 02:52:23,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270019 to 110959. [2022-01-18 02:52:23,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110959 states, 110958 states have (on average 3.121081850790389) internal successors, (346309), 110958 states have internal predecessors, (346309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:52:23,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110959 states to 110959 states and 346309 transitions. [2022-01-18 02:52:23,787 INFO L78 Accepts]: Start accepts. Automaton has 110959 states and 346309 transitions. Word has length 145 [2022-01-18 02:52:23,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:52:23,788 INFO L470 AbstractCegarLoop]: Abstraction has 110959 states and 346309 transitions. [2022-01-18 02:52:23,788 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 5.629032258064516) internal successors, (349), 62 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-01-18 02:52:23,788 INFO L276 IsEmpty]: Start isEmpty. Operand 110959 states and 346309 transitions. [2022-01-18 02:52:24,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-01-18 02:52:24,309 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:52:24,309 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-01-18 02:52:24,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-01-18 02:52:24,510 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-01-18 02:52:24,510 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 02:52:24,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:52:24,510 INFO L85 PathProgramCache]: Analyzing trace with hash 503837740, now seen corresponding path program 10 times [2022-01-18 02:52:24,510 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:52:24,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814021066] [2022-01-18 02:52:24,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:52:24,511 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:52:24,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:52:26,183 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:52:26,183 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:52:26,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814021066] [2022-01-18 02:52:26,183 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814021066] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:52:26,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092969471] [2022-01-18 02:52:26,183 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-18 02:52:26,184 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:52:26,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:52:26,184 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 02:52:26,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-01-18 02:52:26,290 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-18 02:52:26,290 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 02:52:26,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 75 conjunts are in the unsatisfiable core [2022-01-18 02:52:26,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:52:26,322 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-01-18 02:52:26,757 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 02:52:26,758 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-01-18 02:52:28,194 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-01-18 02:52:28,288 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-01-18 02:52:28,288 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-01-18 02:52:28,365 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:52:28,365 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:52:28,530 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_550 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_550) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (forall ((v_ArrVal_550 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_550) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))))))) is different from false [2022-01-18 02:52:28,625 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (<= c_~back~0 c_~front~0) (and (forall ((v_ArrVal_550 (Array Int Int))) (<= (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_550) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))) 1)) (forall ((v_ArrVal_550 (Array Int Int))) (<= 0 (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_550) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4))))))) (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-01-18 02:52:28,675 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (<= c_~back~0 c_~front~0) (= |c_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (and (forall ((v_ArrVal_550 (Array Int Int))) (<= (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_550) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))) 1)) (forall ((v_ArrVal_550 (Array Int Int))) (<= 0 (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_550) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4))))))) (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-01-18 02:52:28,695 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (<= c_~back~0 c_~front~0) (and (forall ((v_ArrVal_550 (Array Int Int))) (<= (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_550) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))) 1)) (forall ((v_ArrVal_550 (Array Int Int))) (<= 0 (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_550) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4))))))) (= |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-01-18 02:52:28,737 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~back~0) (<= c_~back~0 c_~front~0) (and (forall ((v_ArrVal_550 (Array Int Int))) (<= (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_550) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))) 1)) (forall ((v_ArrVal_550 (Array Int Int))) (<= 0 (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_550) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4))))))) (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-01-18 02:52:28,832 INFO L353 Elim1Store]: treesize reduction 64, result has 37.9 percent of original size [2022-01-18 02:52:28,833 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 108 [2022-01-18 02:52:28,837 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-01-18 02:52:28,840 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-01-18 02:52:31,510 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-01-18 02:52:31,543 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2022-01-18 02:52:31,543 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092969471] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:52:31,543 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:52:31,543 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 30, 30] total 87 [2022-01-18 02:52:31,544 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104422059] [2022-01-18 02:52:31,544 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:52:31,544 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 87 states [2022-01-18 02:52:31,544 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:52:31,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2022-01-18 02:52:31,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=505, Invalid=6152, Unknown=5, NotChecked=820, Total=7482 [2022-01-18 02:52:31,545 INFO L87 Difference]: Start difference. First operand 110959 states and 346309 transitions. Second operand has 87 states, 87 states have (on average 4.275862068965517) internal successors, (372), 87 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:52:39,266 WARN L838 $PredicateComparison]: unable to prove that (and (or (<= c_~n~0 c_~back~0) (<= c_~back~0 c_~front~0) (and (forall ((v_ArrVal_550 (Array Int Int))) (<= (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_550) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))) 1)) (forall ((v_ArrVal_550 (Array Int Int))) (<= 0 (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_550) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4))))))) (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_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2022-01-18 02:52:39,616 WARN L838 $PredicateComparison]: unable to prove that (and (or (<= c_~n~0 c_~back~0) (<= c_~back~0 c_~front~0) (and (forall ((v_ArrVal_550 (Array Int Int))) (<= (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_550) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))) 1)) (forall ((v_ArrVal_550 (Array Int Int))) (<= 0 (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_550) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4))))))) (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-01-18 02:52:40,772 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_#StackHeapBarrier| 1))) (and (or (<= c_~n~0 c_~back~0) (<= c_~back~0 c_~front~0) (and (forall ((v_ArrVal_550 (Array Int Int))) (<= (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_550) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))) 1)) (forall ((v_ArrVal_550 (Array Int Int))) (<= 0 (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_550) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4))))))) (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_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (<= .cse2 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= 1 c_~v_assert~0) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t3~0#1.base|) 1) (<= .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base|) (= c_~sum~0 0) (<= .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base|))) is different from false [2022-01-18 02:52:42,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:52:42,962 INFO L93 Difference]: Finished difference Result 231082 states and 719972 transitions. [2022-01-18 02:52:42,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2022-01-18 02:52:42,962 INFO L78 Accepts]: Start accepts. Automaton has has 87 states, 87 states have (on average 4.275862068965517) internal successors, (372), 87 states have internal predecessors, (372), 0 states have call successors, (0), 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-01-18 02:52:42,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:52:43,673 INFO L225 Difference]: With dead ends: 231082 [2022-01-18 02:52:43,674 INFO L226 Difference]: Without dead ends: 224827 [2022-01-18 02:52:43,675 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 248 SyntacticMatches, 20 SemanticMatches, 179 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 11066 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=3660, Invalid=26105, Unknown=23, NotChecked=2792, Total=32580 [2022-01-18 02:52:43,675 INFO L933 BasicCegarLoop]: 247 mSDtfsCounter, 4384 mSDsluCounter, 8295 mSDsCounter, 0 mSdLazyCounter, 3680 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4384 SdHoareTripleChecker+Valid, 7653 SdHoareTripleChecker+Invalid, 8116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 3680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4162 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-01-18 02:52:43,675 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4384 Valid, 7653 Invalid, 8116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 3680 Invalid, 0 Unknown, 4162 Unchecked, 1.7s Time] [2022-01-18 02:52:43,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224827 states. [2022-01-18 02:52:46,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224827 to 127921. [2022-01-18 02:52:47,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127921 states, 127920 states have (on average 3.1325515947467166) internal successors, (400716), 127920 states have internal predecessors, (400716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:52:47,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127921 states to 127921 states and 400716 transitions. [2022-01-18 02:52:47,486 INFO L78 Accepts]: Start accepts. Automaton has 127921 states and 400716 transitions. Word has length 145 [2022-01-18 02:52:47,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:52:47,487 INFO L470 AbstractCegarLoop]: Abstraction has 127921 states and 400716 transitions. [2022-01-18 02:52:47,487 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 87 states, 87 states have (on average 4.275862068965517) internal successors, (372), 87 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:52:47,487 INFO L276 IsEmpty]: Start isEmpty. Operand 127921 states and 400716 transitions. [2022-01-18 02:52:47,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-01-18 02:52:47,616 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:52:47,616 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-01-18 02:52:47,632 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-01-18 02:52:47,816 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-01-18 02:52:47,817 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 02:52:47,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:52:47,817 INFO L85 PathProgramCache]: Analyzing trace with hash -190497132, now seen corresponding path program 11 times [2022-01-18 02:52:47,817 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:52:47,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775450137] [2022-01-18 02:52:47,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:52:47,817 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:52:47,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:52:48,433 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-18 02:52:48,433 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:52:48,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775450137] [2022-01-18 02:52:48,433 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775450137] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:52:48,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117038555] [2022-01-18 02:52:48,433 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-18 02:52:48,434 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:52:48,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:52:48,435 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 02:52:48,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-01-18 02:52:48,566 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-01-18 02:52:48,567 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 02:52:48,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 42 conjunts are in the unsatisfiable core [2022-01-18 02:52:48,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:52:48,987 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 31 treesize of output 13 [2022-01-18 02:52:49,073 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 40 treesize of output 16 [2022-01-18 02:52:49,141 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-18 02:52:49,141 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:52:49,250 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:52:49,251 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 42 treesize of output 34 [2022-01-18 02:52:49,375 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:52:49,376 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 45 [2022-01-18 02:52:49,863 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-18 02:52:49,864 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117038555] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:52:49,864 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:52:49,864 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 10] total 24 [2022-01-18 02:52:49,864 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628096668] [2022-01-18 02:52:49,864 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:52:49,865 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-18 02:52:49,865 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:52:49,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-18 02:52:49,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=462, Unknown=0, NotChecked=0, Total=552 [2022-01-18 02:52:49,865 INFO L87 Difference]: Start difference. First operand 127921 states and 400716 transitions. Second operand has 24 states, 24 states have (on average 11.416666666666666) internal successors, (274), 24 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:52:51,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:52:51,972 INFO L93 Difference]: Finished difference Result 203938 states and 641858 transitions. [2022-01-18 02:52:51,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-01-18 02:52:51,973 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 11.416666666666666) internal successors, (274), 24 states have internal predecessors, (274), 0 states have call successors, (0), 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-01-18 02:52:51,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:52:52,908 INFO L225 Difference]: With dead ends: 203938 [2022-01-18 02:52:52,909 INFO L226 Difference]: Without dead ends: 193582 [2022-01-18 02:52:52,909 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 272 SyntacticMatches, 7 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1010 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=623, Invalid=2917, Unknown=0, NotChecked=0, Total=3540 [2022-01-18 02:52:52,909 INFO L933 BasicCegarLoop]: 230 mSDtfsCounter, 1039 mSDsluCounter, 2101 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1039 SdHoareTripleChecker+Valid, 2150 SdHoareTripleChecker+Invalid, 1073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-18 02:52:52,910 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1039 Valid, 2150 Invalid, 1073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 926 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-18 02:52:53,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193582 states. [2022-01-18 02:52:55,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193582 to 127996. [2022-01-18 02:52:56,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127996 states, 127995 states have (on average 3.132348919879683) internal successors, (400925), 127995 states have internal predecessors, (400925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:52:56,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127996 states to 127996 states and 400925 transitions. [2022-01-18 02:52:56,507 INFO L78 Accepts]: Start accepts. Automaton has 127996 states and 400925 transitions. Word has length 145 [2022-01-18 02:52:56,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:52:56,507 INFO L470 AbstractCegarLoop]: Abstraction has 127996 states and 400925 transitions. [2022-01-18 02:52:56,507 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 11.416666666666666) internal successors, (274), 24 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:52:56,508 INFO L276 IsEmpty]: Start isEmpty. Operand 127996 states and 400925 transitions. [2022-01-18 02:52:57,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-01-18 02:52:57,123 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:52:57,123 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-01-18 02:52:57,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-01-18 02:52:57,324 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-01-18 02:52:57,324 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 02:52:57,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:52:57,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1169933966, now seen corresponding path program 12 times [2022-01-18 02:52:57,324 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:52:57,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196256420] [2022-01-18 02:52:57,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:52:57,325 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:52:57,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:52:57,560 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-18 02:52:57,560 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:52:57,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196256420] [2022-01-18 02:52:57,561 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196256420] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:52:57,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440659964] [2022-01-18 02:52:57,561 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-18 02:52:57,561 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:52:57,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:52:57,562 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 02:52:57,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-01-18 02:52:57,666 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-01-18 02:52:57,666 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 02:52:57,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 56 conjunts are in the unsatisfiable core [2022-01-18 02:52:57,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:52:57,698 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-01-18 02:52:57,832 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 02:52:57,832 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-01-18 02:52:58,464 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 46 treesize of output 44 [2022-01-18 02:52:58,546 INFO L353 Elim1Store]: treesize reduction 48, result has 5.9 percent of original size [2022-01-18 02:52:58,546 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 52 treesize of output 21 [2022-01-18 02:52:58,613 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-18 02:52:58,614 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:52:58,749 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_632 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_632) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (forall ((v_ArrVal_632 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_632) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))))))) is different from false [2022-01-18 02:52:58,995 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-01-18 02:52:58,996 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-01-18 02:52:58,999 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-01-18 02:52:59,002 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-01-18 02:53:00,149 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-01-18 02:53:00,183 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 1 not checked. [2022-01-18 02:53:00,183 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [440659964] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:53:00,183 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:53:00,183 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 20, 17] total 40 [2022-01-18 02:53:00,183 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538530065] [2022-01-18 02:53:00,183 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:53:00,184 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-01-18 02:53:00,184 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:53:00,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-01-18 02:53:00,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1324, Unknown=1, NotChecked=74, Total=1560 [2022-01-18 02:53:00,185 INFO L87 Difference]: Start difference. First operand 127996 states and 400925 transitions. Second operand has 40 states, 40 states have (on average 7.175) internal successors, (287), 40 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:53:05,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:53:05,454 INFO L93 Difference]: Finished difference Result 266731 states and 836805 transitions. [2022-01-18 02:53:05,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2022-01-18 02:53:05,454 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 7.175) internal successors, (287), 40 states have internal predecessors, (287), 0 states have call successors, (0), 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-01-18 02:53:05,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:53:06,599 INFO L225 Difference]: With dead ends: 266731 [2022-01-18 02:53:06,599 INFO L226 Difference]: Without dead ends: 215531 [2022-01-18 02:53:06,600 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 275 SyntacticMatches, 7 SemanticMatches, 132 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6125 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=2106, Invalid=15434, Unknown=20, NotChecked=262, Total=17822 [2022-01-18 02:53:06,600 INFO L933 BasicCegarLoop]: 282 mSDtfsCounter, 1720 mSDsluCounter, 5853 mSDsCounter, 0 mSdLazyCounter, 1917 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1720 SdHoareTripleChecker+Valid, 5611 SdHoareTripleChecker+Invalid, 3809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 1917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1759 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-18 02:53:06,600 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1720 Valid, 5611 Invalid, 3809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 1917 Invalid, 0 Unknown, 1759 Unchecked, 0.8s Time] [2022-01-18 02:53:06,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215531 states. [2022-01-18 02:53:10,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215531 to 123322. [2022-01-18 02:53:10,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123322 states, 123321 states have (on average 3.127099196406127) internal successors, (385637), 123321 states have internal predecessors, (385637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:53:10,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123322 states to 123322 states and 385637 transitions. [2022-01-18 02:53:10,564 INFO L78 Accepts]: Start accepts. Automaton has 123322 states and 385637 transitions. Word has length 145 [2022-01-18 02:53:10,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:53:10,564 INFO L470 AbstractCegarLoop]: Abstraction has 123322 states and 385637 transitions. [2022-01-18 02:53:10,565 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 7.175) internal successors, (287), 40 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:53:10,565 INFO L276 IsEmpty]: Start isEmpty. Operand 123322 states and 385637 transitions. [2022-01-18 02:53:10,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-01-18 02:53:10,702 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:53:10,702 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-01-18 02:53:10,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-01-18 02:53:10,903 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-01-18 02:53:10,903 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 02:53:10,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:53:10,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1258748306, now seen corresponding path program 13 times [2022-01-18 02:53:10,904 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:53:10,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589475241] [2022-01-18 02:53:10,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:53:10,904 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:53:10,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:53:14,972 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:53:14,972 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:53:14,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589475241] [2022-01-18 02:53:14,972 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589475241] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:53:14,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341692663] [2022-01-18 02:53:14,973 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-18 02:53:14,973 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:53:14,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:53:14,974 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 02:53:14,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-01-18 02:53:15,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:53:15,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 74 conjunts are in the unsatisfiable core [2022-01-18 02:53:15,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:53:16,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 02:53:16,690 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-01-18 02:53:16,773 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-01-18 02:53:16,773 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 16 [2022-01-18 02:53:16,886 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:53:16,886 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:53:17,091 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_673 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_673) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (forall ((v_ArrVal_673 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_673) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))))))) is different from false [2022-01-18 02:53:17,203 WARN L838 $PredicateComparison]: unable to prove that (or (= |c_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (and (forall ((v_ArrVal_673 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_673) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (forall ((v_ArrVal_673 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_673) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))))))) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0))) is different from false [2022-01-18 02:53:17,214 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_673 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_673) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (forall ((v_ArrVal_673 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_673) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))))))) (= |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))) is different from false [2022-01-18 02:53:17,239 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~back~0) (and (forall ((v_ArrVal_673 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_673) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (forall ((v_ArrVal_673 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_673) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))))))) (< c_~back~0 0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0))) is different from false [2022-01-18 02:53:17,259 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_673 (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_673) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))))) (forall ((v_ArrVal_673 (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_673) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) 1))) (<= c_~n~0 c_~back~0) (<= c_~back~0 c_~front~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-01-18 02:53:17,339 INFO L353 Elim1Store]: treesize reduction 64, result has 37.9 percent of original size [2022-01-18 02:53:17,339 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 108 [2022-01-18 02:53:17,343 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-01-18 02:53:17,345 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-01-18 02:53:19,533 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2022-01-18 02:53:19,534 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1341692663] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:53:19,534 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:53:19,534 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 31, 30] total 88 [2022-01-18 02:53:19,534 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712373660] [2022-01-18 02:53:19,534 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:53:19,534 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 88 states [2022-01-18 02:53:19,534 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:53:19,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2022-01-18 02:53:19,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=549, Invalid=6272, Unknown=5, NotChecked=830, Total=7656 [2022-01-18 02:53:19,535 INFO L87 Difference]: Start difference. First operand 123322 states and 385637 transitions. Second operand has 88 states, 88 states have (on average 4.3522727272727275) internal successors, (383), 88 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:53:31,776 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| c_~queue~0.base))) (let ((.cse1 (+ c_~sum~0 (select .cse4 (+ c_~queue~0.offset (* c_~front~0 4))))) (.cse0 (+ |c_#StackHeapBarrier| 1))) (and (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= .cse1 1) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 0 .cse1) (<= 1 c_~v_assert~0) (<= .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base|) (= c_~sum~0 0) (or (and (forall ((v_ArrVal_673 (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_673) c_~queue~0.base) (+ c_~queue~0.offset .cse2 4)))))) (forall ((v_ArrVal_673 (Array Int Int))) (<= (let ((.cse3 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse3)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_673) c_~queue~0.base) (+ c_~queue~0.offset .cse3 4)))) 1))) (<= c_~n~0 c_~back~0) (<= c_~back~0 c_~front~0) (not (= (+ (select .cse4 (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) (<= .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base|)))) is different from false [2022-01-18 02:53:35,544 WARN L838 $PredicateComparison]: unable to prove that (and (<= 0 c_~sum~0) (<= c_~sum~0 1) (or (<= c_~n~0 c_~back~0) (and (forall ((v_ArrVal_673 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_673) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (forall ((v_ArrVal_673 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_673) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))))))) (< c_~back~0 0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)))) is different from false [2022-01-18 02:53:35,549 WARN L838 $PredicateComparison]: unable to prove that (and (<= 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) (or (and (forall ((v_ArrVal_673 (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_673) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))))) (forall ((v_ArrVal_673 (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_673) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) 1))) (<= c_~n~0 c_~back~0) (<= c_~back~0 c_~front~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-01-18 02:53:44,292 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) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1) (or (and (forall ((v_ArrVal_673 (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_673) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))))) (forall ((v_ArrVal_673 (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_673) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) 1))) (<= c_~n~0 c_~back~0) (<= c_~back~0 c_~front~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-01-18 02:53:45,274 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) (<= 1 c_~v_assert~0) (or (<= c_~n~0 c_~back~0) (and (forall ((v_ArrVal_673 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_673) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (forall ((v_ArrVal_673 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_673) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))))))) (< c_~back~0 0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)))) is different from false [2022-01-18 02:53:46,571 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_~back~0 4))) (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 (not (< |c_ULTIMATE.start_main_~#t3~0#1.base| |c_#StackHeapBarrier|)) (<= 0 c_~sum~0) (<= c_~sum~0 1) (= (* c_~front~0 4) .cse0)) (<= (+ c_~back~0 1) c_~front~0) (< c_~front~0 0) (<= 2 c_~back~0)) (<= 1 c_~v_assert~0) (= c_~sum~0 0) (or (<= c_~n~0 c_~back~0) (and (forall ((v_ArrVal_673 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_673) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (forall ((v_ArrVal_673 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_673) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))))))) (< c_~back~0 0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)) 1) 0))))) is different from false [2022-01-18 02:53:47,586 WARN L838 $PredicateComparison]: unable to prove that (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (forall ((v_ArrVal_673 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_673) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (forall ((v_ArrVal_673 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_673) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))))))) is different from false [2022-01-18 02:54:09,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 351 states. [2022-01-18 02:54:09,929 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 774 GetRequests, 264 SyntacticMatches, 96 SemanticMatches, 413 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 84857 ImplicationChecksByTransitivity, 45.4s TimeCoverageRelationStatistics Valid=16224, Invalid=145603, Unknown=227, NotChecked=9756, Total=171810 [2022-01-18 02:54:09,930 INFO L933 BasicCegarLoop]: 410 mSDtfsCounter, 9977 mSDsluCounter, 15961 mSDsCounter, 0 mSdLazyCounter, 9054 mSolverCounterSat, 1314 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9977 SdHoareTripleChecker+Valid, 14798 SdHoareTripleChecker+Invalid, 17944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1314 IncrementalHoareTripleChecker+Valid, 9054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7576 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-01-18 02:54:09,930 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9977 Valid, 14798 Invalid, 17944 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1314 Valid, 9054 Invalid, 0 Unknown, 7576 Unchecked, 5.1s Time] [2022-01-18 02:54:09,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-01-18 02:54:10,131 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:54:10,131 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: at most one deprecated predicate at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:980) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:388) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:868) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:784) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:462) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-01-18 02:54:10,133 INFO L158 Benchmark]: Toolchain (without parser) took 312396.34ms. Allocated memory was 369.1MB in the beginning and 13.4GB in the end (delta: 13.1GB). Free memory was 314.6MB in the beginning and 7.2GB in the end (delta: -6.9GB). Peak memory consumption was 6.2GB. Max. memory is 16.0GB. [2022-01-18 02:54:10,133 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 369.1MB. Free memory is still 331.8MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-18 02:54:10,133 INFO L158 Benchmark]: CACSL2BoogieTranslator took 214.36ms. Allocated memory was 369.1MB in the beginning and 476.1MB in the end (delta: 107.0MB). Free memory was 314.5MB in the beginning and 447.5MB in the end (delta: -133.1MB). Peak memory consumption was 8.8MB. Max. memory is 16.0GB. [2022-01-18 02:54:10,134 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.49ms. Allocated memory is still 476.1MB. Free memory was 447.5MB in the beginning and 445.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-18 02:54:10,134 INFO L158 Benchmark]: Boogie Preprocessor took 20.59ms. Allocated memory is still 476.1MB. Free memory was 445.5MB in the beginning and 444.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-18 02:54:10,134 INFO L158 Benchmark]: RCFGBuilder took 373.56ms. Allocated memory is still 476.1MB. Free memory was 443.4MB in the beginning and 422.4MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. [2022-01-18 02:54:10,134 INFO L158 Benchmark]: TraceAbstraction took 311756.86ms. Allocated memory was 476.1MB in the beginning and 13.4GB in the end (delta: 13.0GB). Free memory was 421.3MB in the beginning and 7.2GB in the end (delta: -6.8GB). Peak memory consumption was 6.2GB. Max. memory is 16.0GB. [2022-01-18 02:54:10,135 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 369.1MB. Free memory is still 331.8MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 214.36ms. Allocated memory was 369.1MB in the beginning and 476.1MB in the end (delta: 107.0MB). Free memory was 314.5MB in the beginning and 447.5MB in the end (delta: -133.1MB). Peak memory consumption was 8.8MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 26.49ms. Allocated memory is still 476.1MB. Free memory was 447.5MB in the beginning and 445.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 20.59ms. Allocated memory is still 476.1MB. Free memory was 445.5MB in the beginning and 444.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 373.56ms. Allocated memory is still 476.1MB. Free memory was 443.4MB in the beginning and 422.4MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. * TraceAbstraction took 311756.86ms. Allocated memory was 476.1MB in the beginning and 13.4GB in the end (delta: 13.0GB). Free memory was 421.3MB in the beginning and 7.2GB in the end (delta: -6.8GB). Peak memory consumption was 6.2GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: at most one deprecated predicate de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: at most one deprecated predicate: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:980) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-01-18 02:54:10,172 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...