/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-array-sum-alt.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 14:12:23,381 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 14:12:23,392 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 14:12:23,429 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 14:12:23,430 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 14:12:23,432 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 14:12:23,434 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 14:12:23,438 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 14:12:23,439 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 14:12:23,442 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 14:12:23,443 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 14:12:23,444 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 14:12:23,444 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 14:12:23,445 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 14:12:23,446 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 14:12:23,448 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 14:12:23,449 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 14:12:23,449 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 14:12:23,451 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 14:12:23,455 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 14:12:23,455 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 14:12:23,456 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 14:12:23,457 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 14:12:23,458 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 14:12:23,462 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 14:12:23,462 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 14:12:23,462 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 14:12:23,464 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 14:12:23,464 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 14:12:23,464 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 14:12:23,465 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 14:12:23,465 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 14:12:23,466 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 14:12:23,467 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 14:12:23,468 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 14:12:23,468 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 14:12:23,468 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 14:12:23,468 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 14:12:23,469 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 14:12:23,469 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 14:12:23,469 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 14:12:23,470 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2022-03-15 14:12:23,498 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 14:12:23,498 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 14:12:23,499 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-15 14:12:23,499 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-15 14:12:23,500 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 14:12:23,500 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 14:12:23,500 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 14:12:23,500 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 14:12:23,500 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 14:12:23,500 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 14:12:23,501 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 14:12:23,501 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 14:12:23,501 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 14:12:23,501 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 14:12:23,501 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 14:12:23,501 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 14:12:23,501 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 14:12:23,502 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 14:12:23,502 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 14:12:23,502 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 14:12:23,502 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 14:12:23,502 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 14:12:23,502 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 14:12:23,502 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 14:12:23,503 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 14:12:23,503 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 14:12:23,503 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 14:12:23,503 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-15 14:12:23,503 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 14:12:23,503 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 14:12:23,503 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 14:12:23,503 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-15 14:12:23,504 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 14:12:23,504 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-03-15 14:12:23,673 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 14:12:23,692 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 14:12:23,694 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 14:12:23,695 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 14:12:23,699 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 14:12:23,700 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-array-sum-alt.wvr.c [2022-03-15 14:12:23,740 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e1113531/321cc045d9594b95ba07ce595f840f1c/FLAG6ca54e442 [2022-03-15 14:12:24,100 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 14:12:24,100 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum-alt.wvr.c [2022-03-15 14:12:24,105 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e1113531/321cc045d9594b95ba07ce595f840f1c/FLAG6ca54e442 [2022-03-15 14:12:24,520 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e1113531/321cc045d9594b95ba07ce595f840f1c [2022-03-15 14:12:24,521 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 14:12:24,522 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 14:12:24,527 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 14:12:24,527 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 14:12:24,530 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 14:12:24,530 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 02:12:24" (1/1) ... [2022-03-15 14:12:24,532 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dd2518b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:12:24, skipping insertion in model container [2022-03-15 14:12:24,532 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 02:12:24" (1/1) ... [2022-03-15 14:12:24,537 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 14:12:24,554 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 14:12:24,771 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-more-array-sum-alt.wvr.c[2761,2774] [2022-03-15 14:12:24,784 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 14:12:24,789 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 14:12:24,821 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-more-array-sum-alt.wvr.c[2761,2774] [2022-03-15 14:12:24,824 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 14:12:24,835 INFO L208 MainTranslator]: Completed translation [2022-03-15 14:12:24,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:12:24 WrapperNode [2022-03-15 14:12:24,836 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 14:12:24,837 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 14:12:24,837 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 14:12:24,837 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 14:12:24,841 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:12:24" (1/1) ... [2022-03-15 14:12:24,857 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:12:24" (1/1) ... [2022-03-15 14:12:24,888 INFO L137 Inliner]: procedures = 25, calls = 51, calls flagged for inlining = 12, calls inlined = 16, statements flattened = 200 [2022-03-15 14:12:24,888 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 14:12:24,889 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 14:12:24,889 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 14:12:24,889 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 14:12:24,895 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:12:24" (1/1) ... [2022-03-15 14:12:24,895 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:12:24" (1/1) ... [2022-03-15 14:12:24,903 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:12:24" (1/1) ... [2022-03-15 14:12:24,903 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:12:24" (1/1) ... [2022-03-15 14:12:24,913 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:12:24" (1/1) ... [2022-03-15 14:12:24,922 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:12:24" (1/1) ... [2022-03-15 14:12:24,924 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:12:24" (1/1) ... [2022-03-15 14:12:24,925 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 14:12:24,926 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 14:12:24,926 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 14:12:24,926 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 14:12:24,934 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:12:24" (1/1) ... [2022-03-15 14:12:24,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 14:12:24,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:12:24,958 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-15 14:12:24,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-15 14:12:24,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 14:12:24,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 14:12:24,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 14:12:24,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 14:12:24,985 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 14:12:24,985 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 14:12:24,986 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 14:12:24,986 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 14:12:24,986 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-15 14:12:24,986 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-15 14:12:24,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 14:12:24,986 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-03-15 14:12:24,986 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-03-15 14:12:24,986 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-15 14:12:24,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 14:12:24,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 14:12:24,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 14:12:24,987 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-15 14:12:25,098 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 14:12:25,100 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 14:12:25,414 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 14:12:25,505 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 14:12:25,506 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-03-15 14:12:25,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 02:12:25 BoogieIcfgContainer [2022-03-15 14:12:25,507 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 14:12:25,508 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 14:12:25,508 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 14:12:25,510 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 14:12:25,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 02:12:24" (1/3) ... [2022-03-15 14:12:25,511 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dc67570 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 02:12:25, skipping insertion in model container [2022-03-15 14:12:25,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:12:24" (2/3) ... [2022-03-15 14:12:25,511 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dc67570 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 02:12:25, skipping insertion in model container [2022-03-15 14:12:25,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 02:12:25" (3/3) ... [2022-03-15 14:12:25,512 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum-alt.wvr.c [2022-03-15 14:12:25,516 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 14:12:25,517 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-15 14:12:25,517 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 14:12:25,517 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 14:12:25,557 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,558 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,558 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,558 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,558 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,558 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,559 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,559 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,559 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,559 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,559 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,559 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,559 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,559 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,559 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,559 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,559 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,559 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,560 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,560 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,560 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,561 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,561 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,561 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,562 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,562 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,562 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,562 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,562 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,562 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,562 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,562 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,563 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,563 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,563 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,563 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,563 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,563 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,563 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,564 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,564 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,564 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,564 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,564 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,564 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,565 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,565 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,565 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,565 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,565 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,565 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,566 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,566 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,566 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,566 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,566 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,567 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~tmp~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,567 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,567 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,567 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,567 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,567 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,567 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,567 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,567 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,568 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,568 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,568 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~tmp~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,568 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,568 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,568 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,569 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,569 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,569 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,569 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,569 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,570 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~tmp~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,570 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~tmp~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,570 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,570 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,570 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,570 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,570 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,572 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,572 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,572 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,573 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,575 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,579 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,580 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,580 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,580 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,580 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,580 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,584 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,584 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,584 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,584 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,584 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,584 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,584 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,584 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,584 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,585 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,585 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~tmp~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,585 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,585 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,585 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,585 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,586 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,586 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,586 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,586 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,586 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,586 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,586 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~tmp~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,586 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,586 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,586 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,586 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,587 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~tmp~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,587 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~tmp~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,587 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,587 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,587 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,587 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,587 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,588 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,588 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,588 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,588 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,588 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,590 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,590 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,590 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,590 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,591 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,591 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,591 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,591 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,591 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,591 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,591 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,591 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,591 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,591 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,592 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,592 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,592 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,592 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,592 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,592 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,593 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,593 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,593 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,593 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,593 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,593 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,593 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~tmp~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,593 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,594 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,594 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,594 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,594 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,594 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,594 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,594 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,594 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,594 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,594 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,595 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,595 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~tmp~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,595 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,595 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:25,597 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-03-15 14:12:25,637 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 14:12:25,644 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 14:12:25,644 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-03-15 14:12:25,657 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 154 places, 156 transitions, 336 flow [2022-03-15 14:12:25,875 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 5072 states, 5071 states have (on average 3.8171958193650166) internal successors, (19357), 5071 states have internal predecessors, (19357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:12:25,891 INFO L276 IsEmpty]: Start isEmpty. Operand has 5072 states, 5071 states have (on average 3.8171958193650166) internal successors, (19357), 5071 states have internal predecessors, (19357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:12:25,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 14:12:25,930 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:12:25,930 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] [2022-03-15 14:12:25,931 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:12:25,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:12:25,935 INFO L85 PathProgramCache]: Analyzing trace with hash -131448580, now seen corresponding path program 1 times [2022-03-15 14:12:25,940 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:12:25,940 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373437734] [2022-03-15 14:12:25,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:12:25,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:12:26,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:12:26,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:12:26,112 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:12:26,113 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373437734] [2022-03-15 14:12:26,113 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373437734] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 14:12:26,113 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 14:12:26,113 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 14:12:26,114 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659256056] [2022-03-15 14:12:26,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 14:12:26,118 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-03-15 14:12:26,118 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:12:26,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-03-15 14:12:26,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-15 14:12:26,161 INFO L87 Difference]: Start difference. First operand has 5072 states, 5071 states have (on average 3.8171958193650166) internal successors, (19357), 5071 states have internal predecessors, (19357), 0 states have call successors, (0), 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 52.5) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:12:26,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:12:26,257 INFO L93 Difference]: Finished difference Result 5072 states and 17963 transitions. [2022-03-15 14:12:26,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 14:12:26,260 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 52.5) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2022-03-15 14:12:26,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:12:26,305 INFO L225 Difference]: With dead ends: 5072 [2022-03-15 14:12:26,305 INFO L226 Difference]: Without dead ends: 5068 [2022-03-15 14:12:26,307 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-15 14:12:26,309 INFO L933 BasicCegarLoop]: 125 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, 125 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 14:12:26,310 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 14:12:26,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5068 states. [2022-03-15 14:12:26,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5068 to 5068. [2022-03-15 14:12:26,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5068 states, 5067 states have (on average 3.544306295638445) internal successors, (17959), 5067 states have internal predecessors, (17959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:12:26,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5068 states to 5068 states and 17959 transitions. [2022-03-15 14:12:26,565 INFO L78 Accepts]: Start accepts. Automaton has 5068 states and 17959 transitions. Word has length 105 [2022-03-15 14:12:26,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:12:26,565 INFO L470 AbstractCegarLoop]: Abstraction has 5068 states and 17959 transitions. [2022-03-15 14:12:26,566 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 52.5) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:12:26,566 INFO L276 IsEmpty]: Start isEmpty. Operand 5068 states and 17959 transitions. [2022-03-15 14:12:26,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 14:12:26,579 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:12:26,580 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] [2022-03-15 14:12:26,580 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 14:12:26,580 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:12:26,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:12:26,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1737784380, now seen corresponding path program 1 times [2022-03-15 14:12:26,582 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:12:26,582 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138152716] [2022-03-15 14:12:26,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:12:26,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:12:26,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:12:26,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:12:26,893 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:12:26,893 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138152716] [2022-03-15 14:12:26,893 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138152716] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 14:12:26,893 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 14:12:26,893 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-15 14:12:26,893 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085007381] [2022-03-15 14:12:26,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 14:12:26,894 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 14:12:26,894 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:12:26,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 14:12:26,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-15 14:12:26,895 INFO L87 Difference]: Start difference. First operand 5068 states and 17959 transitions. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:12:27,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:12:27,077 INFO L93 Difference]: Finished difference Result 9970 states and 35356 transitions. [2022-03-15 14:12:27,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 14:12:27,077 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2022-03-15 14:12:27,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:12:27,172 INFO L225 Difference]: With dead ends: 9970 [2022-03-15 14:12:27,172 INFO L226 Difference]: Without dead ends: 9820 [2022-03-15 14:12:27,172 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-03-15 14:12:27,173 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 174 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 14:12:27,173 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [174 Valid, 477 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 14:12:27,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9820 states. [2022-03-15 14:12:27,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9820 to 5678. [2022-03-15 14:12:27,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5678 states, 5677 states have (on average 3.5317949621278846) internal successors, (20050), 5677 states have internal predecessors, (20050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:12:27,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5678 states to 5678 states and 20050 transitions. [2022-03-15 14:12:27,388 INFO L78 Accepts]: Start accepts. Automaton has 5678 states and 20050 transitions. Word has length 105 [2022-03-15 14:12:27,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:12:27,391 INFO L470 AbstractCegarLoop]: Abstraction has 5678 states and 20050 transitions. [2022-03-15 14:12:27,391 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:12:27,391 INFO L276 IsEmpty]: Start isEmpty. Operand 5678 states and 20050 transitions. [2022-03-15 14:12:27,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-03-15 14:12:27,411 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:12:27,411 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] [2022-03-15 14:12:27,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 14:12:27,412 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:12:27,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:12:27,412 INFO L85 PathProgramCache]: Analyzing trace with hash -957278848, now seen corresponding path program 1 times [2022-03-15 14:12:27,412 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:12:27,412 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461852190] [2022-03-15 14:12:27,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:12:27,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:12:27,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:12:27,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:12:27,616 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:12:27,617 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461852190] [2022-03-15 14:12:27,617 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461852190] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 14:12:27,617 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 14:12:27,617 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 14:12:27,617 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843574176] [2022-03-15 14:12:27,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 14:12:27,619 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 14:12:27,619 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:12:27,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 14:12:27,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-03-15 14:12:27,620 INFO L87 Difference]: Start difference. First operand 5678 states and 20050 transitions. Second operand has 10 states, 10 states have (on average 11.1) internal successors, (111), 10 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:12:27,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:12:27,954 INFO L93 Difference]: Finished difference Result 8818 states and 30445 transitions. [2022-03-15 14:12:27,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 14:12:27,954 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.1) internal successors, (111), 10 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2022-03-15 14:12:27,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:12:28,029 INFO L225 Difference]: With dead ends: 8818 [2022-03-15 14:12:28,029 INFO L226 Difference]: Without dead ends: 8728 [2022-03-15 14:12:28,029 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2022-03-15 14:12:28,030 INFO L933 BasicCegarLoop]: 127 mSDtfsCounter, 554 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 14:12:28,031 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [554 Valid, 675 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 14:12:28,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8728 states. [2022-03-15 14:12:28,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8728 to 6938. [2022-03-15 14:12:28,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6938 states, 6937 states have (on average 3.5180913939743403) internal successors, (24405), 6937 states have internal predecessors, (24405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:12:28,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6938 states to 6938 states and 24405 transitions. [2022-03-15 14:12:28,281 INFO L78 Accepts]: Start accepts. Automaton has 6938 states and 24405 transitions. Word has length 111 [2022-03-15 14:12:28,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:12:28,281 INFO L470 AbstractCegarLoop]: Abstraction has 6938 states and 24405 transitions. [2022-03-15 14:12:28,281 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.1) internal successors, (111), 10 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:12:28,281 INFO L276 IsEmpty]: Start isEmpty. Operand 6938 states and 24405 transitions. [2022-03-15 14:12:28,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-03-15 14:12:28,302 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:12:28,302 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] [2022-03-15 14:12:28,302 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 14:12:28,303 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:12:28,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:12:28,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1189826400, now seen corresponding path program 1 times [2022-03-15 14:12:28,303 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:12:28,304 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472768540] [2022-03-15 14:12:28,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:12:28,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:12:28,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:12:28,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:12:28,568 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:12:28,568 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472768540] [2022-03-15 14:12:28,568 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472768540] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 14:12:28,568 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 14:12:28,568 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 14:12:28,568 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604585448] [2022-03-15 14:12:28,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 14:12:28,569 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 14:12:28,569 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:12:28,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 14:12:28,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-03-15 14:12:28,569 INFO L87 Difference]: Start difference. First operand 6938 states and 24405 transitions. Second operand has 10 states, 10 states have (on average 11.1) internal successors, (111), 10 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:12:29,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:12:29,000 INFO L93 Difference]: Finished difference Result 7558 states and 25776 transitions. [2022-03-15 14:12:29,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 14:12:29,001 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.1) internal successors, (111), 10 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2022-03-15 14:12:29,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:12:29,026 INFO L225 Difference]: With dead ends: 7558 [2022-03-15 14:12:29,027 INFO L226 Difference]: Without dead ends: 7294 [2022-03-15 14:12:29,027 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2022-03-15 14:12:29,028 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 564 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 14:12:29,028 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [564 Valid, 635 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 14:12:29,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7294 states. [2022-03-15 14:12:29,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7294 to 6848. [2022-03-15 14:12:29,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6848 states, 6847 states have (on average 3.465897473345991) internal successors, (23731), 6847 states have internal predecessors, (23731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:12:29,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6848 states to 6848 states and 23731 transitions. [2022-03-15 14:12:29,285 INFO L78 Accepts]: Start accepts. Automaton has 6848 states and 23731 transitions. Word has length 111 [2022-03-15 14:12:29,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:12:29,286 INFO L470 AbstractCegarLoop]: Abstraction has 6848 states and 23731 transitions. [2022-03-15 14:12:29,286 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.1) internal successors, (111), 10 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:12:29,286 INFO L276 IsEmpty]: Start isEmpty. Operand 6848 states and 23731 transitions. [2022-03-15 14:12:29,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-03-15 14:12:29,300 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:12:29,300 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] [2022-03-15 14:12:29,300 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-15 14:12:29,300 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:12:29,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:12:29,301 INFO L85 PathProgramCache]: Analyzing trace with hash 318459928, now seen corresponding path program 1 times [2022-03-15 14:12:29,301 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:12:29,301 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879015332] [2022-03-15 14:12:29,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:12:29,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:12:29,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:12:29,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:12:29,359 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:12:29,359 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879015332] [2022-03-15 14:12:29,359 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879015332] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 14:12:29,359 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 14:12:29,359 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-15 14:12:29,359 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208775009] [2022-03-15 14:12:29,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 14:12:29,360 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 14:12:29,360 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:12:29,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 14:12:29,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-03-15 14:12:29,360 INFO L87 Difference]: Start difference. First operand 6848 states and 23731 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:12:29,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:12:29,453 INFO L93 Difference]: Finished difference Result 5971 states and 20798 transitions. [2022-03-15 14:12:29,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 14:12:29,453 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2022-03-15 14:12:29,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:12:29,470 INFO L225 Difference]: With dead ends: 5971 [2022-03-15 14:12:29,470 INFO L226 Difference]: Without dead ends: 5684 [2022-03-15 14:12:29,470 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-03-15 14:12:29,474 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 379 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 14:12:29,475 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [379 Valid, 393 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 14:12:29,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5684 states. [2022-03-15 14:12:29,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5684 to 5679. [2022-03-15 14:12:29,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5679 states, 5678 states have (on average 3.5313490665727367) internal successors, (20051), 5678 states have internal predecessors, (20051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:12:29,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5679 states to 5679 states and 20051 transitions. [2022-03-15 14:12:29,641 INFO L78 Accepts]: Start accepts. Automaton has 5679 states and 20051 transitions. Word has length 111 [2022-03-15 14:12:29,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:12:29,641 INFO L470 AbstractCegarLoop]: Abstraction has 5679 states and 20051 transitions. [2022-03-15 14:12:29,641 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:12:29,641 INFO L276 IsEmpty]: Start isEmpty. Operand 5679 states and 20051 transitions. [2022-03-15 14:12:29,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-03-15 14:12:29,653 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:12:29,653 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, 1] [2022-03-15 14:12:29,653 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-15 14:12:29,653 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:12:29,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:12:29,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1466674770, now seen corresponding path program 1 times [2022-03-15 14:12:29,654 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:12:29,654 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554303769] [2022-03-15 14:12:29,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:12:29,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:12:29,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:12:29,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:12:29,735 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:12:29,735 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554303769] [2022-03-15 14:12:29,735 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554303769] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:12:29,735 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126182056] [2022-03-15 14:12:29,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:12:29,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:12:29,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:12:29,737 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 14:12:29,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-15 14:12:29,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:12:29,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 14:12:29,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:12:30,120 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:12:30,121 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:12:30,373 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:12:30,373 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1126182056] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 14:12:30,373 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 14:12:30,374 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-03-15 14:12:30,374 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891966849] [2022-03-15 14:12:30,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 14:12:30,374 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 14:12:30,374 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:12:30,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 14:12:30,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-03-15 14:12:30,375 INFO L87 Difference]: Start difference. First operand 5679 states and 20051 transitions. Second operand has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:12:30,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:12:30,466 INFO L93 Difference]: Finished difference Result 5775 states and 20516 transitions. [2022-03-15 14:12:30,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 14:12:30,467 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 0 states have call successors, (0), 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 118 [2022-03-15 14:12:30,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:12:30,484 INFO L225 Difference]: With dead ends: 5775 [2022-03-15 14:12:30,484 INFO L226 Difference]: Without dead ends: 5775 [2022-03-15 14:12:30,486 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 228 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-03-15 14:12:30,489 INFO L933 BasicCegarLoop]: 140 mSDtfsCounter, 248 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 14:12:30,489 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [248 Valid, 335 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 14:12:30,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5775 states. [2022-03-15 14:12:30,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5775 to 5535. [2022-03-15 14:12:30,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5535 states, 5534 states have (on average 3.5511384170581857) internal successors, (19652), 5534 states have internal predecessors, (19652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:12:30,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5535 states to 5535 states and 19652 transitions. [2022-03-15 14:12:30,641 INFO L78 Accepts]: Start accepts. Automaton has 5535 states and 19652 transitions. Word has length 118 [2022-03-15 14:12:30,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:12:30,641 INFO L470 AbstractCegarLoop]: Abstraction has 5535 states and 19652 transitions. [2022-03-15 14:12:30,641 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:12:30,642 INFO L276 IsEmpty]: Start isEmpty. Operand 5535 states and 19652 transitions. [2022-03-15 14:12:30,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-03-15 14:12:30,652 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:12:30,652 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, 1] [2022-03-15 14:12:30,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-15 14:12:30,868 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-03-15 14:12:30,869 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:12:30,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:12:30,869 INFO L85 PathProgramCache]: Analyzing trace with hash -190935994, now seen corresponding path program 1 times [2022-03-15 14:12:30,869 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:12:30,870 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639864253] [2022-03-15 14:12:30,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:12:30,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:12:30,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:12:30,986 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:12:30,986 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:12:30,986 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639864253] [2022-03-15 14:12:30,986 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639864253] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:12:30,986 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214830481] [2022-03-15 14:12:30,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:12:30,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:12:30,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:12:30,988 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 14:12:30,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-15 14:12:31,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:12:31,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 14:12:31,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:12:31,266 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:12:31,266 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:12:31,511 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:12:31,512 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214830481] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 14:12:31,512 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 14:12:31,513 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 18 [2022-03-15 14:12:31,513 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254225260] [2022-03-15 14:12:31,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 14:12:31,513 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 14:12:31,513 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:12:31,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 14:12:31,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2022-03-15 14:12:31,514 INFO L87 Difference]: Start difference. First operand 5535 states and 19652 transitions. Second operand has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 9 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:12:31,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:12:31,712 INFO L93 Difference]: Finished difference Result 7577 states and 27120 transitions. [2022-03-15 14:12:31,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 14:12:31,712 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 9 states have internal predecessors, (118), 0 states have call successors, (0), 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 118 [2022-03-15 14:12:31,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:12:31,735 INFO L225 Difference]: With dead ends: 7577 [2022-03-15 14:12:31,735 INFO L226 Difference]: Without dead ends: 7577 [2022-03-15 14:12:31,736 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 226 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=463, Unknown=0, NotChecked=0, Total=600 [2022-03-15 14:12:31,737 INFO L933 BasicCegarLoop]: 184 mSDtfsCounter, 373 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 14:12:31,737 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [373 Valid, 576 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 14:12:31,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7577 states. [2022-03-15 14:12:31,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7577 to 5864. [2022-03-15 14:12:31,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5864 states, 5863 states have (on average 3.551594746716698) internal successors, (20823), 5863 states have internal predecessors, (20823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:12:31,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5864 states to 5864 states and 20823 transitions. [2022-03-15 14:12:31,968 INFO L78 Accepts]: Start accepts. Automaton has 5864 states and 20823 transitions. Word has length 118 [2022-03-15 14:12:31,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:12:31,968 INFO L470 AbstractCegarLoop]: Abstraction has 5864 states and 20823 transitions. [2022-03-15 14:12:31,968 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 9 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:12:31,968 INFO L276 IsEmpty]: Start isEmpty. Operand 5864 states and 20823 transitions. [2022-03-15 14:12:31,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-03-15 14:12:31,982 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:12:31,982 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, 1] [2022-03-15 14:12:31,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-15 14:12:32,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-03-15 14:12:32,196 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:12:32,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:12:32,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1391695046, now seen corresponding path program 2 times [2022-03-15 14:12:32,196 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:12:32,197 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555324939] [2022-03-15 14:12:32,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:12:32,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:12:32,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:12:32,291 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:12:32,291 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:12:32,291 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555324939] [2022-03-15 14:12:32,291 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555324939] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:12:32,291 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318327506] [2022-03-15 14:12:32,292 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 14:12:32,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:12:32,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:12:32,293 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 14:12:32,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-15 14:12:32,382 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 14:12:32,383 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:12:32,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 14:12:32,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:12:32,601 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:12:32,602 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:12:32,800 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:12:32,800 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1318327506] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:12:32,800 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:12:32,800 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 17 [2022-03-15 14:12:32,800 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173292079] [2022-03-15 14:12:32,800 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:12:32,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 14:12:32,801 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:12:32,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 14:12:32,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2022-03-15 14:12:32,802 INFO L87 Difference]: Start difference. First operand 5864 states and 20823 transitions. Second operand has 17 states, 17 states have (on average 10.882352941176471) internal successors, (185), 17 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:12:33,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:12:33,815 INFO L93 Difference]: Finished difference Result 26682 states and 97534 transitions. [2022-03-15 14:12:33,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-15 14:12:33,815 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 10.882352941176471) internal successors, (185), 17 states have internal predecessors, (185), 0 states have call successors, (0), 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 118 [2022-03-15 14:12:33,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:12:33,927 INFO L225 Difference]: With dead ends: 26682 [2022-03-15 14:12:33,927 INFO L226 Difference]: Without dead ends: 26682 [2022-03-15 14:12:33,928 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 228 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=570, Invalid=1686, Unknown=0, NotChecked=0, Total=2256 [2022-03-15 14:12:33,929 INFO L933 BasicCegarLoop]: 254 mSDtfsCounter, 1077 mSDsluCounter, 1538 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1077 SdHoareTripleChecker+Valid, 1713 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 14:12:33,929 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1077 Valid, 1713 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 14:12:33,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26682 states. [2022-03-15 14:12:34,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26682 to 5911. [2022-03-15 14:12:34,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5911 states, 5910 states have (on average 3.5686971235194584) internal successors, (21091), 5910 states have internal predecessors, (21091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:12:34,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5911 states to 5911 states and 21091 transitions. [2022-03-15 14:12:34,263 INFO L78 Accepts]: Start accepts. Automaton has 5911 states and 21091 transitions. Word has length 118 [2022-03-15 14:12:34,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:12:34,264 INFO L470 AbstractCegarLoop]: Abstraction has 5911 states and 21091 transitions. [2022-03-15 14:12:34,264 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 10.882352941176471) internal successors, (185), 17 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:12:34,264 INFO L276 IsEmpty]: Start isEmpty. Operand 5911 states and 21091 transitions. [2022-03-15 14:12:34,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-03-15 14:12:34,276 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:12:34,276 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, 1] [2022-03-15 14:12:34,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-03-15 14:12:34,477 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:12:34,478 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:12:34,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:12:34,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1570091000, now seen corresponding path program 3 times [2022-03-15 14:12:34,479 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:12:34,479 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836506199] [2022-03-15 14:12:34,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:12:34,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:12:34,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:12:34,555 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:12:34,555 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:12:34,555 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836506199] [2022-03-15 14:12:34,555 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836506199] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:12:34,555 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744311258] [2022-03-15 14:12:34,556 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 14:12:34,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:12:34,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:12:34,572 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 14:12:34,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-15 14:12:34,670 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 14:12:34,670 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:12:34,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 14:12:34,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:12:34,873 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:12:34,873 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:12:35,038 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:12:35,038 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744311258] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:12:35,038 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:12:35,038 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 16 [2022-03-15 14:12:35,038 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783009183] [2022-03-15 14:12:35,039 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:12:35,039 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 14:12:35,039 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:12:35,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 14:12:35,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-03-15 14:12:35,040 INFO L87 Difference]: Start difference. First operand 5911 states and 21091 transitions. Second operand has 16 states, 16 states have (on average 11.375) internal successors, (182), 16 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:12:35,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:12:35,823 INFO L93 Difference]: Finished difference Result 18477 states and 67462 transitions. [2022-03-15 14:12:35,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 14:12:35,823 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 11.375) internal successors, (182), 16 states have internal predecessors, (182), 0 states have call successors, (0), 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 118 [2022-03-15 14:12:35,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:12:35,878 INFO L225 Difference]: With dead ends: 18477 [2022-03-15 14:12:35,879 INFO L226 Difference]: Without dead ends: 18477 [2022-03-15 14:12:35,879 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 229 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=362, Invalid=970, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 14:12:35,880 INFO L933 BasicCegarLoop]: 254 mSDtfsCounter, 752 mSDsluCounter, 1423 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 752 SdHoareTripleChecker+Valid, 1606 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 14:12:35,880 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [752 Valid, 1606 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 14:12:35,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18477 states. [2022-03-15 14:12:36,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18477 to 6055. [2022-03-15 14:12:36,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6055 states, 6054 states have (on average 3.5632639577139082) internal successors, (21572), 6054 states have internal predecessors, (21572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:12:36,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6055 states to 6055 states and 21572 transitions. [2022-03-15 14:12:36,180 INFO L78 Accepts]: Start accepts. Automaton has 6055 states and 21572 transitions. Word has length 118 [2022-03-15 14:12:36,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:12:36,180 INFO L470 AbstractCegarLoop]: Abstraction has 6055 states and 21572 transitions. [2022-03-15 14:12:36,180 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 11.375) internal successors, (182), 16 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:12:36,180 INFO L276 IsEmpty]: Start isEmpty. Operand 6055 states and 21572 transitions. [2022-03-15 14:12:36,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-03-15 14:12:36,194 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:12:36,194 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, 1] [2022-03-15 14:12:36,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-15 14:12:36,425 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:12:36,426 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:12:36,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:12:36,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1015378234, now seen corresponding path program 4 times [2022-03-15 14:12:36,426 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:12:36,426 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38042677] [2022-03-15 14:12:36,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:12:36,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:12:36,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:12:36,507 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:12:36,508 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:12:36,508 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38042677] [2022-03-15 14:12:36,508 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38042677] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:12:36,508 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800807077] [2022-03-15 14:12:36,508 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 14:12:36,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:12:36,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:12:36,509 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 14:12:36,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-15 14:12:36,584 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 14:12:36,584 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:12:36,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 14:12:36,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:12:36,827 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:12:36,827 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:12:37,097 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:12:37,097 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1800807077] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 14:12:37,097 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 14:12:37,098 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 20 [2022-03-15 14:12:37,098 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331891508] [2022-03-15 14:12:37,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 14:12:37,098 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 14:12:37,098 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:12:37,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 14:12:37,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2022-03-15 14:12:37,099 INFO L87 Difference]: Start difference. First operand 6055 states and 21572 transitions. Second operand has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 9 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:12:37,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:12:37,335 INFO L93 Difference]: Finished difference Result 12871 states and 46133 transitions. [2022-03-15 14:12:37,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 14:12:37,335 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 9 states have internal predecessors, (118), 0 states have call successors, (0), 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 118 [2022-03-15 14:12:37,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:12:37,374 INFO L225 Difference]: With dead ends: 12871 [2022-03-15 14:12:37,374 INFO L226 Difference]: Without dead ends: 12871 [2022-03-15 14:12:37,375 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 224 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=159, Invalid=543, Unknown=0, NotChecked=0, Total=702 [2022-03-15 14:12:37,375 INFO L933 BasicCegarLoop]: 172 mSDtfsCounter, 391 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 14:12:37,375 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [391 Valid, 734 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 14:12:37,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12871 states. [2022-03-15 14:12:37,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12871 to 6215. [2022-03-15 14:12:37,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6215 states, 6214 states have (on average 3.5926939169616996) internal successors, (22325), 6214 states have internal predecessors, (22325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:12:37,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6215 states to 6215 states and 22325 transitions. [2022-03-15 14:12:37,558 INFO L78 Accepts]: Start accepts. Automaton has 6215 states and 22325 transitions. Word has length 118 [2022-03-15 14:12:37,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:12:37,558 INFO L470 AbstractCegarLoop]: Abstraction has 6215 states and 22325 transitions. [2022-03-15 14:12:37,558 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 9 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:12:37,558 INFO L276 IsEmpty]: Start isEmpty. Operand 6215 states and 22325 transitions. [2022-03-15 14:12:37,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-03-15 14:12:37,574 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:12:37,574 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, 1] [2022-03-15 14:12:37,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-15 14:12:37,789 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-03-15 14:12:37,790 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:12:37,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:12:37,790 INFO L85 PathProgramCache]: Analyzing trace with hash -836982280, now seen corresponding path program 5 times [2022-03-15 14:12:37,790 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:12:37,790 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508701647] [2022-03-15 14:12:37,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:12:37,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:12:37,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:12:37,881 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:12:37,881 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:12:37,881 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508701647] [2022-03-15 14:12:37,881 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508701647] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:12:37,881 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294483813] [2022-03-15 14:12:37,881 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 14:12:37,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:12:37,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:12:37,896 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 14:12:37,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-15 14:12:37,980 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 14:12:37,980 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:12:37,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 14:12:37,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:12:38,190 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:12:38,190 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:12:38,370 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:12:38,370 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294483813] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:12:38,371 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:12:38,371 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 16 [2022-03-15 14:12:38,371 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805908541] [2022-03-15 14:12:38,371 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:12:38,371 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 14:12:38,371 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:12:38,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 14:12:38,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2022-03-15 14:12:38,372 INFO L87 Difference]: Start difference. First operand 6215 states and 22325 transitions. Second operand has 16 states, 16 states have (on average 11.25) internal successors, (180), 16 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:12:39,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:12:39,391 INFO L93 Difference]: Finished difference Result 22956 states and 82999 transitions. [2022-03-15 14:12:39,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-15 14:12:39,392 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 11.25) internal successors, (180), 16 states have internal predecessors, (180), 0 states have call successors, (0), 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 118 [2022-03-15 14:12:39,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:12:39,461 INFO L225 Difference]: With dead ends: 22956 [2022-03-15 14:12:39,462 INFO L226 Difference]: Without dead ends: 22956 [2022-03-15 14:12:39,462 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 229 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=406, Invalid=1076, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 14:12:39,463 INFO L933 BasicCegarLoop]: 294 mSDtfsCounter, 722 mSDsluCounter, 2522 mSDsCounter, 0 mSdLazyCounter, 1199 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 2690 SdHoareTripleChecker+Invalid, 1205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 14:12:39,463 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [722 Valid, 2690 Invalid, 1205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1199 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 14:12:39,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22956 states. [2022-03-15 14:12:39,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22956 to 6168. [2022-03-15 14:12:39,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6168 states, 6167 states have (on average 3.5766174801362087) internal successors, (22057), 6167 states have internal predecessors, (22057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:12:39,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6168 states to 6168 states and 22057 transitions. [2022-03-15 14:12:39,724 INFO L78 Accepts]: Start accepts. Automaton has 6168 states and 22057 transitions. Word has length 118 [2022-03-15 14:12:39,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:12:39,724 INFO L470 AbstractCegarLoop]: Abstraction has 6168 states and 22057 transitions. [2022-03-15 14:12:39,724 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 11.25) internal successors, (180), 16 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:12:39,724 INFO L276 IsEmpty]: Start isEmpty. Operand 6168 states and 22057 transitions. [2022-03-15 14:12:39,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-03-15 14:12:39,736 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:12:39,736 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, 1] [2022-03-15 14:12:39,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-03-15 14:12:39,952 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:12:39,953 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:12:39,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:12:39,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1449163496, now seen corresponding path program 6 times [2022-03-15 14:12:39,953 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:12:39,953 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748370802] [2022-03-15 14:12:39,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:12:39,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:12:40,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:12:40,097 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:12:40,098 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:12:40,098 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748370802] [2022-03-15 14:12:40,098 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748370802] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:12:40,098 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556781041] [2022-03-15 14:12:40,098 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 14:12:40,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:12:40,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:12:40,099 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 14:12:40,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-15 14:12:40,188 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-03-15 14:12:40,188 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:12:40,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 14:12:40,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:12:40,393 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:12:40,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:12:40,542 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:12:40,543 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [556781041] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:12:40,543 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:12:40,543 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 15 [2022-03-15 14:12:40,543 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830504640] [2022-03-15 14:12:40,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:12:40,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 14:12:40,543 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:12:40,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 14:12:40,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-03-15 14:12:40,544 INFO L87 Difference]: Start difference. First operand 6168 states and 22057 transitions. Second operand has 15 states, 15 states have (on average 11.933333333333334) internal successors, (179), 15 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:12:41,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:12:41,085 INFO L93 Difference]: Finished difference Result 14859 states and 53179 transitions. [2022-03-15 14:12:41,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 14:12:41,085 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 11.933333333333334) internal successors, (179), 15 states have internal predecessors, (179), 0 states have call successors, (0), 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 118 [2022-03-15 14:12:41,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:12:41,127 INFO L225 Difference]: With dead ends: 14859 [2022-03-15 14:12:41,127 INFO L226 Difference]: Without dead ends: 14859 [2022-03-15 14:12:41,128 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 230 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=262, Invalid=730, Unknown=0, NotChecked=0, Total=992 [2022-03-15 14:12:41,128 INFO L933 BasicCegarLoop]: 266 mSDtfsCounter, 535 mSDsluCounter, 1668 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 1835 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 14:12:41,128 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [535 Valid, 1835 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 14:12:41,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14859 states. [2022-03-15 14:12:41,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14859 to 6510. [2022-03-15 14:12:41,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6510 states, 6509 states have (on average 3.5437087110155168) internal successors, (23066), 6509 states have internal predecessors, (23066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:12:41,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6510 states to 6510 states and 23066 transitions. [2022-03-15 14:12:41,306 INFO L78 Accepts]: Start accepts. Automaton has 6510 states and 23066 transitions. Word has length 118 [2022-03-15 14:12:41,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:12:41,306 INFO L470 AbstractCegarLoop]: Abstraction has 6510 states and 23066 transitions. [2022-03-15 14:12:41,306 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 11.933333333333334) internal successors, (179), 15 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:12:41,306 INFO L276 IsEmpty]: Start isEmpty. Operand 6510 states and 23066 transitions. [2022-03-15 14:12:41,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-15 14:12:41,318 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:12:41,318 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, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:12:41,336 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-03-15 14:12:41,534 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:12:41,534 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:12:41,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:12:41,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1496151562, now seen corresponding path program 1 times [2022-03-15 14:12:41,535 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:12:41,535 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998521288] [2022-03-15 14:12:41,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:12:41,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:12:41,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:12:41,941 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:12:41,941 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:12:41,941 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998521288] [2022-03-15 14:12:41,941 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998521288] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:12:41,942 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3414396] [2022-03-15 14:12:41,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:12:41,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:12:41,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:12:41,943 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 14:12:41,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-15 14:12:42,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:12:42,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 71 conjunts are in the unsatisfiable core [2022-03-15 14:12:42,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:12:42,117 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 14:12:42,173 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-03-15 14:12:42,173 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-03-15 14:12:42,551 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-15 14:12:42,552 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-03-15 14:12:42,708 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 11 treesize of output 7 [2022-03-15 14:12:43,001 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 14:12:43,241 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 14 treesize of output 16 [2022-03-15 14:12:43,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 14:12:43,303 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 14 treesize of output 16 [2022-03-15 14:12:43,394 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-03-15 14:12:43,465 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:12:43,466 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:12:43,598 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_333 (Array Int Int))) (= (+ c_~res2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_333) c_~A~0.base) c_~A~0.offset) (* (- 1) c_~res1~0)) 0)) is different from false [2022-03-15 14:12:43,641 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (= (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_332) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_333) c_~A~0.base) c_~A~0.offset) c_~res2~0 (* (- 1) c_~res1~0)) 0)) is different from false [2022-03-15 14:12:43,736 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (= (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_332) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_333) c_~A~0.base) c_~A~0.offset) (* (- 1) |c_thread1Thread1of1ForFork0_~tmp~0#1|) c_~res2~0) 0)) is different from false [2022-03-15 14:12:43,752 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (= (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_332) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_333) c_~A~0.base) c_~A~0.offset) c_~res2~0 (* (- 1) (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)))) (* (- 1) c_~res1~0)) 0)) is different from false [2022-03-15 14:12:43,775 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (= 0 (+ (* (- 1) (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset)) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_332) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_333) c_~A~0.base) c_~A~0.offset) c_~res2~0 (* (- 1) c_~res1~0)))) is different from false [2022-03-15 14:12:43,794 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_331 (Array Int Int)) (v_ArrVal_333 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_331))) (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_332) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_333) c_~A~0.base) c_~A~0.offset) (* (- 1) (select (select .cse0 c_~A~0.base) c_~A~0.offset)) (* (- 1) c_~res1~0))) 0)) is different from false [2022-03-15 14:12:43,861 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_331 (Array Int Int)) (v_ArrVal_333 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_331))) (+ (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_332) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_333) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~res2~0 (* (- 1) (select (select .cse0 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|)) (* (- 1) c_~res1~0))) 0)) is different from false [2022-03-15 14:12:43,875 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_331 (Array Int Int)) (v_ArrVal_333 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_331))) (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_332) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_333) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (* (- 1) (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (* (- 1) c_~res1~0))) 0)) is different from false [2022-03-15 14:12:43,883 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_331 (Array Int Int)) (v_ArrVal_333 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (= 0 (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_331))) (+ (* (- 1) (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_332) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_333) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~res2~0 (* (- 1) c_~res1~0))))) is different from false [2022-03-15 14:12:43,934 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:12:43,934 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 55 treesize of output 44 [2022-03-15 14:12:43,941 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 790 treesize of output 726 [2022-03-15 14:12:43,948 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 726 treesize of output 710 [2022-03-15 14:12:43,956 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 710 treesize of output 678 [2022-03-15 14:12:43,962 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 678 treesize of output 646 [2022-03-15 14:12:47,033 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 14:12:47,035 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-03-15 14:12:47,059 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-03-15 14:12:47,059 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3414396] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:12:47,060 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:12:47,060 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24, 22] total 54 [2022-03-15 14:12:47,060 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036377745] [2022-03-15 14:12:47,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:12:47,061 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-03-15 14:12:47,061 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:12:47,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-03-15 14:12:47,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=1797, Unknown=9, NotChecked=846, Total=2862 [2022-03-15 14:12:47,063 INFO L87 Difference]: Start difference. First operand 6510 states and 23066 transitions. Second operand has 54 states, 54 states have (on average 5.537037037037037) internal successors, (299), 54 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:12:49,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:12:49,835 INFO L93 Difference]: Finished difference Result 18697 states and 66840 transitions. [2022-03-15 14:12:49,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-03-15 14:12:49,835 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 5.537037037037037) internal successors, (299), 54 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2022-03-15 14:12:49,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:12:49,887 INFO L225 Difference]: With dead ends: 18697 [2022-03-15 14:12:49,887 INFO L226 Difference]: Without dead ends: 18547 [2022-03-15 14:12:49,889 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 216 SyntacticMatches, 11 SemanticMatches, 83 ConstructedPredicates, 9 IntricatePredicates, 2 DeprecatedPredicates, 1656 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=721, Invalid=5006, Unknown=9, NotChecked=1404, Total=7140 [2022-03-15 14:12:49,889 INFO L933 BasicCegarLoop]: 267 mSDtfsCounter, 1843 mSDsluCounter, 5395 mSDsCounter, 0 mSdLazyCounter, 2097 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1843 SdHoareTripleChecker+Valid, 5219 SdHoareTripleChecker+Invalid, 6844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 2097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4676 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 14:12:49,889 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1843 Valid, 5219 Invalid, 6844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 2097 Invalid, 0 Unknown, 4676 Unchecked, 0.9s Time] [2022-03-15 14:12:49,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18547 states. [2022-03-15 14:12:50,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18547 to 9408. [2022-03-15 14:12:50,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9408 states, 9407 states have (on average 3.5748910385882855) internal successors, (33629), 9407 states have internal predecessors, (33629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:12:50,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9408 states to 9408 states and 33629 transitions. [2022-03-15 14:12:50,127 INFO L78 Accepts]: Start accepts. Automaton has 9408 states and 33629 transitions. Word has length 124 [2022-03-15 14:12:50,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:12:50,127 INFO L470 AbstractCegarLoop]: Abstraction has 9408 states and 33629 transitions. [2022-03-15 14:12:50,127 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 5.537037037037037) internal successors, (299), 54 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:12:50,127 INFO L276 IsEmpty]: Start isEmpty. Operand 9408 states and 33629 transitions. [2022-03-15 14:12:50,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-15 14:12:50,144 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:12:50,144 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, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:12:50,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-03-15 14:12:50,344 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-03-15 14:12:50,345 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:12:50,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:12:50,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1263604010, now seen corresponding path program 1 times [2022-03-15 14:12:50,345 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:12:50,345 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240256303] [2022-03-15 14:12:50,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:12:50,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:12:50,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:12:51,128 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:12:51,128 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:12:51,128 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240256303] [2022-03-15 14:12:51,128 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240256303] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:12:51,128 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701844165] [2022-03-15 14:12:51,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:12:51,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:12:51,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:12:51,129 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 14:12:51,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-03-15 14:12:51,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:12:51,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 85 conjunts are in the unsatisfiable core [2022-03-15 14:12:51,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:12:51,313 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 14:12:51,371 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-03-15 14:12:51,371 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-03-15 14:12:51,823 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-15 14:12:51,823 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-03-15 14:12:52,047 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-15 14:12:52,885 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 14:12:53,334 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 14 treesize of output 16 [2022-03-15 14:12:53,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 14:12:53,492 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 14 treesize of output 16 [2022-03-15 14:12:53,756 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 14:12:53,758 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:12:53,758 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 17 treesize of output 10 [2022-03-15 14:12:53,818 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:12:53,819 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:12:55,525 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:12:55,526 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 55 treesize of output 44 [2022-03-15 14:12:55,534 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:12:55,535 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 830 treesize of output 746 [2022-03-15 14:12:55,540 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 734 treesize of output 638 [2022-03-15 14:12:55,546 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 638 treesize of output 590 [2022-03-15 14:12:55,557 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:12:55,557 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 590 treesize of output 546 [2022-03-15 14:12:57,633 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 14:12:57,635 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-03-15 14:12:57,655 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:12:57,656 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [701844165] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:12:57,656 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:12:57,656 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33, 32] total 83 [2022-03-15 14:12:57,656 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732846326] [2022-03-15 14:12:57,656 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:12:57,657 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2022-03-15 14:12:57,657 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:12:57,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2022-03-15 14:12:57,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=515, Invalid=6205, Unknown=86, NotChecked=0, Total=6806 [2022-03-15 14:12:57,659 INFO L87 Difference]: Start difference. First operand 9408 states and 33629 transitions. Second operand has 83 states, 83 states have (on average 3.63855421686747) internal successors, (302), 83 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:13:04,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:13:04,843 INFO L93 Difference]: Finished difference Result 36669 states and 132152 transitions. [2022-03-15 14:13:04,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-03-15 14:13:04,843 INFO L78 Accepts]: Start accepts. Automaton has has 83 states, 83 states have (on average 3.63855421686747) internal successors, (302), 83 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2022-03-15 14:13:04,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:13:04,955 INFO L225 Difference]: With dead ends: 36669 [2022-03-15 14:13:04,955 INFO L226 Difference]: Without dead ends: 36369 [2022-03-15 14:13:04,959 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5979 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=2297, Invalid=17923, Unknown=86, NotChecked=0, Total=20306 [2022-03-15 14:13:04,959 INFO L933 BasicCegarLoop]: 257 mSDtfsCounter, 3085 mSDsluCounter, 10575 mSDsCounter, 0 mSdLazyCounter, 5191 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3085 SdHoareTripleChecker+Valid, 9796 SdHoareTripleChecker+Invalid, 9284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 5191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3982 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-03-15 14:13:04,959 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3085 Valid, 9796 Invalid, 9284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 5191 Invalid, 0 Unknown, 3982 Unchecked, 2.1s Time] [2022-03-15 14:13:04,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36369 states. [2022-03-15 14:13:05,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36369 to 11810. [2022-03-15 14:13:05,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11810 states, 11809 states have (on average 3.587009907697519) internal successors, (42359), 11809 states have internal predecessors, (42359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:13:05,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11810 states to 11810 states and 42359 transitions. [2022-03-15 14:13:05,364 INFO L78 Accepts]: Start accepts. Automaton has 11810 states and 42359 transitions. Word has length 124 [2022-03-15 14:13:05,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:13:05,364 INFO L470 AbstractCegarLoop]: Abstraction has 11810 states and 42359 transitions. [2022-03-15 14:13:05,364 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 83 states have (on average 3.63855421686747) internal successors, (302), 83 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:13:05,364 INFO L276 IsEmpty]: Start isEmpty. Operand 11810 states and 42359 transitions. [2022-03-15 14:13:05,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-15 14:13:05,386 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:13:05,386 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, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:13:05,403 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-03-15 14:13:05,586 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-03-15 14:13:05,586 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:13:05,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:13:05,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1665569678, now seen corresponding path program 2 times [2022-03-15 14:13:05,587 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:13:05,587 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661401195] [2022-03-15 14:13:05,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:13:05,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:13:05,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:13:05,980 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:13:05,981 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:13:05,981 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661401195] [2022-03-15 14:13:05,981 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661401195] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:13:05,981 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566711510] [2022-03-15 14:13:05,981 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 14:13:05,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:13:05,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:13:05,982 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 14:13:05,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-03-15 14:13:06,068 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 14:13:06,068 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:13:06,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 64 conjunts are in the unsatisfiable core [2022-03-15 14:13:06,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:13:06,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 14:13:06,722 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 14:13:06,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 14:13:06,810 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 14:13:06,905 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 15 [2022-03-15 14:13:06,985 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:13:06,986 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:13:07,109 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_406 (Array Int Int))) (= 0 (+ (* (- 1) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_406) c_~A~0.base) c_~A~0.offset)) |c_thread1Thread1of1ForFork0_~tmp~0#1| (* (- 1) c_~res2~0)))) is different from false [2022-03-15 14:13:07,127 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_405 (Array Int Int)) (v_ArrVal_406 (Array Int Int))) (= (+ (* (- 1) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_405) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_406) c_~A~0.base) c_~A~0.offset)) |c_thread1Thread1of1ForFork0_~tmp~0#1| (* (- 1) c_~res2~0)) 0)) is different from false [2022-03-15 14:13:07,146 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:13:07,147 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 92 [2022-03-15 14:13:07,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 80 treesize of output 76 [2022-03-15 14:13:07,152 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 38 treesize of output 36 [2022-03-15 14:13:07,657 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:13:07,657 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [566711510] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:13:07,657 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:13:07,657 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 20] total 46 [2022-03-15 14:13:07,658 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155022217] [2022-03-15 14:13:07,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:13:07,658 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-03-15 14:13:07,658 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:13:07,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-03-15 14:13:07,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=1701, Unknown=2, NotChecked=170, Total=2070 [2022-03-15 14:13:07,659 INFO L87 Difference]: Start difference. First operand 11810 states and 42359 transitions. Second operand has 46 states, 46 states have (on average 5.717391304347826) internal successors, (263), 46 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:13:09,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:13:09,553 INFO L93 Difference]: Finished difference Result 32338 states and 116389 transitions. [2022-03-15 14:13:09,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-03-15 14:13:09,554 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 5.717391304347826) internal successors, (263), 46 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2022-03-15 14:13:09,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:13:09,648 INFO L225 Difference]: With dead ends: 32338 [2022-03-15 14:13:09,649 INFO L226 Difference]: Without dead ends: 32188 [2022-03-15 14:13:09,650 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 222 SyntacticMatches, 5 SemanticMatches, 75 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1602 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=643, Invalid=4913, Unknown=2, NotChecked=294, Total=5852 [2022-03-15 14:13:09,650 INFO L933 BasicCegarLoop]: 257 mSDtfsCounter, 1559 mSDsluCounter, 4904 mSDsCounter, 0 mSdLazyCounter, 2056 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1559 SdHoareTripleChecker+Valid, 4807 SdHoareTripleChecker+Invalid, 3115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 2056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1009 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 14:13:09,651 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1559 Valid, 4807 Invalid, 3115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 2056 Invalid, 0 Unknown, 1009 Unchecked, 0.8s Time] [2022-03-15 14:13:09,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32188 states. [2022-03-15 14:13:09,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32188 to 12232. [2022-03-15 14:13:10,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12232 states, 12231 states have (on average 3.5917749979560134) internal successors, (43931), 12231 states have internal predecessors, (43931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:13:10,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12232 states to 12232 states and 43931 transitions. [2022-03-15 14:13:10,041 INFO L78 Accepts]: Start accepts. Automaton has 12232 states and 43931 transitions. Word has length 124 [2022-03-15 14:13:10,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:13:10,041 INFO L470 AbstractCegarLoop]: Abstraction has 12232 states and 43931 transitions. [2022-03-15 14:13:10,041 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 5.717391304347826) internal successors, (263), 46 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:13:10,041 INFO L276 IsEmpty]: Start isEmpty. Operand 12232 states and 43931 transitions. [2022-03-15 14:13:10,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-15 14:13:10,063 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:13:10,063 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, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:13:10,079 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-03-15 14:13:10,273 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-03-15 14:13:10,273 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:13:10,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:13:10,273 INFO L85 PathProgramCache]: Analyzing trace with hash -2065216558, now seen corresponding path program 3 times [2022-03-15 14:13:10,273 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:13:10,273 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197663446] [2022-03-15 14:13:10,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:13:10,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:13:10,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:13:10,656 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:13:10,656 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:13:10,656 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197663446] [2022-03-15 14:13:10,657 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197663446] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:13:10,657 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1765104167] [2022-03-15 14:13:10,657 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 14:13:10,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:13:10,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:13:10,658 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 14:13:10,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-03-15 14:13:10,749 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 14:13:10,749 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:13:10,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 64 conjunts are in the unsatisfiable core [2022-03-15 14:13:10,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:13:11,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 14:13:11,411 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 14:13:11,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 14:13:11,481 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 14:13:11,574 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 15 [2022-03-15 14:13:11,647 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:13:11,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:13:11,756 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_440 (Array Int Int))) (= (+ (* (- 1) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_440) c_~A~0.base) c_~A~0.offset)) |c_thread1Thread1of1ForFork0_~tmp~0#1| (* (- 1) c_~res2~0)) 0)) is different from false [2022-03-15 14:13:11,772 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_439 (Array Int Int)) (v_ArrVal_440 (Array Int Int))) (= (+ |c_thread1Thread1of1ForFork0_~tmp~0#1| (* (- 1) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_439) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_440) c_~A~0.base) c_~A~0.offset)) (* (- 1) c_~res2~0)) 0)) is different from false [2022-03-15 14:13:11,793 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:13:11,793 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 92 [2022-03-15 14:13:11,796 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 40 treesize of output 38 [2022-03-15 14:13:11,799 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 78 treesize of output 74 [2022-03-15 14:13:12,309 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:13:12,309 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1765104167] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:13:12,309 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:13:12,309 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 20] total 46 [2022-03-15 14:13:12,309 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284763760] [2022-03-15 14:13:12,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:13:12,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-03-15 14:13:12,310 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:13:12,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-03-15 14:13:12,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=1701, Unknown=2, NotChecked=170, Total=2070 [2022-03-15 14:13:12,311 INFO L87 Difference]: Start difference. First operand 12232 states and 43931 transitions. Second operand has 46 states, 46 states have (on average 5.717391304347826) internal successors, (263), 46 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:13:14,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:13:14,316 INFO L93 Difference]: Finished difference Result 37903 states and 136252 transitions. [2022-03-15 14:13:14,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-03-15 14:13:14,317 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 5.717391304347826) internal successors, (263), 46 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2022-03-15 14:13:14,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:13:14,431 INFO L225 Difference]: With dead ends: 37903 [2022-03-15 14:13:14,431 INFO L226 Difference]: Without dead ends: 37603 [2022-03-15 14:13:14,433 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 222 SyntacticMatches, 6 SemanticMatches, 79 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1738 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=739, Invalid=5429, Unknown=2, NotChecked=310, Total=6480 [2022-03-15 14:13:14,433 INFO L933 BasicCegarLoop]: 273 mSDtfsCounter, 1587 mSDsluCounter, 4592 mSDsCounter, 0 mSdLazyCounter, 1884 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1587 SdHoareTripleChecker+Valid, 4511 SdHoareTripleChecker+Invalid, 3070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1116 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 14:13:14,433 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1587 Valid, 4511 Invalid, 3070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1884 Invalid, 0 Unknown, 1116 Unchecked, 0.8s Time] [2022-03-15 14:13:14,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37603 states. [2022-03-15 14:13:14,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37603 to 12580. [2022-03-15 14:13:14,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12580 states, 12579 states have (on average 3.601955640352969) internal successors, (45309), 12579 states have internal predecessors, (45309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:13:14,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12580 states to 12580 states and 45309 transitions. [2022-03-15 14:13:14,858 INFO L78 Accepts]: Start accepts. Automaton has 12580 states and 45309 transitions. Word has length 124 [2022-03-15 14:13:14,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:13:14,859 INFO L470 AbstractCegarLoop]: Abstraction has 12580 states and 45309 transitions. [2022-03-15 14:13:14,859 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 5.717391304347826) internal successors, (263), 46 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:13:14,859 INFO L276 IsEmpty]: Start isEmpty. Operand 12580 states and 45309 transitions. [2022-03-15 14:13:14,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-15 14:13:14,882 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:13:14,883 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, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:13:14,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-03-15 14:13:15,101 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-03-15 14:13:15,101 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:13:15,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:13:15,101 INFO L85 PathProgramCache]: Analyzing trace with hash 2003048260, now seen corresponding path program 4 times [2022-03-15 14:13:15,101 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:13:15,102 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130695312] [2022-03-15 14:13:15,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:13:15,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:13:15,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:13:15,853 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:13:15,853 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:13:15,853 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130695312] [2022-03-15 14:13:15,853 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130695312] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:13:15,853 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083042335] [2022-03-15 14:13:15,853 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 14:13:15,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:13:15,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:13:15,854 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 14:13:15,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-03-15 14:13:15,954 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 14:13:15,955 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:13:15,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 66 conjunts are in the unsatisfiable core [2022-03-15 14:13:15,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:13:16,467 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 11 treesize of output 7 [2022-03-15 14:13:16,712 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 14:13:16,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 14:13:16,867 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 14:13:16,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 14:13:16,929 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 14:13:17,065 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-03-15 14:13:17,138 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:13:17,139 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:13:17,296 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_477 (Array Int Int))) (= (+ (* (- 1) |c_thread1Thread1of1ForFork0_~tmp~0#1|) c_~res2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_477) c_~A~0.base) c_~A~0.offset)) 0)) is different from false [2022-03-15 14:13:17,313 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_476 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (= (+ (* (- 1) |c_thread1Thread1of1ForFork0_~tmp~0#1|) c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_476) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_477) c_~A~0.base) c_~A~0.offset)) 0)) is different from false [2022-03-15 14:13:17,340 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_476 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (= (+ c_~res2~0 (* (- 1) (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_476) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_477) c_~A~0.base) c_~A~0.offset) (* (- 1) c_~res1~0)) 0)) is different from false [2022-03-15 14:13:17,348 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_476 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (= 0 (+ (* (- 1) (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset)) c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_476) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_477) c_~A~0.base) c_~A~0.offset) (* (- 1) c_~res1~0)))) is different from false [2022-03-15 14:13:17,374 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_476 (Array Int Int)) (v_ArrVal_475 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_475))) (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_476) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_477) c_~A~0.base) c_~A~0.offset) (* (- 1) (select (select .cse0 c_~A~0.base) c_~A~0.offset)) (* (- 1) c_~res1~0))) 0)) is different from false [2022-03-15 14:13:17,416 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_476 (Array Int Int)) (v_ArrVal_475 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (= 0 (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_475))) (+ (* (- 1) (select (select .cse0 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|)) c_~res2~0 (* (- 1) c_~res1~0) (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_476) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))))) is different from false [2022-03-15 14:13:17,425 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_476 (Array Int Int)) (v_ArrVal_475 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_475))) (+ (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_476) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~res2~0 (* (- 1) (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (* (- 1) c_~res1~0))) 0)) is different from false [2022-03-15 14:13:17,430 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_476 (Array Int Int)) (v_ArrVal_475 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_475))) (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_476) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (* (- 1) (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (* (- 1) c_~res1~0))) 0)) is different from false [2022-03-15 14:13:17,450 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:13:17,450 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 55 treesize of output 44 [2022-03-15 14:13:17,452 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 790 treesize of output 726 [2022-03-15 14:13:17,455 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 726 treesize of output 694 [2022-03-15 14:13:17,459 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 694 treesize of output 662 [2022-03-15 14:13:17,465 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 662 treesize of output 646 [2022-03-15 14:13:17,843 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-03-15 14:13:17,843 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083042335] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:13:17,843 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:13:17,843 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 24, 22] total 63 [2022-03-15 14:13:17,843 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056910554] [2022-03-15 14:13:17,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:13:17,844 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-03-15 14:13:17,844 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:13:17,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-03-15 14:13:17,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=2715, Unknown=8, NotChecked=904, Total=3906 [2022-03-15 14:13:17,845 INFO L87 Difference]: Start difference. First operand 12580 states and 45309 transitions. Second operand has 63 states, 63 states have (on average 4.603174603174603) internal successors, (290), 63 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:13:21,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:13:21,030 INFO L93 Difference]: Finished difference Result 33688 states and 121423 transitions. [2022-03-15 14:13:21,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-03-15 14:13:21,030 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 4.603174603174603) internal successors, (290), 63 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2022-03-15 14:13:21,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:13:21,136 INFO L225 Difference]: With dead ends: 33688 [2022-03-15 14:13:21,136 INFO L226 Difference]: Without dead ends: 33538 [2022-03-15 14:13:21,137 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 219 SyntacticMatches, 10 SemanticMatches, 98 ConstructedPredicates, 8 IntricatePredicates, 2 DeprecatedPredicates, 2944 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=791, Invalid=7605, Unknown=8, NotChecked=1496, Total=9900 [2022-03-15 14:13:21,138 INFO L933 BasicCegarLoop]: 252 mSDtfsCounter, 1331 mSDsluCounter, 6414 mSDsCounter, 0 mSdLazyCounter, 2820 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1331 SdHoareTripleChecker+Valid, 6168 SdHoareTripleChecker+Invalid, 6367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 2820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3506 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 14:13:21,138 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1331 Valid, 6168 Invalid, 6367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 2820 Invalid, 0 Unknown, 3506 Unchecked, 1.1s Time] [2022-03-15 14:13:21,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33538 states. [2022-03-15 14:13:21,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33538 to 12763. [2022-03-15 14:13:21,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12763 states, 12762 states have (on average 3.5981037454944365) internal successors, (45919), 12762 states have internal predecessors, (45919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:13:21,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12763 states to 12763 states and 45919 transitions. [2022-03-15 14:13:21,597 INFO L78 Accepts]: Start accepts. Automaton has 12763 states and 45919 transitions. Word has length 124 [2022-03-15 14:13:21,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:13:21,597 INFO L470 AbstractCegarLoop]: Abstraction has 12763 states and 45919 transitions. [2022-03-15 14:13:21,597 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 4.603174603174603) internal successors, (290), 63 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:13:21,597 INFO L276 IsEmpty]: Start isEmpty. Operand 12763 states and 45919 transitions. [2022-03-15 14:13:21,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-15 14:13:21,622 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:13:21,622 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, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:13:21,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-03-15 14:13:21,823 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-03-15 14:13:21,824 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:13:21,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:13:21,825 INFO L85 PathProgramCache]: Analyzing trace with hash -732266808, now seen corresponding path program 2 times [2022-03-15 14:13:21,825 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:13:21,825 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657948456] [2022-03-15 14:13:21,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:13:21,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:13:21,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:13:22,598 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:13:22,598 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:13:22,598 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657948456] [2022-03-15 14:13:22,598 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657948456] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:13:22,598 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909674920] [2022-03-15 14:13:22,598 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 14:13:22,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:13:22,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:13:22,599 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 14:13:22,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-03-15 14:13:22,685 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 14:13:22,685 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:13:22,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 67 conjunts are in the unsatisfiable core [2022-03-15 14:13:22,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:13:23,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 14:13:23,457 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 14:13:23,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 14:13:23,544 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 14:13:23,839 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:13:23,839 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 17 treesize of output 17 [2022-03-15 14:13:24,181 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:13:24,181 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:13:24,634 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread3Thread1of1ForFork2_~i~2#1_41| Int) (v_ArrVal_511 (Array Int Int))) (or (< 0 |v_thread3Thread1of1ForFork2_~i~2#1_41|) (< (+ |v_thread3Thread1of1ForFork2_~i~2#1_41| 1) c_~N~0) (= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_511) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork2_~i~2#1_41| 4))) c_~res2~0) |c_thread1Thread1of1ForFork0_~tmp~0#1|))) is different from false [2022-03-15 14:13:24,702 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread3Thread1of1ForFork2_~i~2#1_41| Int) (v_ArrVal_511 (Array Int Int)) (v_ArrVal_510 (Array Int Int))) (or (< 0 |v_thread3Thread1of1ForFork2_~i~2#1_41|) (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_510) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_511) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork2_~i~2#1_41| 4)))) |c_thread1Thread1of1ForFork0_~tmp~0#1|) (< (+ |v_thread3Thread1of1ForFork2_~i~2#1_41| 1) c_~N~0))) is different from false [2022-03-15 14:13:24,756 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:13:24,757 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 92 [2022-03-15 14:13:24,760 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 76 treesize of output 64 [2022-03-15 14:13:24,765 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2022-03-15 14:13:25,518 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:13:25,518 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909674920] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:13:25,518 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:13:25,519 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 27, 26] total 70 [2022-03-15 14:13:25,519 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13474915] [2022-03-15 14:13:25,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:13:25,519 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-03-15 14:13:25,519 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:13:25,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-03-15 14:13:25,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=513, Invalid=4049, Unknown=2, NotChecked=266, Total=4830 [2022-03-15 14:13:25,520 INFO L87 Difference]: Start difference. First operand 12763 states and 45919 transitions. Second operand has 70 states, 70 states have (on average 4.385714285714286) internal successors, (307), 70 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:14:02,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:14:02,976 INFO L93 Difference]: Finished difference Result 79616 states and 286747 transitions. [2022-03-15 14:14:02,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 449 states. [2022-03-15 14:14:02,976 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 70 states have (on average 4.385714285714286) internal successors, (307), 70 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2022-03-15 14:14:02,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:14:03,346 INFO L225 Difference]: With dead ends: 79616 [2022-03-15 14:14:03,346 INFO L226 Difference]: Without dead ends: 79016 [2022-03-15 14:14:03,356 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 736 GetRequests, 221 SyntacticMatches, 17 SemanticMatches, 498 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 108475 ImplicationChecksByTransitivity, 28.8s TimeCoverageRelationStatistics Valid=19860, Invalid=227652, Unknown=2, NotChecked=1986, Total=249500 [2022-03-15 14:14:03,357 INFO L933 BasicCegarLoop]: 710 mSDtfsCounter, 4336 mSDsluCounter, 19145 mSDsCounter, 0 mSdLazyCounter, 16335 mSolverCounterSat, 379 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4336 SdHoareTripleChecker+Valid, 18196 SdHoareTripleChecker+Invalid, 20177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 379 IncrementalHoareTripleChecker+Valid, 16335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3463 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2022-03-15 14:14:03,357 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4336 Valid, 18196 Invalid, 20177 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [379 Valid, 16335 Invalid, 0 Unknown, 3463 Unchecked, 7.3s Time] [2022-03-15 14:14:03,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79016 states. [2022-03-15 14:14:04,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79016 to 13209. [2022-03-15 14:14:04,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13209 states, 13208 states have (on average 3.6281798909751664) internal successors, (47921), 13208 states have internal predecessors, (47921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:14:04,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13209 states to 13209 states and 47921 transitions. [2022-03-15 14:14:04,309 INFO L78 Accepts]: Start accepts. Automaton has 13209 states and 47921 transitions. Word has length 124 [2022-03-15 14:14:04,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:14:04,310 INFO L470 AbstractCegarLoop]: Abstraction has 13209 states and 47921 transitions. [2022-03-15 14:14:04,310 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 4.385714285714286) internal successors, (307), 70 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:14:04,310 INFO L276 IsEmpty]: Start isEmpty. Operand 13209 states and 47921 transitions. [2022-03-15 14:14:04,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-15 14:14:04,334 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:14:04,334 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, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:14:04,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-03-15 14:14:04,534 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-03-15 14:14:04,535 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:14:04,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:14:04,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1913273718, now seen corresponding path program 3 times [2022-03-15 14:14:04,535 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:14:04,535 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375724324] [2022-03-15 14:14:04,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:14:04,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:14:04,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:14:05,235 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:14:05,235 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:14:05,235 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375724324] [2022-03-15 14:14:05,235 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375724324] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:14:05,236 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921871319] [2022-03-15 14:14:05,236 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 14:14:05,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:14:05,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:14:05,237 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 14:14:05,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-03-15 14:14:05,336 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 14:14:05,336 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:14:05,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 67 conjunts are in the unsatisfiable core [2022-03-15 14:14:05,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:14:06,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 14:14:06,171 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 14:14:06,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 14:14:06,254 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 14:14:06,400 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:14:06,401 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2022-03-15 14:14:06,816 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:14:06,817 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:14:07,234 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_545 (Array Int Int)) (|v_thread3Thread1of1ForFork2_~i~2#1_44| Int)) (or (< (+ |v_thread3Thread1of1ForFork2_~i~2#1_44| 1) c_~N~0) (= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_545) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork2_~i~2#1_44| 4))) c_~res2~0) |c_thread1Thread1of1ForFork0_~tmp~0#1|) (< 0 |v_thread3Thread1of1ForFork2_~i~2#1_44|))) is different from false [2022-03-15 14:14:07,289 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_545 (Array Int Int)) (|v_thread3Thread1of1ForFork2_~i~2#1_44| Int) (v_ArrVal_544 (Array Int Int))) (or (< (+ |v_thread3Thread1of1ForFork2_~i~2#1_44| 1) c_~N~0) (< 0 |v_thread3Thread1of1ForFork2_~i~2#1_44|) (= |c_thread1Thread1of1ForFork0_~tmp~0#1| (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_544) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_545) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork2_~i~2#1_44| 4))))))) is different from false [2022-03-15 14:14:07,337 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:14:07,338 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 242 treesize of output 178 [2022-03-15 14:14:07,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 81 treesize of output 69 [2022-03-15 14:14:07,353 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 150 treesize of output 126 [2022-03-15 14:14:08,126 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:14:08,126 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1921871319] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:14:08,126 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:14:08,126 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 27, 26] total 71 [2022-03-15 14:14:08,126 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075791155] [2022-03-15 14:14:08,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:14:08,127 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2022-03-15 14:14:08,127 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:14:08,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2022-03-15 14:14:08,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=4170, Unknown=2, NotChecked=270, Total=4970 [2022-03-15 14:14:08,128 INFO L87 Difference]: Start difference. First operand 13209 states and 47921 transitions. Second operand has 71 states, 71 states have (on average 4.436619718309859) internal successors, (315), 71 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:14:40,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:14:40,355 INFO L93 Difference]: Finished difference Result 85389 states and 312374 transitions. [2022-03-15 14:14:40,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 465 states. [2022-03-15 14:14:40,356 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 71 states have (on average 4.436619718309859) internal successors, (315), 71 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2022-03-15 14:14:40,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:14:40,968 INFO L225 Difference]: With dead ends: 85389 [2022-03-15 14:14:40,969 INFO L226 Difference]: Without dead ends: 85089 [2022-03-15 14:14:40,981 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 732 GetRequests, 208 SyntacticMatches, 8 SemanticMatches, 516 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 117629 ImplicationChecksByTransitivity, 26.1s TimeCoverageRelationStatistics Valid=22640, Invalid=243106, Unknown=2, NotChecked=2058, Total=267806 [2022-03-15 14:14:40,982 INFO L933 BasicCegarLoop]: 429 mSDtfsCounter, 5255 mSDsluCounter, 14233 mSDsCounter, 0 mSdLazyCounter, 10722 mSolverCounterSat, 552 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5255 SdHoareTripleChecker+Valid, 13200 SdHoareTripleChecker+Invalid, 20805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 552 IncrementalHoareTripleChecker+Valid, 10722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9531 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-03-15 14:14:40,982 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5255 Valid, 13200 Invalid, 20805 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [552 Valid, 10722 Invalid, 0 Unknown, 9531 Unchecked, 5.2s Time] [2022-03-15 14:14:41,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85089 states. [2022-03-15 14:14:41,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85089 to 13314. [2022-03-15 14:14:41,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13314 states, 13313 states have (on average 3.6297603845864943) internal successors, (48323), 13313 states have internal predecessors, (48323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:14:41,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13314 states to 13314 states and 48323 transitions. [2022-03-15 14:14:41,984 INFO L78 Accepts]: Start accepts. Automaton has 13314 states and 48323 transitions. Word has length 124 [2022-03-15 14:14:41,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:14:41,984 INFO L470 AbstractCegarLoop]: Abstraction has 13314 states and 48323 transitions. [2022-03-15 14:14:41,985 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 4.436619718309859) internal successors, (315), 71 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:14:41,985 INFO L276 IsEmpty]: Start isEmpty. Operand 13314 states and 48323 transitions. [2022-03-15 14:14:42,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-15 14:14:42,010 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:14:42,010 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, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:14:42,026 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-03-15 14:14:42,210 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:14:42,211 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:14:42,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:14:42,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1254294472, now seen corresponding path program 4 times [2022-03-15 14:14:42,211 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:14:42,212 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959503340] [2022-03-15 14:14:42,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:14:42,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:14:42,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:14:42,970 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:14:42,970 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:14:42,970 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959503340] [2022-03-15 14:14:42,970 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959503340] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:14:42,970 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956875245] [2022-03-15 14:14:42,970 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 14:14:42,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:14:42,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:14:42,971 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 14:14:42,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-03-15 14:14:43,059 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 14:14:43,059 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:14:43,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 78 conjunts are in the unsatisfiable core [2022-03-15 14:14:43,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:14:43,699 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-15 14:14:44,259 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 14:14:44,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 14:14:44,551 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 14:14:44,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 14:14:44,642 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 14:14:44,791 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:14:44,792 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 27 treesize of output 27 [2022-03-15 14:14:45,085 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:14:45,085 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:14:45,454 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_582 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (= (+ c_~res2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_582) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) |c_thread1Thread1of1ForFork0_~tmp~0#1|) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-15 14:14:45,525 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_581) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_582) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) |c_thread1Thread1of1ForFork0_~tmp~0#1|) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-15 14:14:45,588 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_581) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_582) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0)) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-15 14:14:45,616 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_581) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_582) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) c_~res1~0)) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-15 14:14:45,648 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_580 (Array Int Int)) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_580))) (= (+ (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_581) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_582) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) (+ c_~res1~0 (select (select .cse0 c_~A~0.base) c_~A~0.offset)))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-15 14:14:45,790 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_580 (Array Int Int)) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_580))) (= (+ c_~res1~0 (select (select .cse0 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|)) (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_581) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_582) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4)))))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-15 14:14:45,820 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_580 (Array Int Int)) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_580))) (= (+ (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~res1~0) (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_581) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_582) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-15 14:14:45,836 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_580 (Array Int Int)) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_580))) (= (+ (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~res1~0) (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_581) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_582) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-15 14:14:46,091 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:14:46,092 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 55 treesize of output 44 [2022-03-15 14:14:46,099 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:14:46,099 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 410 treesize of output 374 [2022-03-15 14:14:46,103 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 362 treesize of output 314 [2022-03-15 14:14:46,107 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 314 treesize of output 290 [2022-03-15 14:14:46,116 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:14:46,116 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 290 treesize of output 274 [2022-03-15 14:14:47,242 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-03-15 14:14:47,242 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956875245] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:14:47,242 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:14:47,242 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33, 33] total 85 [2022-03-15 14:14:47,242 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112804988] [2022-03-15 14:14:47,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:14:47,243 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2022-03-15 14:14:47,243 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:14:47,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2022-03-15 14:14:47,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=456, Invalid=5417, Unknown=11, NotChecked=1256, Total=7140 [2022-03-15 14:14:47,244 INFO L87 Difference]: Start difference. First operand 13314 states and 48323 transitions. Second operand has 85 states, 85 states have (on average 3.458823529411765) internal successors, (294), 85 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:14:55,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:14:55,387 INFO L93 Difference]: Finished difference Result 34495 states and 124249 transitions. [2022-03-15 14:14:55,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-03-15 14:14:55,388 INFO L78 Accepts]: Start accepts. Automaton has has 85 states, 85 states have (on average 3.458823529411765) internal successors, (294), 85 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2022-03-15 14:14:55,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:14:55,490 INFO L225 Difference]: With dead ends: 34495 [2022-03-15 14:14:55,490 INFO L226 Difference]: Without dead ends: 34345 [2022-03-15 14:14:55,492 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 199 SyntacticMatches, 8 SemanticMatches, 139 ConstructedPredicates, 8 IntricatePredicates, 2 DeprecatedPredicates, 5681 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=1443, Invalid=16134, Unknown=11, NotChecked=2152, Total=19740 [2022-03-15 14:14:55,492 INFO L933 BasicCegarLoop]: 289 mSDtfsCounter, 2109 mSDsluCounter, 10233 mSDsCounter, 0 mSdLazyCounter, 4407 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2109 SdHoareTripleChecker+Valid, 9882 SdHoareTripleChecker+Invalid, 10488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 4407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5987 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-15 14:14:55,492 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2109 Valid, 9882 Invalid, 10488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 4407 Invalid, 0 Unknown, 5987 Unchecked, 1.7s Time] [2022-03-15 14:14:55,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34345 states. [2022-03-15 14:14:55,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34345 to 13481. [2022-03-15 14:14:55,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13481 states, 13480 states have (on average 3.632492581602374) internal successors, (48966), 13480 states have internal predecessors, (48966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:14:56,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13481 states to 13481 states and 48966 transitions. [2022-03-15 14:14:56,017 INFO L78 Accepts]: Start accepts. Automaton has 13481 states and 48966 transitions. Word has length 124 [2022-03-15 14:14:56,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:14:56,017 INFO L470 AbstractCegarLoop]: Abstraction has 13481 states and 48966 transitions. [2022-03-15 14:14:56,017 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 85 states, 85 states have (on average 3.458823529411765) internal successors, (294), 85 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:14:56,017 INFO L276 IsEmpty]: Start isEmpty. Operand 13481 states and 48966 transitions. [2022-03-15 14:14:56,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-15 14:14:56,042 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:14:56,043 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, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:14:56,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-03-15 14:14:56,243 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:14:56,243 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:14:56,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:14:56,244 INFO L85 PathProgramCache]: Analyzing trace with hash 2051171398, now seen corresponding path program 5 times [2022-03-15 14:14:56,244 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:14:56,244 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889256313] [2022-03-15 14:14:56,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:14:56,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:14:56,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:14:57,094 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:14:57,094 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:14:57,094 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889256313] [2022-03-15 14:14:57,094 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889256313] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:14:57,094 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319211447] [2022-03-15 14:14:57,095 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 14:14:57,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:14:57,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:14:57,096 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 14:14:57,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-03-15 14:14:57,193 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 14:14:57,193 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:14:57,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 83 conjunts are in the unsatisfiable core [2022-03-15 14:14:57,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:14:57,234 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 14:14:57,265 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-03-15 14:14:57,265 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-03-15 14:14:57,313 INFO L353 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-03-15 14:14:57,313 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 30 [2022-03-15 14:14:57,786 INFO L353 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-03-15 14:14:57,786 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 24 treesize of output 34 [2022-03-15 14:14:57,962 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-15 14:14:58,419 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 14:14:58,674 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 14:14:58,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 14:14:58,773 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 14:14:58,922 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:14:58,922 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 27 treesize of output 27 [2022-03-15 14:14:59,185 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:14:59,185 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:14:59,529 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_622 (Array Int Int)) (~M~0 Int)) (or (= (+ c_~res2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_622) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) |c_thread1Thread1of1ForFork0_~tmp~0#1|) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-15 14:14:59,588 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_622 (Array Int Int)) (~M~0 Int) (v_ArrVal_621 (Array Int Int))) (or (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_621) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_622) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) |c_thread1Thread1of1ForFork0_~tmp~0#1|) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-15 14:14:59,639 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_622 (Array Int Int)) (~M~0 Int) (v_ArrVal_621 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_621) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_622) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0)) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-15 14:14:59,654 WARN L838 $PredicateComparison]: unable to prove that (or (not (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0)) (forall ((v_ArrVal_622 (Array Int Int)) (~M~0 Int) (v_ArrVal_621 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_621) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_622) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0)) (< (+ ~M~0 1) c_~N~0)))) is different from false [2022-03-15 14:14:59,668 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_622 (Array Int Int)) (~M~0 Int) (v_ArrVal_621 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_621) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_622) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) c_~res1~0)) (< (+ ~M~0 1) c_~N~0))) (not (< 0 c_~N~0))) is different from false [2022-03-15 14:14:59,695 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_622 (Array Int Int)) (~M~0 Int) (v_ArrVal_621 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_620))) (= (+ (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_621) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_622) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) (+ (select (select .cse0 c_~A~0.base) c_~A~0.offset) c_~res1~0))) (< (+ ~M~0 1) c_~N~0))) (not (< 0 c_~N~0))) is different from false [2022-03-15 14:14:59,838 WARN L838 $PredicateComparison]: unable to prove that (or (not (< 0 c_~N~0)) (forall ((v_ArrVal_622 (Array Int Int)) (~M~0 Int) (v_ArrVal_621 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_620))) (= (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_621) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_622) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4)))) (+ (select (select .cse0 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~res1~0))) (< (+ ~M~0 1) c_~N~0)))) is different from false [2022-03-15 14:14:59,872 WARN L838 $PredicateComparison]: unable to prove that (or (not (< 0 c_~N~0)) (forall ((v_ArrVal_622 (Array Int Int)) (~M~0 Int) (v_ArrVal_621 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_620))) (= (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_621) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_622) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (+ c_~res1~0 (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (< (+ ~M~0 1) c_~N~0)))) is different from false [2022-03-15 14:14:59,888 WARN L838 $PredicateComparison]: unable to prove that (or (not (< 0 c_~N~0)) (forall ((v_ArrVal_622 (Array Int Int)) (~M~0 Int) (v_ArrVal_621 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (or (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_620))) (= (+ (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_621) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_622) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~res2~0) (+ (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~res1~0))) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0)))) is different from false [2022-03-15 14:15:00,171 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:15:00,172 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 55 treesize of output 44 [2022-03-15 14:15:00,180 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:15:00,180 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 1670 treesize of output 1490 [2022-03-15 14:15:00,187 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 1478 treesize of output 1382 [2022-03-15 14:15:00,194 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 1382 treesize of output 1190 [2022-03-15 14:15:00,207 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:15:00,207 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 1190 treesize of output 1090 [2022-03-15 14:15:05,378 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-03-15 14:15:05,378 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [319211447] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:15:05,378 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:15:05,378 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33, 34] total 85 [2022-03-15 14:15:05,379 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246041870] [2022-03-15 14:15:05,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:15:05,379 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2022-03-15 14:15:05,379 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:15:05,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2022-03-15 14:15:05,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=425, Invalid=5300, Unknown=11, NotChecked=1404, Total=7140 [2022-03-15 14:15:05,380 INFO L87 Difference]: Start difference. First operand 13481 states and 48966 transitions. Second operand has 85 states, 85 states have (on average 3.447058823529412) internal successors, (293), 85 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:15:12,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:15:12,323 INFO L93 Difference]: Finished difference Result 32006 states and 115141 transitions. [2022-03-15 14:15:12,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-03-15 14:15:12,323 INFO L78 Accepts]: Start accepts. Automaton has has 85 states, 85 states have (on average 3.447058823529412) internal successors, (293), 85 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2022-03-15 14:15:12,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:15:12,410 INFO L225 Difference]: With dead ends: 32006 [2022-03-15 14:15:12,411 INFO L226 Difference]: Without dead ends: 31937 [2022-03-15 14:15:12,412 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 200 SyntacticMatches, 8 SemanticMatches, 122 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 4108 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=1133, Invalid=12002, Unknown=11, NotChecked=2106, Total=15252 [2022-03-15 14:15:12,412 INFO L933 BasicCegarLoop]: 288 mSDtfsCounter, 1637 mSDsluCounter, 8667 mSDsCounter, 0 mSdLazyCounter, 2528 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1637 SdHoareTripleChecker+Valid, 8491 SdHoareTripleChecker+Invalid, 7791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5206 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 14:15:12,413 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1637 Valid, 8491 Invalid, 7791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 2528 Invalid, 0 Unknown, 5206 Unchecked, 1.0s Time] [2022-03-15 14:15:12,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31937 states. [2022-03-15 14:15:12,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31937 to 13878. [2022-03-15 14:15:12,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13878 states, 13877 states have (on average 3.636737046912157) internal successors, (50467), 13877 states have internal predecessors, (50467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:15:12,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13878 states to 13878 states and 50467 transitions. [2022-03-15 14:15:12,923 INFO L78 Accepts]: Start accepts. Automaton has 13878 states and 50467 transitions. Word has length 124 [2022-03-15 14:15:12,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:15:12,923 INFO L470 AbstractCegarLoop]: Abstraction has 13878 states and 50467 transitions. [2022-03-15 14:15:12,923 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 85 states, 85 states have (on average 3.447058823529412) internal successors, (293), 85 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:15:12,923 INFO L276 IsEmpty]: Start isEmpty. Operand 13878 states and 50467 transitions. [2022-03-15 14:15:12,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-15 14:15:12,949 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:15:12,949 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, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:15:12,965 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-03-15 14:15:13,161 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:15:13,162 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:15:13,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:15:13,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1783840602, now seen corresponding path program 6 times [2022-03-15 14:15:13,162 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:15:13,162 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661636205] [2022-03-15 14:15:13,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:15:13,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:15:13,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:15:13,928 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:15:13,928 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:15:13,928 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661636205] [2022-03-15 14:15:13,928 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661636205] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:15:13,928 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033724921] [2022-03-15 14:15:13,928 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 14:15:13,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:15:13,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:15:13,930 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 14:15:13,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-03-15 14:15:14,026 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 14:15:14,027 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:15:14,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 72 conjunts are in the unsatisfiable core [2022-03-15 14:15:14,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:15:14,083 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 14:15:14,277 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-15 14:15:14,278 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-03-15 14:15:14,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 14:15:14,753 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 14:15:14,828 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 14:15:14,974 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:15:14,974 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 27 treesize of output 27 [2022-03-15 14:15:15,328 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:15:15,329 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:15:15,780 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_657 (Array Int Int)) (~M~0 Int)) (or (< 0 ~M~0) (= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_657) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) |c_thread1Thread1of1ForFork0_~tmp~0#1|) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-15 14:15:15,852 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_656 (Array Int Int)) (v_ArrVal_657 (Array Int Int)) (~M~0 Int)) (or (< 0 ~M~0) (= (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_656) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_657) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) |c_thread1Thread1of1ForFork0_~tmp~0#1|) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-15 14:15:15,901 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:15:15,902 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 92 [2022-03-15 14:15:15,904 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 76 treesize of output 64 [2022-03-15 14:15:15,907 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2022-03-15 14:15:16,979 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-03-15 14:15:17,036 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:15:17,036 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033724921] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:15:17,036 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:15:17,037 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 27, 26] total 71 [2022-03-15 14:15:17,037 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431855366] [2022-03-15 14:15:17,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:15:17,037 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2022-03-15 14:15:17,037 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:15:17,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2022-03-15 14:15:17,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=411, Invalid=4287, Unknown=2, NotChecked=270, Total=4970 [2022-03-15 14:15:17,038 INFO L87 Difference]: Start difference. First operand 13878 states and 50467 transitions. Second operand has 71 states, 71 states have (on average 4.436619718309859) internal successors, (315), 71 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:15:33,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:15:33,474 INFO L93 Difference]: Finished difference Result 43974 states and 160672 transitions. [2022-03-15 14:15:33,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2022-03-15 14:15:33,474 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 71 states have (on average 4.436619718309859) internal successors, (315), 71 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2022-03-15 14:15:33,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:15:33,615 INFO L225 Difference]: With dead ends: 43974 [2022-03-15 14:15:33,615 INFO L226 Difference]: Without dead ends: 43674 [2022-03-15 14:15:33,617 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 213 SyntacticMatches, 20 SemanticMatches, 232 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 19164 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=6994, Invalid=46604, Unknown=2, NotChecked=922, Total=54522 [2022-03-15 14:15:33,617 INFO L933 BasicCegarLoop]: 353 mSDtfsCounter, 2977 mSDsluCounter, 13456 mSDsCounter, 0 mSdLazyCounter, 6174 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2977 SdHoareTripleChecker+Valid, 12937 SdHoareTripleChecker+Invalid, 14134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 6174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7829 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-03-15 14:15:33,618 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2977 Valid, 12937 Invalid, 14134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 6174 Invalid, 0 Unknown, 7829 Unchecked, 2.8s Time] [2022-03-15 14:15:33,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43674 states. [2022-03-15 14:15:34,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43674 to 14665. [2022-03-15 14:15:34,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14665 states, 14664 states have (on average 3.6644844517184945) internal successors, (53736), 14664 states have internal predecessors, (53736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:15:34,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14665 states to 14665 states and 53736 transitions. [2022-03-15 14:15:34,121 INFO L78 Accepts]: Start accepts. Automaton has 14665 states and 53736 transitions. Word has length 124 [2022-03-15 14:15:34,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:15:34,121 INFO L470 AbstractCegarLoop]: Abstraction has 14665 states and 53736 transitions. [2022-03-15 14:15:34,122 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 4.436619718309859) internal successors, (315), 71 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:15:34,122 INFO L276 IsEmpty]: Start isEmpty. Operand 14665 states and 53736 transitions. [2022-03-15 14:15:34,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-15 14:15:34,149 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:15:34,149 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, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:15:34,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-03-15 14:15:34,356 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:15:34,356 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:15:34,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:15:34,357 INFO L85 PathProgramCache]: Analyzing trace with hash -369162054, now seen corresponding path program 7 times [2022-03-15 14:15:34,357 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:15:34,357 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505640870] [2022-03-15 14:15:34,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:15:34,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:15:34,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:15:35,086 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:15:35,087 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:15:35,087 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505640870] [2022-03-15 14:15:35,087 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505640870] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:15:35,087 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507482162] [2022-03-15 14:15:35,087 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 14:15:35,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:15:35,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:15:35,088 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 14:15:35,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-03-15 14:15:35,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:15:35,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 77 conjunts are in the unsatisfiable core [2022-03-15 14:15:35,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:15:35,853 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-15 14:15:36,353 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 14:15:36,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 14:15:36,596 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 14:15:36,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 14:15:36,717 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 14:15:36,994 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:15:36,995 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 27 treesize of output 27 [2022-03-15 14:15:37,430 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:15:37,430 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:15:37,795 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_694 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (= |c_thread1Thread1of1ForFork0_~tmp~0#1| (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_694) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0)))) is different from false [2022-03-15 14:15:37,853 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_694 (Array Int Int)) (v_ArrVal_693 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (= |c_thread1Thread1of1ForFork0_~tmp~0#1| (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_693) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_694) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))))) is different from false [2022-03-15 14:15:37,906 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_694 (Array Int Int)) (v_ArrVal_693 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (= (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0) (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_693) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_694) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))))) is different from false [2022-03-15 14:15:37,929 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_694 (Array Int Int)) (v_ArrVal_693 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (= (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) c_~res1~0) (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_693) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_694) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))))) is different from false [2022-03-15 14:15:37,952 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_692 (Array Int Int)) (v_ArrVal_694 (Array Int Int)) (v_ArrVal_693 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_692))) (= (+ (select (select .cse0 c_~A~0.base) c_~A~0.offset) c_~res1~0) (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_693) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_694) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))))))) is different from false [2022-03-15 14:15:38,066 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_692 (Array Int Int)) (v_ArrVal_694 (Array Int Int)) (v_ArrVal_693 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_692))) (= (+ (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_693) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_694) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))) c_~res2~0) (+ (select (select .cse0 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~res1~0))))) is different from false [2022-03-15 14:15:38,090 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_692 (Array Int Int)) (v_ArrVal_694 (Array Int Int)) (v_ArrVal_693 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_692))) (= (+ (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~res1~0) (+ (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_693) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_694) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~res2~0))))) is different from false [2022-03-15 14:15:38,103 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_692 (Array Int Int)) (v_ArrVal_694 (Array Int Int)) (v_ArrVal_693 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_692))) (= (+ c_~res1~0 (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_693) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_694) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))) is different from false [2022-03-15 14:15:38,364 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:15:38,365 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 55 treesize of output 44 [2022-03-15 14:15:38,373 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:15:38,374 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 410 treesize of output 374 [2022-03-15 14:15:38,378 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 362 treesize of output 314 [2022-03-15 14:15:38,382 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 314 treesize of output 290 [2022-03-15 14:15:38,390 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:15:38,390 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 290 treesize of output 274 [2022-03-15 14:15:40,022 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-03-15 14:15:40,023 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1507482162] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:15:40,023 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:15:40,023 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33, 33] total 84 [2022-03-15 14:15:40,023 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404221927] [2022-03-15 14:15:40,023 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:15:40,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2022-03-15 14:15:40,023 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:15:40,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2022-03-15 14:15:40,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=477, Invalid=5244, Unknown=11, NotChecked=1240, Total=6972 [2022-03-15 14:15:40,024 INFO L87 Difference]: Start difference. First operand 14665 states and 53736 transitions. Second operand has 84 states, 84 states have (on average 3.630952380952381) internal successors, (305), 84 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:15:45,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:15:45,114 INFO L93 Difference]: Finished difference Result 32412 states and 117800 transitions. [2022-03-15 14:15:45,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-03-15 14:15:45,114 INFO L78 Accepts]: Start accepts. Automaton has has 84 states, 84 states have (on average 3.630952380952381) internal successors, (305), 84 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2022-03-15 14:15:45,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:15:45,212 INFO L225 Difference]: With dead ends: 32412 [2022-03-15 14:15:45,212 INFO L226 Difference]: Without dead ends: 32262 [2022-03-15 14:15:45,213 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 199 SyntacticMatches, 8 SemanticMatches, 134 ConstructedPredicates, 8 IntricatePredicates, 2 DeprecatedPredicates, 5295 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1428, Invalid=14849, Unknown=11, NotChecked=2072, Total=18360 [2022-03-15 14:15:45,214 INFO L933 BasicCegarLoop]: 283 mSDtfsCounter, 1734 mSDsluCounter, 9318 mSDsCounter, 0 mSdLazyCounter, 3720 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1734 SdHoareTripleChecker+Valid, 9080 SdHoareTripleChecker+Invalid, 8309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4526 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-15 14:15:45,214 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1734 Valid, 9080 Invalid, 8309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 3720 Invalid, 0 Unknown, 4526 Unchecked, 1.5s Time] [2022-03-15 14:15:45,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32262 states. [2022-03-15 14:15:45,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32262 to 14531. [2022-03-15 14:15:45,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14531 states, 14530 states have (on average 3.658981417756366) internal successors, (53165), 14530 states have internal predecessors, (53165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:15:45,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14531 states to 14531 states and 53165 transitions. [2022-03-15 14:15:45,628 INFO L78 Accepts]: Start accepts. Automaton has 14531 states and 53165 transitions. Word has length 124 [2022-03-15 14:15:45,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:15:45,628 INFO L470 AbstractCegarLoop]: Abstraction has 14531 states and 53165 transitions. [2022-03-15 14:15:45,629 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 84 states, 84 states have (on average 3.630952380952381) internal successors, (305), 84 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:15:45,629 INFO L276 IsEmpty]: Start isEmpty. Operand 14531 states and 53165 transitions. [2022-03-15 14:15:45,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-15 14:15:45,656 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:15:45,656 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, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:15:45,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-03-15 14:15:45,857 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:15:45,857 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:15:45,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:15:45,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1457504890, now seen corresponding path program 8 times [2022-03-15 14:15:45,857 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:15:45,858 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514931279] [2022-03-15 14:15:45,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:15:45,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:15:45,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:15:46,626 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:15:46,626 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:15:46,626 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514931279] [2022-03-15 14:15:46,626 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514931279] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:15:46,626 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519307853] [2022-03-15 14:15:46,626 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 14:15:46,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:15:46,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:15:46,627 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 14:15:46,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-03-15 14:15:46,724 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 14:15:46,724 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:15:46,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 73 conjunts are in the unsatisfiable core [2022-03-15 14:15:46,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:15:46,768 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 14:15:46,797 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-03-15 14:15:46,798 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-03-15 14:15:46,981 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-03-15 14:15:46,981 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-03-15 14:15:47,431 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 14:15:47,501 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 14:15:47,628 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:15:47,629 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 27 treesize of output 27 [2022-03-15 14:15:47,980 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:15:47,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:15:48,400 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_730 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (< 0 ~M~0) (= |c_thread1Thread1of1ForFork0_~tmp~0#1| (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_730) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0)))) is different from false [2022-03-15 14:15:48,452 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_729 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (< 0 ~M~0) (= |c_thread1Thread1of1ForFork0_~tmp~0#1| (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_729) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_730) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0)))) is different from false [2022-03-15 14:15:48,505 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:15:48,506 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 92 [2022-03-15 14:15:48,508 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 76 treesize of output 64 [2022-03-15 14:15:48,511 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2022-03-15 14:15:49,489 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2022-03-15 14:15:49,509 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:15:49,509 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1519307853] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:15:49,509 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:15:49,509 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 27, 26] total 71 [2022-03-15 14:15:49,510 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480389951] [2022-03-15 14:15:49,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:15:49,510 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2022-03-15 14:15:49,510 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:15:49,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2022-03-15 14:15:49,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=4258, Unknown=2, NotChecked=270, Total=4970 [2022-03-15 14:15:49,511 INFO L87 Difference]: Start difference. First operand 14531 states and 53165 transitions. Second operand has 71 states, 71 states have (on average 4.408450704225352) internal successors, (313), 71 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:16:08,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:16:08,703 INFO L93 Difference]: Finished difference Result 54394 states and 196928 transitions. [2022-03-15 14:16:08,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 250 states. [2022-03-15 14:16:08,704 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 71 states have (on average 4.408450704225352) internal successors, (313), 71 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2022-03-15 14:16:08,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:16:08,898 INFO L225 Difference]: With dead ends: 54394 [2022-03-15 14:16:08,899 INFO L226 Difference]: Without dead ends: 53839 [2022-03-15 14:16:08,904 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 535 GetRequests, 219 SyntacticMatches, 13 SemanticMatches, 303 ConstructedPredicates, 2 IntricatePredicates, 2 DeprecatedPredicates, 36334 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=10834, Invalid=80678, Unknown=2, NotChecked=1206, Total=92720 [2022-03-15 14:16:08,905 INFO L933 BasicCegarLoop]: 477 mSDtfsCounter, 3917 mSDsluCounter, 13641 mSDsCounter, 0 mSdLazyCounter, 5294 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3917 SdHoareTripleChecker+Valid, 12853 SdHoareTripleChecker+Invalid, 19791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 5294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 14319 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-03-15 14:16:08,905 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3917 Valid, 12853 Invalid, 19791 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [178 Valid, 5294 Invalid, 0 Unknown, 14319 Unchecked, 2.7s Time] [2022-03-15 14:16:08,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53839 states. [2022-03-15 14:16:09,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53839 to 15140. [2022-03-15 14:16:09,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15140 states, 15139 states have (on average 3.6635841204835193) internal successors, (55463), 15139 states have internal predecessors, (55463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:16:09,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15140 states to 15140 states and 55463 transitions. [2022-03-15 14:16:09,654 INFO L78 Accepts]: Start accepts. Automaton has 15140 states and 55463 transitions. Word has length 124 [2022-03-15 14:16:09,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:16:09,654 INFO L470 AbstractCegarLoop]: Abstraction has 15140 states and 55463 transitions. [2022-03-15 14:16:09,654 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 4.408450704225352) internal successors, (313), 71 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:16:09,654 INFO L276 IsEmpty]: Start isEmpty. Operand 15140 states and 55463 transitions. [2022-03-15 14:16:09,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-15 14:16:09,686 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:16:09,686 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, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:16:09,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-03-15 14:16:09,886 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:16:09,886 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:16:09,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:16:09,887 INFO L85 PathProgramCache]: Analyzing trace with hash -89866212, now seen corresponding path program 9 times [2022-03-15 14:16:09,887 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:16:09,887 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568046091] [2022-03-15 14:16:09,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:16:09,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:16:09,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:16:10,628 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:16:10,629 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:16:10,629 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568046091] [2022-03-15 14:16:10,629 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568046091] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:16:10,629 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525354252] [2022-03-15 14:16:10,629 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 14:16:10,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:16:10,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:16:10,630 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 14:16:10,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-03-15 14:16:10,729 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 14:16:10,729 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:16:10,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 78 conjunts are in the unsatisfiable core [2022-03-15 14:16:10,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:16:10,799 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 14:16:10,839 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-03-15 14:16:10,840 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-03-15 14:16:11,130 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-03-15 14:16:11,131 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-03-15 14:16:11,282 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 11 treesize of output 7 [2022-03-15 14:16:11,548 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 14:16:11,755 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 14:16:11,835 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 14:16:11,978 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:16:11,978 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 27 treesize of output 27 [2022-03-15 14:16:12,365 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:16:12,365 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:16:12,787 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_769 (Array Int Int)) (~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (< 0 ~M~0) (= (+ c_~res2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_769) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) |c_thread1Thread1of1ForFork0_~tmp~0#1|))) is different from false [2022-03-15 14:16:12,843 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_768 (Array Int Int)) (v_ArrVal_769 (Array Int Int)) (~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (< 0 ~M~0) (= (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_768) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_769) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) |c_thread1Thread1of1ForFork0_~tmp~0#1|))) is different from false [2022-03-15 14:16:12,892 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_768 (Array Int Int)) (v_ArrVal_769 (Array Int Int)) (~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (< 0 ~M~0) (= (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_768) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_769) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0)))) is different from false [2022-03-15 14:16:12,904 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_768 (Array Int Int)) (v_ArrVal_769 (Array Int Int)) (~M~0 Int)) (or (<= (+ ~M~0 1) |c_thread1Thread1of1ForFork0_~i~0#1|) (< 0 ~M~0) (= (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_768) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_769) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0)))) is different from false [2022-03-15 14:16:12,916 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_768 (Array Int Int)) (v_ArrVal_769 (Array Int Int)) (~M~0 Int)) (or (<= (+ ~M~0 1) 0) (= (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_768) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_769) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) c_~res1~0)) (< 0 ~M~0))) is different from false [2022-03-15 14:16:12,938 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_768 (Array Int Int)) (v_ArrVal_767 (Array Int Int)) (v_ArrVal_769 (Array Int Int)) (~M~0 Int)) (or (<= (+ ~M~0 1) 0) (< 0 ~M~0) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_767))) (= (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_768) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_769) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (+ (select (select .cse0 c_~A~0.base) c_~A~0.offset) c_~res1~0))))) is different from false [2022-03-15 14:16:13,040 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_768 (Array Int Int)) (v_ArrVal_767 (Array Int Int)) (v_ArrVal_769 (Array Int Int)) (~M~0 Int)) (or (<= (+ ~M~0 1) 0) (< 0 ~M~0) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_767))) (= (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_768) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_769) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4)))) (+ c_~res1~0 (select (select .cse0 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|)))))) is different from false [2022-03-15 14:16:13,063 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_768 (Array Int Int)) (v_ArrVal_767 (Array Int Int)) (v_ArrVal_769 (Array Int Int)) (~M~0 Int)) (or (<= (+ ~M~0 1) 0) (< 0 ~M~0) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_767))) (= (+ c_~res1~0 (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_768) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_769) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))))))) is different from false [2022-03-15 14:16:13,077 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_768 (Array Int Int)) (v_ArrVal_767 (Array Int Int)) (v_ArrVal_769 (Array Int Int)) (~M~0 Int)) (or (<= (+ ~M~0 1) 0) (< 0 ~M~0) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_767))) (= (+ (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~res1~0) (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_768) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_769) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))) is different from false [2022-03-15 14:16:13,138 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:16:13,138 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 55 treesize of output 44 [2022-03-15 14:16:13,146 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-15 14:16:13,146 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 1670 treesize of output 1482 [2022-03-15 14:16:13,157 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 1478 treesize of output 1382 [2022-03-15 14:16:13,165 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 1382 treesize of output 1190 [2022-03-15 14:16:13,177 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-15 14:16:13,177 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 1190 treesize of output 1082 [2022-03-15 14:16:17,039 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2022-03-15 14:16:17,061 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-03-15 14:16:17,061 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525354252] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:16:17,061 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:16:17,061 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 30, 28] total 75 [2022-03-15 14:16:17,061 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142846142] [2022-03-15 14:16:17,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:16:17,062 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-03-15 14:16:17,062 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:16:17,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-03-15 14:16:17,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=408, Invalid=3909, Unknown=9, NotChecked=1224, Total=5550 [2022-03-15 14:16:17,062 INFO L87 Difference]: Start difference. First operand 15140 states and 55463 transitions. Second operand has 75 states, 75 states have (on average 4.16) internal successors, (312), 75 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:16:35,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:16:35,483 INFO L93 Difference]: Finished difference Result 43208 states and 157975 transitions. [2022-03-15 14:16:35,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 195 states. [2022-03-15 14:16:35,484 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 75 states have (on average 4.16) internal successors, (312), 75 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2022-03-15 14:16:35,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:16:35,618 INFO L225 Difference]: With dead ends: 43208 [2022-03-15 14:16:35,618 INFO L226 Difference]: Without dead ends: 42908 [2022-03-15 14:16:35,622 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 481 GetRequests, 215 SyntacticMatches, 12 SemanticMatches, 254 ConstructedPredicates, 9 IntricatePredicates, 1 DeprecatedPredicates, 22032 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=7776, Invalid=53013, Unknown=9, NotChecked=4482, Total=65280 [2022-03-15 14:16:35,622 INFO L933 BasicCegarLoop]: 424 mSDtfsCounter, 2963 mSDsluCounter, 12739 mSDsCounter, 0 mSdLazyCounter, 5986 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2963 SdHoareTripleChecker+Valid, 12056 SdHoareTripleChecker+Invalid, 21478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 5986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 15357 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-03-15 14:16:35,622 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2963 Valid, 12056 Invalid, 21478 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [135 Valid, 5986 Invalid, 0 Unknown, 15357 Unchecked, 2.8s Time] [2022-03-15 14:16:35,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42908 states. [2022-03-15 14:16:36,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42908 to 14977. [2022-03-15 14:16:36,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14977 states, 14976 states have (on average 3.655582264957265) internal successors, (54746), 14976 states have internal predecessors, (54746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:16:36,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14977 states to 14977 states and 54746 transitions. [2022-03-15 14:16:36,251 INFO L78 Accepts]: Start accepts. Automaton has 14977 states and 54746 transitions. Word has length 124 [2022-03-15 14:16:36,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:16:36,251 INFO L470 AbstractCegarLoop]: Abstraction has 14977 states and 54746 transitions. [2022-03-15 14:16:36,251 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 75 states have (on average 4.16) internal successors, (312), 75 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:16:36,252 INFO L276 IsEmpty]: Start isEmpty. Operand 14977 states and 54746 transitions. [2022-03-15 14:16:36,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-15 14:16:36,280 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:16:36,280 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, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:16:36,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-03-15 14:16:36,481 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-03-15 14:16:36,481 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:16:36,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:16:36,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1002033640, now seen corresponding path program 10 times [2022-03-15 14:16:36,482 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:16:36,482 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422856570] [2022-03-15 14:16:36,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:16:36,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:16:36,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:16:37,214 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:16:37,214 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:16:37,214 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422856570] [2022-03-15 14:16:37,214 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422856570] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:16:37,214 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224900484] [2022-03-15 14:16:37,214 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 14:16:37,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:16:37,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:16:37,216 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 14:16:37,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-03-15 14:16:37,316 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 14:16:37,316 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:16:37,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 78 conjunts are in the unsatisfiable core [2022-03-15 14:16:37,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:16:37,969 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-15 14:16:38,474 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 14:16:38,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 14:16:38,720 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 14:16:38,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 14:16:38,820 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 14:16:38,984 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:16:38,984 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 27 treesize of output 27 [2022-03-15 14:16:39,286 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:16:39,286 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:16:39,659 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_806 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (= (+ c_~res2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_806) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) |c_thread1Thread1of1ForFork0_~tmp~0#1|) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-15 14:16:39,722 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_806 (Array Int Int))) (or (= (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_805) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_806) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) |c_thread1Thread1of1ForFork0_~tmp~0#1|) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-15 14:16:39,782 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_806 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (= (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_805) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_806) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0)) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-15 14:16:39,809 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_806 (Array Int Int))) (or (= (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_805) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_806) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) c_~res1~0)) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-15 14:16:39,836 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_806 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_804))) (= (+ (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_805) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_806) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) (+ (select (select .cse0 c_~A~0.base) c_~A~0.offset) c_~res1~0))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-15 14:16:39,985 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_806 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_804))) (= (+ (select (select .cse0 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~res1~0) (+ (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_805) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_806) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))) c_~res2~0))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-15 14:16:40,015 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_806 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_804))) (= (+ (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_805) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_806) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~res2~0) (+ c_~res1~0 (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))))) is different from false [2022-03-15 14:16:40,032 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_806 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_804))) (= (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_805) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_806) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (+ c_~res1~0 (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-15 14:16:40,294 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:16:40,295 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 55 treesize of output 44 [2022-03-15 14:16:40,304 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:16:40,304 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 830 treesize of output 746 [2022-03-15 14:16:40,314 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 734 treesize of output 686 [2022-03-15 14:16:40,320 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 686 treesize of output 590 [2022-03-15 14:16:40,330 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:16:40,331 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 590 treesize of output 546 [2022-03-15 14:16:48,141 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-03-15 14:16:48,142 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [224900484] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:16:48,142 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:16:48,142 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33, 33] total 85 [2022-03-15 14:16:48,142 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115923134] [2022-03-15 14:16:48,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:16:48,143 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2022-03-15 14:16:48,143 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:16:48,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2022-03-15 14:16:48,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=532, Invalid=5341, Unknown=11, NotChecked=1256, Total=7140 [2022-03-15 14:16:48,144 INFO L87 Difference]: Start difference. First operand 14977 states and 54746 transitions. Second operand has 85 states, 85 states have (on average 3.458823529411765) internal successors, (294), 85 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:17:02,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:17:02,113 INFO L93 Difference]: Finished difference Result 35017 states and 126569 transitions. [2022-03-15 14:17:02,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-03-15 14:17:02,114 INFO L78 Accepts]: Start accepts. Automaton has has 85 states, 85 states have (on average 3.458823529411765) internal successors, (294), 85 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2022-03-15 14:17:02,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:17:02,210 INFO L225 Difference]: With dead ends: 35017 [2022-03-15 14:17:02,210 INFO L226 Difference]: Without dead ends: 34723 [2022-03-15 14:17:02,211 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 200 SyntacticMatches, 7 SemanticMatches, 135 ConstructedPredicates, 8 IntricatePredicates, 2 DeprecatedPredicates, 5375 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=1577, Invalid=14956, Unknown=11, NotChecked=2088, Total=18632 [2022-03-15 14:17:02,212 INFO L933 BasicCegarLoop]: 317 mSDtfsCounter, 1955 mSDsluCounter, 9525 mSDsCounter, 0 mSdLazyCounter, 3988 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1955 SdHoareTripleChecker+Valid, 9193 SdHoareTripleChecker+Invalid, 9801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 3988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5756 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-15 14:17:02,212 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1955 Valid, 9193 Invalid, 9801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 3988 Invalid, 0 Unknown, 5756 Unchecked, 1.6s Time] [2022-03-15 14:17:02,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34723 states. [2022-03-15 14:17:02,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34723 to 15137. [2022-03-15 14:17:02,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15137 states, 15136 states have (on average 3.658958773784355) internal successors, (55382), 15136 states have internal predecessors, (55382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:17:02,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15137 states to 15137 states and 55382 transitions. [2022-03-15 14:17:02,650 INFO L78 Accepts]: Start accepts. Automaton has 15137 states and 55382 transitions. Word has length 124 [2022-03-15 14:17:02,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:17:02,651 INFO L470 AbstractCegarLoop]: Abstraction has 15137 states and 55382 transitions. [2022-03-15 14:17:02,651 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 85 states, 85 states have (on average 3.458823529411765) internal successors, (294), 85 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:17:02,651 INFO L276 IsEmpty]: Start isEmpty. Operand 15137 states and 55382 transitions. [2022-03-15 14:17:02,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-15 14:17:02,679 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:17:02,679 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, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:17:02,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-03-15 14:17:02,880 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-03-15 14:17:02,880 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:17:02,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:17:02,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1740562566, now seen corresponding path program 11 times [2022-03-15 14:17:02,881 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:17:02,881 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116979867] [2022-03-15 14:17:02,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:17:02,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:17:02,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:17:03,613 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:17:03,613 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:17:03,613 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116979867] [2022-03-15 14:17:03,613 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116979867] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:17:03,613 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604102656] [2022-03-15 14:17:03,613 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 14:17:03,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:17:03,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:17:03,615 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 14:17:03,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-03-15 14:17:03,722 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 14:17:03,722 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:17:03,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 84 conjunts are in the unsatisfiable core [2022-03-15 14:17:03,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:17:04,360 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-15 14:17:04,877 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 14:17:05,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 14:17:05,175 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 14:17:05,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 14:17:05,307 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 14:17:05,552 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:17:05,552 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2022-03-15 14:17:05,898 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:17:05,898 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:17:06,218 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_843 (Array Int Int)) (~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_843) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) |c_thread1Thread1of1ForFork0_~tmp~0#1|))) is different from false [2022-03-15 14:17:06,272 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_843 (Array Int Int)) (v_ArrVal_842 (Array Int Int)) (~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_842) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_843) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) |c_thread1Thread1of1ForFork0_~tmp~0#1|) (not (< ~M~0 c_~N~0)))) is different from false [2022-03-15 14:17:06,322 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_843 (Array Int Int)) (v_ArrVal_842 (Array Int Int)) (~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_842) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_843) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0)))) is different from false [2022-03-15 14:17:06,337 WARN L838 $PredicateComparison]: unable to prove that (or (not (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0)) (forall ((v_ArrVal_843 (Array Int Int)) (v_ArrVal_842 (Array Int Int)) (~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_842) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_843) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0))))) is different from false [2022-03-15 14:17:06,351 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_843 (Array Int Int)) (v_ArrVal_842 (Array Int Int)) (~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_842) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_843) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) c_~res1~0)))) (not (< 0 c_~N~0))) is different from false [2022-03-15 14:17:06,379 WARN L838 $PredicateComparison]: unable to prove that (or (not (< 0 c_~N~0)) (forall ((v_ArrVal_843 (Array Int Int)) (v_ArrVal_842 (Array Int Int)) (~M~0 Int) (v_ArrVal_841 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_841))) (= (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_842) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_843) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (+ c_~res1~0 (select (select .cse0 c_~A~0.base) c_~A~0.offset))))))) is different from false [2022-03-15 14:17:06,506 WARN L838 $PredicateComparison]: unable to prove that (or (not (< 0 c_~N~0)) (forall ((v_ArrVal_843 (Array Int Int)) (v_ArrVal_842 (Array Int Int)) (~M~0 Int) (v_ArrVal_841 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_841))) (= (+ (select (select .cse0 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~res1~0) (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_842) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_843) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))))))) is different from false [2022-03-15 14:17:06,535 WARN L838 $PredicateComparison]: unable to prove that (or (not (< 0 c_~N~0)) (forall ((v_ArrVal_843 (Array Int Int)) (v_ArrVal_842 (Array Int Int)) (~M~0 Int) (v_ArrVal_841 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_841))) (= (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_842) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_843) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (+ (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~res1~0)))))) is different from false [2022-03-15 14:17:06,552 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_843 (Array Int Int)) (v_ArrVal_842 (Array Int Int)) (~M~0 Int) (v_ArrVal_841 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_841))) (= (+ (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~res1~0) (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_842) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_843) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (not (< ~M~0 c_~N~0)))) (not (< 0 c_~N~0))) is different from false [2022-03-15 14:17:06,822 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:17:06,822 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 55 treesize of output 44 [2022-03-15 14:17:06,831 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:17:06,831 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 1670 treesize of output 1490 [2022-03-15 14:17:06,839 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 1478 treesize of output 1382 [2022-03-15 14:17:06,846 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1382 treesize of output 1190 [2022-03-15 14:17:06,859 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:17:06,860 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 1190 treesize of output 1090 [2022-03-15 14:17:08,244 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-03-15 14:17:08,244 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1604102656] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:17:08,244 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:17:08,244 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33, 33] total 83 [2022-03-15 14:17:08,245 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746369635] [2022-03-15 14:17:08,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:17:08,245 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2022-03-15 14:17:08,245 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:17:08,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2022-03-15 14:17:08,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=504, Invalid=4923, Unknown=11, NotChecked=1368, Total=6806 [2022-03-15 14:17:08,246 INFO L87 Difference]: Start difference. First operand 15137 states and 55382 transitions. Second operand has 83 states, 83 states have (on average 3.6144578313253013) internal successors, (300), 83 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:17:16,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:17:16,819 INFO L93 Difference]: Finished difference Result 35225 states and 128124 transitions. [2022-03-15 14:17:16,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-03-15 14:17:16,819 INFO L78 Accepts]: Start accepts. Automaton has has 83 states, 83 states have (on average 3.6144578313253013) internal successors, (300), 83 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2022-03-15 14:17:16,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:17:16,920 INFO L225 Difference]: With dead ends: 35225 [2022-03-15 14:17:16,921 INFO L226 Difference]: Without dead ends: 35075 [2022-03-15 14:17:16,922 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 197 SyntacticMatches, 9 SemanticMatches, 132 ConstructedPredicates, 9 IntricatePredicates, 1 DeprecatedPredicates, 5053 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=1506, Invalid=14019, Unknown=11, NotChecked=2286, Total=17822 [2022-03-15 14:17:16,922 INFO L933 BasicCegarLoop]: 266 mSDtfsCounter, 1868 mSDsluCounter, 7743 mSDsCounter, 0 mSdLazyCounter, 3831 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1868 SdHoareTripleChecker+Valid, 7461 SdHoareTripleChecker+Invalid, 8211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 3831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4261 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-15 14:17:16,923 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1868 Valid, 7461 Invalid, 8211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 3831 Invalid, 0 Unknown, 4261 Unchecked, 1.6s Time] [2022-03-15 14:17:16,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35075 states. [2022-03-15 14:17:17,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35075 to 15204. [2022-03-15 14:17:17,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15204 states, 15203 states have (on average 3.658817338683155) internal successors, (55625), 15203 states have internal predecessors, (55625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:17:17,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15204 states to 15204 states and 55625 transitions. [2022-03-15 14:17:17,374 INFO L78 Accepts]: Start accepts. Automaton has 15204 states and 55625 transitions. Word has length 124 [2022-03-15 14:17:17,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:17:17,375 INFO L470 AbstractCegarLoop]: Abstraction has 15204 states and 55625 transitions. [2022-03-15 14:17:17,375 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 83 states have (on average 3.6144578313253013) internal successors, (300), 83 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:17:17,375 INFO L276 IsEmpty]: Start isEmpty. Operand 15204 states and 55625 transitions. [2022-03-15 14:17:17,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-15 14:17:17,403 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:17:17,403 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, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:17:17,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-03-15 14:17:17,603 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-03-15 14:17:17,604 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:17:17,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:17:17,604 INFO L85 PathProgramCache]: Analyzing trace with hash -640143214, now seen corresponding path program 12 times [2022-03-15 14:17:17,604 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:17:17,604 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395211292] [2022-03-15 14:17:17,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:17:17,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:17:17,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:17:18,432 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:17:18,432 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:17:18,432 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395211292] [2022-03-15 14:17:18,432 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395211292] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:17:18,432 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [510826408] [2022-03-15 14:17:18,432 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 14:17:18,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:17:18,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:17:18,434 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 14:17:18,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-03-15 14:17:18,542 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 14:17:18,542 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:17:18,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 64 conjunts are in the unsatisfiable core [2022-03-15 14:17:18,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:17:19,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 14:17:19,296 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 14:17:19,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 14:17:19,375 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 14:17:19,536 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:17:19,536 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 27 treesize of output 27 [2022-03-15 14:17:19,911 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:17:19,911 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:17:20,375 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_877 (Array Int Int)) (~M~0 Int)) (or (< 0 ~M~0) (= (+ c_~res2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_877) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) |c_thread1Thread1of1ForFork0_~tmp~0#1|) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-15 14:17:20,428 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_876 (Array Int Int)) (v_ArrVal_877 (Array Int Int)) (~M~0 Int)) (or (< 0 ~M~0) (= |c_thread1Thread1of1ForFork0_~tmp~0#1| (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_876) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_877) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0)) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-15 14:17:20,474 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:17:20,474 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 92 [2022-03-15 14:17:20,477 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 76 treesize of output 64 [2022-03-15 14:17:20,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 34 treesize of output 28 [2022-03-15 14:17:21,252 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:17:21,252 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [510826408] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:17:21,252 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:17:21,252 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 27, 26] total 70 [2022-03-15 14:17:21,252 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336549346] [2022-03-15 14:17:21,253 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:17:21,253 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-03-15 14:17:21,253 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:17:21,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-03-15 14:17:21,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=335, Invalid=4227, Unknown=2, NotChecked=266, Total=4830 [2022-03-15 14:17:21,254 INFO L87 Difference]: Start difference. First operand 15204 states and 55625 transitions. Second operand has 70 states, 70 states have (on average 4.385714285714286) internal successors, (307), 70 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:17:47,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:17:47,268 INFO L93 Difference]: Finished difference Result 81532 states and 295501 transitions. [2022-03-15 14:17:47,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 342 states. [2022-03-15 14:17:47,268 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 70 states have (on average 4.385714285714286) internal successors, (307), 70 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2022-03-15 14:17:47,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:17:47,544 INFO L225 Difference]: With dead ends: 81532 [2022-03-15 14:17:47,544 INFO L226 Difference]: Without dead ends: 80932 [2022-03-15 14:17:47,550 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 655 GetRequests, 251 SyntacticMatches, 17 SemanticMatches, 387 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 63082 ImplicationChecksByTransitivity, 21.4s TimeCoverageRelationStatistics Valid=12290, Invalid=137098, Unknown=2, NotChecked=1542, Total=150932 [2022-03-15 14:17:47,551 INFO L933 BasicCegarLoop]: 505 mSDtfsCounter, 3949 mSDsluCounter, 15551 mSDsCounter, 0 mSdLazyCounter, 8742 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3949 SdHoareTripleChecker+Valid, 14875 SdHoareTripleChecker+Invalid, 16617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 8742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7638 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-03-15 14:17:47,551 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3949 Valid, 14875 Invalid, 16617 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [237 Valid, 8742 Invalid, 0 Unknown, 7638 Unchecked, 4.2s Time] [2022-03-15 14:17:47,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80932 states. [2022-03-15 14:17:48,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80932 to 15290. [2022-03-15 14:17:48,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15290 states, 15289 states have (on average 3.668258224867552) internal successors, (56084), 15289 states have internal predecessors, (56084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:17:48,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15290 states to 15290 states and 56084 transitions. [2022-03-15 14:17:48,620 INFO L78 Accepts]: Start accepts. Automaton has 15290 states and 56084 transitions. Word has length 124 [2022-03-15 14:17:48,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:17:48,620 INFO L470 AbstractCegarLoop]: Abstraction has 15290 states and 56084 transitions. [2022-03-15 14:17:48,620 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 4.385714285714286) internal successors, (307), 70 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:17:48,620 INFO L276 IsEmpty]: Start isEmpty. Operand 15290 states and 56084 transitions. [2022-03-15 14:17:48,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-15 14:17:48,649 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:17:48,649 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, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:17:48,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-03-15 14:17:48,849 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:17:48,849 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:17:48,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:17:48,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1636201500, now seen corresponding path program 13 times [2022-03-15 14:17:48,850 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:17:48,850 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194927133] [2022-03-15 14:17:48,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:17:48,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:17:49,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:17:49,758 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:17:49,758 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:17:49,758 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194927133] [2022-03-15 14:17:49,758 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194927133] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:17:49,759 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663900170] [2022-03-15 14:17:49,759 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 14:17:49,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:17:49,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:17:49,760 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 14:17:49,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-03-15 14:17:49,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:17:49,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 77 conjunts are in the unsatisfiable core [2022-03-15 14:17:49,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:17:50,550 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-15 14:17:51,069 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 14:17:51,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 14:17:51,293 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 14:17:51,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 14:17:51,387 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 14:17:51,542 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:17:51,543 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 27 treesize of output 27 [2022-03-15 14:17:51,835 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:17:51,836 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:17:52,201 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_914 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0) (= |c_thread1Thread1of1ForFork0_~tmp~0#1| (+ c_~res2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_914) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))))) is different from false [2022-03-15 14:17:52,258 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_913 (Array Int Int)) (~M~0 Int) (v_ArrVal_914 (Array Int Int))) (or (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_913) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_914) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) |c_thread1Thread1of1ForFork0_~tmp~0#1|) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-15 14:17:52,311 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_913 (Array Int Int)) (~M~0 Int) (v_ArrVal_914 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_913) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_914) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0)) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-15 14:17:52,337 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_913 (Array Int Int)) (~M~0 Int) (v_ArrVal_914 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0) (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_913) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_914) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) c_~res1~0)))) is different from false [2022-03-15 14:17:52,364 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_913 (Array Int Int)) (v_ArrVal_912 (Array Int Int)) (~M~0 Int) (v_ArrVal_914 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_912))) (= (+ (select (select .cse0 c_~A~0.base) c_~A~0.offset) c_~res1~0) (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_913) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_914) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-15 14:17:52,483 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_913 (Array Int Int)) (v_ArrVal_912 (Array Int Int)) (~M~0 Int) (v_ArrVal_914 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_912))) (= (+ (select (select .cse0 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~res1~0) (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_913) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_914) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4)))))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-15 14:17:52,529 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_913 (Array Int Int)) (v_ArrVal_912 (Array Int Int)) (~M~0 Int) (v_ArrVal_914 (Array Int Int))) (or (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_912))) (= (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_913) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_914) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (+ (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~res1~0))) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-15 14:17:52,543 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_913 (Array Int Int)) (v_ArrVal_912 (Array Int Int)) (~M~0 Int) (v_ArrVal_914 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_912))) (= (+ (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~res1~0) (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_913) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_914) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-15 14:17:52,807 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:17:52,807 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 55 treesize of output 44 [2022-03-15 14:17:52,815 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:17:52,816 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 1670 treesize of output 1490 [2022-03-15 14:17:52,823 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 1478 treesize of output 1382 [2022-03-15 14:17:52,836 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:17:52,836 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 1382 treesize of output 1282 [2022-03-15 14:17:52,844 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 1270 treesize of output 1078 [2022-03-15 14:17:59,903 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-03-15 14:17:59,903 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [663900170] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:17:59,903 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:17:59,903 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33, 33] total 84 [2022-03-15 14:17:59,904 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925487482] [2022-03-15 14:17:59,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:17:59,904 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2022-03-15 14:17:59,904 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:17:59,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2022-03-15 14:17:59,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=415, Invalid=5306, Unknown=11, NotChecked=1240, Total=6972 [2022-03-15 14:17:59,905 INFO L87 Difference]: Start difference. First operand 15290 states and 56084 transitions. Second operand has 84 states, 84 states have (on average 3.5357142857142856) internal successors, (297), 84 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:18:06,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:18:06,594 INFO L93 Difference]: Finished difference Result 38478 states and 140589 transitions. [2022-03-15 14:18:06,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-03-15 14:18:06,595 INFO L78 Accepts]: Start accepts. Automaton has has 84 states, 84 states have (on average 3.5357142857142856) internal successors, (297), 84 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2022-03-15 14:18:06,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:18:06,718 INFO L225 Difference]: With dead ends: 38478 [2022-03-15 14:18:06,718 INFO L226 Difference]: Without dead ends: 38328 [2022-03-15 14:18:06,719 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 200 SyntacticMatches, 10 SemanticMatches, 156 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 7206 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=2095, Invalid=20276, Unknown=11, NotChecked=2424, Total=24806 [2022-03-15 14:18:06,720 INFO L933 BasicCegarLoop]: 284 mSDtfsCounter, 3412 mSDsluCounter, 10343 mSDsCounter, 0 mSdLazyCounter, 4148 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3412 SdHoareTripleChecker+Valid, 9915 SdHoareTripleChecker+Invalid, 11100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 4148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6854 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-15 14:18:06,720 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3412 Valid, 9915 Invalid, 11100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 4148 Invalid, 0 Unknown, 6854 Unchecked, 1.7s Time] [2022-03-15 14:18:06,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38328 states. [2022-03-15 14:18:07,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38328 to 14559. [2022-03-15 14:18:07,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14559 states, 14558 states have (on average 3.6517378760818793) internal successors, (53162), 14558 states have internal predecessors, (53162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:18:07,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14559 states to 14559 states and 53162 transitions. [2022-03-15 14:18:07,165 INFO L78 Accepts]: Start accepts. Automaton has 14559 states and 53162 transitions. Word has length 124 [2022-03-15 14:18:07,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:18:07,166 INFO L470 AbstractCegarLoop]: Abstraction has 14559 states and 53162 transitions. [2022-03-15 14:18:07,166 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 84 states, 84 states have (on average 3.5357142857142856) internal successors, (297), 84 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:18:07,166 INFO L276 IsEmpty]: Start isEmpty. Operand 14559 states and 53162 transitions. [2022-03-15 14:18:07,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-15 14:18:07,192 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:18:07,193 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, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:18:07,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-03-15 14:18:07,393 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-03-15 14:18:07,393 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:18:07,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:18:07,394 INFO L85 PathProgramCache]: Analyzing trace with hash 2068566152, now seen corresponding path program 14 times [2022-03-15 14:18:07,394 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:18:07,394 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088051337] [2022-03-15 14:18:07,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:18:07,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:18:07,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:18:07,970 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:18:07,970 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:18:07,971 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088051337] [2022-03-15 14:18:07,971 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088051337] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:18:07,971 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [39532657] [2022-03-15 14:18:07,971 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 14:18:07,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:18:07,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:18:07,972 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 14:18:07,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-03-15 14:18:08,076 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 14:18:08,076 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:18:08,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 77 conjunts are in the unsatisfiable core [2022-03-15 14:18:08,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:18:08,127 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 14:18:08,174 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-03-15 14:18:08,174 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-03-15 14:18:08,465 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-15 14:18:08,466 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-03-15 14:18:09,037 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 14:18:09,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 14:18:09,134 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 14:18:09,528 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:18:09,528 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 17 treesize of output 17 [2022-03-15 14:18:09,700 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:18:09,701 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:18:10,076 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_950 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (= (+ c_~res2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_950) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) |c_thread1Thread1of1ForFork0_~tmp~0#1|) (< 0 ~M~0))) is different from false [2022-03-15 14:18:10,129 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_949 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_949) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_950) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) |c_thread1Thread1of1ForFork0_~tmp~0#1|) (< 0 ~M~0))) is different from false [2022-03-15 14:18:10,177 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:18:10,177 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 242 treesize of output 178 [2022-03-15 14:18:10,181 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 69 [2022-03-15 14:18:10,184 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 150 treesize of output 126 [2022-03-15 14:18:11,295 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 14:18:11,297 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-03-15 14:18:11,317 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:18:11,317 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [39532657] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:18:11,317 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:18:11,318 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 26] total 63 [2022-03-15 14:18:11,318 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489049392] [2022-03-15 14:18:11,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:18:11,318 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-03-15 14:18:11,318 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:18:11,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-03-15 14:18:11,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=345, Invalid=3321, Unknown=2, NotChecked=238, Total=3906 [2022-03-15 14:18:11,319 INFO L87 Difference]: Start difference. First operand 14559 states and 53162 transitions. Second operand has 63 states, 63 states have (on average 5.031746031746032) internal successors, (317), 63 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:18:18,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:18:18,819 INFO L93 Difference]: Finished difference Result 38539 states and 141440 transitions. [2022-03-15 14:18:18,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2022-03-15 14:18:18,820 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 5.031746031746032) internal successors, (317), 63 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2022-03-15 14:18:18,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:18:18,931 INFO L225 Difference]: With dead ends: 38539 [2022-03-15 14:18:18,932 INFO L226 Difference]: Without dead ends: 38470 [2022-03-15 14:18:18,933 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 212 SyntacticMatches, 4 SemanticMatches, 142 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 6610 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=2433, Invalid=17595, Unknown=2, NotChecked=562, Total=20592 [2022-03-15 14:18:18,933 INFO L933 BasicCegarLoop]: 346 mSDtfsCounter, 1978 mSDsluCounter, 9344 mSDsCounter, 0 mSdLazyCounter, 6105 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1978 SdHoareTripleChecker+Valid, 8817 SdHoareTripleChecker+Invalid, 9130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 6105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2922 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-03-15 14:18:18,933 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1978 Valid, 8817 Invalid, 9130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 6105 Invalid, 0 Unknown, 2922 Unchecked, 2.7s Time] [2022-03-15 14:18:18,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38470 states. [2022-03-15 14:18:19,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38470 to 14572. [2022-03-15 14:18:19,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14572 states, 14571 states have (on average 3.6532152906458033) internal successors, (53231), 14571 states have internal predecessors, (53231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:18:19,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14572 states to 14572 states and 53231 transitions. [2022-03-15 14:18:19,417 INFO L78 Accepts]: Start accepts. Automaton has 14572 states and 53231 transitions. Word has length 124 [2022-03-15 14:18:19,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:18:19,417 INFO L470 AbstractCegarLoop]: Abstraction has 14572 states and 53231 transitions. [2022-03-15 14:18:19,417 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 5.031746031746032) internal successors, (317), 63 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:18:19,417 INFO L276 IsEmpty]: Start isEmpty. Operand 14572 states and 53231 transitions. [2022-03-15 14:18:19,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-15 14:18:19,444 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:18:19,444 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, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:18:19,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-03-15 14:18:19,644 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:18:19,645 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:18:19,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:18:19,645 INFO L85 PathProgramCache]: Analyzing trace with hash -466546552, now seen corresponding path program 15 times [2022-03-15 14:18:19,645 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:18:19,645 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893248570] [2022-03-15 14:18:19,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:18:19,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:18:19,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:18:20,439 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:18:20,440 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:18:20,440 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893248570] [2022-03-15 14:18:20,440 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893248570] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:18:20,440 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082519339] [2022-03-15 14:18:20,440 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 14:18:20,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:18:20,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:18:20,441 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 14:18:20,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-03-15 14:18:20,543 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 14:18:20,543 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:18:20,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 79 conjunts are in the unsatisfiable core [2022-03-15 14:18:20,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:18:20,637 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 14:18:20,881 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-15 14:18:20,881 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-03-15 14:18:21,191 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 11 treesize of output 7 [2022-03-15 14:18:21,495 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 14:18:21,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 14:18:21,744 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 14:18:21,836 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 14:18:22,234 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:18:22,235 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 17 treesize of output 17 [2022-03-15 14:18:22,418 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:18:22,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:18:22,780 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_988 (Array Int Int)) (|v_thread3Thread1of1ForFork2_~i~2#1_80| Int)) (or (= |c_thread1Thread1of1ForFork0_~tmp~0#1| (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_988) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork2_~i~2#1_80| 4))) c_~res2~0)) (<= (+ 2 |v_thread3Thread1of1ForFork2_~i~2#1_80|) c_~N~0) (< 0 |v_thread3Thread1of1ForFork2_~i~2#1_80|))) is different from false [2022-03-15 14:18:22,835 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_988 (Array Int Int)) (v_ArrVal_987 (Array Int Int)) (|v_thread3Thread1of1ForFork2_~i~2#1_80| Int)) (or (<= (+ 2 |v_thread3Thread1of1ForFork2_~i~2#1_80|) c_~N~0) (< 0 |v_thread3Thread1of1ForFork2_~i~2#1_80|) (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_987) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_988) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork2_~i~2#1_80| 4)))) |c_thread1Thread1of1ForFork0_~tmp~0#1|))) is different from false [2022-03-15 14:18:22,890 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_988 (Array Int Int)) (v_ArrVal_987 (Array Int Int)) (|v_thread3Thread1of1ForFork2_~i~2#1_80| Int)) (or (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_987) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_988) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork2_~i~2#1_80| 4)))) (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0)) (<= (+ 2 |v_thread3Thread1of1ForFork2_~i~2#1_80|) c_~N~0) (< 0 |v_thread3Thread1of1ForFork2_~i~2#1_80|))) is different from false [2022-03-15 14:18:22,904 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_988 (Array Int Int)) (v_ArrVal_987 (Array Int Int)) (|v_thread3Thread1of1ForFork2_~i~2#1_80| Int)) (or (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_987) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_988) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork2_~i~2#1_80| 4)))) (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0)) (<= (+ |v_thread3Thread1of1ForFork2_~i~2#1_80| 1) |c_thread1Thread1of1ForFork0_~i~0#1|) (< 0 |v_thread3Thread1of1ForFork2_~i~2#1_80|))) is different from false [2022-03-15 14:18:22,918 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_988 (Array Int Int)) (v_ArrVal_987 (Array Int Int)) (|v_thread3Thread1of1ForFork2_~i~2#1_80| Int)) (or (<= (+ |v_thread3Thread1of1ForFork2_~i~2#1_80| 1) 0) (< 0 |v_thread3Thread1of1ForFork2_~i~2#1_80|) (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_987) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_988) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork2_~i~2#1_80| 4)))) (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) c_~res1~0)))) is different from false [2022-03-15 14:18:22,944 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_986 (Array Int Int)) (v_ArrVal_988 (Array Int Int)) (v_ArrVal_987 (Array Int Int)) (|v_thread3Thread1of1ForFork2_~i~2#1_80| Int)) (or (<= (+ |v_thread3Thread1of1ForFork2_~i~2#1_80| 1) 0) (< 0 |v_thread3Thread1of1ForFork2_~i~2#1_80|) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_986))) (= (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_987) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_988) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork2_~i~2#1_80| 4)))) (+ (select (select .cse0 c_~A~0.base) c_~A~0.offset) c_~res1~0))))) is different from false [2022-03-15 14:18:23,059 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_986 (Array Int Int)) (v_ArrVal_988 (Array Int Int)) (v_ArrVal_987 (Array Int Int)) (|v_thread3Thread1of1ForFork2_~i~2#1_80| Int)) (or (<= (+ |v_thread3Thread1of1ForFork2_~i~2#1_80| 1) 0) (< 0 |v_thread3Thread1of1ForFork2_~i~2#1_80|) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_986))) (= (+ (select (select .cse0 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~res1~0) (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_987) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_988) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* |v_thread3Thread1of1ForFork2_~i~2#1_80| 4)))))))) is different from false [2022-03-15 14:18:23,082 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_986 (Array Int Int)) (v_ArrVal_988 (Array Int Int)) (v_ArrVal_987 (Array Int Int)) (|v_thread3Thread1of1ForFork2_~i~2#1_80| Int)) (or (<= (+ |v_thread3Thread1of1ForFork2_~i~2#1_80| 1) 0) (< 0 |v_thread3Thread1of1ForFork2_~i~2#1_80|) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_986))) (= (+ (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_987) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_988) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_80| 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~res2~0) (+ c_~res1~0 (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))))) is different from false [2022-03-15 14:18:23,095 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_986 (Array Int Int)) (v_ArrVal_988 (Array Int Int)) (v_ArrVal_987 (Array Int Int)) (|v_thread3Thread1of1ForFork2_~i~2#1_80| Int)) (or (<= (+ |v_thread3Thread1of1ForFork2_~i~2#1_80| 1) 0) (< 0 |v_thread3Thread1of1ForFork2_~i~2#1_80|) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_986))) (= (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_987) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_988) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_80| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (+ (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~res1~0))))) is different from false [2022-03-15 14:18:23,155 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:18:23,156 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 55 treesize of output 44 [2022-03-15 14:18:23,164 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-15 14:18:23,165 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 3350 treesize of output 2970 [2022-03-15 14:18:23,181 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 2966 treesize of output 2582 [2022-03-15 14:18:23,190 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 2582 treesize of output 2390 [2022-03-15 14:18:23,205 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-15 14:18:23,205 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 2390 treesize of output 2170 [2022-03-15 14:18:42,720 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-03-15 14:18:42,786 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-03-15 14:18:42,786 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082519339] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:18:42,786 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:18:42,786 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 28] total 72 [2022-03-15 14:18:42,786 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498882563] [2022-03-15 14:18:42,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:18:42,786 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-03-15 14:18:42,787 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:18:42,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-03-15 14:18:42,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=401, Invalid=3532, Unknown=9, NotChecked=1170, Total=5112 [2022-03-15 14:18:42,787 INFO L87 Difference]: Start difference. First operand 14572 states and 53231 transitions. Second operand has 72 states, 72 states have (on average 4.416666666666667) internal successors, (318), 72 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:18:51,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:18:51,630 INFO L93 Difference]: Finished difference Result 45167 states and 164008 transitions. [2022-03-15 14:18:51,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2022-03-15 14:18:51,630 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 4.416666666666667) internal successors, (318), 72 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2022-03-15 14:18:51,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:18:51,768 INFO L225 Difference]: With dead ends: 45167 [2022-03-15 14:18:51,768 INFO L226 Difference]: Without dead ends: 45029 [2022-03-15 14:18:51,770 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 209 SyntacticMatches, 8 SemanticMatches, 180 ConstructedPredicates, 9 IntricatePredicates, 1 DeprecatedPredicates, 11505 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=2884, Invalid=26899, Unknown=9, NotChecked=3150, Total=32942 [2022-03-15 14:18:51,770 INFO L933 BasicCegarLoop]: 307 mSDtfsCounter, 1944 mSDsluCounter, 11315 mSDsCounter, 0 mSdLazyCounter, 8385 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1944 SdHoareTripleChecker+Valid, 10490 SdHoareTripleChecker+Invalid, 15320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 8385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6845 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-03-15 14:18:51,770 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1944 Valid, 10490 Invalid, 15320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 8385 Invalid, 0 Unknown, 6845 Unchecked, 3.5s Time] [2022-03-15 14:18:51,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45029 states. [2022-03-15 14:18:52,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45029 to 14617. [2022-03-15 14:18:52,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14617 states, 14616 states have (on average 3.652504105090312) internal successors, (53385), 14616 states have internal predecessors, (53385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:18:52,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14617 states to 14617 states and 53385 transitions. [2022-03-15 14:18:52,283 INFO L78 Accepts]: Start accepts. Automaton has 14617 states and 53385 transitions. Word has length 124 [2022-03-15 14:18:52,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:18:52,283 INFO L470 AbstractCegarLoop]: Abstraction has 14617 states and 53385 transitions. [2022-03-15 14:18:52,283 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 4.416666666666667) internal successors, (318), 72 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:18:52,284 INFO L276 IsEmpty]: Start isEmpty. Operand 14617 states and 53385 transitions. [2022-03-15 14:18:52,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-15 14:18:52,314 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:18:52,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:18:52,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-03-15 14:18:52,519 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-03-15 14:18:52,519 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:18:52,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:18:52,520 INFO L85 PathProgramCache]: Analyzing trace with hash 2055882024, now seen corresponding path program 16 times [2022-03-15 14:18:52,520 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:18:52,520 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175850377] [2022-03-15 14:18:52,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:18:52,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:18:52,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:18:53,280 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:18:53,280 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:18:53,280 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175850377] [2022-03-15 14:18:53,280 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175850377] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:18:53,280 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184141742] [2022-03-15 14:18:53,280 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 14:18:53,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:18:53,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:18:53,281 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 14:18:53,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-03-15 14:18:53,388 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 14:18:53,389 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:18:53,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 78 conjunts are in the unsatisfiable core [2022-03-15 14:18:53,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:18:54,072 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-15 14:18:54,566 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 14:18:54,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 14:18:54,811 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 14:18:54,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 14:18:54,903 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 14:18:55,180 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:18:55,180 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2022-03-15 14:18:55,407 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:18:55,407 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:18:55,762 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1025 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (= |c_thread1Thread1of1ForFork0_~tmp~0#1| (+ c_~res2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1025) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))))) is different from false [2022-03-15 14:18:55,817 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1025 (Array Int Int)) (v_ArrVal_1024 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1024) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1025) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) |c_thread1Thread1of1ForFork0_~tmp~0#1|))) is different from false [2022-03-15 14:18:55,865 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1025 (Array Int Int)) (v_ArrVal_1024 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1024) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1025) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0)))) is different from false [2022-03-15 14:18:55,886 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1025 (Array Int Int)) (v_ArrVal_1024 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1024) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1025) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) c_~res1~0)))) is different from false [2022-03-15 14:18:55,921 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1025 (Array Int Int)) (v_ArrVal_1024 (Array Int Int)) (v_ArrVal_1023 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1023))) (= (+ (select (select .cse0 c_~A~0.base) c_~A~0.offset) c_~res1~0) (+ (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1024) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1025) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0))))) is different from false [2022-03-15 14:18:56,028 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1025 (Array Int Int)) (v_ArrVal_1024 (Array Int Int)) (v_ArrVal_1023 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1023))) (= (+ c_~res1~0 (select (select .cse0 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|)) (+ (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1024) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1025) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))) c_~res2~0))))) is different from false [2022-03-15 14:18:56,051 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1025 (Array Int Int)) (v_ArrVal_1024 (Array Int Int)) (v_ArrVal_1023 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1023))) (= (+ c_~res1~0 (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (+ (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1024) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1025) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~res2~0))) (not (< ~M~0 c_~N~0)))) is different from false [2022-03-15 14:18:56,064 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1025 (Array Int Int)) (v_ArrVal_1024 (Array Int Int)) (v_ArrVal_1023 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1023))) (= (+ (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1024) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1025) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~res2~0) (+ (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~res1~0))))) is different from false [2022-03-15 14:18:56,287 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:18:56,288 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 55 treesize of output 44 [2022-03-15 14:18:56,295 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:18:56,296 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 830 treesize of output 746 [2022-03-15 14:18:56,302 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 734 treesize of output 638 [2022-03-15 14:18:56,307 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 638 treesize of output 590 [2022-03-15 14:18:56,317 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:18:56,317 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 590 treesize of output 546 [2022-03-15 14:18:59,036 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-03-15 14:18:59,036 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [184141742] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:18:59,037 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:18:59,037 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33, 33] total 81 [2022-03-15 14:18:59,037 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310739922] [2022-03-15 14:18:59,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:18:59,037 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2022-03-15 14:18:59,037 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:18:59,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2022-03-15 14:18:59,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=505, Invalid=4772, Unknown=11, NotChecked=1192, Total=6480 [2022-03-15 14:18:59,038 INFO L87 Difference]: Start difference. First operand 14617 states and 53385 transitions. Second operand has 81 states, 81 states have (on average 3.765432098765432) internal successors, (305), 81 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:04,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:19:04,170 INFO L93 Difference]: Finished difference Result 33108 states and 120095 transitions. [2022-03-15 14:19:04,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-03-15 14:19:04,170 INFO L78 Accepts]: Start accepts. Automaton has has 81 states, 81 states have (on average 3.765432098765432) internal successors, (305), 81 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2022-03-15 14:19:04,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:19:04,276 INFO L225 Difference]: With dead ends: 33108 [2022-03-15 14:19:04,276 INFO L226 Difference]: Without dead ends: 32958 [2022-03-15 14:19:04,278 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 203 SyntacticMatches, 8 SemanticMatches, 118 ConstructedPredicates, 8 IntricatePredicates, 2 DeprecatedPredicates, 4215 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=1271, Invalid=11182, Unknown=11, NotChecked=1816, Total=14280 [2022-03-15 14:19:04,278 INFO L933 BasicCegarLoop]: 287 mSDtfsCounter, 1394 mSDsluCounter, 9172 mSDsCounter, 0 mSdLazyCounter, 3345 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1394 SdHoareTripleChecker+Valid, 8762 SdHoareTripleChecker+Invalid, 8598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 3345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5202 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-15 14:19:04,278 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1394 Valid, 8762 Invalid, 8598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 3345 Invalid, 0 Unknown, 5202 Unchecked, 1.4s Time] [2022-03-15 14:19:04,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32958 states. [2022-03-15 14:19:04,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32958 to 14528. [2022-03-15 14:19:04,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14528 states, 14527 states have (on average 3.6524402836098298) internal successors, (53059), 14527 states have internal predecessors, (53059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:04,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14528 states to 14528 states and 53059 transitions. [2022-03-15 14:19:04,896 INFO L78 Accepts]: Start accepts. Automaton has 14528 states and 53059 transitions. Word has length 124 [2022-03-15 14:19:04,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:19:04,896 INFO L470 AbstractCegarLoop]: Abstraction has 14528 states and 53059 transitions. [2022-03-15 14:19:04,896 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 81 states have (on average 3.765432098765432) internal successors, (305), 81 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:04,897 INFO L276 IsEmpty]: Start isEmpty. Operand 14528 states and 53059 transitions. [2022-03-15 14:19:04,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-15 14:19:04,926 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:19:04,927 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, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:19:04,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-03-15 14:19:05,127 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:19:05,127 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:19:05,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:19:05,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1356284150, now seen corresponding path program 5 times [2022-03-15 14:19:05,128 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:19:05,128 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520411269] [2022-03-15 14:19:05,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:19:05,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:19:05,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:19:05,501 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:19:05,501 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:19:05,501 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520411269] [2022-03-15 14:19:05,501 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520411269] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:19:05,501 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [212376144] [2022-03-15 14:19:05,501 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 14:19:05,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:19:05,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:19:05,502 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 14:19:05,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-03-15 14:19:05,616 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 14:19:05,616 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:19:05,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 69 conjunts are in the unsatisfiable core [2022-03-15 14:19:05,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:19:06,108 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 11 treesize of output 7 [2022-03-15 14:19:06,405 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 14:19:06,534 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 14:19:06,619 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 14:19:06,750 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-03-15 14:19:06,800 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:19:06,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:19:06,945 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1062 (Array Int Int))) (= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1062) c_~A~0.base))) (+ (* (- 1) (select .cse0 c_~A~0.offset)) c_~res1~0 (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (* (- 1) c_~res2~0))) 0)) is different from false [2022-03-15 14:19:06,963 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1062 (Array Int Int)) (v_ArrVal_1061 (Array Int Int))) (= (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1061) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1062) c_~A~0.base))) (+ c_~res1~0 (* (- 1) (select .cse0 c_~A~0.offset)) (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (* (- 1) c_~res2~0))) 0)) is different from false [2022-03-15 14:19:07,077 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-03-15 14:19:07,077 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [212376144] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:19:07,077 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:19:07,077 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 24, 13] total 39 [2022-03-15 14:19:07,078 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625853186] [2022-03-15 14:19:07,078 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:19:07,078 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-03-15 14:19:07,078 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:19:07,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-03-15 14:19:07,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1161, Unknown=2, NotChecked=142, Total=1482 [2022-03-15 14:19:07,079 INFO L87 Difference]: Start difference. First operand 14528 states and 53059 transitions. Second operand has 39 states, 39 states have (on average 7.256410256410256) internal successors, (283), 39 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:08,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:19:08,339 INFO L93 Difference]: Finished difference Result 24336 states and 88625 transitions. [2022-03-15 14:19:08,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-15 14:19:08,339 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 7.256410256410256) internal successors, (283), 39 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2022-03-15 14:19:08,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:19:08,411 INFO L225 Difference]: With dead ends: 24336 [2022-03-15 14:19:08,412 INFO L226 Difference]: Without dead ends: 24186 [2022-03-15 14:19:08,412 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 226 SyntacticMatches, 4 SemanticMatches, 59 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1014 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=463, Invalid=2965, Unknown=2, NotChecked=230, Total=3660 [2022-03-15 14:19:08,412 INFO L933 BasicCegarLoop]: 229 mSDtfsCounter, 1304 mSDsluCounter, 3145 mSDsCounter, 0 mSdLazyCounter, 1348 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1304 SdHoareTripleChecker+Valid, 3176 SdHoareTripleChecker+Invalid, 2032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 659 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 14:19:08,412 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1304 Valid, 3176 Invalid, 2032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1348 Invalid, 0 Unknown, 659 Unchecked, 0.6s Time] [2022-03-15 14:19:08,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24186 states. [2022-03-15 14:19:08,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24186 to 15188. [2022-03-15 14:19:08,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15188 states, 15187 states have (on average 3.6518733127016527) internal successors, (55461), 15187 states have internal predecessors, (55461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:08,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15188 states to 15188 states and 55461 transitions. [2022-03-15 14:19:08,811 INFO L78 Accepts]: Start accepts. Automaton has 15188 states and 55461 transitions. Word has length 124 [2022-03-15 14:19:08,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:19:08,811 INFO L470 AbstractCegarLoop]: Abstraction has 15188 states and 55461 transitions. [2022-03-15 14:19:08,812 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 7.256410256410256) internal successors, (283), 39 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:08,812 INFO L276 IsEmpty]: Start isEmpty. Operand 15188 states and 55461 transitions. [2022-03-15 14:19:08,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-15 14:19:08,842 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:19:08,842 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, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:19:08,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-03-15 14:19:09,042 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:19:09,043 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:19:09,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:19:09,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1830773178, now seen corresponding path program 6 times [2022-03-15 14:19:09,043 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:19:09,043 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973834082] [2022-03-15 14:19:09,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:19:09,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:19:09,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:19:09,357 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:19:09,358 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:19:09,358 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973834082] [2022-03-15 14:19:09,358 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973834082] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:19:09,358 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714049572] [2022-03-15 14:19:09,358 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 14:19:09,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:19:09,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:19:09,364 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 14:19:09,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-03-15 14:19:09,473 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-03-15 14:19:09,473 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:19:09,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 51 conjunts are in the unsatisfiable core [2022-03-15 14:19:09,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:19:09,886 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 15 [2022-03-15 14:19:09,950 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:19:09,950 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:19:10,024 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:19:10,024 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 27 treesize of output 28 [2022-03-15 14:19:10,216 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:19:10,216 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714049572] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:19:10,216 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:19:10,216 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 11] total 24 [2022-03-15 14:19:10,217 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531440649] [2022-03-15 14:19:10,217 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:19:10,217 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 14:19:10,217 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:19:10,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 14:19:10,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=467, Unknown=0, NotChecked=0, Total=552 [2022-03-15 14:19:10,217 INFO L87 Difference]: Start difference. First operand 15188 states and 55461 transitions. Second operand has 24 states, 24 states have (on average 8.958333333333334) internal successors, (215), 24 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:11,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:19:11,134 INFO L93 Difference]: Finished difference Result 35417 states and 128836 transitions. [2022-03-15 14:19:11,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-03-15 14:19:11,134 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 8.958333333333334) internal successors, (215), 24 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2022-03-15 14:19:11,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:19:11,243 INFO L225 Difference]: With dead ends: 35417 [2022-03-15 14:19:11,244 INFO L226 Difference]: Without dead ends: 35267 [2022-03-15 14:19:11,244 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 241 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 750 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=402, Invalid=2354, Unknown=0, NotChecked=0, Total=2756 [2022-03-15 14:19:11,244 INFO L933 BasicCegarLoop]: 259 mSDtfsCounter, 1370 mSDsluCounter, 2824 mSDsCounter, 0 mSdLazyCounter, 924 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1370 SdHoareTripleChecker+Valid, 2908 SdHoareTripleChecker+Invalid, 974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 14:19:11,245 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1370 Valid, 2908 Invalid, 974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 924 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 14:19:11,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35267 states. [2022-03-15 14:19:11,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35267 to 15372. [2022-03-15 14:19:11,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15372 states, 15371 states have (on average 3.6530479474334787) internal successors, (56151), 15371 states have internal predecessors, (56151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:11,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15372 states to 15372 states and 56151 transitions. [2022-03-15 14:19:11,774 INFO L78 Accepts]: Start accepts. Automaton has 15372 states and 56151 transitions. Word has length 124 [2022-03-15 14:19:11,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:19:11,774 INFO L470 AbstractCegarLoop]: Abstraction has 15372 states and 56151 transitions. [2022-03-15 14:19:11,774 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 8.958333333333334) internal successors, (215), 24 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:11,774 INFO L276 IsEmpty]: Start isEmpty. Operand 15372 states and 56151 transitions. [2022-03-15 14:19:11,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-15 14:19:11,801 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:19:11,801 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, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:19:11,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-03-15 14:19:12,001 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:19:12,001 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:19:12,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:19:12,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1266592118, now seen corresponding path program 7 times [2022-03-15 14:19:12,002 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:19:12,002 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876546442] [2022-03-15 14:19:12,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:19:12,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:19:12,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:19:12,223 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:19:12,223 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:19:12,223 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876546442] [2022-03-15 14:19:12,223 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876546442] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:19:12,223 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692667588] [2022-03-15 14:19:12,223 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 14:19:12,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:19:12,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:19:12,235 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 14:19:12,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-03-15 14:19:12,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:19:12,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 49 conjunts are in the unsatisfiable core [2022-03-15 14:19:12,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:19:12,783 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 15 [2022-03-15 14:19:12,855 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:19:12,855 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:19:12,925 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:19:12,925 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 27 treesize of output 28 [2022-03-15 14:19:13,118 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:19:13,119 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [692667588] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:19:13,119 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:19:13,119 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12, 11] total 26 [2022-03-15 14:19:13,119 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307407441] [2022-03-15 14:19:13,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:19:13,119 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 14:19:13,119 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:19:13,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 14:19:13,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2022-03-15 14:19:13,120 INFO L87 Difference]: Start difference. First operand 15372 states and 56151 transitions. Second operand has 26 states, 26 states have (on average 10.115384615384615) internal successors, (263), 26 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:14,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:19:14,126 INFO L93 Difference]: Finished difference Result 31445 states and 114553 transitions. [2022-03-15 14:19:14,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-15 14:19:14,126 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 10.115384615384615) internal successors, (263), 26 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2022-03-15 14:19:14,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:19:14,236 INFO L225 Difference]: With dead ends: 31445 [2022-03-15 14:19:14,236 INFO L226 Difference]: Without dead ends: 31295 [2022-03-15 14:19:14,236 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 239 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 586 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=349, Invalid=1907, Unknown=0, NotChecked=0, Total=2256 [2022-03-15 14:19:14,236 INFO L933 BasicCegarLoop]: 264 mSDtfsCounter, 785 mSDsluCounter, 3464 mSDsCounter, 0 mSdLazyCounter, 1141 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 3509 SdHoareTripleChecker+Invalid, 1162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 14:19:14,237 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [785 Valid, 3509 Invalid, 1162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1141 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 14:19:14,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31295 states. [2022-03-15 14:19:14,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31295 to 15296. [2022-03-15 14:19:14,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15296 states, 15295 states have (on average 3.65289310232102) internal successors, (55871), 15295 states have internal predecessors, (55871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:14,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15296 states to 15296 states and 55871 transitions. [2022-03-15 14:19:14,720 INFO L78 Accepts]: Start accepts. Automaton has 15296 states and 55871 transitions. Word has length 124 [2022-03-15 14:19:14,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:19:14,721 INFO L470 AbstractCegarLoop]: Abstraction has 15296 states and 55871 transitions. [2022-03-15 14:19:14,721 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 10.115384615384615) internal successors, (263), 26 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:14,721 INFO L276 IsEmpty]: Start isEmpty. Operand 15296 states and 55871 transitions. [2022-03-15 14:19:14,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-15 14:19:14,751 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:19:14,751 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, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:19:14,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-03-15 14:19:14,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-03-15 14:19:14,952 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:19:14,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:19:14,952 INFO L85 PathProgramCache]: Analyzing trace with hash 78530768, now seen corresponding path program 8 times [2022-03-15 14:19:14,952 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:19:14,952 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757454887] [2022-03-15 14:19:14,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:19:14,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:19:14,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:19:15,176 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:19:15,176 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:19:15,176 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757454887] [2022-03-15 14:19:15,176 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757454887] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:19:15,176 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471505576] [2022-03-15 14:19:15,177 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 14:19:15,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:19:15,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:19:15,180 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 14:19:15,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-03-15 14:19:15,302 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 14:19:15,302 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:19:15,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 51 conjunts are in the unsatisfiable core [2022-03-15 14:19:15,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:19:15,705 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 15 [2022-03-15 14:19:15,826 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:19:15,826 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:19:15,898 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:19:15,898 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 27 treesize of output 28 [2022-03-15 14:19:16,079 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:19:16,079 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [471505576] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:19:16,079 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:19:16,079 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 11] total 24 [2022-03-15 14:19:16,079 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885312266] [2022-03-15 14:19:16,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:19:16,080 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 14:19:16,080 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:19:16,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 14:19:16,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2022-03-15 14:19:16,080 INFO L87 Difference]: Start difference. First operand 15296 states and 55871 transitions. Second operand has 24 states, 24 states have (on average 8.958333333333334) internal successors, (215), 24 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:17,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:19:17,058 INFO L93 Difference]: Finished difference Result 38199 states and 138740 transitions. [2022-03-15 14:19:17,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-03-15 14:19:17,058 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 8.958333333333334) internal successors, (215), 24 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2022-03-15 14:19:17,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:19:17,185 INFO L225 Difference]: With dead ends: 38199 [2022-03-15 14:19:17,186 INFO L226 Difference]: Without dead ends: 38049 [2022-03-15 14:19:17,186 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 241 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 646 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=359, Invalid=2191, Unknown=0, NotChecked=0, Total=2550 [2022-03-15 14:19:17,186 INFO L933 BasicCegarLoop]: 254 mSDtfsCounter, 1200 mSDsluCounter, 3167 mSDsCounter, 0 mSdLazyCounter, 1139 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1200 SdHoareTripleChecker+Valid, 3215 SdHoareTripleChecker+Invalid, 1172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 14:19:17,187 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1200 Valid, 3215 Invalid, 1172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1139 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 14:19:17,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38049 states. [2022-03-15 14:19:17,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38049 to 15320. [2022-03-15 14:19:17,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15320 states, 15319 states have (on average 3.6550688687251127) internal successors, (55992), 15319 states have internal predecessors, (55992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:17,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15320 states to 15320 states and 55992 transitions. [2022-03-15 14:19:17,708 INFO L78 Accepts]: Start accepts. Automaton has 15320 states and 55992 transitions. Word has length 124 [2022-03-15 14:19:17,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:19:17,708 INFO L470 AbstractCegarLoop]: Abstraction has 15320 states and 55992 transitions. [2022-03-15 14:19:17,708 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 8.958333333333334) internal successors, (215), 24 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:17,708 INFO L276 IsEmpty]: Start isEmpty. Operand 15320 states and 55992 transitions. [2022-03-15 14:19:17,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-15 14:19:17,737 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:19:17,737 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, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:19:17,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-03-15 14:19:17,937 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-03-15 14:19:17,937 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:19:17,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:19:17,938 INFO L85 PathProgramCache]: Analyzing trace with hash 416009350, now seen corresponding path program 9 times [2022-03-15 14:19:17,938 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:19:17,938 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214849948] [2022-03-15 14:19:17,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:19:17,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:19:17,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:19:18,231 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:19:18,232 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:19:18,232 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214849948] [2022-03-15 14:19:18,232 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214849948] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:19:18,232 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689779016] [2022-03-15 14:19:18,232 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 14:19:18,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:19:18,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:19:18,233 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 14:19:18,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-03-15 14:19:18,348 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 14:19:18,349 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:19:18,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 51 conjunts are in the unsatisfiable core [2022-03-15 14:19:18,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:19:18,771 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-03-15 14:19:18,829 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:19:18,829 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:19:18,913 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:19:18,913 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 27 treesize of output 28 [2022-03-15 14:19:19,096 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:19:19,096 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [689779016] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:19:19,096 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:19:19,097 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 11] total 25 [2022-03-15 14:19:19,097 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115853407] [2022-03-15 14:19:19,097 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:19:19,097 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 14:19:19,097 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:19:19,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 14:19:19,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2022-03-15 14:19:19,098 INFO L87 Difference]: Start difference. First operand 15320 states and 55992 transitions. Second operand has 25 states, 25 states have (on average 8.64) internal successors, (216), 25 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:19,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:19:19,976 INFO L93 Difference]: Finished difference Result 30271 states and 110000 transitions. [2022-03-15 14:19:19,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-15 14:19:19,977 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 8.64) internal successors, (216), 25 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2022-03-15 14:19:19,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:19:20,073 INFO L225 Difference]: With dead ends: 30271 [2022-03-15 14:19:20,073 INFO L226 Difference]: Without dead ends: 30121 [2022-03-15 14:19:20,074 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 239 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=258, Invalid=1548, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 14:19:20,074 INFO L933 BasicCegarLoop]: 250 mSDtfsCounter, 791 mSDsluCounter, 3031 mSDsCounter, 0 mSdLazyCounter, 1214 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 791 SdHoareTripleChecker+Valid, 3074 SdHoareTripleChecker+Invalid, 1231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 14:19:20,074 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [791 Valid, 3074 Invalid, 1231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1214 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 14:19:20,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30121 states. [2022-03-15 14:19:20,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30121 to 15390. [2022-03-15 14:19:20,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15390 states, 15389 states have (on average 3.650139710182598) internal successors, (56172), 15389 states have internal predecessors, (56172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:20,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15390 states to 15390 states and 56172 transitions. [2022-03-15 14:19:20,495 INFO L78 Accepts]: Start accepts. Automaton has 15390 states and 56172 transitions. Word has length 124 [2022-03-15 14:19:20,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:19:20,496 INFO L470 AbstractCegarLoop]: Abstraction has 15390 states and 56172 transitions. [2022-03-15 14:19:20,496 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 8.64) internal successors, (216), 25 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:20,496 INFO L276 IsEmpty]: Start isEmpty. Operand 15390 states and 56172 transitions. [2022-03-15 14:19:20,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-15 14:19:20,524 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:19:20,524 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, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:19:20,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-03-15 14:19:20,724 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:19:20,724 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:19:20,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:19:20,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1308591088, now seen corresponding path program 17 times [2022-03-15 14:19:20,725 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:19:20,725 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434450369] [2022-03-15 14:19:20,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:19:20,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:19:20,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:19:21,259 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:19:21,260 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:19:21,260 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434450369] [2022-03-15 14:19:21,260 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434450369] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:19:21,260 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530208879] [2022-03-15 14:19:21,260 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 14:19:21,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:19:21,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:19:21,261 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 14:19:21,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-03-15 14:19:21,371 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 14:19:21,371 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:19:21,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 63 conjunts are in the unsatisfiable core [2022-03-15 14:19:21,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:19:22,425 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:19:22,426 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 17 treesize of output 17 [2022-03-15 14:19:22,631 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:19:22,631 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:19:22,779 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:19:22,779 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-03-15 14:19:23,563 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:19:23,564 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530208879] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:19:23,564 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:19:23,564 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27, 22] total 60 [2022-03-15 14:19:23,564 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271670800] [2022-03-15 14:19:23,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:19:23,564 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-03-15 14:19:23,564 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:19:23,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-03-15 14:19:23,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=478, Invalid=3062, Unknown=0, NotChecked=0, Total=3540 [2022-03-15 14:19:23,565 INFO L87 Difference]: Start difference. First operand 15390 states and 56172 transitions. Second operand has 60 states, 60 states have (on average 4.65) internal successors, (279), 60 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:25,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:19:25,612 INFO L93 Difference]: Finished difference Result 27927 states and 102492 transitions. [2022-03-15 14:19:25,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-03-15 14:19:25,612 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 4.65) internal successors, (279), 60 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2022-03-15 14:19:25,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:19:25,702 INFO L225 Difference]: With dead ends: 27927 [2022-03-15 14:19:25,702 INFO L226 Difference]: Without dead ends: 27777 [2022-03-15 14:19:25,703 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 211 SyntacticMatches, 10 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3056 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1044, Invalid=6266, Unknown=0, NotChecked=0, Total=7310 [2022-03-15 14:19:25,704 INFO L933 BasicCegarLoop]: 266 mSDtfsCounter, 1672 mSDsluCounter, 5940 mSDsCounter, 0 mSdLazyCounter, 2260 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1672 SdHoareTripleChecker+Valid, 5746 SdHoareTripleChecker+Invalid, 3121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 806 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 14:19:25,704 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1672 Valid, 5746 Invalid, 3121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2260 Invalid, 0 Unknown, 806 Unchecked, 0.9s Time] [2022-03-15 14:19:25,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27777 states. [2022-03-15 14:19:26,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27777 to 15390. [2022-03-15 14:19:26,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15390 states, 15389 states have (on average 3.650139710182598) internal successors, (56172), 15389 states have internal predecessors, (56172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:26,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15390 states to 15390 states and 56172 transitions. [2022-03-15 14:19:26,173 INFO L78 Accepts]: Start accepts. Automaton has 15390 states and 56172 transitions. Word has length 124 [2022-03-15 14:19:26,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:19:26,173 INFO L470 AbstractCegarLoop]: Abstraction has 15390 states and 56172 transitions. [2022-03-15 14:19:26,173 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 4.65) internal successors, (279), 60 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:26,173 INFO L276 IsEmpty]: Start isEmpty. Operand 15390 states and 56172 transitions. [2022-03-15 14:19:26,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-15 14:19:26,202 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:19:26,202 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, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:19:26,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2022-03-15 14:19:26,402 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-03-15 14:19:26,403 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:19:26,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:19:26,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1336949438, now seen corresponding path program 18 times [2022-03-15 14:19:26,404 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:19:26,404 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224888000] [2022-03-15 14:19:26,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:19:26,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:19:26,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:19:26,800 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:19:26,800 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:19:26,801 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224888000] [2022-03-15 14:19:26,801 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224888000] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:19:26,801 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937017174] [2022-03-15 14:19:26,801 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 14:19:26,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:19:26,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:19:26,802 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 14:19:26,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-03-15 14:19:26,911 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-03-15 14:19:26,911 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:19:26,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 54 conjunts are in the unsatisfiable core [2022-03-15 14:19:26,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:19:27,334 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:19:27,334 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 27 treesize of output 27 [2022-03-15 14:19:27,711 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:19:27,711 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:19:28,031 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:19:28,031 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-03-15 14:19:28,424 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:19:28,424 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [937017174] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:19:28,424 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:19:28,424 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 18, 17] total 46 [2022-03-15 14:19:28,424 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594546007] [2022-03-15 14:19:28,425 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:19:28,425 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-03-15 14:19:28,425 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:19:28,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-03-15 14:19:28,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=1774, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 14:19:28,426 INFO L87 Difference]: Start difference. First operand 15390 states and 56172 transitions. Second operand has 46 states, 46 states have (on average 6.326086956521739) internal successors, (291), 46 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:52,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:19:52,851 INFO L93 Difference]: Finished difference Result 90475 states and 330820 transitions. [2022-03-15 14:19:52,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 383 states. [2022-03-15 14:19:52,851 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 6.326086956521739) internal successors, (291), 46 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2022-03-15 14:19:52,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:19:53,151 INFO L225 Difference]: With dead ends: 90475 [2022-03-15 14:19:53,152 INFO L226 Difference]: Without dead ends: 90325 [2022-03-15 14:19:53,157 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 645 GetRequests, 232 SyntacticMatches, 8 SemanticMatches, 405 ConstructedPredicates, 0 IntricatePredicates, 7 DeprecatedPredicates, 74627 ImplicationChecksByTransitivity, 19.6s TimeCoverageRelationStatistics Valid=17315, Invalid=147927, Unknown=0, NotChecked=0, Total=165242 [2022-03-15 14:19:53,158 INFO L933 BasicCegarLoop]: 514 mSDtfsCounter, 3121 mSDsluCounter, 13788 mSDsCounter, 0 mSdLazyCounter, 7617 mSolverCounterSat, 322 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3121 SdHoareTripleChecker+Valid, 12621 SdHoareTripleChecker+Invalid, 16624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 322 IncrementalHoareTripleChecker+Valid, 7617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8685 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-03-15 14:19:53,158 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3121 Valid, 12621 Invalid, 16624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [322 Valid, 7617 Invalid, 0 Unknown, 8685 Unchecked, 3.7s Time] [2022-03-15 14:19:53,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90325 states. [2022-03-15 14:19:54,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90325 to 15607. [2022-03-15 14:19:54,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15607 states, 15606 states have (on average 3.666794822504165) internal successors, (57224), 15606 states have internal predecessors, (57224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:54,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15607 states to 15607 states and 57224 transitions. [2022-03-15 14:19:54,328 INFO L78 Accepts]: Start accepts. Automaton has 15607 states and 57224 transitions. Word has length 124 [2022-03-15 14:19:54,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:19:54,328 INFO L470 AbstractCegarLoop]: Abstraction has 15607 states and 57224 transitions. [2022-03-15 14:19:54,328 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 6.326086956521739) internal successors, (291), 46 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:54,328 INFO L276 IsEmpty]: Start isEmpty. Operand 15607 states and 57224 transitions. [2022-03-15 14:19:54,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-15 14:19:54,357 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:19:54,357 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, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:19:54,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2022-03-15 14:19:54,557 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-03-15 14:19:54,557 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:19:54,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:19:54,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1021856560, now seen corresponding path program 19 times [2022-03-15 14:19:54,558 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:19:54,558 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264578401] [2022-03-15 14:19:54,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:19:54,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:19:54,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:19:55,291 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:19:55,292 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:19:55,292 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264578401] [2022-03-15 14:19:55,292 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264578401] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:19:55,292 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071678515] [2022-03-15 14:19:55,292 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 14:19:55,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:19:55,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:19:55,293 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 14:19:55,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-03-15 14:19:55,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:19:55,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 82 conjunts are in the unsatisfiable core [2022-03-15 14:19:55,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:19:55,518 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 14:19:55,857 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-15 14:19:55,857 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-03-15 14:19:56,068 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-15 14:19:56,540 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 14:19:56,711 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 14:19:56,808 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 14:19:56,980 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:19:56,981 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 27 treesize of output 27 [2022-03-15 14:19:57,349 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:19:57,350 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:19:57,670 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1292 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1292) c_~A~0.base))) (= (+ c_~res1~0 (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)))) (+ (select .cse0 (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0))))) is different from false [2022-03-15 14:19:57,736 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1291 (Array Int Int)) (~M~0 Int) (v_ArrVal_1292 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1292) c_~A~0.base))) (= (+ c_~res2~0 (select .cse0 (+ c_~A~0.offset (* ~M~0 4)))) (+ (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0))))) is different from false [2022-03-15 14:19:57,810 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1291 (Array Int Int)) (~M~0 Int) (v_ArrVal_1292 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1292) c_~A~0.base))) (= (+ c_~res2~0 (select .cse0 (+ c_~A~0.offset (* ~M~0 4)))) (+ c_~res1~0 (select .cse0 c_~A~0.offset)))))) is different from false [2022-03-15 14:19:57,834 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1291 (Array Int Int)) (v_ArrVal_1290 (Array Int Int)) (~M~0 Int) (v_ArrVal_1292 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1290) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1292) c_~A~0.base))) (= (+ (select .cse0 c_~A~0.offset) c_~res1~0) (+ (select .cse0 (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0))))) is different from false [2022-03-15 14:19:57,949 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1291 (Array Int Int)) (v_ArrVal_1290 (Array Int Int)) (~M~0 Int) (v_ArrVal_1292 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1290) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1292) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (= (+ c_~res2~0 (select .cse0 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4)))) (+ (select .cse0 |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~res1~0))))) is different from false [2022-03-15 14:19:57,975 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1291 (Array Int Int)) (v_ArrVal_1290 (Array Int Int)) (~M~0 Int) (v_ArrVal_1292 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1290) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1292) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (= (+ (select .cse0 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~res2~0) (+ c_~res1~0 (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))))) is different from false [2022-03-15 14:19:57,990 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1291 (Array Int Int)) (v_ArrVal_1290 (Array Int Int)) (~M~0 Int) (v_ArrVal_1292 (Array Int Int))) (or (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1290) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1292) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (= (+ (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~res1~0) (+ (select .cse0 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~res2~0))) (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)))) is different from false [2022-03-15 14:19:58,224 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:19:58,224 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 61 treesize of output 50 [2022-03-15 14:19:58,235 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:19:58,236 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 398 treesize of output 386 [2022-03-15 14:19:58,246 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:19:58,247 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 374 treesize of output 354 [2022-03-15 14:19:58,257 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:19:58,258 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 342 treesize of output 290 [2022-03-15 14:19:58,278 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:19:58,278 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 146 treesize of output 143 [2022-03-15 14:19:59,576 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-03-15 14:19:59,600 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-03-15 14:19:59,600 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071678515] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:19:59,600 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:19:59,600 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 33, 31] total 76 [2022-03-15 14:19:59,600 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242313555] [2022-03-15 14:19:59,600 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:19:59,600 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2022-03-15 14:19:59,601 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:19:59,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2022-03-15 14:19:59,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=636, Invalid=4074, Unknown=10, NotChecked=980, Total=5700 [2022-03-15 14:19:59,602 INFO L87 Difference]: Start difference. First operand 15607 states and 57224 transitions. Second operand has 76 states, 76 states have (on average 3.9473684210526314) internal successors, (300), 76 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:20:03,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:20:03,842 INFO L93 Difference]: Finished difference Result 34201 states and 124791 transitions. [2022-03-15 14:20:03,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-03-15 14:20:03,842 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 76 states have (on average 3.9473684210526314) internal successors, (300), 76 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2022-03-15 14:20:03,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:20:03,953 INFO L225 Difference]: With dead ends: 34201 [2022-03-15 14:20:03,953 INFO L226 Difference]: Without dead ends: 34162 [2022-03-15 14:20:03,954 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 211 SyntacticMatches, 13 SemanticMatches, 119 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 4952 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1445, Invalid=11455, Unknown=10, NotChecked=1610, Total=14520 [2022-03-15 14:20:03,954 INFO L933 BasicCegarLoop]: 317 mSDtfsCounter, 1597 mSDsluCounter, 8940 mSDsCounter, 0 mSdLazyCounter, 2452 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1597 SdHoareTripleChecker+Valid, 8752 SdHoareTripleChecker+Invalid, 5913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 2452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3441 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 14:20:03,955 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1597 Valid, 8752 Invalid, 5913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 2452 Invalid, 0 Unknown, 3441 Unchecked, 1.0s Time] [2022-03-15 14:20:03,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34162 states. [2022-03-15 14:20:04,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34162 to 17028. [2022-03-15 14:20:04,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17028 states, 17027 states have (on average 3.681564573912022) internal successors, (62686), 17027 states have internal predecessors, (62686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:20:04,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17028 states to 17028 states and 62686 transitions. [2022-03-15 14:20:04,441 INFO L78 Accepts]: Start accepts. Automaton has 17028 states and 62686 transitions. Word has length 124 [2022-03-15 14:20:04,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:20:04,441 INFO L470 AbstractCegarLoop]: Abstraction has 17028 states and 62686 transitions. [2022-03-15 14:20:04,441 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 76 states have (on average 3.9473684210526314) internal successors, (300), 76 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:20:04,441 INFO L276 IsEmpty]: Start isEmpty. Operand 17028 states and 62686 transitions. [2022-03-15 14:20:04,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-15 14:20:04,473 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:20:04,474 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, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:20:04,490 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2022-03-15 14:20:04,674 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-03-15 14:20:04,674 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:20:04,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:20:04,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1071096070, now seen corresponding path program 20 times [2022-03-15 14:20:04,675 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:20:04,675 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920457566] [2022-03-15 14:20:04,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:20:04,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:20:04,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:20:05,213 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:20:05,213 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:20:05,213 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920457566] [2022-03-15 14:20:05,214 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920457566] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:20:05,214 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450525245] [2022-03-15 14:20:05,214 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 14:20:05,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:20:05,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:20:05,215 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 14:20:05,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-03-15 14:20:05,327 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 14:20:05,327 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:20:05,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 58 conjunts are in the unsatisfiable core [2022-03-15 14:20:05,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:20:06,017 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:20:06,017 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2022-03-15 14:20:06,400 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:20:06,401 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:20:06,715 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:20:06,715 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-03-15 14:20:07,108 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:20:07,108 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [450525245] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:20:07,108 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:20:07,108 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 23, 17] total 55 [2022-03-15 14:20:07,108 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684739520] [2022-03-15 14:20:07,108 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:20:07,109 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-03-15 14:20:07,109 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:20:07,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-03-15 14:20:07,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=401, Invalid=2569, Unknown=0, NotChecked=0, Total=2970 [2022-03-15 14:20:07,110 INFO L87 Difference]: Start difference. First operand 17028 states and 62686 transitions. Second operand has 55 states, 55 states have (on average 5.5636363636363635) internal successors, (306), 55 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:20:40,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:20:40,942 INFO L93 Difference]: Finished difference Result 113072 states and 415075 transitions. [2022-03-15 14:20:40,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 541 states. [2022-03-15 14:20:40,942 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 5.5636363636363635) internal successors, (306), 55 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2022-03-15 14:20:40,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:20:41,599 INFO L225 Difference]: With dead ends: 113072 [2022-03-15 14:20:41,599 INFO L226 Difference]: Without dead ends: 112622 [2022-03-15 14:20:41,613 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 805 GetRequests, 223 SyntacticMatches, 9 SemanticMatches, 573 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153788 ImplicationChecksByTransitivity, 26.1s TimeCoverageRelationStatistics Valid=28496, Invalid=301554, Unknown=0, NotChecked=0, Total=330050 [2022-03-15 14:20:41,614 INFO L933 BasicCegarLoop]: 605 mSDtfsCounter, 4205 mSDsluCounter, 16337 mSDsCounter, 0 mSdLazyCounter, 12218 mSolverCounterSat, 436 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4205 SdHoareTripleChecker+Valid, 15419 SdHoareTripleChecker+Invalid, 15061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 436 IncrementalHoareTripleChecker+Valid, 12218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2407 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-03-15 14:20:41,614 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4205 Valid, 15419 Invalid, 15061 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [436 Valid, 12218 Invalid, 0 Unknown, 2407 Unchecked, 5.7s Time] [2022-03-15 14:20:41,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112622 states. [2022-03-15 14:20:42,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112622 to 15658. [2022-03-15 14:20:42,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15658 states, 15657 states have (on average 3.6551702114070386) internal successors, (57229), 15657 states have internal predecessors, (57229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:20:43,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15658 states to 15658 states and 57229 transitions. [2022-03-15 14:20:43,072 INFO L78 Accepts]: Start accepts. Automaton has 15658 states and 57229 transitions. Word has length 124 [2022-03-15 14:20:43,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:20:43,072 INFO L470 AbstractCegarLoop]: Abstraction has 15658 states and 57229 transitions. [2022-03-15 14:20:43,072 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 5.5636363636363635) internal successors, (306), 55 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:20:43,072 INFO L276 IsEmpty]: Start isEmpty. Operand 15658 states and 57229 transitions. [2022-03-15 14:20:43,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-15 14:20:43,104 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:20:43,104 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, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:20:43,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-03-15 14:20:43,304 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:20:43,304 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:20:43,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:20:43,305 INFO L85 PathProgramCache]: Analyzing trace with hash 677970192, now seen corresponding path program 21 times [2022-03-15 14:20:43,305 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:20:43,305 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35702375] [2022-03-15 14:20:43,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:20:43,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:20:43,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:20:43,902 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:20:43,902 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:20:43,902 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35702375] [2022-03-15 14:20:43,902 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35702375] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:20:43,902 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726328694] [2022-03-15 14:20:43,902 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 14:20:43,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:20:43,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:20:43,903 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 14:20:43,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-03-15 14:20:44,027 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 14:20:44,028 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:20:44,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 54 conjunts are in the unsatisfiable core [2022-03-15 14:20:44,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:20:44,486 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:20:44,487 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 27 [2022-03-15 14:20:44,879 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:20:44,879 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:20:45,190 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:20:45,190 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-03-15 14:20:45,567 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:20:45,567 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726328694] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:20:45,567 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:20:45,567 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 18, 17] total 51 [2022-03-15 14:20:45,567 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734048858] [2022-03-15 14:20:45,567 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:20:45,568 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-03-15 14:20:45,568 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:20:45,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-03-15 14:20:45,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=2278, Unknown=0, NotChecked=0, Total=2550 [2022-03-15 14:20:45,569 INFO L87 Difference]: Start difference. First operand 15658 states and 57229 transitions. Second operand has 51 states, 51 states have (on average 6.019607843137255) internal successors, (307), 51 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:21:20,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:21:20,867 INFO L93 Difference]: Finished difference Result 106487 states and 390266 transitions. [2022-03-15 14:21:20,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 514 states. [2022-03-15 14:21:20,867 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 6.019607843137255) internal successors, (307), 51 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2022-03-15 14:21:20,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:21:21,432 INFO L225 Difference]: With dead ends: 106487 [2022-03-15 14:21:21,433 INFO L226 Difference]: Without dead ends: 106037 [2022-03-15 14:21:21,442 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 779 GetRequests, 235 SyntacticMatches, 4 SemanticMatches, 540 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132190 ImplicationChecksByTransitivity, 28.1s TimeCoverageRelationStatistics Valid=27373, Invalid=265849, Unknown=0, NotChecked=0, Total=293222 [2022-03-15 14:21:21,459 INFO L933 BasicCegarLoop]: 591 mSDtfsCounter, 3882 mSDsluCounter, 17308 mSDsCounter, 0 mSdLazyCounter, 10563 mSolverCounterSat, 420 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3882 SdHoareTripleChecker+Valid, 16497 SdHoareTripleChecker+Invalid, 18436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 420 IncrementalHoareTripleChecker+Valid, 10563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7453 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-03-15 14:21:21,459 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3882 Valid, 16497 Invalid, 18436 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [420 Valid, 10563 Invalid, 0 Unknown, 7453 Unchecked, 5.0s Time] [2022-03-15 14:21:21,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106037 states. [2022-03-15 14:21:22,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106037 to 16138. [2022-03-15 14:21:22,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16138 states, 16137 states have (on average 3.673111482927434) internal successors, (59273), 16137 states have internal predecessors, (59273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:21:22,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16138 states to 16138 states and 59273 transitions. [2022-03-15 14:21:22,611 INFO L78 Accepts]: Start accepts. Automaton has 16138 states and 59273 transitions. Word has length 124 [2022-03-15 14:21:22,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:21:22,611 INFO L470 AbstractCegarLoop]: Abstraction has 16138 states and 59273 transitions. [2022-03-15 14:21:22,611 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 6.019607843137255) internal successors, (307), 51 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:21:22,611 INFO L276 IsEmpty]: Start isEmpty. Operand 16138 states and 59273 transitions. [2022-03-15 14:21:22,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-15 14:21:22,642 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:21:22,642 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, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:21:22,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-03-15 14:21:22,842 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:21:22,843 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:21:22,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:21:22,843 INFO L85 PathProgramCache]: Analyzing trace with hash 2092648740, now seen corresponding path program 22 times [2022-03-15 14:21:22,843 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:21:22,843 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182404742] [2022-03-15 14:21:22,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:21:22,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:21:22,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:21:23,338 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:21:23,339 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:21:23,339 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182404742] [2022-03-15 14:21:23,339 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182404742] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:21:23,339 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105896545] [2022-03-15 14:21:23,339 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 14:21:23,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:21:23,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:21:23,341 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 14:21:23,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-03-15 14:21:23,457 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 14:21:23,457 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:21:23,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 61 conjunts are in the unsatisfiable core [2022-03-15 14:21:23,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:21:24,239 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:21:24,239 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 27 treesize of output 27 [2022-03-15 14:21:24,684 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:21:24,684 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:21:24,897 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:21:24,898 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-03-15 14:21:25,605 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:21:25,606 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105896545] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:21:25,606 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:21:25,606 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 22, 22] total 57 [2022-03-15 14:21:25,606 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602719049] [2022-03-15 14:21:25,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:21:25,606 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-03-15 14:21:25,606 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:21:25,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-03-15 14:21:25,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=2825, Unknown=0, NotChecked=0, Total=3192 [2022-03-15 14:21:25,607 INFO L87 Difference]: Start difference. First operand 16138 states and 59273 transitions. Second operand has 57 states, 57 states have (on average 4.894736842105263) internal successors, (279), 57 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:21:30,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:21:30,457 INFO L93 Difference]: Finished difference Result 42115 states and 154292 transitions. [2022-03-15 14:21:30,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2022-03-15 14:21:30,457 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 4.894736842105263) internal successors, (279), 57 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2022-03-15 14:21:30,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:21:30,582 INFO L225 Difference]: With dead ends: 42115 [2022-03-15 14:21:30,582 INFO L226 Difference]: Without dead ends: 41965 [2022-03-15 14:21:30,584 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 221 SyntacticMatches, 15 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 7211 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=2174, Invalid=17008, Unknown=0, NotChecked=0, Total=19182 [2022-03-15 14:21:30,584 INFO L933 BasicCegarLoop]: 274 mSDtfsCounter, 2975 mSDsluCounter, 7289 mSDsCounter, 0 mSdLazyCounter, 2259 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2975 SdHoareTripleChecker+Valid, 6957 SdHoareTripleChecker+Invalid, 4557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 2259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2152 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 14:21:30,584 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2975 Valid, 6957 Invalid, 4557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 2259 Invalid, 0 Unknown, 2152 Unchecked, 1.0s Time] [2022-03-15 14:21:30,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41965 states. [2022-03-15 14:21:31,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41965 to 15942. [2022-03-15 14:21:31,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15942 states, 15941 states have (on average 3.663634652782134) internal successors, (58402), 15941 states have internal predecessors, (58402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:21:31,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15942 states to 15942 states and 58402 transitions. [2022-03-15 14:21:31,115 INFO L78 Accepts]: Start accepts. Automaton has 15942 states and 58402 transitions. Word has length 124 [2022-03-15 14:21:31,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:21:31,115 INFO L470 AbstractCegarLoop]: Abstraction has 15942 states and 58402 transitions. [2022-03-15 14:21:31,116 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 4.894736842105263) internal successors, (279), 57 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:21:31,116 INFO L276 IsEmpty]: Start isEmpty. Operand 15942 states and 58402 transitions. [2022-03-15 14:21:31,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-15 14:21:31,143 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:21:31,144 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, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:21:31,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2022-03-15 14:21:31,344 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-03-15 14:21:31,344 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:21:31,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:21:31,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1474847118, now seen corresponding path program 23 times [2022-03-15 14:21:31,345 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:21:31,345 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125977224] [2022-03-15 14:21:31,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:21:31,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:21:31,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:21:31,836 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:21:31,836 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:21:31,836 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125977224] [2022-03-15 14:21:31,837 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125977224] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:21:31,837 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104648142] [2022-03-15 14:21:31,837 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 14:21:31,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:21:31,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:21:31,838 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 14:21:31,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-03-15 14:21:31,953 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 14:21:31,953 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:21:31,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 82 conjunts are in the unsatisfiable core [2022-03-15 14:21:31,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:21:32,551 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-15 14:21:33,039 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 14:21:33,337 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 14:21:33,472 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 14:21:33,691 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:21:33,691 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2022-03-15 14:21:33,947 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:21:33,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:21:34,302 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1425 (Array Int Int)) (~M~0 Int)) (or (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1425) c_~A~0.base))) (= (+ c_~res2~0 (select .cse0 (+ c_~A~0.offset (* ~M~0 4)))) (+ (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0))) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-15 14:21:34,359 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1425 (Array Int Int)) (v_ArrVal_1424 (Array Int Int)) (~M~0 Int)) (or (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1424) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1425) c_~A~0.base))) (= (+ c_~res2~0 (select .cse0 (+ c_~A~0.offset (* ~M~0 4)))) (+ (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-15 14:21:34,412 WARN L838 $PredicateComparison]: unable to prove that (or (not (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0)) (forall ((v_ArrVal_1425 (Array Int Int)) (v_ArrVal_1424 (Array Int Int)) (~M~0 Int)) (or (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1424) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1425) c_~A~0.base))) (= (+ c_~res2~0 (select .cse0 (+ c_~A~0.offset (* ~M~0 4)))) (+ (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0))) (< (+ ~M~0 1) c_~N~0)))) is different from false [2022-03-15 14:21:34,426 WARN L838 $PredicateComparison]: unable to prove that (or (not (< 0 c_~N~0)) (forall ((v_ArrVal_1425 (Array Int Int)) (v_ArrVal_1424 (Array Int Int)) (~M~0 Int)) (or (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1424) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1425) c_~A~0.base))) (= (+ c_~res2~0 (select .cse0 (+ c_~A~0.offset (* ~M~0 4)))) (+ (select .cse0 c_~A~0.offset) c_~res1~0))) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0)))) is different from false [2022-03-15 14:21:34,452 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1425 (Array Int Int)) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1423 (Array Int Int)) (~M~0 Int)) (or (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1423) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1424) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1425) c_~A~0.base))) (= (+ (select .cse0 (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) (+ c_~res1~0 (select .cse0 c_~A~0.offset)))) (< (+ ~M~0 1) c_~N~0))) (not (< 0 c_~N~0))) is different from false [2022-03-15 14:21:34,575 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1425 (Array Int Int)) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1423 (Array Int Int)) (~M~0 Int)) (or (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1423) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1424) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1425) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (= (+ c_~res2~0 (select .cse0 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4)))) (+ (select .cse0 |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~res1~0))) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0))) (not (< 0 c_~N~0))) is different from false [2022-03-15 14:21:34,601 WARN L838 $PredicateComparison]: unable to prove that (or (not (< 0 c_~N~0)) (forall ((v_ArrVal_1425 (Array Int Int)) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1423 (Array Int Int)) (~M~0 Int)) (or (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1423) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1424) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1425) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (= (+ c_~res2~0 (select .cse0 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (+ (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~res1~0))) (< (+ ~M~0 1) c_~N~0)))) is different from false [2022-03-15 14:21:34,616 WARN L838 $PredicateComparison]: unable to prove that (or (not (< 0 c_~N~0)) (forall ((v_ArrVal_1425 (Array Int Int)) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1423 (Array Int Int)) (~M~0 Int)) (or (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1423) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1424) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1425) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (= (+ (select .cse0 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~res2~0) (+ c_~res1~0 (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (+ ~M~0 1) c_~N~0)))) is different from false [2022-03-15 14:21:34,869 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:21:34,869 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 61 treesize of output 50 [2022-03-15 14:21:34,876 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:21:34,876 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 398 treesize of output 386 [2022-03-15 14:21:34,891 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:21:34,892 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 374 treesize of output 354 [2022-03-15 14:21:34,900 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:21:34,900 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 342 treesize of output 290 [2022-03-15 14:21:34,911 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:21:34,911 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 146 treesize of output 143 [2022-03-15 14:21:35,792 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-03-15 14:21:35,792 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1104648142] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:21:35,792 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:21:35,792 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 33, 29] total 76 [2022-03-15 14:21:35,792 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919301998] [2022-03-15 14:21:35,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:21:35,793 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2022-03-15 14:21:35,793 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:21:35,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2022-03-15 14:21:35,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=456, Invalid=4122, Unknown=10, NotChecked=1112, Total=5700 [2022-03-15 14:21:35,794 INFO L87 Difference]: Start difference. First operand 15942 states and 58402 transitions. Second operand has 76 states, 76 states have (on average 3.8289473684210527) internal successors, (291), 76 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:21:45,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:21:45,233 INFO L93 Difference]: Finished difference Result 38774 states and 140671 transitions. [2022-03-15 14:21:45,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-03-15 14:21:45,234 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 76 states have (on average 3.8289473684210527) internal successors, (291), 76 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2022-03-15 14:21:45,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:21:45,345 INFO L225 Difference]: With dead ends: 38774 [2022-03-15 14:21:45,345 INFO L226 Difference]: Without dead ends: 38624 [2022-03-15 14:21:45,346 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 199 SyntacticMatches, 7 SemanticMatches, 129 ConstructedPredicates, 8 IntricatePredicates, 1 DeprecatedPredicates, 4793 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=1497, Invalid=13531, Unknown=10, NotChecked=1992, Total=17030 [2022-03-15 14:21:45,346 INFO L933 BasicCegarLoop]: 315 mSDtfsCounter, 2103 mSDsluCounter, 10527 mSDsCounter, 0 mSdLazyCounter, 4512 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2103 SdHoareTripleChecker+Valid, 10018 SdHoareTripleChecker+Invalid, 9086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 4512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4487 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-03-15 14:21:45,347 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2103 Valid, 10018 Invalid, 9086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 4512 Invalid, 0 Unknown, 4487 Unchecked, 1.8s Time] [2022-03-15 14:21:45,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38624 states. [2022-03-15 14:21:45,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38624 to 15878. [2022-03-15 14:21:45,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15878 states, 15877 states have (on average 3.661271020973736) internal successors, (58130), 15877 states have internal predecessors, (58130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:21:45,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15878 states to 15878 states and 58130 transitions. [2022-03-15 14:21:45,836 INFO L78 Accepts]: Start accepts. Automaton has 15878 states and 58130 transitions. Word has length 124 [2022-03-15 14:21:45,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:21:45,836 INFO L470 AbstractCegarLoop]: Abstraction has 15878 states and 58130 transitions. [2022-03-15 14:21:45,836 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 76 states have (on average 3.8289473684210527) internal successors, (291), 76 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:21:45,836 INFO L276 IsEmpty]: Start isEmpty. Operand 15878 states and 58130 transitions. [2022-03-15 14:21:45,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-15 14:21:45,863 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:21:45,863 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, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:21:45,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-03-15 14:21:46,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-03-15 14:21:46,064 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:21:46,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:21:46,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1934802414, now seen corresponding path program 24 times [2022-03-15 14:21:46,064 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:21:46,064 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71275749] [2022-03-15 14:21:46,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:21:46,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:21:46,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:21:46,629 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:21:46,629 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:21:46,629 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71275749] [2022-03-15 14:21:46,629 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71275749] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:21:46,629 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805744999] [2022-03-15 14:21:46,630 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 14:21:46,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:21:46,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:21:46,631 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 14:21:46,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-03-15 14:21:46,753 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 14:21:46,753 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:21:46,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 55 conjunts are in the unsatisfiable core [2022-03-15 14:21:46,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:21:47,193 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:21:47,193 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 27 treesize of output 27 [2022-03-15 14:21:47,508 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:21:47,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:21:47,816 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:21:47,817 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-03-15 14:21:48,209 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:21:48,210 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [805744999] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:21:48,210 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:21:48,210 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 18, 17] total 51 [2022-03-15 14:21:48,210 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611945866] [2022-03-15 14:21:48,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:21:48,210 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-03-15 14:21:48,210 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:21:48,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-03-15 14:21:48,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=2260, Unknown=0, NotChecked=0, Total=2550 [2022-03-15 14:21:48,211 INFO L87 Difference]: Start difference. First operand 15878 states and 58130 transitions. Second operand has 51 states, 51 states have (on average 6.019607843137255) internal successors, (307), 51 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:22:10,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:22:10,422 INFO L93 Difference]: Finished difference Result 90071 states and 329478 transitions. [2022-03-15 14:22:10,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 386 states. [2022-03-15 14:22:10,423 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 6.019607843137255) internal successors, (307), 51 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2022-03-15 14:22:10,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:22:10,727 INFO L225 Difference]: With dead ends: 90071 [2022-03-15 14:22:10,728 INFO L226 Difference]: Without dead ends: 89651 [2022-03-15 14:22:10,734 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 659 GetRequests, 235 SyntacticMatches, 13 SemanticMatches, 411 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76682 ImplicationChecksByTransitivity, 17.3s TimeCoverageRelationStatistics Valid=16993, Invalid=153163, Unknown=0, NotChecked=0, Total=170156 [2022-03-15 14:22:10,734 INFO L933 BasicCegarLoop]: 577 mSDtfsCounter, 3524 mSDsluCounter, 15132 mSDsCounter, 0 mSdLazyCounter, 7185 mSolverCounterSat, 330 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3524 SdHoareTripleChecker+Valid, 14346 SdHoareTripleChecker+Invalid, 20261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 330 IncrementalHoareTripleChecker+Valid, 7185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 12746 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-03-15 14:22:10,734 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3524 Valid, 14346 Invalid, 20261 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [330 Valid, 7185 Invalid, 0 Unknown, 12746 Unchecked, 3.5s Time] [2022-03-15 14:22:10,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89651 states. [2022-03-15 14:22:11,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89651 to 16366. [2022-03-15 14:22:11,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16366 states, 16365 states have (on average 3.6739382829208678) internal successors, (60124), 16365 states have internal predecessors, (60124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:22:11,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16366 states to 16366 states and 60124 transitions. [2022-03-15 14:22:11,833 INFO L78 Accepts]: Start accepts. Automaton has 16366 states and 60124 transitions. Word has length 124 [2022-03-15 14:22:11,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:22:11,834 INFO L470 AbstractCegarLoop]: Abstraction has 16366 states and 60124 transitions. [2022-03-15 14:22:11,834 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 6.019607843137255) internal successors, (307), 51 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:22:11,834 INFO L276 IsEmpty]: Start isEmpty. Operand 16366 states and 60124 transitions. [2022-03-15 14:22:12,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-15 14:22:12,005 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:22:12,005 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, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:22:12,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-03-15 14:22:12,219 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-03-15 14:22:12,219 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:22:12,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:22:12,220 INFO L85 PathProgramCache]: Analyzing trace with hash -945486334, now seen corresponding path program 25 times [2022-03-15 14:22:12,220 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:22:12,220 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638444438] [2022-03-15 14:22:12,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:22:12,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:22:12,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:22:12,854 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:22:12,854 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:22:12,854 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638444438] [2022-03-15 14:22:12,854 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638444438] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:22:12,854 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1221235544] [2022-03-15 14:22:12,854 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 14:22:12,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:22:12,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:22:12,856 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 14:22:12,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-03-15 14:22:12,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:22:12,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 82 conjunts are in the unsatisfiable core [2022-03-15 14:22:12,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:22:13,072 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 14:22:13,400 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-15 14:22:13,400 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-03-15 14:22:13,619 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-15 14:22:14,115 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 14:22:14,278 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 14:22:14,371 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 14:22:14,554 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:22:14,554 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 27 treesize of output 27 [2022-03-15 14:22:14,903 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:22:14,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:22:15,278 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1495 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1495) c_~A~0.base))) (= (+ c_~res2~0 (select .cse0 (+ c_~A~0.offset (* ~M~0 4)))) (+ (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0))))) is different from false [2022-03-15 14:22:15,335 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1495 (Array Int Int)) (v_ArrVal_1494 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1494) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1495) c_~A~0.base))) (= (+ c_~res1~0 (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)))) (+ (select .cse0 (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0))))) is different from false [2022-03-15 14:22:15,396 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1495 (Array Int Int)) (v_ArrVal_1494 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1494) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1495) c_~A~0.base))) (= (+ (select .cse0 (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) (+ (select .cse0 c_~A~0.offset) c_~res1~0))))) is different from false [2022-03-15 14:22:15,419 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1495 (Array Int Int)) (v_ArrVal_1494 (Array Int Int)) (v_ArrVal_1493 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1493) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1494) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1495) c_~A~0.base))) (= (+ c_~res2~0 (select .cse0 (+ c_~A~0.offset (* ~M~0 4)))) (+ c_~res1~0 (select .cse0 c_~A~0.offset)))))) is different from false [2022-03-15 14:22:15,523 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1495 (Array Int Int)) (v_ArrVal_1494 (Array Int Int)) (v_ArrVal_1493 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1493) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1494) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1495) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (= (+ c_~res2~0 (select .cse0 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4)))) (+ (select .cse0 |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~res1~0))))) is different from false [2022-03-15 14:22:15,562 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1495 (Array Int Int)) (v_ArrVal_1494 (Array Int Int)) (v_ArrVal_1493 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1493) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1494) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1495) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (= (+ (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~res1~0) (+ c_~res2~0 (select .cse0 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))))) (not (< ~M~0 c_~N~0)))) is different from false [2022-03-15 14:22:15,575 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1495 (Array Int Int)) (v_ArrVal_1494 (Array Int Int)) (v_ArrVal_1493 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1493) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1494) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1495) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (= (+ c_~res1~0 (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (+ c_~res2~0 (select .cse0 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))) is different from false [2022-03-15 14:22:15,807 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:22:15,807 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 61 treesize of output 50 [2022-03-15 14:22:15,814 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:22:15,815 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 398 treesize of output 386 [2022-03-15 14:22:15,829 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:22:15,830 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 374 treesize of output 322 [2022-03-15 14:22:15,839 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:22:15,839 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 310 treesize of output 306 [2022-03-15 14:22:15,848 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:22:15,848 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 294 treesize of output 274 [2022-03-15 14:22:16,865 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-03-15 14:22:16,888 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-03-15 14:22:16,888 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1221235544] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:22:16,888 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:22:16,889 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 33, 31] total 79 [2022-03-15 14:22:16,889 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445639896] [2022-03-15 14:22:16,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:22:16,889 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2022-03-15 14:22:16,889 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:22:16,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2022-03-15 14:22:16,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=618, Invalid=4512, Unknown=10, NotChecked=1022, Total=6162 [2022-03-15 14:22:16,890 INFO L87 Difference]: Start difference. First operand 16366 states and 60124 transitions. Second operand has 79 states, 79 states have (on average 3.8607594936708862) internal successors, (305), 79 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:22:22,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:22:22,549 INFO L93 Difference]: Finished difference Result 45363 states and 165251 transitions. [2022-03-15 14:22:22,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2022-03-15 14:22:22,549 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 79 states have (on average 3.8607594936708862) internal successors, (305), 79 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2022-03-15 14:22:22,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:22:22,693 INFO L225 Difference]: With dead ends: 45363 [2022-03-15 14:22:22,693 INFO L226 Difference]: Without dead ends: 45063 [2022-03-15 14:22:22,694 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 205 SyntacticMatches, 13 SemanticMatches, 152 ConstructedPredicates, 7 IntricatePredicates, 1 DeprecatedPredicates, 8035 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=2183, Invalid=19297, Unknown=10, NotChecked=2072, Total=23562 [2022-03-15 14:22:22,695 INFO L933 BasicCegarLoop]: 307 mSDtfsCounter, 2990 mSDsluCounter, 10236 mSDsCounter, 0 mSdLazyCounter, 3262 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2990 SdHoareTripleChecker+Valid, 9599 SdHoareTripleChecker+Invalid, 9850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 3262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6493 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-15 14:22:22,695 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2990 Valid, 9599 Invalid, 9850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 3262 Invalid, 0 Unknown, 6493 Unchecked, 1.4s Time] [2022-03-15 14:22:22,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45063 states. [2022-03-15 14:22:23,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45063 to 15874. [2022-03-15 14:22:23,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15874 states, 15873 states have (on average 3.662256662256662) internal successors, (58131), 15873 states have internal predecessors, (58131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:22:23,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15874 states to 15874 states and 58131 transitions. [2022-03-15 14:22:23,228 INFO L78 Accepts]: Start accepts. Automaton has 15874 states and 58131 transitions. Word has length 124 [2022-03-15 14:22:23,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:22:23,228 INFO L470 AbstractCegarLoop]: Abstraction has 15874 states and 58131 transitions. [2022-03-15 14:22:23,228 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 79 states have (on average 3.8607594936708862) internal successors, (305), 79 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:22:23,228 INFO L276 IsEmpty]: Start isEmpty. Operand 15874 states and 58131 transitions. [2022-03-15 14:22:23,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-15 14:22:23,322 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:22:23,322 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, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:22:23,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2022-03-15 14:22:23,522 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-03-15 14:22:23,523 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:22:23,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:22:23,523 INFO L85 PathProgramCache]: Analyzing trace with hash 724968554, now seen corresponding path program 26 times [2022-03-15 14:22:23,523 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:22:23,523 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011639917] [2022-03-15 14:22:23,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:22:23,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:22:23,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:22:24,150 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:22:24,150 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:22:24,150 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011639917] [2022-03-15 14:22:24,150 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011639917] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:22:24,150 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978866632] [2022-03-15 14:22:24,150 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 14:22:24,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:22:24,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:22:24,152 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 14:22:24,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-03-15 14:22:24,281 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 14:22:24,282 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:22:24,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 58 conjunts are in the unsatisfiable core [2022-03-15 14:22:24,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:22:24,968 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:22:24,968 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 25 [2022-03-15 14:22:25,345 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:22:25,345 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:22:25,621 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:22:25,621 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-03-15 14:22:26,043 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:22:26,043 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [978866632] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:22:26,043 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:22:26,043 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 23, 17] total 56 [2022-03-15 14:22:26,043 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374001475] [2022-03-15 14:22:26,043 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:22:26,044 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-03-15 14:22:26,044 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:22:26,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-03-15 14:22:26,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=454, Invalid=2626, Unknown=0, NotChecked=0, Total=3080 [2022-03-15 14:22:26,044 INFO L87 Difference]: Start difference. First operand 15874 states and 58131 transitions. Second operand has 56 states, 56 states have (on average 5.482142857142857) internal successors, (307), 56 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:22:51,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:22:51,480 INFO L93 Difference]: Finished difference Result 84822 states and 311994 transitions. [2022-03-15 14:22:51,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 397 states. [2022-03-15 14:22:51,481 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 5.482142857142857) internal successors, (307), 56 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2022-03-15 14:22:51,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:22:51,771 INFO L225 Difference]: With dead ends: 84822 [2022-03-15 14:22:51,771 INFO L226 Difference]: Without dead ends: 84522 [2022-03-15 14:22:51,778 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 707 GetRequests, 242 SyntacticMatches, 30 SemanticMatches, 435 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91356 ImplicationChecksByTransitivity, 19.9s TimeCoverageRelationStatistics Valid=19890, Invalid=170642, Unknown=0, NotChecked=0, Total=190532 [2022-03-15 14:22:51,778 INFO L933 BasicCegarLoop]: 483 mSDtfsCounter, 4029 mSDsluCounter, 12896 mSDsCounter, 0 mSdLazyCounter, 9270 mSolverCounterSat, 355 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4029 SdHoareTripleChecker+Valid, 12221 SdHoareTripleChecker+Invalid, 13716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 355 IncrementalHoareTripleChecker+Valid, 9270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4091 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-03-15 14:22:51,778 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4029 Valid, 12221 Invalid, 13716 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [355 Valid, 9270 Invalid, 0 Unknown, 4091 Unchecked, 4.5s Time] [2022-03-15 14:22:51,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84522 states. [2022-03-15 14:22:52,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84522 to 16034. [2022-03-15 14:22:52,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16034 states, 16033 states have (on average 3.6646292022703175) internal successors, (58755), 16033 states have internal predecessors, (58755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:22:52,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16034 states to 16034 states and 58755 transitions. [2022-03-15 14:22:52,617 INFO L78 Accepts]: Start accepts. Automaton has 16034 states and 58755 transitions. Word has length 124 [2022-03-15 14:22:52,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:22:52,617 INFO L470 AbstractCegarLoop]: Abstraction has 16034 states and 58755 transitions. [2022-03-15 14:22:52,617 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 5.482142857142857) internal successors, (307), 56 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:22:52,617 INFO L276 IsEmpty]: Start isEmpty. Operand 16034 states and 58755 transitions. [2022-03-15 14:22:52,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-15 14:22:52,645 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:22:52,645 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, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:22:52,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-03-15 14:22:52,846 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:22:52,846 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:22:52,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:22:52,846 INFO L85 PathProgramCache]: Analyzing trace with hash 65989308, now seen corresponding path program 27 times [2022-03-15 14:22:52,846 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:22:52,846 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951715669] [2022-03-15 14:22:52,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:22:52,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:22:52,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:22:53,389 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:22:53,389 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:22:53,389 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951715669] [2022-03-15 14:22:53,389 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951715669] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:22:53,389 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1626981596] [2022-03-15 14:22:53,389 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 14:22:53,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:22:53,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:22:53,391 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 14:22:53,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-03-15 14:22:53,526 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 14:22:53,526 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:22:53,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 55 conjunts are in the unsatisfiable core [2022-03-15 14:22:53,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:22:54,031 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:22:54,031 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2022-03-15 14:22:54,358 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:22:54,358 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:22:54,640 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:22:54,640 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-03-15 14:22:55,329 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:22:55,329 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1626981596] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:22:55,330 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:22:55,330 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 18, 17] total 51 [2022-03-15 14:22:55,330 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758119241] [2022-03-15 14:22:55,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:22:55,330 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-03-15 14:22:55,330 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:22:55,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-03-15 14:22:55,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=2267, Unknown=0, NotChecked=0, Total=2550 [2022-03-15 14:22:55,331 INFO L87 Difference]: Start difference. First operand 16034 states and 58755 transitions. Second operand has 51 states, 51 states have (on average 6.019607843137255) internal successors, (307), 51 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:23:17,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:23:17,369 INFO L93 Difference]: Finished difference Result 75679 states and 278632 transitions. [2022-03-15 14:23:17,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 379 states. [2022-03-15 14:23:17,369 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 6.019607843137255) internal successors, (307), 51 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2022-03-15 14:23:17,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:23:17,611 INFO L225 Difference]: With dead ends: 75679 [2022-03-15 14:23:17,611 INFO L226 Difference]: Without dead ends: 75079 [2022-03-15 14:23:17,620 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 746 GetRequests, 272 SyntacticMatches, 66 SemanticMatches, 408 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82726 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=13216, Invalid=154474, Unknown=0, NotChecked=0, Total=167690 [2022-03-15 14:23:17,620 INFO L933 BasicCegarLoop]: 600 mSDtfsCounter, 2434 mSDsluCounter, 18035 mSDsCounter, 0 mSdLazyCounter, 10207 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2434 SdHoareTripleChecker+Valid, 17642 SdHoareTripleChecker+Invalid, 21699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 10207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 11278 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-03-15 14:23:17,620 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2434 Valid, 17642 Invalid, 21699 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [214 Valid, 10207 Invalid, 0 Unknown, 11278 Unchecked, 4.6s Time] [2022-03-15 14:23:17,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75079 states. [2022-03-15 14:23:18,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75079 to 16282. [2022-03-15 14:23:18,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16282 states, 16281 states have (on average 3.6735458509919536) internal successors, (59809), 16281 states have internal predecessors, (59809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:23:18,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16282 states to 16282 states and 59809 transitions. [2022-03-15 14:23:18,585 INFO L78 Accepts]: Start accepts. Automaton has 16282 states and 59809 transitions. Word has length 124 [2022-03-15 14:23:18,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:23:18,586 INFO L470 AbstractCegarLoop]: Abstraction has 16282 states and 59809 transitions. [2022-03-15 14:23:18,586 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 6.019607843137255) internal successors, (307), 51 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:23:18,586 INFO L276 IsEmpty]: Start isEmpty. Operand 16282 states and 59809 transitions. [2022-03-15 14:23:18,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-15 14:23:18,617 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:23:18,617 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, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:23:18,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-03-15 14:23:18,817 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-03-15 14:23:18,818 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:23:18,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:23:18,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1480667856, now seen corresponding path program 28 times [2022-03-15 14:23:18,818 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:23:18,818 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047290316] [2022-03-15 14:23:18,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:23:18,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:23:18,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:23:19,382 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:23:19,382 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:23:19,383 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047290316] [2022-03-15 14:23:19,383 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047290316] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:23:19,383 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1360799137] [2022-03-15 14:23:19,383 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 14:23:19,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:23:19,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:23:19,384 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 14:23:19,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-03-15 14:23:19,507 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 14:23:19,507 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:23:19,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 78 conjunts are in the unsatisfiable core [2022-03-15 14:23:19,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:23:20,146 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-15 14:23:20,641 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 14:23:20,819 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 14:23:20,925 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 14:23:21,111 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:23:21,111 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2022-03-15 14:23:21,477 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:23:21,477 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:23:21,884 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1596 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1596) c_~A~0.base))) (= (+ (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0) (+ c_~res2~0 (select .cse0 (+ c_~A~0.offset (* ~M~0 4)))))))) is different from false [2022-03-15 14:23:21,953 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1596 (Array Int Int)) (v_ArrVal_1595 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1595) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1596) c_~A~0.base))) (= (+ (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0) (+ c_~res2~0 (select .cse0 (+ c_~A~0.offset (* ~M~0 4)))))))) is different from false [2022-03-15 14:23:22,018 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1596 (Array Int Int)) (v_ArrVal_1595 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1595) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1596) c_~A~0.base))) (= (+ (select .cse0 c_~A~0.offset) c_~res1~0) (+ c_~res2~0 (select .cse0 (+ c_~A~0.offset (* ~M~0 4)))))))) is different from false [2022-03-15 14:23:22,123 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1596 (Array Int Int)) (v_ArrVal_1595 (Array Int Int)) (v_ArrVal_1594 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1594) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1595) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1596) c_~A~0.base))) (= (+ c_~res2~0 (select .cse0 (+ c_~A~0.offset (* ~M~0 4)))) (+ c_~res1~0 (select .cse0 c_~A~0.offset)))))) is different from false [2022-03-15 14:23:22,226 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1596 (Array Int Int)) (v_ArrVal_1595 (Array Int Int)) (v_ArrVal_1594 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1594) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1595) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1596) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (= (+ c_~res2~0 (select .cse0 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4)))) (+ (select .cse0 |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~res1~0))))) is different from false [2022-03-15 14:23:22,249 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1596 (Array Int Int)) (v_ArrVal_1595 (Array Int Int)) (v_ArrVal_1594 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1594) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1595) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1596) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (= (+ c_~res2~0 (select .cse0 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (+ c_~res1~0 (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))))) is different from false [2022-03-15 14:23:22,262 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1596 (Array Int Int)) (v_ArrVal_1595 (Array Int Int)) (v_ArrVal_1594 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1594) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1595) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1596) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (= (+ c_~res1~0 (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (+ (select .cse0 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~res2~0))))) is different from false [2022-03-15 14:23:22,496 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:23:22,496 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 61 treesize of output 50 [2022-03-15 14:23:22,502 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:23:22,503 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 398 treesize of output 386 [2022-03-15 14:23:22,511 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:23:22,511 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 374 treesize of output 322 [2022-03-15 14:23:22,519 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:23:22,519 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 310 treesize of output 290 [2022-03-15 14:23:22,529 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:23:22,529 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 146 treesize of output 143 [2022-03-15 14:23:24,151 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-03-15 14:23:24,151 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1360799137] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:23:24,151 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:23:24,151 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 33, 29] total 77 [2022-03-15 14:23:24,152 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870225895] [2022-03-15 14:23:24,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:23:24,152 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-03-15 14:23:24,152 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:23:24,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-03-15 14:23:24,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=521, Invalid=4328, Unknown=9, NotChecked=994, Total=5852 [2022-03-15 14:23:24,153 INFO L87 Difference]: Start difference. First operand 16282 states and 59809 transitions. Second operand has 77 states, 77 states have (on average 3.961038961038961) internal successors, (305), 77 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:23:30,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:23:30,460 INFO L93 Difference]: Finished difference Result 35396 states and 128960 transitions. [2022-03-15 14:23:30,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-03-15 14:23:30,460 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 77 states have (on average 3.961038961038961) internal successors, (305), 77 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2022-03-15 14:23:30,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:23:30,560 INFO L225 Difference]: With dead ends: 35396 [2022-03-15 14:23:30,560 INFO L226 Difference]: Without dead ends: 35102 [2022-03-15 14:23:30,561 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 207 SyntacticMatches, 11 SemanticMatches, 129 ConstructedPredicates, 7 IntricatePredicates, 1 DeprecatedPredicates, 5582 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=1574, Invalid=13697, Unknown=9, NotChecked=1750, Total=17030 [2022-03-15 14:23:30,561 INFO L933 BasicCegarLoop]: 291 mSDtfsCounter, 2186 mSDsluCounter, 7715 mSDsCounter, 0 mSdLazyCounter, 2371 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2186 SdHoareTripleChecker+Valid, 7412 SdHoareTripleChecker+Invalid, 6107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 2371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3670 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 14:23:30,562 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2186 Valid, 7412 Invalid, 6107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 2371 Invalid, 0 Unknown, 3670 Unchecked, 1.0s Time] [2022-03-15 14:23:30,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35102 states. [2022-03-15 14:23:30,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35102 to 16562. [2022-03-15 14:23:30,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16562 states, 16561 states have (on average 3.6774953203308978) internal successors, (60903), 16561 states have internal predecessors, (60903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:23:31,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16562 states to 16562 states and 60903 transitions. [2022-03-15 14:23:31,045 INFO L78 Accepts]: Start accepts. Automaton has 16562 states and 60903 transitions. Word has length 124 [2022-03-15 14:23:31,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:23:31,045 INFO L470 AbstractCegarLoop]: Abstraction has 16562 states and 60903 transitions. [2022-03-15 14:23:31,045 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 77 states have (on average 3.961038961038961) internal successors, (305), 77 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:23:31,045 INFO L276 IsEmpty]: Start isEmpty. Operand 16562 states and 60903 transitions. [2022-03-15 14:23:31,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-15 14:23:31,075 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:23:31,075 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, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:23:31,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-03-15 14:23:31,276 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-03-15 14:23:31,276 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:23:31,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:23:31,276 INFO L85 PathProgramCache]: Analyzing trace with hash 862866234, now seen corresponding path program 29 times [2022-03-15 14:23:31,276 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:23:31,277 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968679843] [2022-03-15 14:23:31,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:23:31,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:23:31,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:23:31,958 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:23:31,958 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:23:31,958 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968679843] [2022-03-15 14:23:31,959 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968679843] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:23:31,959 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469865679] [2022-03-15 14:23:31,959 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 14:23:31,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:23:31,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:23:31,962 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 14:23:31,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-03-15 14:23:32,078 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 14:23:32,078 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:23:32,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 63 conjunts are in the unsatisfiable core [2022-03-15 14:23:32,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:23:33,018 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:23:33,018 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 25 [2022-03-15 14:23:33,255 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:23:33,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:23:33,467 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:23:33,467 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-03-15 14:23:34,410 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:23:34,411 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469865679] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:23:34,411 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:23:34,411 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 22] total 63 [2022-03-15 14:23:34,411 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130014043] [2022-03-15 14:23:34,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:23:34,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-03-15 14:23:34,411 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:23:34,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-03-15 14:23:34,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=363, Invalid=3543, Unknown=0, NotChecked=0, Total=3906 [2022-03-15 14:23:34,413 INFO L87 Difference]: Start difference. First operand 16562 states and 60903 transitions. Second operand has 63 states, 63 states have (on average 4.666666666666667) internal successors, (294), 63 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:23:44,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:23:44,758 INFO L93 Difference]: Finished difference Result 44412 states and 162289 transitions. [2022-03-15 14:23:44,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2022-03-15 14:23:44,759 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 4.666666666666667) internal successors, (294), 63 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2022-03-15 14:23:44,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:23:44,892 INFO L225 Difference]: With dead ends: 44412 [2022-03-15 14:23:44,892 INFO L226 Difference]: Without dead ends: 43962 [2022-03-15 14:23:44,893 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 219 SyntacticMatches, 11 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10784 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=3448, Invalid=29132, Unknown=0, NotChecked=0, Total=32580 [2022-03-15 14:23:44,893 INFO L933 BasicCegarLoop]: 332 mSDtfsCounter, 3472 mSDsluCounter, 11061 mSDsCounter, 0 mSdLazyCounter, 5386 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3472 SdHoareTripleChecker+Valid, 10596 SdHoareTripleChecker+Invalid, 8385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 5386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2802 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-03-15 14:23:44,894 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3472 Valid, 10596 Invalid, 8385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 5386 Invalid, 0 Unknown, 2802 Unchecked, 2.5s Time] [2022-03-15 14:23:44,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43962 states. [2022-03-15 14:23:45,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43962 to 17138. [2022-03-15 14:23:45,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17138 states, 17137 states have (on average 3.6869347026900856) internal successors, (63183), 17137 states have internal predecessors, (63183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:23:45,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17138 states to 17138 states and 63183 transitions. [2022-03-15 14:23:45,410 INFO L78 Accepts]: Start accepts. Automaton has 17138 states and 63183 transitions. Word has length 124 [2022-03-15 14:23:45,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:23:45,410 INFO L470 AbstractCegarLoop]: Abstraction has 17138 states and 63183 transitions. [2022-03-15 14:23:45,411 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 4.666666666666667) internal successors, (294), 63 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:23:45,411 INFO L276 IsEmpty]: Start isEmpty. Operand 17138 states and 63183 transitions. [2022-03-15 14:23:45,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-15 14:23:45,446 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:23:45,446 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, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:23:45,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-03-15 14:23:45,647 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-03-15 14:23:45,647 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:23:45,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:23:45,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1322821530, now seen corresponding path program 30 times [2022-03-15 14:23:45,647 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:23:45,647 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402254810] [2022-03-15 14:23:45,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:23:45,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:23:45,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:23:46,053 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:23:46,053 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:23:46,053 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402254810] [2022-03-15 14:23:46,053 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402254810] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:23:46,053 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711924183] [2022-03-15 14:23:46,053 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 14:23:46,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:23:46,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:23:46,054 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 14:23:46,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-03-15 14:23:46,185 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 14:23:46,185 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:23:46,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 72 conjunts are in the unsatisfiable core [2022-03-15 14:23:46,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:23:46,628 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 11 treesize of output 7 [2022-03-15 14:23:46,884 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 14:23:47,048 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 14:23:47,278 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 14:23:47,461 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:23:47,461 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2022-03-15 14:23:47,890 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:23:47,890 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:23:48,327 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1665 (Array Int Int)) (~M~0 Int)) (or (< 0 ~M~0) (< (+ ~M~0 1) c_~N~0) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1665) c_~A~0.base))) (= (+ c_~res1~0 (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)))) (+ c_~res2~0 (select .cse0 (+ c_~A~0.offset (* ~M~0 4)))))))) is different from false [2022-03-15 14:23:48,383 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1665 (Array Int Int)) (~M~0 Int) (v_ArrVal_1664 (Array Int Int))) (or (< 0 ~M~0) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1664) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1665) c_~A~0.base))) (= (+ c_~res1~0 (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)))) (+ c_~res2~0 (select .cse0 (+ c_~A~0.offset (* ~M~0 4)))))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-15 14:23:48,436 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1665 (Array Int Int)) (~M~0 Int) (v_ArrVal_1664 (Array Int Int))) (or (<= (+ ~M~0 1) |c_thread1Thread1of1ForFork0_~i~0#1|) (< 0 ~M~0) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1664) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1665) c_~A~0.base))) (= (+ c_~res1~0 (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)))) (+ c_~res2~0 (select .cse0 (+ c_~A~0.offset (* ~M~0 4)))))))) is different from false [2022-03-15 14:23:48,558 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-03-15 14:23:48,559 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1711924183] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:23:48,559 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:23:48,559 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 30, 19] total 60 [2022-03-15 14:23:48,559 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416266728] [2022-03-15 14:23:48,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:23:48,559 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-03-15 14:23:48,559 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:23:48,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-03-15 14:23:48,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=2802, Unknown=3, NotChecked=336, Total=3540 [2022-03-15 14:23:48,560 INFO L87 Difference]: Start difference. First operand 17138 states and 63183 transitions. Second operand has 60 states, 60 states have (on average 5.283333333333333) internal successors, (317), 60 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:24:02,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:24:02,700 INFO L93 Difference]: Finished difference Result 62743 states and 230090 transitions. [2022-03-15 14:24:02,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 214 states. [2022-03-15 14:24:02,700 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 5.283333333333333) internal successors, (317), 60 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2022-03-15 14:24:02,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:24:03,009 INFO L225 Difference]: With dead ends: 62743 [2022-03-15 14:24:03,010 INFO L226 Difference]: Without dead ends: 62294 [2022-03-15 14:24:03,012 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 215 SyntacticMatches, 7 SemanticMatches, 249 ConstructedPredicates, 3 IntricatePredicates, 2 DeprecatedPredicates, 24749 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=5759, Invalid=55506, Unknown=3, NotChecked=1482, Total=62750 [2022-03-15 14:24:03,012 INFO L933 BasicCegarLoop]: 455 mSDtfsCounter, 2883 mSDsluCounter, 12395 mSDsCounter, 0 mSdLazyCounter, 7949 mSolverCounterSat, 256 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2883 SdHoareTripleChecker+Valid, 11801 SdHoareTripleChecker+Invalid, 14538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 256 IncrementalHoareTripleChecker+Valid, 7949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6333 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-03-15 14:24:03,012 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2883 Valid, 11801 Invalid, 14538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [256 Valid, 7949 Invalid, 0 Unknown, 6333 Unchecked, 3.6s Time] [2022-03-15 14:24:03,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62294 states. [2022-03-15 14:24:03,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62294 to 17170. [2022-03-15 14:24:03,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17170 states, 17169 states have (on average 3.6889160696604346) internal successors, (63335), 17169 states have internal predecessors, (63335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:24:03,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17170 states to 17170 states and 63335 transitions. [2022-03-15 14:24:03,712 INFO L78 Accepts]: Start accepts. Automaton has 17170 states and 63335 transitions. Word has length 124 [2022-03-15 14:24:03,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:24:03,713 INFO L470 AbstractCegarLoop]: Abstraction has 17170 states and 63335 transitions. [2022-03-15 14:24:03,713 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 5.283333333333333) internal successors, (317), 60 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:24:03,713 INFO L276 IsEmpty]: Start isEmpty. Operand 17170 states and 63335 transitions. [2022-03-15 14:24:03,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-15 14:24:03,753 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:24:03,754 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, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:24:03,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2022-03-15 14:24:03,954 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:24:03,954 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:24:03,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:24:03,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1557467218, now seen corresponding path program 31 times [2022-03-15 14:24:03,955 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:24:03,955 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355728555] [2022-03-15 14:24:03,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:24:03,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:24:03,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:24:04,473 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:24:04,473 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:24:04,473 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355728555] [2022-03-15 14:24:04,473 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355728555] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:24:04,473 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967289873] [2022-03-15 14:24:04,473 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 14:24:04,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:24:04,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:24:04,474 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 14:24:04,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-03-15 14:24:04,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:24:04,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 65 conjunts are in the unsatisfiable core [2022-03-15 14:24:04,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:24:05,411 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:24:05,412 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 25 [2022-03-15 14:24:05,731 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:24:05,731 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:24:05,929 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:24:05,929 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-03-15 14:24:06,942 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:24:06,942 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967289873] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:24:06,942 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:24:06,942 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27, 22] total 54 [2022-03-15 14:24:06,942 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959318167] [2022-03-15 14:24:06,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:24:06,943 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-03-15 14:24:06,943 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:24:06,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-03-15 14:24:06,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=348, Invalid=2514, Unknown=0, NotChecked=0, Total=2862 [2022-03-15 14:24:06,944 INFO L87 Difference]: Start difference. First operand 17170 states and 63335 transitions. Second operand has 54 states, 54 states have (on average 4.537037037037037) internal successors, (245), 54 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:24:09,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:24:09,921 INFO L93 Difference]: Finished difference Result 32929 states and 121572 transitions. [2022-03-15 14:24:09,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-03-15 14:24:09,922 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 4.537037037037037) internal successors, (245), 54 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2022-03-15 14:24:09,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:24:10,031 INFO L225 Difference]: With dead ends: 32929 [2022-03-15 14:24:10,031 INFO L226 Difference]: Without dead ends: 32779 [2022-03-15 14:24:10,031 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 218 SyntacticMatches, 7 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3153 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1303, Invalid=8597, Unknown=0, NotChecked=0, Total=9900 [2022-03-15 14:24:10,032 INFO L933 BasicCegarLoop]: 274 mSDtfsCounter, 1667 mSDsluCounter, 6907 mSDsCounter, 0 mSdLazyCounter, 2295 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1667 SdHoareTripleChecker+Valid, 6629 SdHoareTripleChecker+Invalid, 3554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1204 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 14:24:10,032 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1667 Valid, 6629 Invalid, 3554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2295 Invalid, 0 Unknown, 1204 Unchecked, 0.9s Time] [2022-03-15 14:24:10,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32779 states. [2022-03-15 14:24:10,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32779 to 17234. [2022-03-15 14:24:10,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17234 states, 17233 states have (on average 3.6863575697789126) internal successors, (63527), 17233 states have internal predecessors, (63527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:24:10,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17234 states to 17234 states and 63527 transitions. [2022-03-15 14:24:10,522 INFO L78 Accepts]: Start accepts. Automaton has 17234 states and 63527 transitions. Word has length 124 [2022-03-15 14:24:10,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:24:10,523 INFO L470 AbstractCegarLoop]: Abstraction has 17234 states and 63527 transitions. [2022-03-15 14:24:10,523 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 4.537037037037037) internal successors, (245), 54 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:24:10,523 INFO L276 IsEmpty]: Start isEmpty. Operand 17234 states and 63527 transitions. [2022-03-15 14:24:10,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-15 14:24:10,556 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:24:10,556 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, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:24:10,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2022-03-15 14:24:10,756 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:24:10,756 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:24:10,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:24:10,757 INFO L85 PathProgramCache]: Analyzing trace with hash 2104628492, now seen corresponding path program 32 times [2022-03-15 14:24:10,757 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:24:10,757 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967871430] [2022-03-15 14:24:10,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:24:10,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:24:10,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:24:11,177 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:24:11,177 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:24:11,177 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967871430] [2022-03-15 14:24:11,177 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967871430] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:24:11,178 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192537897] [2022-03-15 14:24:11,178 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 14:24:11,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:24:11,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:24:11,179 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 14:24:11,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-03-15 14:24:11,306 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 14:24:11,306 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:24:11,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 78 conjunts are in the unsatisfiable core [2022-03-15 14:24:11,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:24:11,367 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 14:24:11,400 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-03-15 14:24:11,400 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-03-15 14:24:11,642 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-03-15 14:24:11,642 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-03-15 14:24:11,771 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 11 treesize of output 7 [2022-03-15 14:24:12,071 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 14:24:12,226 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 14:24:12,307 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 14:24:12,489 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:24:12,489 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2022-03-15 14:24:12,815 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:24:12,815 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:24:13,238 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1736 (Array Int Int)) (~M~0 Int)) (or (< 0 ~M~0) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1736) c_~A~0.base))) (= (+ c_~res1~0 (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)))) (+ (select .cse0 (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-15 14:24:13,297 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1736 (Array Int Int)) (v_ArrVal_1735 (Array Int Int)) (~M~0 Int)) (or (< 0 ~M~0) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1735) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1736) c_~A~0.base))) (= (+ (select .cse0 (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) (+ (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-15 14:24:13,351 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1736 (Array Int Int)) (v_ArrVal_1735 (Array Int Int)) (~M~0 Int)) (or (<= (+ ~M~0 1) |c_thread1Thread1of1ForFork0_~i~0#1|) (< 0 ~M~0) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1735) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1736) c_~A~0.base))) (= (+ (select .cse0 (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) (+ (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0))))) is different from false [2022-03-15 14:24:13,636 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-03-15 14:24:13,657 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-03-15 14:24:13,657 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [192537897] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:24:13,657 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:24:13,657 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 30, 20] total 61 [2022-03-15 14:24:13,657 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255988336] [2022-03-15 14:24:13,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:24:13,657 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-03-15 14:24:13,657 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:24:13,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-03-15 14:24:13,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=476, Invalid=2839, Unknown=3, NotChecked=342, Total=3660 [2022-03-15 14:24:13,658 INFO L87 Difference]: Start difference. First operand 17234 states and 63527 transitions. Second operand has 61 states, 61 states have (on average 5.19672131147541) internal successors, (317), 61 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:24:24,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:24:24,948 INFO L93 Difference]: Finished difference Result 53099 states and 194485 transitions. [2022-03-15 14:24:24,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2022-03-15 14:24:24,949 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 5.19672131147541) internal successors, (317), 61 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2022-03-15 14:24:24,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:24:25,133 INFO L225 Difference]: With dead ends: 53099 [2022-03-15 14:24:25,134 INFO L226 Difference]: Without dead ends: 52799 [2022-03-15 14:24:25,135 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 217 SyntacticMatches, 5 SemanticMatches, 204 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 16176 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=5479, Invalid=35536, Unknown=3, NotChecked=1212, Total=42230 [2022-03-15 14:24:25,136 INFO L933 BasicCegarLoop]: 362 mSDtfsCounter, 2561 mSDsluCounter, 8730 mSDsCounter, 0 mSdLazyCounter, 4867 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2561 SdHoareTripleChecker+Valid, 8475 SdHoareTripleChecker+Invalid, 11864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 4867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6777 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-03-15 14:24:25,136 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2561 Valid, 8475 Invalid, 11864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 4867 Invalid, 0 Unknown, 6777 Unchecked, 2.4s Time] [2022-03-15 14:24:25,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52799 states. [2022-03-15 14:24:25,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52799 to 17321. [2022-03-15 14:24:25,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17321 states, 17320 states have (on average 3.6916281755196305) internal successors, (63939), 17320 states have internal predecessors, (63939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:24:25,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17321 states to 17321 states and 63939 transitions. [2022-03-15 14:24:25,790 INFO L78 Accepts]: Start accepts. Automaton has 17321 states and 63939 transitions. Word has length 124 [2022-03-15 14:24:25,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:24:25,790 INFO L470 AbstractCegarLoop]: Abstraction has 17321 states and 63939 transitions. [2022-03-15 14:24:25,791 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 5.19672131147541) internal successors, (317), 61 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:24:25,791 INFO L276 IsEmpty]: Start isEmpty. Operand 17321 states and 63939 transitions. [2022-03-15 14:24:25,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-15 14:24:25,824 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:24:25,824 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, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:24:25,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-03-15 14:24:26,024 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:24:26,025 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:24:26,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:24:26,025 INFO L85 PathProgramCache]: Analyzing trace with hash -775660256, now seen corresponding path program 33 times [2022-03-15 14:24:26,025 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:24:26,025 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277988624] [2022-03-15 14:24:26,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:24:26,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:24:26,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:24:26,535 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:24:26,535 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:24:26,535 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277988624] [2022-03-15 14:24:26,535 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277988624] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:24:26,535 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541106037] [2022-03-15 14:24:26,535 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 14:24:26,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:24:26,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:24:26,537 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 14:24:26,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-03-15 14:24:26,667 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 14:24:26,667 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:24:26,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 78 conjunts are in the unsatisfiable core [2022-03-15 14:24:26,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:24:26,731 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 14:24:26,767 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-03-15 14:24:26,775 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-03-15 14:24:27,034 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-03-15 14:24:27,035 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-03-15 14:24:27,184 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 11 treesize of output 7 [2022-03-15 14:24:27,440 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 14:24:27,617 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 14:24:27,896 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 14:24:28,088 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:24:28,088 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2022-03-15 14:24:28,555 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:24:28,555 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:24:28,997 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1775 (Array Int Int)) (~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (< 0 ~M~0) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1775) c_~A~0.base))) (= (+ (select .cse0 (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) (+ c_~res1~0 (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)))))))) is different from false [2022-03-15 14:24:29,061 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1775 (Array Int Int)) (~M~0 Int) (v_ArrVal_1774 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (< 0 ~M~0) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1774) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1775) c_~A~0.base))) (= (+ (select .cse0 (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) (+ c_~res1~0 (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)))))))) is different from false [2022-03-15 14:24:29,112 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1775 (Array Int Int)) (~M~0 Int) (v_ArrVal_1774 (Array Int Int))) (or (<= (+ ~M~0 1) |c_thread1Thread1of1ForFork0_~i~0#1|) (< 0 ~M~0) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1774) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1775) c_~A~0.base))) (= (+ (select .cse0 (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) (+ c_~res1~0 (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)))))))) is different from false [2022-03-15 14:24:29,384 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-03-15 14:24:29,404 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-03-15 14:24:29,405 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541106037] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:24:29,405 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:24:29,405 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 30, 20] total 65 [2022-03-15 14:24:29,405 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083713841] [2022-03-15 14:24:29,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:24:29,405 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-03-15 14:24:29,405 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:24:29,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-03-15 14:24:29,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=477, Invalid=3314, Unknown=3, NotChecked=366, Total=4160 [2022-03-15 14:24:29,406 INFO L87 Difference]: Start difference. First operand 17321 states and 63939 transitions. Second operand has 65 states, 65 states have (on average 4.8307692307692305) internal successors, (314), 65 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Received shutdown request... [2022-03-15 14:24:42,307 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 14:24:42,307 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 14:24:42,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2022-03-15 14:24:42,312 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 451 GetRequests, 228 SyntacticMatches, 9 SemanticMatches, 213 ConstructedPredicates, 3 IntricatePredicates, 7 DeprecatedPredicates, 16797 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=7843, Invalid=36898, Unknown=3, NotChecked=1266, Total=46010 [2022-03-15 14:24:42,312 INFO L933 BasicCegarLoop]: 242 mSDtfsCounter, 2854 mSDsluCounter, 6867 mSDsCounter, 0 mSdLazyCounter, 4049 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2854 SdHoareTripleChecker+Valid, 6873 SdHoareTripleChecker+Invalid, 7552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 4049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3314 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-03-15 14:24:42,312 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2854 Valid, 6873 Invalid, 7552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 4049 Invalid, 0 Unknown, 3314 Unchecked, 1.9s Time] [2022-03-15 14:24:42,313 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-03-15 14:24:42,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2022-03-15 14:24:42,513 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2022-03-15 14:24:42,513 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was constructing difference of abstraction (17321states) and FLOYD_HOARE automaton (currently 165 states, 65 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 215 known predicates. [2022-03-15 14:24:42,515 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 4 remaining) [2022-03-15 14:24:42,515 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 4 remaining) [2022-03-15 14:24:42,515 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATION (0 of 4 remaining) [2022-03-15 14:24:42,517 INFO L732 BasicCegarLoop]: Path program histogram: [33, 9, 6, 1, 1, 1, 1, 1, 1] [2022-03-15 14:24:42,518 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 14:24:42,518 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 14:24:42,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 02:24:42 BasicIcfg [2022-03-15 14:24:42,519 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 14:24:42,520 INFO L158 Benchmark]: Toolchain (without parser) took 737997.52ms. Allocated memory was 195.0MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 143.5MB in the beginning and 1.1GB in the end (delta: -945.8MB). Peak memory consumption was 1.0GB. Max. memory is 8.0GB. [2022-03-15 14:24:42,520 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 195.0MB. Free memory was 160.2MB in the beginning and 160.1MB in the end (delta: 71.1kB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 14:24:42,520 INFO L158 Benchmark]: CACSL2BoogieTranslator took 309.03ms. Allocated memory is still 195.0MB. Free memory was 143.4MB in the beginning and 168.1MB in the end (delta: -24.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-03-15 14:24:42,520 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.99ms. Allocated memory is still 195.0MB. Free memory was 168.1MB in the beginning and 166.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 14:24:42,520 INFO L158 Benchmark]: Boogie Preprocessor took 36.14ms. Allocated memory is still 195.0MB. Free memory was 166.0MB in the beginning and 164.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 14:24:42,520 INFO L158 Benchmark]: RCFGBuilder took 581.37ms. Allocated memory is still 195.0MB. Free memory was 164.2MB in the beginning and 136.9MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-03-15 14:24:42,520 INFO L158 Benchmark]: TraceAbstraction took 737011.30ms. Allocated memory was 195.0MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 136.4MB in the beginning and 1.1GB in the end (delta: -952.9MB). Peak memory consumption was 1.0GB. Max. memory is 8.0GB. [2022-03-15 14:24:42,520 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 195.0MB. Free memory was 160.2MB in the beginning and 160.1MB in the end (delta: 71.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 309.03ms. Allocated memory is still 195.0MB. Free memory was 143.4MB in the beginning and 168.1MB in the end (delta: -24.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 51.99ms. Allocated memory is still 195.0MB. Free memory was 168.1MB in the beginning and 166.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.14ms. Allocated memory is still 195.0MB. Free memory was 166.0MB in the beginning and 164.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 581.37ms. Allocated memory is still 195.0MB. Free memory was 164.2MB in the beginning and 136.9MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * TraceAbstraction took 737011.30ms. Allocated memory was 195.0MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 136.4MB in the beginning and 1.1GB in the end (delta: -952.9MB). Peak memory consumption was 1.0GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 104]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (17321states) and FLOYD_HOARE automaton (currently 165 states, 65 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 215 known predicates. - TimeoutResultAtElement [Line: 98]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (17321states) and FLOYD_HOARE automaton (currently 165 states, 65 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 215 known predicates. - TimeoutResultAtElement [Line: 96]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (17321states) and FLOYD_HOARE automaton (currently 165 states, 65 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 215 known predicates. - TimeoutResultAtElement [Line: 97]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (17321states) and FLOYD_HOARE automaton (currently 165 states, 65 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 215 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 178 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 736.9s, OverallIterations: 54, TraceHistogramMax: 1, PathProgramHistogramMax: 33, EmptinessCheckTime: 1.6s, AutomataDifference: 503.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 110207 SdHoareTripleChecker+Valid, 97.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 110207 mSDsluCounter, 405989 SdHoareTripleChecker+Invalid, 82.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 208783 IncrementalHoareTripleChecker+Unchecked, 422232 mSDsCounter, 6335 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 216663 IncrementalHoareTripleChecker+Invalid, 431781 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6335 mSolverCounterUnsat, 17115 mSDtfsCounter, 216663 mSolverCounterSat, 1.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20157 GetRequests, 10809 SyntacticMatches, 454 SemanticMatches, 8893 ConstructedPredicates, 149 IntricatePredicates, 38 DeprecatedPredicates, 1157135 ImplicationChecksByTransitivity, 412.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17321occurred in iteration=53, InterpolantAutomatonStates: 6791, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 28.4s AutomataMinimizationTime, 53 MinimizatonAttempts, 1457750 StatesRemovedByMinimization, 52 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 185.8s InterpolantComputationTime, 12611 NumberOfCodeBlocks, 12601 NumberOfCodeBlocksAsserted, 150 NumberOfCheckSat, 18493 ConstructedInterpolants, 1813 QuantifiedInterpolants, 224097 SizeOfPredicates, 1734 NumberOfNonLiveVariables, 15726 ConjunctsInSsa, 2937 ConjunctsInUnsatCore, 152 InterpolantComputations, 8 PerfectInterpolantSequences, 79/423 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown