/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-44898dd [2022-02-09 01:00:08,408 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-09 01:00:08,410 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-09 01:00:08,477 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-09 01:00:08,477 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-09 01:00:08,479 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-09 01:00:08,481 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-09 01:00:08,483 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-09 01:00:08,484 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-09 01:00:08,488 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-09 01:00:08,489 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-09 01:00:08,490 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-09 01:00:08,490 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-09 01:00:08,491 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-09 01:00:08,492 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-09 01:00:08,495 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-09 01:00:08,495 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-09 01:00:08,496 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-09 01:00:08,497 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-09 01:00:08,502 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-09 01:00:08,503 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-09 01:00:08,507 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-09 01:00:08,508 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-09 01:00:08,509 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-09 01:00:08,511 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-09 01:00:08,511 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-09 01:00:08,511 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-09 01:00:08,512 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-09 01:00:08,512 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-09 01:00:08,512 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-09 01:00:08,513 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-09 01:00:08,513 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-09 01:00:08,514 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-09 01:00:08,515 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-09 01:00:08,515 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-09 01:00:08,516 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-09 01:00:08,516 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-09 01:00:08,516 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-09 01:00:08,516 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-09 01:00:08,517 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-09 01:00:08,517 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-09 01:00:08,518 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2022-02-09 01:00:08,539 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-09 01:00:08,539 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-09 01:00:08,540 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-09 01:00:08,540 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-09 01:00:08,540 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-09 01:00:08,541 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-09 01:00:08,541 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-09 01:00:08,541 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-09 01:00:08,541 INFO L138 SettingsManager]: * Use SBE=true [2022-02-09 01:00:08,541 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-09 01:00:08,542 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-09 01:00:08,542 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-09 01:00:08,542 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-09 01:00:08,542 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-09 01:00:08,542 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-09 01:00:08,542 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-09 01:00:08,542 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-09 01:00:08,542 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-09 01:00:08,542 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-09 01:00:08,543 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-09 01:00:08,543 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-09 01:00:08,543 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-09 01:00:08,543 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-09 01:00:08,543 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-09 01:00:08,543 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-09 01:00:08,543 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-09 01:00:08,543 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-09 01:00:08,543 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-09 01:00:08,543 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-09 01:00:08,543 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-09 01:00:08,544 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-09 01:00:08,544 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-09 01:00:08,544 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-09 01:00:08,544 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-02-09 01:00:08,734 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-09 01:00:08,749 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-09 01:00:08,751 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-09 01:00:08,752 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-09 01:00:08,753 INFO L275 PluginConnector]: CDTParser initialized [2022-02-09 01:00:08,753 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-02-09 01:00:08,800 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3da6d938d/34da5f6d00264c65a3e42b95b21fe69e/FLAG659c1523a [2022-02-09 01:00:09,143 INFO L306 CDTParser]: Found 1 translation units. [2022-02-09 01:00:09,143 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum-alt.wvr.c [2022-02-09 01:00:09,148 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3da6d938d/34da5f6d00264c65a3e42b95b21fe69e/FLAG659c1523a [2022-02-09 01:00:09,156 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3da6d938d/34da5f6d00264c65a3e42b95b21fe69e [2022-02-09 01:00:09,158 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-09 01:00:09,159 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-09 01:00:09,162 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-09 01:00:09,162 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-09 01:00:09,165 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-09 01:00:09,165 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.02 01:00:09" (1/1) ... [2022-02-09 01:00:09,166 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28b24630 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 01:00:09, skipping insertion in model container [2022-02-09 01:00:09,166 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.02 01:00:09" (1/1) ... [2022-02-09 01:00:09,170 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-09 01:00:09,184 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-09 01:00:09,310 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-02-09 01:00:09,316 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-09 01:00:09,321 INFO L203 MainTranslator]: Completed pre-run [2022-02-09 01:00:09,342 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-02-09 01:00:09,345 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-09 01:00:09,355 INFO L208 MainTranslator]: Completed translation [2022-02-09 01:00:09,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 01:00:09 WrapperNode [2022-02-09 01:00:09,356 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-09 01:00:09,356 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-09 01:00:09,357 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-09 01:00:09,357 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-09 01:00:09,362 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 01:00:09" (1/1) ... [2022-02-09 01:00:09,367 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 01:00:09" (1/1) ... [2022-02-09 01:00:09,386 INFO L137 Inliner]: procedures = 25, calls = 51, calls flagged for inlining = 12, calls inlined = 16, statements flattened = 200 [2022-02-09 01:00:09,386 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-09 01:00:09,387 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-09 01:00:09,387 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-09 01:00:09,387 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-09 01:00:09,393 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 01:00:09" (1/1) ... [2022-02-09 01:00:09,393 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 01:00:09" (1/1) ... [2022-02-09 01:00:09,402 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 01:00:09" (1/1) ... [2022-02-09 01:00:09,402 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 01:00:09" (1/1) ... [2022-02-09 01:00:09,409 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 01:00:09" (1/1) ... [2022-02-09 01:00:09,412 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 01:00:09" (1/1) ... [2022-02-09 01:00:09,414 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 01:00:09" (1/1) ... [2022-02-09 01:00:09,429 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-09 01:00:09,430 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-09 01:00:09,430 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-09 01:00:09,430 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-09 01:00:09,433 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 01:00:09" (1/1) ... [2022-02-09 01:00:09,438 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-09 01:00:09,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 01:00:09,458 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-09 01:00:09,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-09 01:00:09,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-09 01:00:09,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-09 01:00:09,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-09 01:00:09,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-09 01:00:09,488 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-02-09 01:00:09,488 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-02-09 01:00:09,488 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-02-09 01:00:09,489 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-02-09 01:00:09,489 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-02-09 01:00:09,489 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-02-09 01:00:09,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-09 01:00:09,489 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-02-09 01:00:09,489 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-02-09 01:00:09,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-09 01:00:09,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-09 01:00:09,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-09 01:00:09,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-09 01:00:09,491 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-02-09 01:00:09,561 INFO L234 CfgBuilder]: Building ICFG [2022-02-09 01:00:09,562 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-09 01:00:09,796 INFO L275 CfgBuilder]: Performing block encoding [2022-02-09 01:00:09,898 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-09 01:00:09,898 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-02-09 01:00:09,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.02 01:00:09 BoogieIcfgContainer [2022-02-09 01:00:09,900 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-09 01:00:09,901 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-09 01:00:09,901 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-09 01:00:09,910 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-09 01:00:09,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.02 01:00:09" (1/3) ... [2022-02-09 01:00:09,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@254779b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.02 01:00:09, skipping insertion in model container [2022-02-09 01:00:09,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 01:00:09" (2/3) ... [2022-02-09 01:00:09,911 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@254779b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.02 01:00:09, skipping insertion in model container [2022-02-09 01:00:09,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.02 01:00:09" (3/3) ... [2022-02-09 01:00:09,912 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum-alt.wvr.c [2022-02-09 01:00:09,916 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-09 01:00:09,916 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-09 01:00:09,917 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-09 01:00:09,917 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-09 01:00:09,952 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,952 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,952 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,952 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,953 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,953 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,953 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,953 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,953 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,953 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,953 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,953 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,954 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,954 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,954 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,954 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,954 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,954 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,954 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,954 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,954 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,955 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,955 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,955 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,955 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,955 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,955 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,956 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,956 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,956 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,956 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,956 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,957 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,957 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,957 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,957 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,957 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,957 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,957 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,957 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,958 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,958 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,958 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,958 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,958 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,958 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,958 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,959 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,959 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,959 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,959 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,959 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,959 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,959 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,960 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,960 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,960 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~tmp~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,960 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,960 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,960 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,960 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,960 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,960 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,960 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,960 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,961 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,961 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,961 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~tmp~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,961 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,961 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,961 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,962 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,962 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,962 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,962 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,962 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,963 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~tmp~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,963 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~tmp~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,963 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,963 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,963 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,963 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,963 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,963 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,963 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,963 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,964 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,964 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,964 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,964 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,964 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,964 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,965 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,965 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,965 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,965 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,965 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,965 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,965 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,965 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,965 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,966 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,966 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,966 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,966 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~tmp~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,966 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,966 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,966 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,966 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,967 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,967 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,967 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,967 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,967 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,967 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,967 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~tmp~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,967 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,967 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,968 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,968 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,968 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~tmp~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,969 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~tmp~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,969 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,969 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,969 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,969 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,969 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,969 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,969 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,969 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,970 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,970 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,972 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,972 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,972 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,972 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,972 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,973 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,973 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,973 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,973 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,973 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,973 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,973 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,973 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,973 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,974 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,974 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,974 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,974 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,974 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,975 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,975 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,975 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,975 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,975 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,975 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,975 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,975 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~tmp~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,975 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,976 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,976 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,976 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,976 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,976 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,976 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,976 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,977 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,977 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,977 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,977 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,977 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~tmp~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,977 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,977 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:00:09,981 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-02-09 01:00:10,028 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-09 01:00:10,033 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 [2022-02-09 01:00:10,033 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-02-09 01:00:10,042 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 154 places, 156 transitions, 336 flow [2022-02-09 01:00:10,219 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-02-09 01:00:10,238 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-02-09 01:00:10,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-09 01:00:10,281 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:00:10,282 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-02-09 01:00:10,283 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-09 01:00:10,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:00:10,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1255483766, now seen corresponding path program 1 times [2022-02-09 01:00:10,293 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:00:10,294 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264874497] [2022-02-09 01:00:10,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:00:10,294 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:00:10,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:00:10,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:00:10,470 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:00:10,470 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264874497] [2022-02-09 01:00:10,470 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264874497] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:00:10,470 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:00:10,471 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-09 01:00:10,472 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382662812] [2022-02-09 01:00:10,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:00:10,475 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-09 01:00:10,475 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:00:10,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-09 01:00:10,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-09 01:00:10,511 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-02-09 01:00:10,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:00:10,648 INFO L93 Difference]: Finished difference Result 5072 states and 17963 transitions. [2022-02-09 01:00:10,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 01:00:10,650 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-02-09 01:00:10,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:00:10,703 INFO L225 Difference]: With dead ends: 5072 [2022-02-09 01:00:10,703 INFO L226 Difference]: Without dead ends: 5068 [2022-02-09 01:00:10,705 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-02-09 01:00:10,708 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-02-09 01:00:10,709 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-02-09 01:00:10,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5068 states. [2022-02-09 01:00:10,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5068 to 5068. [2022-02-09 01:00:10,952 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-02-09 01:00:10,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5068 states to 5068 states and 17959 transitions. [2022-02-09 01:00:10,975 INFO L78 Accepts]: Start accepts. Automaton has 5068 states and 17959 transitions. Word has length 105 [2022-02-09 01:00:10,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:00:10,975 INFO L470 AbstractCegarLoop]: Abstraction has 5068 states and 17959 transitions. [2022-02-09 01:00:10,976 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-02-09 01:00:10,976 INFO L276 IsEmpty]: Start isEmpty. Operand 5068 states and 17959 transitions. [2022-02-09 01:00:10,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-09 01:00:10,991 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:00:10,991 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-02-09 01:00:10,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-09 01:00:10,991 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-09 01:00:10,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:00:10,994 INFO L85 PathProgramCache]: Analyzing trace with hash 613749194, now seen corresponding path program 1 times [2022-02-09 01:00:10,994 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:00:10,994 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951775034] [2022-02-09 01:00:10,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:00:10,994 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:00:11,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:00:11,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:00:11,296 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:00:11,296 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951775034] [2022-02-09 01:00:11,296 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951775034] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:00:11,296 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:00:11,297 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-09 01:00:11,297 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790941480] [2022-02-09 01:00:11,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:00:11,298 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-09 01:00:11,298 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:00:11,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-09 01:00:11,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-09 01:00:11,299 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-02-09 01:00:11,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:00:11,469 INFO L93 Difference]: Finished difference Result 9970 states and 35356 transitions. [2022-02-09 01:00:11,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 01:00:11,470 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-02-09 01:00:11,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:00:11,538 INFO L225 Difference]: With dead ends: 9970 [2022-02-09 01:00:11,538 INFO L226 Difference]: Without dead ends: 9820 [2022-02-09 01:00:11,541 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-02-09 01:00:11,543 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-02-09 01:00:11,543 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-02-09 01:00:11,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9820 states. [2022-02-09 01:00:11,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9820 to 5678. [2022-02-09 01:00:11,766 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-02-09 01:00:11,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5678 states to 5678 states and 20050 transitions. [2022-02-09 01:00:11,784 INFO L78 Accepts]: Start accepts. Automaton has 5678 states and 20050 transitions. Word has length 105 [2022-02-09 01:00:11,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:00:11,786 INFO L470 AbstractCegarLoop]: Abstraction has 5678 states and 20050 transitions. [2022-02-09 01:00:11,786 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-02-09 01:00:11,786 INFO L276 IsEmpty]: Start isEmpty. Operand 5678 states and 20050 transitions. [2022-02-09 01:00:11,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-02-09 01:00:11,840 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:00:11,841 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-02-09 01:00:11,841 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-09 01:00:11,841 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-09 01:00:11,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:00:11,842 INFO L85 PathProgramCache]: Analyzing trace with hash -2081314034, now seen corresponding path program 1 times [2022-02-09 01:00:11,842 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:00:11,842 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400270856] [2022-02-09 01:00:11,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:00:11,842 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:00:11,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:00:12,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:00:12,065 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:00:12,065 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400270856] [2022-02-09 01:00:12,065 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400270856] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:00:12,065 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:00:12,066 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-09 01:00:12,066 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072178638] [2022-02-09 01:00:12,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:00:12,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-09 01:00:12,067 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:00:12,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-09 01:00:12,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-02-09 01:00:12,068 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-02-09 01:00:12,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:00:12,352 INFO L93 Difference]: Finished difference Result 8818 states and 30445 transitions. [2022-02-09 01:00:12,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-09 01:00:12,353 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-02-09 01:00:12,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:00:12,387 INFO L225 Difference]: With dead ends: 8818 [2022-02-09 01:00:12,388 INFO L226 Difference]: Without dead ends: 8728 [2022-02-09 01:00:12,390 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-02-09 01:00:12,393 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-02-09 01:00:12,394 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-02-09 01:00:12,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8728 states. [2022-02-09 01:00:12,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8728 to 6938. [2022-02-09 01:00:12,583 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-02-09 01:00:12,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6938 states to 6938 states and 24405 transitions. [2022-02-09 01:00:12,604 INFO L78 Accepts]: Start accepts. Automaton has 6938 states and 24405 transitions. Word has length 111 [2022-02-09 01:00:12,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:00:12,605 INFO L470 AbstractCegarLoop]: Abstraction has 6938 states and 24405 transitions. [2022-02-09 01:00:12,605 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-02-09 01:00:12,605 INFO L276 IsEmpty]: Start isEmpty. Operand 6938 states and 24405 transitions. [2022-02-09 01:00:12,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-02-09 01:00:12,623 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:00:12,623 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-02-09 01:00:12,624 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-09 01:00:12,624 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-09 01:00:12,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:00:12,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1189826400, now seen corresponding path program 1 times [2022-02-09 01:00:12,624 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:00:12,624 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329179448] [2022-02-09 01:00:12,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:00:12,625 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:00:12,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:00:12,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:00:12,833 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:00:12,833 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329179448] [2022-02-09 01:00:12,833 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329179448] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:00:12,833 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:00:12,833 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-09 01:00:12,833 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369062166] [2022-02-09 01:00:12,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:00:12,834 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-09 01:00:12,834 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:00:12,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-09 01:00:12,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-02-09 01:00:12,834 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-02-09 01:00:13,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:00:13,253 INFO L93 Difference]: Finished difference Result 7558 states and 25776 transitions. [2022-02-09 01:00:13,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-09 01:00:13,254 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-02-09 01:00:13,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:00:13,276 INFO L225 Difference]: With dead ends: 7558 [2022-02-09 01:00:13,278 INFO L226 Difference]: Without dead ends: 7294 [2022-02-09 01:00:13,279 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-02-09 01:00:13,283 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-02-09 01:00:13,284 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-02-09 01:00:13,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7294 states. [2022-02-09 01:00:13,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7294 to 6848. [2022-02-09 01:00:13,411 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-02-09 01:00:13,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6848 states to 6848 states and 23731 transitions. [2022-02-09 01:00:13,431 INFO L78 Accepts]: Start accepts. Automaton has 6848 states and 23731 transitions. Word has length 111 [2022-02-09 01:00:13,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:00:13,431 INFO L470 AbstractCegarLoop]: Abstraction has 6848 states and 23731 transitions. [2022-02-09 01:00:13,432 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-02-09 01:00:13,432 INFO L276 IsEmpty]: Start isEmpty. Operand 6848 states and 23731 transitions. [2022-02-09 01:00:13,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-02-09 01:00:13,449 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:00:13,449 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-02-09 01:00:13,450 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-09 01:00:13,450 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-09 01:00:13,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:00:13,450 INFO L85 PathProgramCache]: Analyzing trace with hash -805575258, now seen corresponding path program 1 times [2022-02-09 01:00:13,450 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:00:13,450 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246125123] [2022-02-09 01:00:13,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:00:13,450 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:00:13,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:00:13,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:00:13,543 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:00:13,543 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246125123] [2022-02-09 01:00:13,543 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246125123] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:00:13,543 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:00:13,543 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-09 01:00:13,543 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702467186] [2022-02-09 01:00:13,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:00:13,544 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-09 01:00:13,544 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:00:13,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-09 01:00:13,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-09 01:00:13,544 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-02-09 01:00:13,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:00:13,637 INFO L93 Difference]: Finished difference Result 5971 states and 20798 transitions. [2022-02-09 01:00:13,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-09 01:00:13,638 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-02-09 01:00:13,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:00:13,655 INFO L225 Difference]: With dead ends: 5971 [2022-02-09 01:00:13,655 INFO L226 Difference]: Without dead ends: 5684 [2022-02-09 01:00:13,655 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-02-09 01:00:13,656 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-02-09 01:00:13,656 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-02-09 01:00:13,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5684 states. [2022-02-09 01:00:13,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5684 to 5679. [2022-02-09 01:00:13,756 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-02-09 01:00:13,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5679 states to 5679 states and 20051 transitions. [2022-02-09 01:00:13,772 INFO L78 Accepts]: Start accepts. Automaton has 5679 states and 20051 transitions. Word has length 111 [2022-02-09 01:00:13,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:00:13,772 INFO L470 AbstractCegarLoop]: Abstraction has 5679 states and 20051 transitions. [2022-02-09 01:00:13,773 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-02-09 01:00:13,773 INFO L276 IsEmpty]: Start isEmpty. Operand 5679 states and 20051 transitions. [2022-02-09 01:00:13,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-02-09 01:00:13,784 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:00:13,784 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-02-09 01:00:13,784 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-09 01:00:13,785 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-09 01:00:13,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:00:13,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1704257340, now seen corresponding path program 1 times [2022-02-09 01:00:13,785 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:00:13,785 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044753777] [2022-02-09 01:00:13,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:00:13,785 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:00:13,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:00:13,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-09 01:00:13,866 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:00:13,866 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044753777] [2022-02-09 01:00:13,866 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044753777] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 01:00:13,866 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766658600] [2022-02-09 01:00:13,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:00:13,866 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 01:00:13,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 01:00:13,868 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-09 01:00:13,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-09 01:00:13,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:00:13,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-09 01:00:13,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 01:00:14,220 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-09 01:00:14,220 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 01:00:14,456 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-09 01:00:14,457 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [766658600] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-09 01:00:14,457 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-02-09 01:00:14,457 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-02-09 01:00:14,457 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365954170] [2022-02-09 01:00:14,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:00:14,457 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-09 01:00:14,458 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:00:14,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-09 01:00:14,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-02-09 01:00:14,458 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-02-09 01:00:14,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:00:14,544 INFO L93 Difference]: Finished difference Result 5775 states and 20516 transitions. [2022-02-09 01:00:14,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-09 01:00:14,545 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-02-09 01:00:14,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:00:14,563 INFO L225 Difference]: With dead ends: 5775 [2022-02-09 01:00:14,563 INFO L226 Difference]: Without dead ends: 5775 [2022-02-09 01:00:14,563 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-02-09 01:00:14,564 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-02-09 01:00:14,564 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-02-09 01:00:14,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5775 states. [2022-02-09 01:00:14,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5775 to 5535. [2022-02-09 01:00:14,682 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-02-09 01:00:14,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5535 states to 5535 states and 19652 transitions. [2022-02-09 01:00:14,701 INFO L78 Accepts]: Start accepts. Automaton has 5535 states and 19652 transitions. Word has length 118 [2022-02-09 01:00:14,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:00:14,701 INFO L470 AbstractCegarLoop]: Abstraction has 5535 states and 19652 transitions. [2022-02-09 01:00:14,701 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-02-09 01:00:14,701 INFO L276 IsEmpty]: Start isEmpty. Operand 5535 states and 19652 transitions. [2022-02-09 01:00:14,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-02-09 01:00:14,713 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:00:14,714 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-02-09 01:00:14,733 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-02-09 01:00:14,932 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-02-09 01:00:14,933 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-09 01:00:14,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:00:14,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1314971180, now seen corresponding path program 1 times [2022-02-09 01:00:14,933 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:00:14,933 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578439653] [2022-02-09 01:00:14,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:00:14,934 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:00:14,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:00:15,015 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-09 01:00:15,015 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:00:15,015 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578439653] [2022-02-09 01:00:15,015 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578439653] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 01:00:15,015 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175084662] [2022-02-09 01:00:15,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:00:15,016 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 01:00:15,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 01:00:15,017 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-09 01:00:15,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-09 01:00:15,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:00:15,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-09 01:00:15,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 01:00:15,313 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-09 01:00:15,313 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 01:00:15,648 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-09 01:00:15,648 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175084662] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-09 01:00:15,648 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-02-09 01:00:15,648 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 18 [2022-02-09 01:00:15,648 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778101988] [2022-02-09 01:00:15,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:00:15,649 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-09 01:00:15,649 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:00:15,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-09 01:00:15,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2022-02-09 01:00:15,649 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-02-09 01:00:15,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:00:15,850 INFO L93 Difference]: Finished difference Result 7577 states and 27120 transitions. [2022-02-09 01:00:15,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-09 01:00:15,850 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-02-09 01:00:15,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:00:15,876 INFO L225 Difference]: With dead ends: 7577 [2022-02-09 01:00:15,876 INFO L226 Difference]: Without dead ends: 7577 [2022-02-09 01:00:15,876 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 226 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=137, Invalid=463, Unknown=0, NotChecked=0, Total=600 [2022-02-09 01:00:15,877 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-02-09 01:00:15,877 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-02-09 01:00:15,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7577 states. [2022-02-09 01:00:15,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7577 to 5864. [2022-02-09 01:00:15,998 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-02-09 01:00:16,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5864 states to 5864 states and 20823 transitions. [2022-02-09 01:00:16,014 INFO L78 Accepts]: Start accepts. Automaton has 5864 states and 20823 transitions. Word has length 118 [2022-02-09 01:00:16,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:00:16,014 INFO L470 AbstractCegarLoop]: Abstraction has 5864 states and 20823 transitions. [2022-02-09 01:00:16,014 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-02-09 01:00:16,015 INFO L276 IsEmpty]: Start isEmpty. Operand 5864 states and 20823 transitions. [2022-02-09 01:00:16,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-02-09 01:00:16,026 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:00:16,026 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-02-09 01:00:16,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-09 01:00:16,243 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-02-09 01:00:16,244 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-09 01:00:16,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:00:16,244 INFO L85 PathProgramCache]: Analyzing trace with hash 267659860, now seen corresponding path program 2 times [2022-02-09 01:00:16,244 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:00:16,244 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346706589] [2022-02-09 01:00:16,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:00:16,244 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:00:16,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:00:16,325 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-09 01:00:16,325 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:00:16,326 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346706589] [2022-02-09 01:00:16,326 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346706589] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 01:00:16,326 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848893796] [2022-02-09 01:00:16,326 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-09 01:00:16,326 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 01:00:16,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 01:00:16,327 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-09 01:00:16,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-09 01:00:16,424 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-09 01:00:16,424 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-09 01:00:16,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-09 01:00:16,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 01:00:16,634 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-09 01:00:16,634 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 01:00:16,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-09 01:00:16,816 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [848893796] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 01:00:16,816 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 01:00:16,816 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 17 [2022-02-09 01:00:16,816 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58993619] [2022-02-09 01:00:16,816 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 01:00:16,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-02-09 01:00:16,817 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:00:16,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-02-09 01:00:16,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2022-02-09 01:00:16,817 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-02-09 01:00:17,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:00:17,811 INFO L93 Difference]: Finished difference Result 26682 states and 97534 transitions. [2022-02-09 01:00:17,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-02-09 01:00:17,811 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-02-09 01:00:17,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:00:17,909 INFO L225 Difference]: With dead ends: 26682 [2022-02-09 01:00:17,909 INFO L226 Difference]: Without dead ends: 26682 [2022-02-09 01:00:17,910 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-02-09 01:00:17,910 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-02-09 01:00:17,910 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-02-09 01:00:17,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26682 states. [2022-02-09 01:00:18,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26682 to 5911. [2022-02-09 01:00:18,236 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-02-09 01:00:18,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5911 states to 5911 states and 21091 transitions. [2022-02-09 01:00:18,252 INFO L78 Accepts]: Start accepts. Automaton has 5911 states and 21091 transitions. Word has length 118 [2022-02-09 01:00:18,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:00:18,253 INFO L470 AbstractCegarLoop]: Abstraction has 5911 states and 21091 transitions. [2022-02-09 01:00:18,253 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-02-09 01:00:18,253 INFO L276 IsEmpty]: Start isEmpty. Operand 5911 states and 21091 transitions. [2022-02-09 01:00:18,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-02-09 01:00:18,265 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:00:18,265 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-02-09 01:00:18,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-09 01:00:18,479 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-02-09 01:00:18,479 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-09 01:00:18,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:00:18,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1570091000, now seen corresponding path program 3 times [2022-02-09 01:00:18,480 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:00:18,480 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446380779] [2022-02-09 01:00:18,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:00:18,480 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:00:18,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:00:18,559 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-09 01:00:18,559 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:00:18,559 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446380779] [2022-02-09 01:00:18,560 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446380779] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 01:00:18,560 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77514877] [2022-02-09 01:00:18,560 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-09 01:00:18,560 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 01:00:18,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 01:00:18,561 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-09 01:00:18,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-09 01:00:18,643 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-02-09 01:00:18,644 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-09 01:00:18,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-09 01:00:18,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 01:00:18,840 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-09 01:00:18,840 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 01:00:18,999 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-09 01:00:19,000 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [77514877] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 01:00:19,000 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 01:00:19,000 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 16 [2022-02-09 01:00:19,000 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214840968] [2022-02-09 01:00:19,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 01:00:19,000 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-09 01:00:19,001 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:00:19,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-09 01:00:19,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-02-09 01:00:19,001 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-02-09 01:00:19,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:00:19,760 INFO L93 Difference]: Finished difference Result 18477 states and 67462 transitions. [2022-02-09 01:00:19,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-02-09 01:00:19,761 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-02-09 01:00:19,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:00:19,823 INFO L225 Difference]: With dead ends: 18477 [2022-02-09 01:00:19,824 INFO L226 Difference]: Without dead ends: 18477 [2022-02-09 01:00:19,824 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 229 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=362, Invalid=970, Unknown=0, NotChecked=0, Total=1332 [2022-02-09 01:00:19,824 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-02-09 01:00:19,825 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-02-09 01:00:19,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18477 states. [2022-02-09 01:00:20,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18477 to 6055. [2022-02-09 01:00:20,032 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-02-09 01:00:20,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6055 states to 6055 states and 21572 transitions. [2022-02-09 01:00:20,053 INFO L78 Accepts]: Start accepts. Automaton has 6055 states and 21572 transitions. Word has length 118 [2022-02-09 01:00:20,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:00:20,054 INFO L470 AbstractCegarLoop]: Abstraction has 6055 states and 21572 transitions. [2022-02-09 01:00:20,054 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-02-09 01:00:20,054 INFO L276 IsEmpty]: Start isEmpty. Operand 6055 states and 21572 transitions. [2022-02-09 01:00:20,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-02-09 01:00:20,067 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:00:20,067 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-02-09 01:00:20,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-02-09 01:00:20,282 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-02-09 01:00:20,282 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-09 01:00:20,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:00:20,283 INFO L85 PathProgramCache]: Analyzing trace with hash -2139413420, now seen corresponding path program 4 times [2022-02-09 01:00:20,283 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:00:20,283 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631516292] [2022-02-09 01:00:20,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:00:20,283 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:00:20,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:00:20,357 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-09 01:00:20,357 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:00:20,357 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631516292] [2022-02-09 01:00:20,357 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631516292] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 01:00:20,357 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680421421] [2022-02-09 01:00:20,357 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-09 01:00:20,357 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 01:00:20,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 01:00:20,359 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-09 01:00:20,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-09 01:00:20,435 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-09 01:00:20,435 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-09 01:00:20,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-09 01:00:20,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 01:00:20,655 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-09 01:00:20,656 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 01:00:20,901 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-09 01:00:20,901 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1680421421] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-09 01:00:20,901 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-02-09 01:00:20,901 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 20 [2022-02-09 01:00:20,901 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499178925] [2022-02-09 01:00:20,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:00:20,902 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-09 01:00:20,902 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:00:20,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-09 01:00:20,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2022-02-09 01:00:20,902 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-02-09 01:00:21,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:00:21,144 INFO L93 Difference]: Finished difference Result 12871 states and 46133 transitions. [2022-02-09 01:00:21,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-09 01:00:21,145 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-02-09 01:00:21,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:00:21,182 INFO L225 Difference]: With dead ends: 12871 [2022-02-09 01:00:21,183 INFO L226 Difference]: Without dead ends: 12871 [2022-02-09 01:00:21,183 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-02-09 01:00:21,184 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-02-09 01:00:21,184 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-02-09 01:00:21,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12871 states. [2022-02-09 01:00:21,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12871 to 6215. [2022-02-09 01:00:21,417 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-02-09 01:00:21,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6215 states to 6215 states and 22325 transitions. [2022-02-09 01:00:21,437 INFO L78 Accepts]: Start accepts. Automaton has 6215 states and 22325 transitions. Word has length 118 [2022-02-09 01:00:21,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:00:21,438 INFO L470 AbstractCegarLoop]: Abstraction has 6215 states and 22325 transitions. [2022-02-09 01:00:21,438 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-02-09 01:00:21,438 INFO L276 IsEmpty]: Start isEmpty. Operand 6215 states and 22325 transitions. [2022-02-09 01:00:21,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-02-09 01:00:21,451 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:00:21,451 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-02-09 01:00:21,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-09 01:00:21,668 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-02-09 01:00:21,668 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-09 01:00:21,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:00:21,669 INFO L85 PathProgramCache]: Analyzing trace with hash -836982280, now seen corresponding path program 5 times [2022-02-09 01:00:21,669 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:00:21,669 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297808107] [2022-02-09 01:00:21,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:00:21,669 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:00:21,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:00:21,755 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-09 01:00:21,755 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:00:21,755 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297808107] [2022-02-09 01:00:21,755 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297808107] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 01:00:21,755 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006009612] [2022-02-09 01:00:21,755 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-09 01:00:21,756 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 01:00:21,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 01:00:21,757 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-09 01:00:21,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-09 01:00:21,842 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-09 01:00:21,843 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-09 01:00:21,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-09 01:00:21,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 01:00:22,059 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-09 01:00:22,059 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 01:00:22,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-09 01:00:22,247 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1006009612] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 01:00:22,247 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 01:00:22,247 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 16 [2022-02-09 01:00:22,249 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374405080] [2022-02-09 01:00:22,249 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 01:00:22,250 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-09 01:00:22,250 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:00:22,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-09 01:00:22,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2022-02-09 01:00:22,251 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-02-09 01:00:23,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:00:23,176 INFO L93 Difference]: Finished difference Result 22956 states and 82999 transitions. [2022-02-09 01:00:23,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-02-09 01:00:23,176 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-02-09 01:00:23,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:00:23,245 INFO L225 Difference]: With dead ends: 22956 [2022-02-09 01:00:23,245 INFO L226 Difference]: Without dead ends: 22956 [2022-02-09 01:00:23,245 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-02-09 01:00:23,246 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-02-09 01:00:23,246 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-02-09 01:00:23,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22956 states. [2022-02-09 01:00:23,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22956 to 6168. [2022-02-09 01:00:23,512 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-02-09 01:00:23,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6168 states to 6168 states and 22057 transitions. [2022-02-09 01:00:23,530 INFO L78 Accepts]: Start accepts. Automaton has 6168 states and 22057 transitions. Word has length 118 [2022-02-09 01:00:23,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:00:23,530 INFO L470 AbstractCegarLoop]: Abstraction has 6168 states and 22057 transitions. [2022-02-09 01:00:23,531 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-02-09 01:00:23,531 INFO L276 IsEmpty]: Start isEmpty. Operand 6168 states and 22057 transitions. [2022-02-09 01:00:23,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-02-09 01:00:23,542 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:00:23,542 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-02-09 01:00:23,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-02-09 01:00:23,760 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-02-09 01:00:23,761 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-09 01:00:23,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:00:23,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1449163496, now seen corresponding path program 6 times [2022-02-09 01:00:23,761 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:00:23,761 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838041816] [2022-02-09 01:00:23,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:00:23,762 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:00:23,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:00:23,849 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-09 01:00:23,849 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:00:23,850 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838041816] [2022-02-09 01:00:23,850 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838041816] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 01:00:23,850 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838262936] [2022-02-09 01:00:23,850 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-09 01:00:23,850 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 01:00:23,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 01:00:23,852 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-09 01:00:23,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-02-09 01:00:23,938 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-02-09 01:00:23,939 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-09 01:00:23,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-09 01:00:23,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 01:00:24,126 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-09 01:00:24,127 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 01:00:24,263 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-09 01:00:24,263 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838262936] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 01:00:24,263 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 01:00:24,263 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 15 [2022-02-09 01:00:24,263 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740197355] [2022-02-09 01:00:24,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 01:00:24,264 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-09 01:00:24,264 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:00:24,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-09 01:00:24,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-02-09 01:00:24,265 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-02-09 01:00:24,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:00:24,814 INFO L93 Difference]: Finished difference Result 14859 states and 53179 transitions. [2022-02-09 01:00:24,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-02-09 01:00:24,815 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-02-09 01:00:24,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:00:24,854 INFO L225 Difference]: With dead ends: 14859 [2022-02-09 01:00:24,854 INFO L226 Difference]: Without dead ends: 14859 [2022-02-09 01:00:24,855 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-02-09 01:00:24,855 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-02-09 01:00:24,855 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-02-09 01:00:24,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14859 states. [2022-02-09 01:00:25,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14859 to 6510. [2022-02-09 01:00:25,008 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-02-09 01:00:25,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6510 states to 6510 states and 23066 transitions. [2022-02-09 01:00:25,096 INFO L78 Accepts]: Start accepts. Automaton has 6510 states and 23066 transitions. Word has length 118 [2022-02-09 01:00:25,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:00:25,096 INFO L470 AbstractCegarLoop]: Abstraction has 6510 states and 23066 transitions. [2022-02-09 01:00:25,096 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-02-09 01:00:25,096 INFO L276 IsEmpty]: Start isEmpty. Operand 6510 states and 23066 transitions. [2022-02-09 01:00:25,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-09 01:00:25,108 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:00:25,108 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-02-09 01:00:25,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-02-09 01:00:25,309 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-02-09 01:00:25,309 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-09 01:00:25,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:00:25,310 INFO L85 PathProgramCache]: Analyzing trace with hash 372116376, now seen corresponding path program 1 times [2022-02-09 01:00:25,310 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:00:25,310 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898970802] [2022-02-09 01:00:25,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:00:25,310 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:00:25,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:00:25,714 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-09 01:00:25,714 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:00:25,714 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898970802] [2022-02-09 01:00:25,715 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898970802] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 01:00:25,715 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860645631] [2022-02-09 01:00:25,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:00:25,715 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 01:00:25,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 01:00:25,716 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-09 01:00:25,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-02-09 01:00:25,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:00:25,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 71 conjunts are in the unsatisfiable core [2022-02-09 01:00:25,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 01:00:25,894 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-09 01:00:25,936 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-09 01:00:25,936 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-02-09 01:00:26,305 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-09 01:00:26,305 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-02-09 01:00:26,466 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-02-09 01:00:26,772 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-09 01:00:27,029 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-02-09 01:00:27,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 01:00:27,092 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-02-09 01:00:27,178 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-02-09 01:00:27,237 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:00:27,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 01:00:27,361 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-02-09 01:00:27,401 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-02-09 01:00:27,462 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-02-09 01:00:27,473 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-02-09 01:00:27,492 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-02-09 01:00:27,504 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-02-09 01:00:27,546 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-02-09 01:00:27,555 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-02-09 01:00:27,561 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-02-09 01:00:27,594 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:00:27,594 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-02-09 01:00:27,599 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-02-09 01:00:27,605 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-02-09 01:00:27,612 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-02-09 01:00:27,616 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-02-09 01:00:30,060 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-09 01:00:30,062 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-02-09 01:00:30,085 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-02-09 01:00:30,086 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860645631] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 01:00:30,086 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 01:00:30,086 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24, 22] total 54 [2022-02-09 01:00:30,086 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767303822] [2022-02-09 01:00:30,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 01:00:30,087 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-02-09 01:00:30,087 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:00:30,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-02-09 01:00:30,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=1797, Unknown=9, NotChecked=846, Total=2862 [2022-02-09 01:00:30,089 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-02-09 01:00:32,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:00:32,690 INFO L93 Difference]: Finished difference Result 18736 states and 66973 transitions. [2022-02-09 01:00:32,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-02-09 01:00:32,691 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-02-09 01:00:32,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:00:32,740 INFO L225 Difference]: With dead ends: 18736 [2022-02-09 01:00:32,740 INFO L226 Difference]: Without dead ends: 18586 [2022-02-09 01:00:32,742 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 217 SyntacticMatches, 11 SemanticMatches, 81 ConstructedPredicates, 9 IntricatePredicates, 3 DeprecatedPredicates, 1559 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=668, Invalid=4761, Unknown=9, NotChecked=1368, Total=6806 [2022-02-09 01:00:32,742 INFO L933 BasicCegarLoop]: 267 mSDtfsCounter, 1626 mSDsluCounter, 5401 mSDsCounter, 0 mSdLazyCounter, 2090 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1626 SdHoareTripleChecker+Valid, 5230 SdHoareTripleChecker+Invalid, 6137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 2090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4004 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-09 01:00:32,742 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1626 Valid, 5230 Invalid, 6137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 2090 Invalid, 0 Unknown, 4004 Unchecked, 0.9s Time] [2022-02-09 01:00:32,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18586 states. [2022-02-09 01:00:32,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18586 to 9408. [2022-02-09 01:00:32,970 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-02-09 01:00:32,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9408 states to 9408 states and 33629 transitions. [2022-02-09 01:00:32,994 INFO L78 Accepts]: Start accepts. Automaton has 9408 states and 33629 transitions. Word has length 124 [2022-02-09 01:00:32,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:00:32,995 INFO L470 AbstractCegarLoop]: Abstraction has 9408 states and 33629 transitions. [2022-02-09 01:00:32,995 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-02-09 01:00:32,995 INFO L276 IsEmpty]: Start isEmpty. Operand 9408 states and 33629 transitions. [2022-02-09 01:00:33,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-09 01:00:33,012 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:00:33,012 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-02-09 01:00:33,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-02-09 01:00:33,215 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-02-09 01:00:33,215 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-09 01:00:33,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:00:33,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1263604010, now seen corresponding path program 1 times [2022-02-09 01:00:33,217 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:00:33,217 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490925381] [2022-02-09 01:00:33,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:00:33,217 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:00:33,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:00:34,007 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:00:34,008 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:00:34,008 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490925381] [2022-02-09 01:00:34,008 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490925381] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 01:00:34,008 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86861984] [2022-02-09 01:00:34,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:00:34,008 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 01:00:34,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 01:00:34,009 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-09 01:00:34,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-02-09 01:00:34,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:00:34,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 85 conjunts are in the unsatisfiable core [2022-02-09 01:00:34,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 01:00:34,167 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-09 01:00:34,212 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-09 01:00:34,213 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-02-09 01:00:34,661 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-09 01:00:34,661 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-02-09 01:00:34,871 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-02-09 01:00:35,590 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-09 01:00:36,025 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-02-09 01:00:36,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 01:00:36,152 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-02-09 01:00:36,339 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-09 01:00:36,341 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:00:36,341 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-02-09 01:00:36,403 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:00:36,403 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 01:00:38,283 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:00:38,283 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-02-09 01:00:38,292 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:00:38,292 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-02-09 01:00:38,310 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-02-09 01:00:38,369 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-02-09 01:00:38,384 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:00:38,385 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-02-09 01:00:40,398 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-09 01:00:40,399 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-02-09 01:00:40,420 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:00:40,420 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86861984] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 01:00:40,420 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 01:00:40,420 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33, 32] total 83 [2022-02-09 01:00:40,420 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655415949] [2022-02-09 01:00:40,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 01:00:40,421 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2022-02-09 01:00:40,421 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:00:40,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2022-02-09 01:00:40,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=515, Invalid=6217, Unknown=74, NotChecked=0, Total=6806 [2022-02-09 01:00:40,422 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-02-09 01:00:47,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:00:47,409 INFO L93 Difference]: Finished difference Result 36669 states and 132152 transitions. [2022-02-09 01:00:47,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-02-09 01:00:47,409 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-02-09 01:00:47,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:00:47,521 INFO L225 Difference]: With dead ends: 36669 [2022-02-09 01:00:47,521 INFO L226 Difference]: Without dead ends: 36369 [2022-02-09 01:00:47,525 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5892 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=2233, Invalid=17715, Unknown=74, NotChecked=0, Total=20022 [2022-02-09 01:00:47,526 INFO L933 BasicCegarLoop]: 260 mSDtfsCounter, 3268 mSDsluCounter, 10626 mSDsCounter, 0 mSdLazyCounter, 4953 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3268 SdHoareTripleChecker+Valid, 9915 SdHoareTripleChecker+Invalid, 8507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 4953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3452 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-02-09 01:00:47,526 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3268 Valid, 9915 Invalid, 8507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 4953 Invalid, 0 Unknown, 3452 Unchecked, 2.1s Time] [2022-02-09 01:00:47,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36369 states. [2022-02-09 01:00:47,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36369 to 11810. [2022-02-09 01:00:47,958 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-02-09 01:00:47,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11810 states to 11810 states and 42359 transitions. [2022-02-09 01:00:47,988 INFO L78 Accepts]: Start accepts. Automaton has 11810 states and 42359 transitions. Word has length 124 [2022-02-09 01:00:47,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:00:47,989 INFO L470 AbstractCegarLoop]: Abstraction has 11810 states and 42359 transitions. [2022-02-09 01:00:47,989 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-02-09 01:00:47,989 INFO L276 IsEmpty]: Start isEmpty. Operand 11810 states and 42359 transitions. [2022-02-09 01:00:48,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-09 01:00:48,010 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:00:48,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-02-09 01:00:48,026 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-02-09 01:00:48,210 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-02-09 01:00:48,210 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-09 01:00:48,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:00:48,211 INFO L85 PathProgramCache]: Analyzing trace with hash 541534492, now seen corresponding path program 2 times [2022-02-09 01:00:48,211 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:00:48,211 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098815789] [2022-02-09 01:00:48,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:00:48,217 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:00:48,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:00:48,697 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:00:48,698 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:00:48,698 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098815789] [2022-02-09 01:00:48,698 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098815789] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 01:00:48,698 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [423122744] [2022-02-09 01:00:48,698 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-09 01:00:48,698 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 01:00:48,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 01:00:48,699 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-09 01:00:48,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-02-09 01:00:48,784 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-09 01:00:48,784 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-09 01:00:48,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 64 conjunts are in the unsatisfiable core [2022-02-09 01:00:48,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 01:00:49,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 01:00:49,515 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-02-09 01:00:49,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 01:00:49,599 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-02-09 01:00:49,698 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-02-09 01:00:49,784 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-09 01:00:49,784 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 01:00:49,918 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-02-09 01:00:49,934 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-02-09 01:00:49,950 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:00:49,951 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-02-09 01:00:49,953 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-02-09 01:00:49,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 38 treesize of output 36 [2022-02-09 01:00:50,485 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-09 01:00:50,485 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [423122744] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 01:00:50,485 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 01:00:50,485 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 21, 20] total 51 [2022-02-09 01:00:50,485 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75632147] [2022-02-09 01:00:50,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 01:00:50,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-02-09 01:00:50,486 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:00:50,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-02-09 01:00:50,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=2127, Unknown=2, NotChecked=190, Total=2550 [2022-02-09 01:00:50,487 INFO L87 Difference]: Start difference. First operand 11810 states and 42359 transitions. Second operand has 51 states, 51 states have (on average 5.666666666666667) internal successors, (289), 51 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:00:52,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:00:52,258 INFO L93 Difference]: Finished difference Result 18584 states and 66824 transitions. [2022-02-09 01:00:52,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-02-09 01:00:52,259 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 5.666666666666667) internal successors, (289), 51 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2022-02-09 01:00:52,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:00:52,308 INFO L225 Difference]: With dead ends: 18584 [2022-02-09 01:00:52,308 INFO L226 Difference]: Without dead ends: 18434 [2022-02-09 01:00:52,309 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 224 SyntacticMatches, 4 SemanticMatches, 69 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 1308 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=628, Invalid=4070, Unknown=2, NotChecked=270, Total=4970 [2022-02-09 01:00:52,310 INFO L933 BasicCegarLoop]: 210 mSDtfsCounter, 1208 mSDsluCounter, 3922 mSDsCounter, 0 mSdLazyCounter, 1389 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1208 SdHoareTripleChecker+Valid, 3874 SdHoareTripleChecker+Invalid, 2072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 663 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-09 01:00:52,310 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1208 Valid, 3874 Invalid, 2072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1389 Invalid, 0 Unknown, 663 Unchecked, 0.5s Time] [2022-02-09 01:00:52,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18434 states. [2022-02-09 01:00:52,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18434 to 12232. [2022-02-09 01:00:52,610 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-02-09 01:00:52,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12232 states to 12232 states and 43931 transitions. [2022-02-09 01:00:52,646 INFO L78 Accepts]: Start accepts. Automaton has 12232 states and 43931 transitions. Word has length 124 [2022-02-09 01:00:52,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:00:52,647 INFO L470 AbstractCegarLoop]: Abstraction has 12232 states and 43931 transitions. [2022-02-09 01:00:52,647 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 5.666666666666667) internal successors, (289), 51 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:00:52,647 INFO L276 IsEmpty]: Start isEmpty. Operand 12232 states and 43931 transitions. [2022-02-09 01:00:52,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-09 01:00:52,672 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:00:52,672 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-02-09 01:00:52,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-02-09 01:00:52,872 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-02-09 01:00:52,872 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-09 01:00:52,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:00:52,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1105715552, now seen corresponding path program 3 times [2022-02-09 01:00:52,873 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:00:52,873 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331026498] [2022-02-09 01:00:52,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:00:52,874 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:00:52,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:00:53,219 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-09 01:00:53,219 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:00:53,219 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331026498] [2022-02-09 01:00:53,219 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331026498] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 01:00:53,219 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187118831] [2022-02-09 01:00:53,220 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-09 01:00:53,220 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 01:00:53,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 01:00:53,221 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-09 01:00:53,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-02-09 01:00:53,307 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-02-09 01:00:53,308 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-09 01:00:53,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 64 conjunts are in the unsatisfiable core [2022-02-09 01:00:53,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 01:00:53,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 01:00:53,966 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-02-09 01:00:54,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 01:00:54,039 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-02-09 01:00:54,129 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-02-09 01:00:54,202 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-09 01:00:54,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 01:00:54,320 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-02-09 01:00:54,336 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-02-09 01:00:54,358 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:00:54,359 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-02-09 01:00:54,363 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-02-09 01:00:54,366 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-02-09 01:00:54,874 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-09 01:00:54,874 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187118831] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 01:00:54,874 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 01:00:54,875 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 20] total 46 [2022-02-09 01:00:54,875 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162174183] [2022-02-09 01:00:54,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 01:00:54,875 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-02-09 01:00:54,875 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:00:54,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-02-09 01:00:54,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=1701, Unknown=2, NotChecked=170, Total=2070 [2022-02-09 01:00:54,876 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-02-09 01:00:57,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:00:57,081 INFO L93 Difference]: Finished difference Result 37903 states and 136252 transitions. [2022-02-09 01:00:57,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-02-09 01:00:57,081 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-02-09 01:00:57,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:00:57,199 INFO L225 Difference]: With dead ends: 37903 [2022-02-09 01:00:57,200 INFO L226 Difference]: Without dead ends: 37603 [2022-02-09 01:00:57,202 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 222 SyntacticMatches, 6 SemanticMatches, 79 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1738 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=739, Invalid=5429, Unknown=2, NotChecked=310, Total=6480 [2022-02-09 01:00:57,203 INFO L933 BasicCegarLoop]: 273 mSDtfsCounter, 1655 mSDsluCounter, 5704 mSDsCounter, 0 mSdLazyCounter, 2455 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1655 SdHoareTripleChecker+Valid, 5528 SdHoareTripleChecker+Invalid, 3524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 2455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 996 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-09 01:00:57,205 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1655 Valid, 5528 Invalid, 3524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 2455 Invalid, 0 Unknown, 996 Unchecked, 0.9s Time] [2022-02-09 01:00:57,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37603 states. [2022-02-09 01:00:57,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37603 to 12580. [2022-02-09 01:00:57,595 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-02-09 01:00:57,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12580 states to 12580 states and 45309 transitions. [2022-02-09 01:00:57,629 INFO L78 Accepts]: Start accepts. Automaton has 12580 states and 45309 transitions. Word has length 124 [2022-02-09 01:00:57,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:00:57,629 INFO L470 AbstractCegarLoop]: Abstraction has 12580 states and 45309 transitions. [2022-02-09 01:00:57,630 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-02-09 01:00:57,630 INFO L276 IsEmpty]: Start isEmpty. Operand 12580 states and 45309 transitions. [2022-02-09 01:00:57,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-09 01:00:57,655 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:00:57,655 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-02-09 01:00:57,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-02-09 01:00:57,871 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-02-09 01:00:57,872 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-09 01:00:57,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:00:57,872 INFO L85 PathProgramCache]: Analyzing trace with hash 879013074, now seen corresponding path program 4 times [2022-02-09 01:00:57,872 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:00:57,872 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086447392] [2022-02-09 01:00:57,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:00:57,873 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:00:57,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:00:58,310 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-09 01:00:58,310 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:00:58,310 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086447392] [2022-02-09 01:00:58,310 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086447392] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 01:00:58,310 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020997077] [2022-02-09 01:00:58,310 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-09 01:00:58,311 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 01:00:58,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 01:00:58,311 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-09 01:00:58,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-02-09 01:00:58,401 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-09 01:00:58,401 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-09 01:00:58,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 66 conjunts are in the unsatisfiable core [2022-02-09 01:00:58,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 01:00:58,832 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-02-09 01:00:59,067 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-09 01:00:59,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 01:00:59,212 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-02-09 01:00:59,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 01:00:59,273 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-02-09 01:00:59,373 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-02-09 01:00:59,436 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:00:59,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 01:00:59,573 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-02-09 01:00:59,588 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-02-09 01:00:59,605 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-02-09 01:00:59,613 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-02-09 01:00:59,621 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-02-09 01:00:59,663 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-02-09 01:00:59,670 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-02-09 01:00:59,675 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-02-09 01:00:59,694 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:00:59,694 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-02-09 01:00:59,698 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-02-09 01:00:59,702 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-02-09 01:00:59,706 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-02-09 01:00:59,711 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-02-09 01:01:00,085 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-02-09 01:01:00,085 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2020997077] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 01:01:00,085 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 01:01:00,086 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24, 22] total 54 [2022-02-09 01:01:00,086 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112176959] [2022-02-09 01:01:00,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 01:01:00,086 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-02-09 01:01:00,086 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:01:00,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-02-09 01:01:00,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=1875, Unknown=8, NotChecked=760, Total=2862 [2022-02-09 01:01:00,088 INFO L87 Difference]: Start difference. First operand 12580 states and 45309 transitions. Second operand has 54 states, 54 states have (on average 5.37037037037037) internal successors, (290), 54 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-02-09 01:01:02,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:01:02,083 INFO L93 Difference]: Finished difference Result 30299 states and 108654 transitions. [2022-02-09 01:01:02,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-02-09 01:01:02,083 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 5.37037037037037) internal successors, (290), 54 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-02-09 01:01:02,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:01:02,173 INFO L225 Difference]: With dead ends: 30299 [2022-02-09 01:01:02,174 INFO L226 Difference]: Without dead ends: 30149 [2022-02-09 01:01:02,174 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 219 SyntacticMatches, 9 SemanticMatches, 78 ConstructedPredicates, 8 IntricatePredicates, 2 DeprecatedPredicates, 1525 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=535, Invalid=4601, Unknown=8, NotChecked=1176, Total=6320 [2022-02-09 01:01:02,175 INFO L933 BasicCegarLoop]: 256 mSDtfsCounter, 1336 mSDsluCounter, 5099 mSDsCounter, 0 mSdLazyCounter, 2204 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1336 SdHoareTripleChecker+Valid, 4966 SdHoareTripleChecker+Invalid, 6068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 2204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3833 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-09 01:01:02,175 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1336 Valid, 4966 Invalid, 6068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 2204 Invalid, 0 Unknown, 3833 Unchecked, 0.8s Time] [2022-02-09 01:01:02,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30149 states. [2022-02-09 01:01:02,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30149 to 12580. [2022-02-09 01:01:02,517 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-02-09 01:01:02,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12580 states to 12580 states and 45309 transitions. [2022-02-09 01:01:02,552 INFO L78 Accepts]: Start accepts. Automaton has 12580 states and 45309 transitions. Word has length 124 [2022-02-09 01:01:02,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:01:02,552 INFO L470 AbstractCegarLoop]: Abstraction has 12580 states and 45309 transitions. [2022-02-09 01:01:02,552 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 5.37037037037037) internal successors, (290), 54 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-02-09 01:01:02,552 INFO L276 IsEmpty]: Start isEmpty. Operand 12580 states and 45309 transitions. [2022-02-09 01:01:02,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-09 01:01:02,576 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:01:02,576 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-02-09 01:01:02,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-02-09 01:01:02,777 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-02-09 01:01:02,778 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-09 01:01:02,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:01:02,778 INFO L85 PathProgramCache]: Analyzing trace with hash -732266808, now seen corresponding path program 2 times [2022-02-09 01:01:02,778 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:01:02,778 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834376547] [2022-02-09 01:01:02,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:01:02,778 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:01:02,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:01:03,602 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:01:03,602 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:01:03,602 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834376547] [2022-02-09 01:01:03,602 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834376547] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 01:01:03,602 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620984190] [2022-02-09 01:01:03,602 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-09 01:01:03,602 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 01:01:03,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 01:01:03,604 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-09 01:01:03,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-02-09 01:01:03,692 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-09 01:01:03,692 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-09 01:01:03,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 67 conjunts are in the unsatisfiable core [2022-02-09 01:01:03,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 01:01:04,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 01:01:04,498 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-02-09 01:01:04,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 01:01:04,580 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-02-09 01:01:04,815 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:01:04,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 17 treesize of output 17 [2022-02-09 01:01:05,127 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-09 01:01:05,127 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 01:01:05,569 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-02-09 01:01:05,632 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-02-09 01:01:05,683 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:01:05,683 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-02-09 01:01:05,687 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-02-09 01:01:05,691 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-02-09 01:01:06,430 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-09 01:01:06,430 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620984190] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 01:01:06,430 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 01:01:06,430 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 27, 26] total 70 [2022-02-09 01:01:06,430 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245126679] [2022-02-09 01:01:06,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 01:01:06,431 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-02-09 01:01:06,431 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:01:06,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-02-09 01:01:06,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=513, Invalid=4049, Unknown=2, NotChecked=266, Total=4830 [2022-02-09 01:01:06,432 INFO L87 Difference]: Start difference. First operand 12580 states and 45309 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-02-09 01:01:45,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:01:45,227 INFO L93 Difference]: Finished difference Result 89801 states and 326321 transitions. [2022-02-09 01:01:45,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 473 states. [2022-02-09 01:01:45,228 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-02-09 01:01:45,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:01:45,619 INFO L225 Difference]: With dead ends: 89801 [2022-02-09 01:01:45,619 INFO L226 Difference]: Without dead ends: 89201 [2022-02-09 01:01:45,631 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 739 GetRequests, 210 SyntacticMatches, 8 SemanticMatches, 521 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 118518 ImplicationChecksByTransitivity, 29.5s TimeCoverageRelationStatistics Valid=21399, Invalid=249527, Unknown=2, NotChecked=2078, Total=273006 [2022-02-09 01:01:45,632 INFO L933 BasicCegarLoop]: 669 mSDtfsCounter, 4982 mSDsluCounter, 20796 mSDsCounter, 0 mSdLazyCounter, 18787 mSolverCounterSat, 467 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4982 SdHoareTripleChecker+Valid, 19364 SdHoareTripleChecker+Invalid, 24904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 467 IncrementalHoareTripleChecker+Valid, 18787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5650 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2022-02-09 01:01:45,632 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4982 Valid, 19364 Invalid, 24904 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [467 Valid, 18787 Invalid, 0 Unknown, 5650 Unchecked, 8.2s Time] [2022-02-09 01:01:45,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89201 states. [2022-02-09 01:01:46,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89201 to 12803. [2022-02-09 01:01:46,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12803 states, 12802 states have (on average 3.6176378690829556) internal successors, (46313), 12802 states have internal predecessors, (46313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:01:46,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12803 states to 12803 states and 46313 transitions. [2022-02-09 01:01:46,600 INFO L78 Accepts]: Start accepts. Automaton has 12803 states and 46313 transitions. Word has length 124 [2022-02-09 01:01:46,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:01:46,600 INFO L470 AbstractCegarLoop]: Abstraction has 12803 states and 46313 transitions. [2022-02-09 01:01:46,600 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-02-09 01:01:46,600 INFO L276 IsEmpty]: Start isEmpty. Operand 12803 states and 46313 transitions. [2022-02-09 01:01:46,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-09 01:01:46,623 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:01:46,623 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-02-09 01:01:46,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-02-09 01:01:46,824 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-02-09 01:01:46,824 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-09 01:01:46,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:01:46,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1913273718, now seen corresponding path program 3 times [2022-02-09 01:01:46,825 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:01:46,825 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470035351] [2022-02-09 01:01:46,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:01:46,825 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:01:46,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:01:47,511 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:01:47,511 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:01:47,512 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470035351] [2022-02-09 01:01:47,512 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470035351] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 01:01:47,512 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [687188160] [2022-02-09 01:01:47,512 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-09 01:01:47,512 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 01:01:47,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 01:01:47,513 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-09 01:01:47,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-02-09 01:01:47,604 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-02-09 01:01:47,604 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-09 01:01:47,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 67 conjunts are in the unsatisfiable core [2022-02-09 01:01:47,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 01:01:48,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 01:01:48,415 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-02-09 01:01:48,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 01:01:48,499 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-02-09 01:01:48,644 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:01:48,644 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-02-09 01:01:49,041 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-09 01:01:49,041 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 01:01:49,455 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-02-09 01:01:49,511 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-02-09 01:01:49,558 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:01:49,558 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-02-09 01:01:49,563 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-02-09 01:01:49,566 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-02-09 01:01:50,395 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-09 01:01:50,395 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [687188160] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 01:01:50,395 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 01:01:50,395 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 27, 26] total 70 [2022-02-09 01:01:50,396 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803206532] [2022-02-09 01:01:50,396 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 01:01:50,396 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-02-09 01:01:50,396 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:01:50,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-02-09 01:01:50,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=516, Invalid=4046, Unknown=2, NotChecked=266, Total=4830 [2022-02-09 01:01:50,397 INFO L87 Difference]: Start difference. First operand 12803 states and 46313 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-02-09 01:02:22,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:02:22,415 INFO L93 Difference]: Finished difference Result 72952 states and 266277 transitions. [2022-02-09 01:02:22,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 431 states. [2022-02-09 01:02:22,416 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-02-09 01:02:22,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:02:22,660 INFO L225 Difference]: With dead ends: 72952 [2022-02-09 01:02:22,661 INFO L226 Difference]: Without dead ends: 72652 [2022-02-09 01:02:22,669 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 730 GetRequests, 220 SyntacticMatches, 33 SemanticMatches, 477 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 101099 ImplicationChecksByTransitivity, 25.3s TimeCoverageRelationStatistics Valid=20521, Invalid=206537, Unknown=2, NotChecked=1902, Total=228962 [2022-02-09 01:02:22,669 INFO L933 BasicCegarLoop]: 563 mSDtfsCounter, 4524 mSDsluCounter, 17572 mSDsCounter, 0 mSdLazyCounter, 12271 mSolverCounterSat, 432 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4524 SdHoareTripleChecker+Valid, 16496 SdHoareTripleChecker+Invalid, 19162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 432 IncrementalHoareTripleChecker+Valid, 12271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6459 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-02-09 01:02:22,670 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4524 Valid, 16496 Invalid, 19162 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [432 Valid, 12271 Invalid, 0 Unknown, 6459 Unchecked, 5.5s Time] [2022-02-09 01:02:22,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72652 states. [2022-02-09 01:02:23,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72652 to 13141. [2022-02-09 01:02:23,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13141 states, 13140 states have (on average 3.6317351598173517) internal successors, (47721), 13140 states have internal predecessors, (47721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:02:23,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13141 states to 13141 states and 47721 transitions. [2022-02-09 01:02:23,669 INFO L78 Accepts]: Start accepts. Automaton has 13141 states and 47721 transitions. Word has length 124 [2022-02-09 01:02:23,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:02:23,670 INFO L470 AbstractCegarLoop]: Abstraction has 13141 states and 47721 transitions. [2022-02-09 01:02:23,670 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-02-09 01:02:23,670 INFO L276 IsEmpty]: Start isEmpty. Operand 13141 states and 47721 transitions. [2022-02-09 01:02:23,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-09 01:02:23,694 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:02:23,695 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-02-09 01:02:23,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-02-09 01:02:23,895 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-02-09 01:02:23,896 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-09 01:02:23,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:02:23,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1254294472, now seen corresponding path program 4 times [2022-02-09 01:02:23,897 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:02:23,897 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688951510] [2022-02-09 01:02:23,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:02:23,897 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:02:23,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:02:24,759 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:02:24,760 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:02:24,760 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688951510] [2022-02-09 01:02:24,760 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688951510] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 01:02:24,760 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444815640] [2022-02-09 01:02:24,760 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-09 01:02:24,760 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 01:02:24,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 01:02:24,761 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-09 01:02:24,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-02-09 01:02:24,852 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-09 01:02:24,852 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-09 01:02:24,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 78 conjunts are in the unsatisfiable core [2022-02-09 01:02:24,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 01:02:25,465 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-02-09 01:02:25,929 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-09 01:02:26,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 01:02:26,151 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-02-09 01:02:26,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 01:02:26,257 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-02-09 01:02:26,399 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:02:26,399 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-02-09 01:02:26,675 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:02:26,675 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 01:02:27,024 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-02-09 01:02:27,105 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-02-09 01:02:27,162 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-02-09 01:02:27,185 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-02-09 01:02:27,209 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-02-09 01:02:27,340 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-02-09 01:02:27,389 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-02-09 01:02:27,402 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-02-09 01:02:27,658 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:02:27,659 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-02-09 01:02:27,666 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:02:27,666 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-02-09 01:02:27,670 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-02-09 01:02:27,675 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-02-09 01:02:27,690 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:02:27,691 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-02-09 01:02:28,823 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-02-09 01:02:28,823 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444815640] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 01:02:28,823 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 01:02:28,823 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33, 33] total 85 [2022-02-09 01:02:28,824 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851584185] [2022-02-09 01:02:28,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 01:02:28,824 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2022-02-09 01:02:28,824 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:02:28,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2022-02-09 01:02:28,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=456, Invalid=5417, Unknown=11, NotChecked=1256, Total=7140 [2022-02-09 01:02:28,825 INFO L87 Difference]: Start difference. First operand 13141 states and 47721 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-02-09 01:02:39,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:02:39,128 INFO L93 Difference]: Finished difference Result 35886 states and 129652 transitions. [2022-02-09 01:02:39,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-02-09 01:02:39,128 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-02-09 01:02:39,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:02:39,234 INFO L225 Difference]: With dead ends: 35886 [2022-02-09 01:02:39,234 INFO L226 Difference]: Without dead ends: 35736 [2022-02-09 01:02:39,235 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 200 SyntacticMatches, 7 SemanticMatches, 146 ConstructedPredicates, 8 IntricatePredicates, 2 DeprecatedPredicates, 6265 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=1665, Invalid=17816, Unknown=11, NotChecked=2264, Total=21756 [2022-02-09 01:02:39,235 INFO L933 BasicCegarLoop]: 326 mSDtfsCounter, 2378 mSDsluCounter, 10050 mSDsCounter, 0 mSdLazyCounter, 4262 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2378 SdHoareTripleChecker+Valid, 9629 SdHoareTripleChecker+Invalid, 9589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 4262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5204 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-02-09 01:02:39,235 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2378 Valid, 9629 Invalid, 9589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 4262 Invalid, 0 Unknown, 5204 Unchecked, 1.7s Time] [2022-02-09 01:02:39,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35736 states. [2022-02-09 01:02:39,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35736 to 13355. [2022-02-09 01:02:39,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13355 states, 13354 states have (on average 3.635015725625281) internal successors, (48542), 13354 states have internal predecessors, (48542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:02:39,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13355 states to 13355 states and 48542 transitions. [2022-02-09 01:02:39,638 INFO L78 Accepts]: Start accepts. Automaton has 13355 states and 48542 transitions. Word has length 124 [2022-02-09 01:02:39,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:02:39,638 INFO L470 AbstractCegarLoop]: Abstraction has 13355 states and 48542 transitions. [2022-02-09 01:02:39,638 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-02-09 01:02:39,638 INFO L276 IsEmpty]: Start isEmpty. Operand 13355 states and 48542 transitions. [2022-02-09 01:02:39,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-09 01:02:39,665 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:02:39,665 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-02-09 01:02:39,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-02-09 01:02:39,866 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-02-09 01:02:39,866 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-09 01:02:39,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:02:39,866 INFO L85 PathProgramCache]: Analyzing trace with hash 2051171398, now seen corresponding path program 5 times [2022-02-09 01:02:39,866 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:02:39,867 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266995767] [2022-02-09 01:02:39,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:02:39,867 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:02:39,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:02:40,614 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:02:40,615 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:02:40,615 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266995767] [2022-02-09 01:02:40,615 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266995767] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 01:02:40,615 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567854503] [2022-02-09 01:02:40,615 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-09 01:02:40,615 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 01:02:40,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 01:02:40,616 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-09 01:02:40,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-02-09 01:02:40,707 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-02-09 01:02:40,707 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-09 01:02:40,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 83 conjunts are in the unsatisfiable core [2022-02-09 01:02:40,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 01:02:40,751 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-09 01:02:40,783 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-09 01:02:40,783 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-02-09 01:02:40,832 INFO L353 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-02-09 01:02:40,832 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-02-09 01:02:41,312 INFO L353 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-02-09 01:02:41,312 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-02-09 01:02:41,498 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-02-09 01:02:41,936 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-02-09 01:02:42,233 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-02-09 01:02:42,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 01:02:42,324 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-02-09 01:02:42,469 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:02:42,469 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-02-09 01:02:42,748 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:02:42,748 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 01:02:43,087 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-02-09 01:02:43,142 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-02-09 01:02:43,191 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-02-09 01:02:43,205 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-02-09 01:02:43,219 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-02-09 01:02:43,249 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-02-09 01:02:43,390 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-02-09 01:02:43,421 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-02-09 01:02:43,436 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-02-09 01:02:43,725 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:02:43,725 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-02-09 01:02:43,734 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:02:43,734 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-02-09 01:02:43,744 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-02-09 01:02:43,757 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-02-09 01:02:43,784 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:02:43,784 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-02-09 01:02:48,984 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-02-09 01:02:48,984 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1567854503] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 01:02:48,984 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 01:02:48,984 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33, 34] total 85 [2022-02-09 01:02:48,985 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435688136] [2022-02-09 01:02:48,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 01:02:48,985 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2022-02-09 01:02:48,985 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:02:48,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2022-02-09 01:02:48,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=425, Invalid=5300, Unknown=11, NotChecked=1404, Total=7140 [2022-02-09 01:02:48,986 INFO L87 Difference]: Start difference. First operand 13355 states and 48542 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-02-09 01:02:56,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:02:56,326 INFO L93 Difference]: Finished difference Result 23721 states and 85469 transitions. [2022-02-09 01:02:56,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-02-09 01:02:56,327 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-02-09 01:02:56,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:02:56,388 INFO L225 Difference]: With dead ends: 23721 [2022-02-09 01:02:56,389 INFO L226 Difference]: Without dead ends: 23571 [2022-02-09 01:02:56,389 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 198 SyntacticMatches, 9 SemanticMatches, 121 ConstructedPredicates, 9 IntricatePredicates, 1 DeprecatedPredicates, 3779 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=1212, Invalid=11695, Unknown=11, NotChecked=2088, Total=15006 [2022-02-09 01:02:56,390 INFO L933 BasicCegarLoop]: 259 mSDtfsCounter, 1355 mSDsluCounter, 8168 mSDsCounter, 0 mSdLazyCounter, 2830 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1355 SdHoareTripleChecker+Valid, 7894 SdHoareTripleChecker+Invalid, 7136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 2830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4250 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-09 01:02:56,390 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1355 Valid, 7894 Invalid, 7136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 2830 Invalid, 0 Unknown, 4250 Unchecked, 1.1s Time] [2022-02-09 01:02:56,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23571 states. [2022-02-09 01:02:56,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23571 to 13311. [2022-02-09 01:02:56,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13311 states, 13310 states have (on average 3.6322314049586777) internal successors, (48345), 13310 states have internal predecessors, (48345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:02:56,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13311 states to 13311 states and 48345 transitions. [2022-02-09 01:02:56,720 INFO L78 Accepts]: Start accepts. Automaton has 13311 states and 48345 transitions. Word has length 124 [2022-02-09 01:02:56,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:02:56,721 INFO L470 AbstractCegarLoop]: Abstraction has 13311 states and 48345 transitions. [2022-02-09 01:02:56,721 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-02-09 01:02:56,721 INFO L276 IsEmpty]: Start isEmpty. Operand 13311 states and 48345 transitions. [2022-02-09 01:02:56,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-09 01:02:56,748 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:02:56,748 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-02-09 01:02:56,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-02-09 01:02:56,951 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-02-09 01:02:56,951 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-09 01:02:56,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:02:56,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1783840602, now seen corresponding path program 6 times [2022-02-09 01:02:56,952 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:02:56,952 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920352508] [2022-02-09 01:02:56,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:02:56,952 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:02:56,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:02:57,700 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:02:57,700 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:02:57,700 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920352508] [2022-02-09 01:02:57,700 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920352508] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 01:02:57,700 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10571014] [2022-02-09 01:02:57,700 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-09 01:02:57,700 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 01:02:57,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 01:02:57,701 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-02-09 01:02:57,702 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-02-09 01:02:57,808 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-02-09 01:02:57,808 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-09 01:02:57,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 72 conjunts are in the unsatisfiable core [2022-02-09 01:02:57,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 01:02:57,861 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-09 01:02:58,054 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-09 01:02:58,055 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-02-09 01:02:58,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 01:02:58,529 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-02-09 01:02:58,608 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-02-09 01:02:58,741 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:02:58,741 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-02-09 01:02:59,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-02-09 01:02:59,096 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 01:02:59,530 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-02-09 01:02:59,650 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-02-09 01:02:59,694 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:02:59,695 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-02-09 01:02:59,697 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-02-09 01:02:59,700 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-02-09 01:03:00,782 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-02-09 01:03:00,842 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-09 01:03:00,842 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [10571014] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 01:03:00,842 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 01:03:00,842 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 27, 26] total 71 [2022-02-09 01:03:00,843 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160128779] [2022-02-09 01:03:00,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 01:03:00,843 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2022-02-09 01:03:00,843 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:03:00,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2022-02-09 01:03:00,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=411, Invalid=4287, Unknown=2, NotChecked=270, Total=4970 [2022-02-09 01:03:00,844 INFO L87 Difference]: Start difference. First operand 13311 states and 48345 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-02-09 01:03:18,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:03:18,233 INFO L93 Difference]: Finished difference Result 46956 states and 170767 transitions. [2022-02-09 01:03:18,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 196 states. [2022-02-09 01:03:18,234 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-02-09 01:03:18,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:03:18,366 INFO L225 Difference]: With dead ends: 46956 [2022-02-09 01:03:18,367 INFO L226 Difference]: Without dead ends: 46521 [2022-02-09 01:03:18,369 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 213 SyntacticMatches, 24 SemanticMatches, 249 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 22581 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=7433, Invalid=54325, Unknown=2, NotChecked=990, Total=62750 [2022-02-09 01:03:18,370 INFO L933 BasicCegarLoop]: 427 mSDtfsCounter, 2911 mSDsluCounter, 17291 mSDsCounter, 0 mSdLazyCounter, 6481 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2911 SdHoareTripleChecker+Valid, 16356 SdHoareTripleChecker+Invalid, 18788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 6481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 12174 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-02-09 01:03:18,370 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2911 Valid, 16356 Invalid, 18788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 6481 Invalid, 0 Unknown, 12174 Unchecked, 2.9s Time] [2022-02-09 01:03:18,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46521 states. [2022-02-09 01:03:18,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46521 to 13892. [2022-02-09 01:03:18,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13892 states, 13891 states have (on average 3.653876610755165) internal successors, (50756), 13891 states have internal predecessors, (50756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:03:18,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13892 states to 13892 states and 50756 transitions. [2022-02-09 01:03:18,874 INFO L78 Accepts]: Start accepts. Automaton has 13892 states and 50756 transitions. Word has length 124 [2022-02-09 01:03:18,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:03:18,874 INFO L470 AbstractCegarLoop]: Abstraction has 13892 states and 50756 transitions. [2022-02-09 01:03:18,874 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-02-09 01:03:18,875 INFO L276 IsEmpty]: Start isEmpty. Operand 13892 states and 50756 transitions. [2022-02-09 01:03:18,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-09 01:03:18,901 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:03:18,901 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-02-09 01:03:18,919 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-02-09 01:03:19,101 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-02-09 01:03:19,101 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-09 01:03:19,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:03:19,102 INFO L85 PathProgramCache]: Analyzing trace with hash -369162054, now seen corresponding path program 7 times [2022-02-09 01:03:19,102 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:03:19,102 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288293387] [2022-02-09 01:03:19,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:03:19,102 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:03:19,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:03:19,841 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:03:19,841 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:03:19,841 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288293387] [2022-02-09 01:03:19,841 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288293387] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 01:03:19,841 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685184385] [2022-02-09 01:03:19,842 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-02-09 01:03:19,842 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 01:03:19,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 01:03:19,843 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-02-09 01:03:19,844 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-02-09 01:03:19,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:03:19,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 77 conjunts are in the unsatisfiable core [2022-02-09 01:03:19,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 01:03:20,649 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-02-09 01:03:21,127 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-09 01:03:21,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 01:03:21,353 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-02-09 01:03:21,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 01:03:21,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-02-09 01:03:21,606 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:03:21,607 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-02-09 01:03:21,989 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:03:21,989 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 01:03:22,358 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-02-09 01:03:22,417 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-02-09 01:03:22,467 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-02-09 01:03:22,489 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-02-09 01:03:22,511 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-02-09 01:03:22,624 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-02-09 01:03:22,648 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-02-09 01:03:22,661 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-02-09 01:03:22,909 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:03:22,909 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-02-09 01:03:22,919 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:03:22,920 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-02-09 01:03:22,924 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-02-09 01:03:22,928 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-02-09 01:03:22,937 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:03:22,937 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-02-09 01:03:24,533 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-02-09 01:03:24,533 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685184385] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 01:03:24,533 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 01:03:24,533 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33, 33] total 84 [2022-02-09 01:03:24,534 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794146002] [2022-02-09 01:03:24,534 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 01:03:24,534 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2022-02-09 01:03:24,534 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:03:24,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2022-02-09 01:03:24,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=477, Invalid=5244, Unknown=11, NotChecked=1240, Total=6972 [2022-02-09 01:03:24,535 INFO L87 Difference]: Start difference. First operand 13892 states and 50756 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-02-09 01:03:30,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:03:30,329 INFO L93 Difference]: Finished difference Result 32580 states and 118215 transitions. [2022-02-09 01:03:30,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-02-09 01:03:30,330 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-02-09 01:03:30,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:03:30,432 INFO L225 Difference]: With dead ends: 32580 [2022-02-09 01:03:30,432 INFO L226 Difference]: Without dead ends: 32430 [2022-02-09 01:03:30,433 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 200 SyntacticMatches, 7 SemanticMatches, 136 ConstructedPredicates, 8 IntricatePredicates, 2 DeprecatedPredicates, 5352 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=1475, Invalid=15316, Unknown=11, NotChecked=2104, Total=18906 [2022-02-09 01:03:30,434 INFO L933 BasicCegarLoop]: 292 mSDtfsCounter, 1804 mSDsluCounter, 9411 mSDsCounter, 0 mSdLazyCounter, 4238 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1804 SdHoareTripleChecker+Valid, 9093 SdHoareTripleChecker+Invalid, 9249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 4238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4933 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-02-09 01:03:30,434 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1804 Valid, 9093 Invalid, 9249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 4238 Invalid, 0 Unknown, 4933 Unchecked, 1.7s Time] [2022-02-09 01:03:30,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32430 states. [2022-02-09 01:03:30,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32430 to 13886. [2022-02-09 01:03:30,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13886 states, 13885 states have (on average 3.6503420957868205) internal successors, (50685), 13885 states have internal predecessors, (50685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:03:30,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13886 states to 13886 states and 50685 transitions. [2022-02-09 01:03:30,876 INFO L78 Accepts]: Start accepts. Automaton has 13886 states and 50685 transitions. Word has length 124 [2022-02-09 01:03:30,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:03:30,876 INFO L470 AbstractCegarLoop]: Abstraction has 13886 states and 50685 transitions. [2022-02-09 01:03:30,876 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-02-09 01:03:30,876 INFO L276 IsEmpty]: Start isEmpty. Operand 13886 states and 50685 transitions. [2022-02-09 01:03:30,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-09 01:03:30,903 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:03:30,903 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-02-09 01:03:30,922 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-02-09 01:03:31,104 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-02-09 01:03:31,105 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-09 01:03:31,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:03:31,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1457504890, now seen corresponding path program 8 times [2022-02-09 01:03:31,105 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:03:31,105 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81563219] [2022-02-09 01:03:31,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:03:31,106 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:03:31,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:03:31,855 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:03:31,855 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:03:31,855 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81563219] [2022-02-09 01:03:31,855 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81563219] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 01:03:31,855 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573725656] [2022-02-09 01:03:31,855 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-09 01:03:31,855 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 01:03:31,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 01:03:31,856 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-02-09 01:03:31,859 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-02-09 01:03:31,951 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-09 01:03:31,951 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-09 01:03:31,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 73 conjunts are in the unsatisfiable core [2022-02-09 01:03:31,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 01:03:32,003 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-09 01:03:32,035 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-09 01:03:32,036 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-02-09 01:03:32,231 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-02-09 01:03:32,232 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-02-09 01:03:32,735 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-02-09 01:03:32,803 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-02-09 01:03:32,928 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:03:32,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 27 treesize of output 27 [2022-02-09 01:03:33,280 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-09 01:03:33,280 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 01:03:33,693 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-02-09 01:03:33,746 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-02-09 01:03:33,810 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:03:33,810 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-02-09 01:03:33,812 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-02-09 01:03:33,816 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-02-09 01:03:34,748 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2022-02-09 01:03:34,770 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-09 01:03:34,770 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1573725656] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 01:03:34,770 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 01:03:34,770 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 27, 26] total 71 [2022-02-09 01:03:34,770 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841795540] [2022-02-09 01:03:34,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 01:03:34,771 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2022-02-09 01:03:34,771 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:03:34,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2022-02-09 01:03:34,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=441, Invalid=4257, Unknown=2, NotChecked=270, Total=4970 [2022-02-09 01:03:34,772 INFO L87 Difference]: Start difference. First operand 13886 states and 50685 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-02-09 01:03:53,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:03:53,016 INFO L93 Difference]: Finished difference Result 45671 states and 167359 transitions. [2022-02-09 01:03:53,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 221 states. [2022-02-09 01:03:53,016 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-02-09 01:03:53,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:03:53,150 INFO L225 Difference]: With dead ends: 45671 [2022-02-09 01:03:53,150 INFO L226 Difference]: Without dead ends: 45371 [2022-02-09 01:03:53,154 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 220 SyntacticMatches, 15 SemanticMatches, 275 ConstructedPredicates, 2 IntricatePredicates, 2 DeprecatedPredicates, 28816 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=10241, Invalid=65115, Unknown=2, NotChecked=1094, Total=76452 [2022-02-09 01:03:53,154 INFO L933 BasicCegarLoop]: 437 mSDtfsCounter, 2925 mSDsluCounter, 13205 mSDsCounter, 0 mSdLazyCounter, 5462 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2925 SdHoareTripleChecker+Valid, 12442 SdHoareTripleChecker+Invalid, 16342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 5462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 10722 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-02-09 01:03:53,154 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2925 Valid, 12442 Invalid, 16342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 5462 Invalid, 0 Unknown, 10722 Unchecked, 2.6s Time] [2022-02-09 01:03:53,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45371 states. [2022-02-09 01:03:53,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45371 to 14264. [2022-02-09 01:03:53,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14264 states, 14263 states have (on average 3.6511252892098436) internal successors, (52076), 14263 states have internal predecessors, (52076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:03:53,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14264 states to 14264 states and 52076 transitions. [2022-02-09 01:03:53,702 INFO L78 Accepts]: Start accepts. Automaton has 14264 states and 52076 transitions. Word has length 124 [2022-02-09 01:03:53,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:03:53,703 INFO L470 AbstractCegarLoop]: Abstraction has 14264 states and 52076 transitions. [2022-02-09 01:03:53,703 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-02-09 01:03:53,703 INFO L276 IsEmpty]: Start isEmpty. Operand 14264 states and 52076 transitions. [2022-02-09 01:03:53,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-09 01:03:53,729 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:03:53,729 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-02-09 01:03:53,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-02-09 01:03:53,929 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-02-09 01:03:53,930 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-09 01:03:53,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:03:53,930 INFO L85 PathProgramCache]: Analyzing trace with hash -89866212, now seen corresponding path program 9 times [2022-02-09 01:03:53,930 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:03:53,930 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830475642] [2022-02-09 01:03:53,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:03:53,930 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:03:53,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:03:54,666 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:03:54,667 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:03:54,667 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830475642] [2022-02-09 01:03:54,667 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830475642] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 01:03:54,667 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787393280] [2022-02-09 01:03:54,667 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-09 01:03:54,667 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 01:03:54,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 01:03:54,668 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-02-09 01:03:54,668 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-02-09 01:03:54,764 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-02-09 01:03:54,765 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-09 01:03:54,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 78 conjunts are in the unsatisfiable core [2022-02-09 01:03:54,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 01:03:54,840 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-09 01:03:54,881 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-09 01:03:54,882 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-02-09 01:03:55,154 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-02-09 01:03:55,155 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-02-09 01:03:55,313 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-02-09 01:03:55,686 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-09 01:03:55,885 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-02-09 01:03:55,958 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-02-09 01:03:56,093 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:03:56,093 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-02-09 01:03:56,459 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:03:56,459 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 01:03:56,850 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-02-09 01:03:56,903 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-02-09 01:03:56,952 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-02-09 01:03:56,965 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-02-09 01:03:56,977 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-02-09 01:03:56,999 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-02-09 01:03:57,099 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-02-09 01:03:57,121 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-02-09 01:03:57,133 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-02-09 01:03:57,190 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:03:57,190 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-02-09 01:03:57,198 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-02-09 01:03:57,199 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-02-09 01:03:57,209 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-02-09 01:03:57,216 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-02-09 01:03:57,231 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-02-09 01:03:57,231 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-02-09 01:04:00,824 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2022-02-09 01:04:00,845 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-02-09 01:04:00,845 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [787393280] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 01:04:00,845 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 01:04:00,845 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 30, 28] total 75 [2022-02-09 01:04:00,845 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344697456] [2022-02-09 01:04:00,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 01:04:00,846 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-02-09 01:04:00,846 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:04:00,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-02-09 01:04:00,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=408, Invalid=3909, Unknown=9, NotChecked=1224, Total=5550 [2022-02-09 01:04:00,847 INFO L87 Difference]: Start difference. First operand 14264 states and 52076 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-02-09 01:04:20,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:04:20,128 INFO L93 Difference]: Finished difference Result 40970 states and 149500 transitions. [2022-02-09 01:04:20,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 200 states. [2022-02-09 01:04:20,128 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-02-09 01:04:20,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:04:20,245 INFO L225 Difference]: With dead ends: 40970 [2022-02-09 01:04:20,245 INFO L226 Difference]: Without dead ends: 40670 [2022-02-09 01:04:20,248 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 228 SyntacticMatches, 15 SemanticMatches, 259 ConstructedPredicates, 9 IntricatePredicates, 1 DeprecatedPredicates, 23295 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=7904, Invalid=55375, Unknown=9, NotChecked=4572, Total=67860 [2022-02-09 01:04:20,248 INFO L933 BasicCegarLoop]: 428 mSDtfsCounter, 3010 mSDsluCounter, 11920 mSDsCounter, 0 mSdLazyCounter, 5288 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3010 SdHoareTripleChecker+Valid, 11358 SdHoareTripleChecker+Invalid, 19772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 5288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 14362 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-02-09 01:04:20,248 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3010 Valid, 11358 Invalid, 19772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 5288 Invalid, 0 Unknown, 14362 Unchecked, 2.6s Time] [2022-02-09 01:04:20,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40670 states. [2022-02-09 01:04:20,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40670 to 14094. [2022-02-09 01:04:20,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14094 states, 14093 states have (on average 3.6449301071453912) internal successors, (51368), 14093 states have internal predecessors, (51368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:04:20,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14094 states to 14094 states and 51368 transitions. [2022-02-09 01:04:20,722 INFO L78 Accepts]: Start accepts. Automaton has 14094 states and 51368 transitions. Word has length 124 [2022-02-09 01:04:20,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:04:20,723 INFO L470 AbstractCegarLoop]: Abstraction has 14094 states and 51368 transitions. [2022-02-09 01:04:20,723 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-02-09 01:04:20,723 INFO L276 IsEmpty]: Start isEmpty. Operand 14094 states and 51368 transitions. [2022-02-09 01:04:20,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-09 01:04:20,750 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:04:20,750 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-02-09 01:04:20,771 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-02-09 01:04:20,951 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-02-09 01:04:20,951 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-09 01:04:20,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:04:20,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1002033640, now seen corresponding path program 10 times [2022-02-09 01:04:20,952 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:04:20,952 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608898861] [2022-02-09 01:04:20,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:04:20,952 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:04:20,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:04:21,675 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:04:21,675 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:04:21,675 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608898861] [2022-02-09 01:04:21,675 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608898861] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 01:04:21,675 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1653540415] [2022-02-09 01:04:21,675 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-09 01:04:21,675 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 01:04:21,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 01:04:21,677 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-02-09 01:04:21,677 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-02-09 01:04:21,772 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-09 01:04:21,772 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-09 01:04:21,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 78 conjunts are in the unsatisfiable core [2022-02-09 01:04:21,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 01:04:22,418 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-02-09 01:04:22,960 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-09 01:04:23,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 01:04:23,174 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-02-09 01:04:23,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 01:04:23,262 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-02-09 01:04:23,411 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:04:23,411 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-02-09 01:04:23,693 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:04:23,693 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 01:04:24,031 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-02-09 01:04:24,083 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-02-09 01:04:24,133 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-02-09 01:04:24,165 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-02-09 01:04:24,187 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-02-09 01:04:24,298 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-02-09 01:04:24,321 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-02-09 01:04:24,333 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-02-09 01:04:24,569 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:04:24,570 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-02-09 01:04:24,577 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:04:24,577 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-02-09 01:04:24,582 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-02-09 01:04:24,586 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-02-09 01:04:24,595 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:04:24,596 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-02-09 01:04:30,426 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-02-09 01:04:30,427 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1653540415] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 01:04:30,427 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 01:04:30,427 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33, 33] total 85 [2022-02-09 01:04:30,427 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947733478] [2022-02-09 01:04:30,427 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 01:04:30,427 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2022-02-09 01:04:30,427 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:04:30,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2022-02-09 01:04:30,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=532, Invalid=5341, Unknown=11, NotChecked=1256, Total=7140 [2022-02-09 01:04:30,428 INFO L87 Difference]: Start difference. First operand 14094 states and 51368 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-02-09 01:04:43,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:04:43,936 INFO L93 Difference]: Finished difference Result 29759 states and 107876 transitions. [2022-02-09 01:04:43,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-02-09 01:04:43,936 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-02-09 01:04:43,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:04:44,018 INFO L225 Difference]: With dead ends: 29759 [2022-02-09 01:04:44,019 INFO L226 Difference]: Without dead ends: 29609 [2022-02-09 01:04:44,020 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 199 SyntacticMatches, 7 SemanticMatches, 130 ConstructedPredicates, 8 IntricatePredicates, 2 DeprecatedPredicates, 4914 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=1504, Invalid=13769, Unknown=11, NotChecked=2008, Total=17292 [2022-02-09 01:04:44,021 INFO L933 BasicCegarLoop]: 282 mSDtfsCounter, 1932 mSDsluCounter, 9243 mSDsCounter, 0 mSdLazyCounter, 3695 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1932 SdHoareTripleChecker+Valid, 8922 SdHoareTripleChecker+Invalid, 9166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 3695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5402 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-02-09 01:04:44,021 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1932 Valid, 8922 Invalid, 9166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 3695 Invalid, 0 Unknown, 5402 Unchecked, 1.5s Time] [2022-02-09 01:04:44,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29609 states. [2022-02-09 01:04:44,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29609 to 14606. [2022-02-09 01:04:44,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14606 states, 14605 states have (on average 3.6661417322834646) internal successors, (53544), 14605 states have internal predecessors, (53544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:04:44,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14606 states to 14606 states and 53544 transitions. [2022-02-09 01:04:44,420 INFO L78 Accepts]: Start accepts. Automaton has 14606 states and 53544 transitions. Word has length 124 [2022-02-09 01:04:44,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:04:44,420 INFO L470 AbstractCegarLoop]: Abstraction has 14606 states and 53544 transitions. [2022-02-09 01:04:44,420 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-02-09 01:04:44,420 INFO L276 IsEmpty]: Start isEmpty. Operand 14606 states and 53544 transitions. [2022-02-09 01:04:44,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-09 01:04:44,448 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:04:44,448 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-02-09 01:04:44,465 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-02-09 01:04:44,649 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-02-09 01:04:44,649 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-09 01:04:44,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:04:44,649 INFO L85 PathProgramCache]: Analyzing trace with hash 727737786, now seen corresponding path program 11 times [2022-02-09 01:04:44,649 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:04:44,649 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278052704] [2022-02-09 01:04:44,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:04:44,650 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:04:44,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:04:45,352 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:04:45,352 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:04:45,352 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278052704] [2022-02-09 01:04:45,352 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278052704] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 01:04:45,352 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882254210] [2022-02-09 01:04:45,352 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-09 01:04:45,352 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 01:04:45,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 01:04:45,353 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-02-09 01:04:45,354 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-02-09 01:04:45,449 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-09 01:04:45,450 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-09 01:04:45,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 84 conjunts are in the unsatisfiable core [2022-02-09 01:04:45,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 01:04:46,089 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-02-09 01:04:46,588 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-09 01:04:46,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 01:04:46,871 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-02-09 01:04:47,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 01:04:47,039 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-02-09 01:04:47,206 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:04:47,206 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-02-09 01:04:47,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-02-09 01:04:47,556 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 01:04:47,897 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-02-09 01:04:47,950 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-02-09 01:04:47,998 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-02-09 01:04:48,012 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-02-09 01:04:48,026 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-02-09 01:04:48,054 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-02-09 01:04:48,183 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-02-09 01:04:48,210 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-02-09 01:04:48,226 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-02-09 01:04:48,477 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:04:48,477 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-02-09 01:04:48,485 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:04:48,485 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-02-09 01:04:48,492 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-02-09 01:04:48,499 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-02-09 01:04:48,510 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:04:48,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 1190 treesize of output 1090 [2022-02-09 01:04:49,856 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-02-09 01:04:49,856 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1882254210] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 01:04:49,856 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 01:04:49,856 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33, 33] total 84 [2022-02-09 01:04:49,857 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868387416] [2022-02-09 01:04:49,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 01:04:49,857 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2022-02-09 01:04:49,857 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:04:49,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2022-02-09 01:04:49,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=520, Invalid=5056, Unknown=10, NotChecked=1386, Total=6972 [2022-02-09 01:04:49,858 INFO L87 Difference]: Start difference. First operand 14606 states and 53544 transitions. Second operand has 84 states, 84 states have (on average 3.5952380952380953) internal successors, (302), 84 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-02-09 01:04:57,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:04:57,708 INFO L93 Difference]: Finished difference Result 34843 states and 126620 transitions. [2022-02-09 01:04:57,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-02-09 01:04:57,709 INFO L78 Accepts]: Start accepts. Automaton has has 84 states, 84 states have (on average 3.5952380952380953) internal successors, (302), 84 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-02-09 01:04:57,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:04:57,811 INFO L225 Difference]: With dead ends: 34843 [2022-02-09 01:04:57,812 INFO L226 Difference]: Without dead ends: 34693 [2022-02-09 01:04:57,813 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 197 SyntacticMatches, 6 SemanticMatches, 136 ConstructedPredicates, 9 IntricatePredicates, 1 DeprecatedPredicates, 5324 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=1575, Invalid=14963, Unknown=10, NotChecked=2358, Total=18906 [2022-02-09 01:04:57,814 INFO L933 BasicCegarLoop]: 269 mSDtfsCounter, 1979 mSDsluCounter, 8269 mSDsCounter, 0 mSdLazyCounter, 4307 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1979 SdHoareTripleChecker+Valid, 7930 SdHoareTripleChecker+Invalid, 8037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 4307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3598 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-02-09 01:04:57,814 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1979 Valid, 7930 Invalid, 8037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 4307 Invalid, 0 Unknown, 3598 Unchecked, 1.7s Time] [2022-02-09 01:04:57,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34693 states. [2022-02-09 01:04:58,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34693 to 14314. [2022-02-09 01:04:58,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14314 states, 14313 states have (on average 3.6482218961782995) internal successors, (52217), 14313 states have internal predecessors, (52217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:04:58,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14314 states to 14314 states and 52217 transitions. [2022-02-09 01:04:58,294 INFO L78 Accepts]: Start accepts. Automaton has 14314 states and 52217 transitions. Word has length 124 [2022-02-09 01:04:58,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:04:58,295 INFO L470 AbstractCegarLoop]: Abstraction has 14314 states and 52217 transitions. [2022-02-09 01:04:58,295 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 84 states, 84 states have (on average 3.5952380952380953) internal successors, (302), 84 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-02-09 01:04:58,295 INFO L276 IsEmpty]: Start isEmpty. Operand 14314 states and 52217 transitions. [2022-02-09 01:04:58,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-09 01:04:58,321 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:04:58,321 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-02-09 01:04:58,340 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-02-09 01:04:58,522 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-02-09 01:04:58,522 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-09 01:04:58,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:04:58,523 INFO L85 PathProgramCache]: Analyzing trace with hash 929729368, now seen corresponding path program 12 times [2022-02-09 01:04:58,523 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:04:58,523 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404895543] [2022-02-09 01:04:58,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:04:58,523 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:04:58,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:04:59,300 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:04:59,300 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:04:59,300 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404895543] [2022-02-09 01:04:59,301 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404895543] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 01:04:59,301 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330727575] [2022-02-09 01:04:59,301 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-09 01:04:59,301 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 01:04:59,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 01:04:59,302 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-02-09 01:04:59,303 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-02-09 01:04:59,404 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-02-09 01:04:59,405 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-09 01:04:59,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 72 conjunts are in the unsatisfiable core [2022-02-09 01:04:59,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 01:04:59,452 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-09 01:04:59,484 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-09 01:04:59,485 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-02-09 01:04:59,695 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-02-09 01:04:59,695 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-02-09 01:05:00,173 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-02-09 01:05:00,246 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-02-09 01:05:00,431 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:05:00,432 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-02-09 01:05:00,715 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-09 01:05:00,715 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 01:05:01,022 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_879 (Array Int Int)) (|v_thread3Thread1of1ForFork2_~i~2#1_71| Int)) (or (<= (+ 2 |v_thread3Thread1of1ForFork2_~i~2#1_71|) c_~N~0) (< 0 |v_thread3Thread1of1ForFork2_~i~2#1_71|) (= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_879) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork2_~i~2#1_71| 4))) c_~res2~0) |c_thread1Thread1of1ForFork0_~tmp~0#1|))) is different from false [2022-02-09 01:05:01,080 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_878 (Array Int Int)) (v_ArrVal_879 (Array Int Int)) (|v_thread3Thread1of1ForFork2_~i~2#1_71| Int)) (or (<= (+ 2 |v_thread3Thread1of1ForFork2_~i~2#1_71|) c_~N~0) (< 0 |v_thread3Thread1of1ForFork2_~i~2#1_71|) (= |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_878) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_879) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork2_~i~2#1_71| 4))))))) is different from false [2022-02-09 01:05:01,130 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:05:01,130 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-02-09 01:05:01,133 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 162 treesize of output 150 [2022-02-09 01:05:01,136 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-02-09 01:05:02,092 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2022-02-09 01:05:02,113 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-09 01:05:02,114 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1330727575] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 01:05:02,114 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 01:05:02,114 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 27, 26] total 68 [2022-02-09 01:05:02,114 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847988517] [2022-02-09 01:05:02,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 01:05:02,114 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-02-09 01:05:02,114 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:05:02,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-02-09 01:05:02,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=407, Invalid=3889, Unknown=2, NotChecked=258, Total=4556 [2022-02-09 01:05:02,115 INFO L87 Difference]: Start difference. First operand 14314 states and 52217 transitions. Second operand has 68 states, 68 states have (on average 4.5) internal successors, (306), 68 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-02-09 01:05:11,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:05:11,080 INFO L93 Difference]: Finished difference Result 34356 states and 125418 transitions. [2022-02-09 01:05:11,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2022-02-09 01:05:11,081 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 4.5) internal successors, (306), 68 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-02-09 01:05:11,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:05:11,181 INFO L225 Difference]: With dead ends: 34356 [2022-02-09 01:05:11,181 INFO L226 Difference]: Without dead ends: 34347 [2022-02-09 01:05:11,183 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 221 SyntacticMatches, 12 SemanticMatches, 159 ConstructedPredicates, 2 IntricatePredicates, 2 DeprecatedPredicates, 7929 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=3779, Invalid=21349, Unknown=2, NotChecked=630, Total=25760 [2022-02-09 01:05:11,183 INFO L933 BasicCegarLoop]: 347 mSDtfsCounter, 2572 mSDsluCounter, 9887 mSDsCounter, 0 mSdLazyCounter, 4111 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2572 SdHoareTripleChecker+Valid, 9666 SdHoareTripleChecker+Invalid, 8060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 4111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3890 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-02-09 01:05:11,184 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2572 Valid, 9666 Invalid, 8060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 4111 Invalid, 0 Unknown, 3890 Unchecked, 1.9s Time] [2022-02-09 01:05:11,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34347 states. [2022-02-09 01:05:11,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34347 to 15582. [2022-02-09 01:05:11,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15582 states, 15581 states have (on average 3.662345163981773) internal successors, (57063), 15581 states have internal predecessors, (57063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:05:11,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15582 states to 15582 states and 57063 transitions. [2022-02-09 01:05:11,740 INFO L78 Accepts]: Start accepts. Automaton has 15582 states and 57063 transitions. Word has length 124 [2022-02-09 01:05:11,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:05:11,740 INFO L470 AbstractCegarLoop]: Abstraction has 15582 states and 57063 transitions. [2022-02-09 01:05:11,740 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 4.5) internal successors, (306), 68 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-02-09 01:05:11,740 INFO L276 IsEmpty]: Start isEmpty. Operand 15582 states and 57063 transitions. [2022-02-09 01:05:11,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-09 01:05:11,768 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:05:11,768 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-02-09 01:05:11,785 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-02-09 01:05:11,969 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-02-09 01:05:11,969 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-09 01:05:11,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:05:11,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1843297594, now seen corresponding path program 13 times [2022-02-09 01:05:11,970 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:05:11,970 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185585262] [2022-02-09 01:05:11,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:05:11,970 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:05:11,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:05:12,753 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:05:12,754 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:05:12,754 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185585262] [2022-02-09 01:05:12,754 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185585262] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 01:05:12,754 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1873961977] [2022-02-09 01:05:12,754 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-02-09 01:05:12,754 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 01:05:12,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 01:05:12,755 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-02-09 01:05:12,756 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-02-09 01:05:12,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:05:12,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 84 conjunts are in the unsatisfiable core [2022-02-09 01:05:12,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 01:05:12,922 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-09 01:05:12,960 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-09 01:05:12,960 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-02-09 01:05:13,302 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-02-09 01:05:13,302 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-02-09 01:05:13,511 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-02-09 01:05:13,982 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-09 01:05:14,194 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-02-09 01:05:14,291 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-02-09 01:05:14,477 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:05:14,478 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-02-09 01:05:14,823 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:05:14,823 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 01:05:15,135 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_918 (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_918) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))))) is different from false [2022-02-09 01:05:15,188 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_917 (Array Int Int)) (v_ArrVal_918 (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_917) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_918) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) |c_thread1Thread1of1ForFork0_~tmp~0#1|))) is different from false [2022-02-09 01:05:15,235 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_917 (Array Int Int)) (v_ArrVal_918 (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_917) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_918) 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-02-09 01:05:15,256 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_917 (Array Int Int)) (v_ArrVal_918 (Array Int Int))) (or (= (+ (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_917) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_918) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)))) is different from false [2022-02-09 01:05:15,278 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_917 (Array Int Int)) (v_ArrVal_916 (Array Int Int)) (v_ArrVal_918 (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_916))) (= (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_917) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_918) 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)))) (not (< ~M~0 c_~N~0)))) is different from false [2022-02-09 01:05:15,381 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_917 (Array Int Int)) (v_ArrVal_916 (Array Int Int)) (v_ArrVal_918 (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_916))) (= (+ (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_917) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_918) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4)))))))) is different from false [2022-02-09 01:05:15,404 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_917 (Array Int Int)) (v_ArrVal_916 (Array Int Int)) (v_ArrVal_918 (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_916))) (= (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_917) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_918) |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|)))) (not (< ~M~0 c_~N~0)))) is different from false [2022-02-09 01:05:15,417 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_917 (Array Int Int)) (v_ArrVal_916 (Array Int Int)) (v_ArrVal_918 (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_916))) (= (+ 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|)) (+ (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_917) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_918) |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))))) is different from false [2022-02-09 01:05:15,635 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:05:15,636 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-02-09 01:05:15,644 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:05:15,644 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 2978 [2022-02-09 01:05:15,654 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 2774 [2022-02-09 01:05:15,664 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 2774 treesize of output 2390 [2022-02-09 01:05:15,679 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:05:15,680 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 2178 [2022-02-09 01:05:40,441 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2022-02-09 01:05:40,461 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-02-09 01:05:40,462 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1873961977] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 01:05:40,462 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 01:05:40,462 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33, 33] total 81 [2022-02-09 01:05:40,462 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022684793] [2022-02-09 01:05:40,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 01:05:40,462 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2022-02-09 01:05:40,462 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:05:40,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2022-02-09 01:05:40,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=493, Invalid=4785, Unknown=10, NotChecked=1192, Total=6480 [2022-02-09 01:05:40,463 INFO L87 Difference]: Start difference. First operand 15582 states and 57063 transitions. Second operand has 81 states, 81 states have (on average 3.7777777777777777) internal successors, (306), 81 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-02-09 01:05:45,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:05:45,987 INFO L93 Difference]: Finished difference Result 32775 states and 118600 transitions. [2022-02-09 01:05:45,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-02-09 01:05:45,988 INFO L78 Accepts]: Start accepts. Automaton has has 81 states, 81 states have (on average 3.7777777777777777) internal successors, (306), 81 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-02-09 01:05:45,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:05:46,086 INFO L225 Difference]: With dead ends: 32775 [2022-02-09 01:05:46,086 INFO L226 Difference]: Without dead ends: 32475 [2022-02-09 01:05:46,088 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 205 SyntacticMatches, 8 SemanticMatches, 127 ConstructedPredicates, 8 IntricatePredicates, 2 DeprecatedPredicates, 4732 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=1460, Invalid=13082, Unknown=10, NotChecked=1960, Total=16512 [2022-02-09 01:05:46,088 INFO L933 BasicCegarLoop]: 280 mSDtfsCounter, 1584 mSDsluCounter, 8935 mSDsCounter, 0 mSdLazyCounter, 2936 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1584 SdHoareTripleChecker+Valid, 8627 SdHoareTripleChecker+Invalid, 8973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 2936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5994 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-02-09 01:05:46,089 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1584 Valid, 8627 Invalid, 8973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 2936 Invalid, 0 Unknown, 5994 Unchecked, 1.2s Time] [2022-02-09 01:05:46,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32475 states. [2022-02-09 01:05:46,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32475 to 15001. [2022-02-09 01:05:46,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15001 states, 15000 states have (on average 3.6474) internal successors, (54711), 15000 states have internal predecessors, (54711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:05:46,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15001 states to 15001 states and 54711 transitions. [2022-02-09 01:05:46,644 INFO L78 Accepts]: Start accepts. Automaton has 15001 states and 54711 transitions. Word has length 124 [2022-02-09 01:05:46,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:05:46,645 INFO L470 AbstractCegarLoop]: Abstraction has 15001 states and 54711 transitions. [2022-02-09 01:05:46,645 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 81 states have (on average 3.7777777777777777) internal successors, (306), 81 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-02-09 01:05:46,645 INFO L276 IsEmpty]: Start isEmpty. Operand 15001 states and 54711 transitions. [2022-02-09 01:05:46,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-09 01:05:46,672 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:05:46,672 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-02-09 01:05:46,688 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-02-09 01:05:46,872 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-02-09 01:05:46,872 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-09 01:05:46,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:05:46,873 INFO L85 PathProgramCache]: Analyzing trace with hash -673379146, now seen corresponding path program 14 times [2022-02-09 01:05:46,873 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:05:46,873 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366412188] [2022-02-09 01:05:46,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:05:46,874 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:05:46,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:05:47,607 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:05:47,607 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:05:47,607 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366412188] [2022-02-09 01:05:47,608 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366412188] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 01:05:47,608 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441379195] [2022-02-09 01:05:47,608 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-09 01:05:47,608 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 01:05:47,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 01:05:47,609 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-02-09 01:05:47,609 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-02-09 01:05:47,734 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-09 01:05:47,734 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-09 01:05:47,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 71 conjunts are in the unsatisfiable core [2022-02-09 01:05:47,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 01:05:47,797 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-09 01:05:47,996 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-09 01:05:47,997 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-02-09 01:05:48,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 01:05:48,467 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-02-09 01:05:48,542 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-02-09 01:05:48,739 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:05:48,740 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-02-09 01:05:49,033 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-09 01:05:49,033 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 01:05:49,355 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_953 (Array Int Int)) (|v_thread3Thread1of1ForFork2_~i~2#1_77| Int)) (or (< 0 |v_thread3Thread1of1ForFork2_~i~2#1_77|) (= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_953) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork2_~i~2#1_77| 4))) c_~res2~0) |c_thread1Thread1of1ForFork0_~tmp~0#1|) (<= (+ 2 |v_thread3Thread1of1ForFork2_~i~2#1_77|) c_~N~0))) is different from false [2022-02-09 01:05:49,411 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_953 (Array Int Int)) (v_ArrVal_952 (Array Int Int)) (|v_thread3Thread1of1ForFork2_~i~2#1_77| Int)) (or (< 0 |v_thread3Thread1of1ForFork2_~i~2#1_77|) (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_952) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_953) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork2_~i~2#1_77| 4)))) |c_thread1Thread1of1ForFork0_~tmp~0#1|) (<= (+ 2 |v_thread3Thread1of1ForFork2_~i~2#1_77|) c_~N~0))) is different from false [2022-02-09 01:05:49,457 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:05:49,457 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-02-09 01:05:49,460 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-02-09 01:05:49,464 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-02-09 01:05:50,475 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-02-09 01:05:50,533 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-09 01:05:50,533 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1441379195] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 01:05:50,533 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 01:05:50,533 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 27, 26] total 67 [2022-02-09 01:05:50,533 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707835616] [2022-02-09 01:05:50,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 01:05:50,534 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-02-09 01:05:50,534 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:05:50,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-02-09 01:05:50,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=394, Invalid=3772, Unknown=2, NotChecked=254, Total=4422 [2022-02-09 01:05:50,535 INFO L87 Difference]: Start difference. First operand 15001 states and 54711 transitions. Second operand has 67 states, 67 states have (on average 4.552238805970149) internal successors, (305), 67 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-02-09 01:06:01,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:06:01,046 INFO L93 Difference]: Finished difference Result 33145 states and 121092 transitions. [2022-02-09 01:06:01,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-02-09 01:06:01,046 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 4.552238805970149) internal successors, (305), 67 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-02-09 01:06:01,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:06:01,145 INFO L225 Difference]: With dead ends: 33145 [2022-02-09 01:06:01,145 INFO L226 Difference]: Without dead ends: 33130 [2022-02-09 01:06:01,146 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 213 SyntacticMatches, 16 SemanticMatches, 156 ConstructedPredicates, 2 IntricatePredicates, 2 DeprecatedPredicates, 7416 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=3518, Invalid=20668, Unknown=2, NotChecked=618, Total=24806 [2022-02-09 01:06:01,147 INFO L933 BasicCegarLoop]: 365 mSDtfsCounter, 2313 mSDsluCounter, 11725 mSDsCounter, 0 mSdLazyCounter, 5658 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2313 SdHoareTripleChecker+Valid, 11362 SdHoareTripleChecker+Invalid, 8825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 5658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3117 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-02-09 01:06:01,147 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2313 Valid, 11362 Invalid, 8825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 5658 Invalid, 0 Unknown, 3117 Unchecked, 2.5s Time] [2022-02-09 01:06:01,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33130 states. [2022-02-09 01:06:01,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33130 to 14998. [2022-02-09 01:06:01,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14998 states, 14997 states have (on average 3.6475961859038475) internal successors, (54703), 14997 states have internal predecessors, (54703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:06:01,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14998 states to 14998 states and 54703 transitions. [2022-02-09 01:06:01,579 INFO L78 Accepts]: Start accepts. Automaton has 14998 states and 54703 transitions. Word has length 124 [2022-02-09 01:06:01,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:06:01,579 INFO L470 AbstractCegarLoop]: Abstraction has 14998 states and 54703 transitions. [2022-02-09 01:06:01,580 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 4.552238805970149) internal successors, (305), 67 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-02-09 01:06:01,580 INFO L276 IsEmpty]: Start isEmpty. Operand 14998 states and 54703 transitions. [2022-02-09 01:06:01,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-09 01:06:01,608 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:06:01,609 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-02-09 01:06:01,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-02-09 01:06:01,809 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-02-09 01:06:01,809 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-09 01:06:01,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:06:01,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1592604130, now seen corresponding path program 15 times [2022-02-09 01:06:01,810 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:06:01,810 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041682090] [2022-02-09 01:06:01,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:06:01,810 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:06:01,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:06:02,537 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:06:02,538 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:06:02,538 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041682090] [2022-02-09 01:06:02,538 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041682090] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 01:06:02,538 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854632375] [2022-02-09 01:06:02,538 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-09 01:06:02,538 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 01:06:02,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 01:06:02,539 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-02-09 01:06:02,539 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-02-09 01:06:02,643 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-02-09 01:06:02,643 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-09 01:06:02,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 79 conjunts are in the unsatisfiable core [2022-02-09 01:06:02,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 01:06:02,740 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-09 01:06:02,986 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-09 01:06:02,986 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-02-09 01:06:03,154 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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-02-09 01:06:03,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 6 treesize of output 5 [2022-02-09 01:06:03,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 01:06:03,792 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-02-09 01:06:03,877 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-02-09 01:06:04,105 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:06:04,105 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-02-09 01:06:04,399 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:06:04,400 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 01:06:04,722 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_991 (Array Int Int)) (|v_thread3Thread1of1ForFork2_~i~2#1_80| Int)) (or (= (+ c_~res2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_991) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork2_~i~2#1_80| 4)))) |c_thread1Thread1of1ForFork0_~tmp~0#1|) (<= (+ 2 |v_thread3Thread1of1ForFork2_~i~2#1_80|) c_~N~0) (< 0 |v_thread3Thread1of1ForFork2_~i~2#1_80|))) is different from false [2022-02-09 01:06:04,775 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_991 (Array Int Int)) (|v_thread3Thread1of1ForFork2_~i~2#1_80| Int) (v_ArrVal_990 (Array Int 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_990) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_991) 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-02-09 01:06:04,824 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_991 (Array Int Int)) (|v_thread3Thread1of1ForFork2_~i~2#1_80| Int) (v_ArrVal_990 (Array Int 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_990) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_991) 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)))) is different from false [2022-02-09 01:06:04,836 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_991 (Array Int Int)) (|v_thread3Thread1of1ForFork2_~i~2#1_80| Int) (v_ArrVal_990 (Array Int Int))) (or (<= (+ |v_thread3Thread1of1ForFork2_~i~2#1_80| 1) |c_thread1Thread1of1ForFork0_~i~0#1|) (< 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_990) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_991) 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)))) is different from false [2022-02-09 01:06:04,847 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_991 (Array Int Int)) (|v_thread3Thread1of1ForFork2_~i~2#1_80| Int) (v_ArrVal_990 (Array Int Int))) (or (<= (+ |v_thread3Thread1of1ForFork2_~i~2#1_80| 1) 0) (< 0 |v_thread3Thread1of1ForFork2_~i~2#1_80|) (= (+ (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_990) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_991) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork2_~i~2#1_80| 4))))))) is different from false [2022-02-09 01:06:04,869 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_989 (Array Int Int)) (v_ArrVal_991 (Array Int Int)) (|v_thread3Thread1of1ForFork2_~i~2#1_80| Int) (v_ArrVal_990 (Array Int 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_989))) (= (+ (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_990) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_991) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork2_~i~2#1_80| 4)))))))) is different from false [2022-02-09 01:06:04,972 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_989 (Array Int Int)) (v_ArrVal_991 (Array Int Int)) (|v_thread3Thread1of1ForFork2_~i~2#1_80| Int) (v_ArrVal_990 (Array Int Int))) (or (<= (+ |v_thread3Thread1of1ForFork2_~i~2#1_80| 1) 0) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_989))) (= (+ 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_990) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_991) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* |v_thread3Thread1of1ForFork2_~i~2#1_80| 4)))))) (< 0 |v_thread3Thread1of1ForFork2_~i~2#1_80|))) is different from false [2022-02-09 01:06:04,997 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_989 (Array Int Int)) (v_ArrVal_991 (Array Int Int)) (|v_thread3Thread1of1ForFork2_~i~2#1_80| Int) (v_ArrVal_990 (Array Int Int))) (or (<= (+ |v_thread3Thread1of1ForFork2_~i~2#1_80| 1) 0) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_989))) (= (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_990) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_991) |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_~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|)))) (< 0 |v_thread3Thread1of1ForFork2_~i~2#1_80|))) is different from false [2022-02-09 01:06:05,011 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_989 (Array Int Int)) (v_ArrVal_991 (Array Int Int)) (|v_thread3Thread1of1ForFork2_~i~2#1_80| Int) (v_ArrVal_990 (Array Int Int))) (or (<= (+ |v_thread3Thread1of1ForFork2_~i~2#1_80| 1) 0) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_989))) (= (+ (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_990) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_991) |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|)) 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))) (< 0 |v_thread3Thread1of1ForFork2_~i~2#1_80|))) is different from false [2022-02-09 01:06:05,072 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:06:05,073 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-02-09 01:06:05,080 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-02-09 01:06:05,080 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-02-09 01:06:05,090 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 1286 [2022-02-09 01:06:05,101 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-02-09 01:06:05,101 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 1286 treesize of output 1178 [2022-02-09 01:06:05,111 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 1174 treesize of output 1078 [2022-02-09 01:06:54,807 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-02-09 01:06:54,865 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-02-09 01:06:54,866 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [854632375] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 01:06:54,866 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 01:06:54,866 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 30, 28] total 73 [2022-02-09 01:06:54,866 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637456904] [2022-02-09 01:06:54,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 01:06:54,866 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-02-09 01:06:54,866 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:06:54,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-02-09 01:06:54,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=412, Invalid=3647, Unknown=9, NotChecked=1188, Total=5256 [2022-02-09 01:06:54,867 INFO L87 Difference]: Start difference. First operand 14998 states and 54703 transitions. Second operand has 73 states, 73 states have (on average 4.205479452054795) internal successors, (307), 73 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-02-09 01:07:03,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:07:03,737 INFO L93 Difference]: Finished difference Result 48904 states and 177911 transitions. [2022-02-09 01:07:03,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2022-02-09 01:07:03,737 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 73 states have (on average 4.205479452054795) internal successors, (307), 73 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-02-09 01:07:03,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:07:03,876 INFO L225 Difference]: With dead ends: 48904 [2022-02-09 01:07:03,876 INFO L226 Difference]: Without dead ends: 48754 [2022-02-09 01:07:03,878 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 211 SyntacticMatches, 8 SemanticMatches, 186 ConstructedPredicates, 9 IntricatePredicates, 2 DeprecatedPredicates, 12282 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=3025, Invalid=28864, Unknown=9, NotChecked=3258, Total=35156 [2022-02-09 01:07:03,878 INFO L933 BasicCegarLoop]: 365 mSDtfsCounter, 2340 mSDsluCounter, 11278 mSDsCounter, 0 mSdLazyCounter, 7571 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2340 SdHoareTripleChecker+Valid, 10568 SdHoareTripleChecker+Invalid, 14567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 7571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6877 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-02-09 01:07:03,878 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2340 Valid, 10568 Invalid, 14567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 7571 Invalid, 0 Unknown, 6877 Unchecked, 3.2s Time] [2022-02-09 01:07:03,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48754 states. [2022-02-09 01:07:04,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48754 to 13945. [2022-02-09 01:07:04,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13945 states, 13944 states have (on average 3.6399885255306943) internal successors, (50756), 13944 states have internal predecessors, (50756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:07:04,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13945 states to 13945 states and 50756 transitions. [2022-02-09 01:07:04,387 INFO L78 Accepts]: Start accepts. Automaton has 13945 states and 50756 transitions. Word has length 124 [2022-02-09 01:07:04,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:07:04,387 INFO L470 AbstractCegarLoop]: Abstraction has 13945 states and 50756 transitions. [2022-02-09 01:07:04,387 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 4.205479452054795) internal successors, (307), 73 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-02-09 01:07:04,387 INFO L276 IsEmpty]: Start isEmpty. Operand 13945 states and 50756 transitions. [2022-02-09 01:07:04,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-09 01:07:04,414 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:07:04,414 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-02-09 01:07:04,432 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-02-09 01:07:04,615 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-02-09 01:07:04,615 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-09 01:07:04,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:07:04,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1814647960, now seen corresponding path program 5 times [2022-02-09 01:07:04,616 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:07:04,616 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777064323] [2022-02-09 01:07:04,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:07:04,616 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:07:04,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:07:04,861 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-09 01:07:04,861 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:07:04,861 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777064323] [2022-02-09 01:07:04,861 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777064323] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 01:07:04,861 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096272483] [2022-02-09 01:07:04,861 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-09 01:07:04,861 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 01:07:04,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 01:07:04,862 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-02-09 01:07:04,867 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-02-09 01:07:04,971 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-09 01:07:04,971 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-09 01:07:04,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 69 conjunts are in the unsatisfiable core [2022-02-09 01:07:04,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 01:07:05,412 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-02-09 01:07:05,695 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-09 01:07:05,827 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-09 01:07:05,906 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-09 01:07:06,030 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-02-09 01:07:06,080 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:07:06,080 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 01:07:06,223 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1028 (Array Int Int))) (= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1028) c_~A~0.base))) (+ (* (- 1) (select .cse0 c_~A~0.offset)) (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0 (* (- 1) c_~res2~0))) 0)) is different from false [2022-02-09 01:07:06,239 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1028 (Array Int Int)) (v_ArrVal_1027 (Array Int Int))) (= (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1027) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1028) c_~A~0.base))) (+ (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0 (* (- 1) (select .cse0 c_~A~0.offset)) (* (- 1) c_~res2~0))) 0)) is different from false [2022-02-09 01:07:06,353 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-02-09 01:07:06,353 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2096272483] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 01:07:06,353 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 01:07:06,353 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 24, 13] total 39 [2022-02-09 01:07:06,353 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526597688] [2022-02-09 01:07:06,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 01:07:06,354 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-02-09 01:07:06,354 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:07:06,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-02-09 01:07:06,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1161, Unknown=2, NotChecked=142, Total=1482 [2022-02-09 01:07:06,355 INFO L87 Difference]: Start difference. First operand 13945 states and 50756 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-02-09 01:07:07,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:07:07,961 INFO L93 Difference]: Finished difference Result 25805 states and 94321 transitions. [2022-02-09 01:07:07,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-02-09 01:07:07,961 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-02-09 01:07:07,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:07:08,037 INFO L225 Difference]: With dead ends: 25805 [2022-02-09 01:07:08,037 INFO L226 Difference]: Without dead ends: 25655 [2022-02-09 01:07:08,038 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 227 SyntacticMatches, 9 SemanticMatches, 65 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 1283 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=576, Invalid=3590, Unknown=2, NotChecked=254, Total=4422 [2022-02-09 01:07:08,038 INFO L933 BasicCegarLoop]: 230 mSDtfsCounter, 1124 mSDsluCounter, 4131 mSDsCounter, 0 mSdLazyCounter, 1677 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1124 SdHoareTripleChecker+Valid, 4095 SdHoareTripleChecker+Invalid, 2258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 554 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-09 01:07:08,039 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1124 Valid, 4095 Invalid, 2258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1677 Invalid, 0 Unknown, 554 Unchecked, 0.7s Time] [2022-02-09 01:07:08,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25655 states. [2022-02-09 01:07:08,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25655 to 14379. [2022-02-09 01:07:08,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14379 states, 14378 states have (on average 3.642857142857143) internal successors, (52377), 14378 states have internal predecessors, (52377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:07:08,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14379 states to 14379 states and 52377 transitions. [2022-02-09 01:07:08,376 INFO L78 Accepts]: Start accepts. Automaton has 14379 states and 52377 transitions. Word has length 124 [2022-02-09 01:07:08,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:07:08,376 INFO L470 AbstractCegarLoop]: Abstraction has 14379 states and 52377 transitions. [2022-02-09 01:07:08,376 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-02-09 01:07:08,376 INFO L276 IsEmpty]: Start isEmpty. Operand 14379 states and 52377 transitions. [2022-02-09 01:07:08,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-09 01:07:08,402 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:07:08,402 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-02-09 01:07:08,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-02-09 01:07:08,603 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-02-09 01:07:08,603 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-09 01:07:08,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:07:08,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1340158932, now seen corresponding path program 6 times [2022-02-09 01:07:08,603 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:07:08,604 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89093835] [2022-02-09 01:07:08,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:07:08,604 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:07:08,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:07:08,817 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-09 01:07:08,817 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:07:08,817 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89093835] [2022-02-09 01:07:08,817 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89093835] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 01:07:08,818 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618192015] [2022-02-09 01:07:08,818 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-09 01:07:08,818 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 01:07:08,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 01:07:08,819 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-02-09 01:07:08,820 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-02-09 01:07:08,929 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-02-09 01:07:08,929 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-09 01:07:08,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 51 conjunts are in the unsatisfiable core [2022-02-09 01:07:08,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 01:07:09,326 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-02-09 01:07:09,388 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-09 01:07:09,388 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 01:07:09,458 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:07:09,458 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-02-09 01:07:09,634 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-09 01:07:09,635 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618192015] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 01:07:09,635 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 01:07:09,635 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 11] total 24 [2022-02-09 01:07:09,635 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255809757] [2022-02-09 01:07:09,635 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 01:07:09,635 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-02-09 01:07:09,635 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:07:09,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-02-09 01:07:09,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=467, Unknown=0, NotChecked=0, Total=552 [2022-02-09 01:07:09,636 INFO L87 Difference]: Start difference. First operand 14379 states and 52377 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-02-09 01:07:10,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:07:10,608 INFO L93 Difference]: Finished difference Result 34527 states and 125047 transitions. [2022-02-09 01:07:10,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-02-09 01:07:10,609 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-02-09 01:07:10,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:07:10,708 INFO L225 Difference]: With dead ends: 34527 [2022-02-09 01:07:10,708 INFO L226 Difference]: Without dead ends: 34377 [2022-02-09 01:07:10,708 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-02-09 01:07:10,708 INFO L933 BasicCegarLoop]: 259 mSDtfsCounter, 1095 mSDsluCounter, 3291 mSDsCounter, 0 mSdLazyCounter, 1090 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1095 SdHoareTripleChecker+Valid, 3352 SdHoareTripleChecker+Invalid, 1125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-09 01:07:10,709 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1095 Valid, 3352 Invalid, 1125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1090 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-09 01:07:10,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34377 states. [2022-02-09 01:07:11,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34377 to 14583. [2022-02-09 01:07:11,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14583 states, 14582 states have (on average 3.643327389932794) internal successors, (53127), 14582 states have internal predecessors, (53127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:07:11,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14583 states to 14583 states and 53127 transitions. [2022-02-09 01:07:11,146 INFO L78 Accepts]: Start accepts. Automaton has 14583 states and 53127 transitions. Word has length 124 [2022-02-09 01:07:11,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:07:11,146 INFO L470 AbstractCegarLoop]: Abstraction has 14583 states and 53127 transitions. [2022-02-09 01:07:11,146 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-02-09 01:07:11,146 INFO L276 IsEmpty]: Start isEmpty. Operand 14583 states and 53127 transitions. [2022-02-09 01:07:11,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-09 01:07:11,173 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:07:11,173 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-02-09 01:07:11,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-02-09 01:07:11,382 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-02-09 01:07:11,382 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-09 01:07:11,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:07:11,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1904339992, now seen corresponding path program 7 times [2022-02-09 01:07:11,383 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:07:11,383 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407322469] [2022-02-09 01:07:11,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:07:11,383 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:07:11,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:07:11,624 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-09 01:07:11,625 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:07:11,625 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407322469] [2022-02-09 01:07:11,625 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407322469] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 01:07:11,625 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608005133] [2022-02-09 01:07:11,625 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-02-09 01:07:11,625 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 01:07:11,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 01:07:11,640 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-02-09 01:07:11,641 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-02-09 01:07:11,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:07:11,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 49 conjunts are in the unsatisfiable core [2022-02-09 01:07:11,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 01:07:12,108 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-02-09 01:07:12,168 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-09 01:07:12,168 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 01:07:12,239 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:07:12,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 28 [2022-02-09 01:07:12,414 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-09 01:07:12,414 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608005133] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 01:07:12,414 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 01:07:12,414 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12, 11] total 26 [2022-02-09 01:07:12,415 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055372891] [2022-02-09 01:07:12,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 01:07:12,415 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-02-09 01:07:12,415 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:07:12,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-02-09 01:07:12,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2022-02-09 01:07:12,415 INFO L87 Difference]: Start difference. First operand 14583 states and 53127 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-02-09 01:07:13,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:07:13,297 INFO L93 Difference]: Finished difference Result 30539 states and 110704 transitions. [2022-02-09 01:07:13,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-02-09 01:07:13,297 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-02-09 01:07:13,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:07:13,387 INFO L225 Difference]: With dead ends: 30539 [2022-02-09 01:07:13,388 INFO L226 Difference]: Without dead ends: 30389 [2022-02-09 01:07:13,388 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-02-09 01:07:13,388 INFO L933 BasicCegarLoop]: 264 mSDtfsCounter, 813 mSDsluCounter, 3306 mSDsCounter, 0 mSdLazyCounter, 1057 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 813 SdHoareTripleChecker+Valid, 3378 SdHoareTripleChecker+Invalid, 1078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-09 01:07:13,388 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [813 Valid, 3378 Invalid, 1078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1057 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-09 01:07:13,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30389 states. [2022-02-09 01:07:13,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30389 to 14507. [2022-02-09 01:07:13,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14507 states, 14506 states have (on average 3.6431131945401902) internal successors, (52847), 14506 states have internal predecessors, (52847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:07:13,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14507 states to 14507 states and 52847 transitions. [2022-02-09 01:07:13,788 INFO L78 Accepts]: Start accepts. Automaton has 14507 states and 52847 transitions. Word has length 124 [2022-02-09 01:07:13,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:07:13,788 INFO L470 AbstractCegarLoop]: Abstraction has 14507 states and 52847 transitions. [2022-02-09 01:07:13,788 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-02-09 01:07:13,788 INFO L276 IsEmpty]: Start isEmpty. Operand 14507 states and 52847 transitions. [2022-02-09 01:07:13,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-09 01:07:13,816 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:07:13,816 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-02-09 01:07:13,832 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-02-09 01:07:14,016 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-02-09 01:07:14,016 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-09 01:07:14,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:07:14,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1045504418, now seen corresponding path program 8 times [2022-02-09 01:07:14,017 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:07:14,017 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604577721] [2022-02-09 01:07:14,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:07:14,017 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:07:14,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:07:14,248 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-09 01:07:14,248 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:07:14,248 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604577721] [2022-02-09 01:07:14,249 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604577721] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 01:07:14,249 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497541377] [2022-02-09 01:07:14,249 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-09 01:07:14,249 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 01:07:14,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 01:07:14,250 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-02-09 01:07:14,250 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-02-09 01:07:14,354 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-09 01:07:14,354 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-09 01:07:14,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 51 conjunts are in the unsatisfiable core [2022-02-09 01:07:14,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 01:07:14,748 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-02-09 01:07:14,824 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-09 01:07:14,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 01:07:14,896 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:07:14,896 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-02-09 01:07:15,075 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-09 01:07:15,075 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [497541377] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 01:07:15,075 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 01:07:15,075 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 11] total 24 [2022-02-09 01:07:15,075 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175638682] [2022-02-09 01:07:15,075 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 01:07:15,076 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-02-09 01:07:15,076 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:07:15,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-02-09 01:07:15,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2022-02-09 01:07:15,076 INFO L87 Difference]: Start difference. First operand 14507 states and 52847 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-02-09 01:07:16,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:07:16,118 INFO L93 Difference]: Finished difference Result 37419 states and 135757 transitions. [2022-02-09 01:07:16,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-02-09 01:07:16,118 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-02-09 01:07:16,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:07:16,238 INFO L225 Difference]: With dead ends: 37419 [2022-02-09 01:07:16,238 INFO L226 Difference]: Without dead ends: 37269 [2022-02-09 01:07:16,239 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-02-09 01:07:16,239 INFO L933 BasicCegarLoop]: 254 mSDtfsCounter, 1294 mSDsluCounter, 2941 mSDsCounter, 0 mSdLazyCounter, 1037 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1294 SdHoareTripleChecker+Valid, 3001 SdHoareTripleChecker+Invalid, 1076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-09 01:07:16,239 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1294 Valid, 3001 Invalid, 1076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1037 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-09 01:07:16,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37269 states. [2022-02-09 01:07:16,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37269 to 14589. [2022-02-09 01:07:16,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14589 states, 14588 states have (on average 3.6469015629284343) internal successors, (53201), 14588 states have internal predecessors, (53201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:07:16,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14589 states to 14589 states and 53201 transitions. [2022-02-09 01:07:16,721 INFO L78 Accepts]: Start accepts. Automaton has 14589 states and 53201 transitions. Word has length 124 [2022-02-09 01:07:16,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:07:16,721 INFO L470 AbstractCegarLoop]: Abstraction has 14589 states and 53201 transitions. [2022-02-09 01:07:16,722 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-02-09 01:07:16,722 INFO L276 IsEmpty]: Start isEmpty. Operand 14589 states and 53201 transitions. [2022-02-09 01:07:16,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-09 01:07:16,751 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:07:16,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-02-09 01:07:16,768 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-02-09 01:07:16,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-02-09 01:07:16,951 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-09 01:07:16,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:07:16,952 INFO L85 PathProgramCache]: Analyzing trace with hash -708025836, now seen corresponding path program 9 times [2022-02-09 01:07:16,952 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:07:16,952 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512448666] [2022-02-09 01:07:16,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:07:16,952 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:07:16,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:07:17,210 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-09 01:07:17,210 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:07:17,210 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512448666] [2022-02-09 01:07:17,211 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512448666] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 01:07:17,211 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914077300] [2022-02-09 01:07:17,211 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-09 01:07:17,211 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 01:07:17,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 01:07:17,212 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-02-09 01:07:17,212 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-02-09 01:07:17,318 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-02-09 01:07:17,318 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-09 01:07:17,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 51 conjunts are in the unsatisfiable core [2022-02-09 01:07:17,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 01:07:17,738 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-02-09 01:07:17,795 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-09 01:07:17,795 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 01:07:17,898 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:07:17,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-02-09 01:07:18,082 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-09 01:07:18,082 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914077300] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 01:07:18,082 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 01:07:18,083 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 11] total 25 [2022-02-09 01:07:18,083 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590278732] [2022-02-09 01:07:18,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 01:07:18,083 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-02-09 01:07:18,083 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:07:18,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-02-09 01:07:18,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2022-02-09 01:07:18,084 INFO L87 Difference]: Start difference. First operand 14589 states and 53201 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-02-09 01:07:18,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:07:18,939 INFO L93 Difference]: Finished difference Result 29554 states and 107255 transitions. [2022-02-09 01:07:18,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-02-09 01:07:18,939 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-02-09 01:07:18,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:07:19,024 INFO L225 Difference]: With dead ends: 29554 [2022-02-09 01:07:19,024 INFO L226 Difference]: Without dead ends: 29404 [2022-02-09 01:07:19,024 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-02-09 01:07:19,025 INFO L933 BasicCegarLoop]: 250 mSDtfsCounter, 839 mSDsluCounter, 2983 mSDsCounter, 0 mSdLazyCounter, 1108 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 839 SdHoareTripleChecker+Valid, 3030 SdHoareTripleChecker+Invalid, 1129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-09 01:07:19,025 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [839 Valid, 3030 Invalid, 1129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1108 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-09 01:07:19,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29404 states. [2022-02-09 01:07:19,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29404 to 14601. [2022-02-09 01:07:19,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14601 states, 14600 states have (on average 3.6402739726027398) internal successors, (53148), 14600 states have internal predecessors, (53148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:07:19,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14601 states to 14601 states and 53148 transitions. [2022-02-09 01:07:19,412 INFO L78 Accepts]: Start accepts. Automaton has 14601 states and 53148 transitions. Word has length 124 [2022-02-09 01:07:19,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:07:19,412 INFO L470 AbstractCegarLoop]: Abstraction has 14601 states and 53148 transitions. [2022-02-09 01:07:19,412 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-02-09 01:07:19,412 INFO L276 IsEmpty]: Start isEmpty. Operand 14601 states and 53148 transitions. [2022-02-09 01:07:19,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-09 01:07:19,440 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:07:19,440 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-02-09 01:07:19,458 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-02-09 01:07:19,640 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-02-09 01:07:19,641 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-09 01:07:19,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:07:19,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1308591088, now seen corresponding path program 16 times [2022-02-09 01:07:19,641 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:07:19,641 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328257816] [2022-02-09 01:07:19,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:07:19,641 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:07:19,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:07:20,222 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:07:20,222 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:07:20,222 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328257816] [2022-02-09 01:07:20,222 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328257816] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 01:07:20,222 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1923169821] [2022-02-09 01:07:20,223 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-09 01:07:20,223 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 01:07:20,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 01:07:20,224 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-02-09 01:07:20,224 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-02-09 01:07:20,329 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-09 01:07:20,329 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-09 01:07:20,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 78 conjunts are in the unsatisfiable core [2022-02-09 01:07:20,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 01:07:20,949 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-02-09 01:07:21,417 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-09 01:07:21,660 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-09 01:07:21,762 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-09 01:07:22,019 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:07:22,020 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-02-09 01:07:22,264 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:07:22,264 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 01:07:22,568 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1193 (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_1193) 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-02-09 01:07:22,625 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1192 (Array Int Int)) (~M~0 Int) (v_ArrVal_1193 (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_1192) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1193) 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-02-09 01:07:22,685 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1192 (Array Int Int)) (~M~0 Int) (v_ArrVal_1193 (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_1192) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1193) 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)))))) is different from false [2022-02-09 01:07:22,707 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1192 (Array Int Int)) (v_ArrVal_1191 (Array Int Int)) (~M~0 Int) (v_ArrVal_1193 (Array Int Int))) (or (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1191) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1192) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1193) c_~A~0.base))) (= (+ c_~res1~0 (select .cse0 c_~A~0.offset)) (+ (select .cse0 (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0))) (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)))) is different from false [2022-02-09 01:07:22,816 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1192 (Array Int Int)) (v_ArrVal_1191 (Array Int Int)) (~M~0 Int) (v_ArrVal_1193 (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_1191) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1192) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1193) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (= (+ c_~res2~0 (select .cse0 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4)))) (+ c_~res1~0 (select .cse0 |c_ULTIMATE.start_main_#t~ret12#1.offset|)))))) is different from false [2022-02-09 01:07:22,841 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1192 (Array Int Int)) (v_ArrVal_1191 (Array Int Int)) (~M~0 Int) (v_ArrVal_1193 (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_1191) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1192) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1193) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (= (+ c_~res1~0 (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (+ 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-02-09 01:07:22,854 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1192 (Array Int Int)) (v_ArrVal_1191 (Array Int Int)) (~M~0 Int) (v_ArrVal_1193 (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_1191) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1192) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1193) |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))))) is different from false [2022-02-09 01:07:23,075 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:07:23,076 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-02-09 01:07:23,082 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:07:23,082 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 194 treesize of output 194 [2022-02-09 01:07:23,090 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:07:23,091 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 182 treesize of output 162 [2022-02-09 01:07:23,099 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:07:23,099 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 150 treesize of output 146 [2022-02-09 01:07:23,108 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:07:23,108 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 70 treesize of output 75 [2022-02-09 01:07:23,978 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-02-09 01:07:23,979 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1923169821] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 01:07:23,979 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 01:07:23,979 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 33, 29] total 74 [2022-02-09 01:07:23,979 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174618865] [2022-02-09 01:07:23,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 01:07:23,979 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2022-02-09 01:07:23,979 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:07:23,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2022-02-09 01:07:23,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=569, Invalid=3872, Unknown=9, NotChecked=952, Total=5402 [2022-02-09 01:07:23,980 INFO L87 Difference]: Start difference. First operand 14601 states and 53148 transitions. Second operand has 74 states, 74 states have (on average 4.081081081081081) internal successors, (302), 74 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-02-09 01:07:29,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:07:29,103 INFO L93 Difference]: Finished difference Result 32738 states and 118481 transitions. [2022-02-09 01:07:29,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-02-09 01:07:29,103 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 74 states have (on average 4.081081081081081) internal successors, (302), 74 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-02-09 01:07:29,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:07:29,194 INFO L225 Difference]: With dead ends: 32738 [2022-02-09 01:07:29,194 INFO L226 Difference]: Without dead ends: 32138 [2022-02-09 01:07:29,195 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 211 SyntacticMatches, 11 SemanticMatches, 126 ConstructedPredicates, 7 IntricatePredicates, 2 DeprecatedPredicates, 5131 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1838, Invalid=12701, Unknown=9, NotChecked=1708, Total=16256 [2022-02-09 01:07:29,196 INFO L933 BasicCegarLoop]: 242 mSDtfsCounter, 2716 mSDsluCounter, 7567 mSDsCounter, 0 mSdLazyCounter, 3087 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2716 SdHoareTripleChecker+Valid, 7234 SdHoareTripleChecker+Invalid, 7415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 3087 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4282 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-02-09 01:07:29,196 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2716 Valid, 7234 Invalid, 7415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 3087 Invalid, 0 Unknown, 4282 Unchecked, 1.3s Time] [2022-02-09 01:07:29,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32138 states. [2022-02-09 01:07:29,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32138 to 15893. [2022-02-09 01:07:29,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15893 states, 15892 states have (on average 3.6546060911150264) internal successors, (58079), 15892 states have internal predecessors, (58079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:07:29,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15893 states to 15893 states and 58079 transitions. [2022-02-09 01:07:29,742 INFO L78 Accepts]: Start accepts. Automaton has 15893 states and 58079 transitions. Word has length 124 [2022-02-09 01:07:29,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:07:29,742 INFO L470 AbstractCegarLoop]: Abstraction has 15893 states and 58079 transitions. [2022-02-09 01:07:29,742 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 74 states have (on average 4.081081081081081) internal successors, (302), 74 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-02-09 01:07:29,743 INFO L276 IsEmpty]: Start isEmpty. Operand 15893 states and 58079 transitions. [2022-02-09 01:07:29,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-09 01:07:29,773 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:07:29,773 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-02-09 01:07:29,790 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-02-09 01:07:29,973 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-02-09 01:07:29,974 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-09 01:07:29,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:07:29,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1704657420, now seen corresponding path program 17 times [2022-02-09 01:07:29,974 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:07:29,974 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109111524] [2022-02-09 01:07:29,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:07:29,975 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:07:30,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:07:30,658 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:07:30,658 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:07:30,658 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109111524] [2022-02-09 01:07:30,658 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109111524] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 01:07:30,658 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608200132] [2022-02-09 01:07:30,658 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-09 01:07:30,658 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 01:07:30,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 01:07:30,659 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-02-09 01:07:30,660 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-02-09 01:07:30,769 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-09 01:07:30,769 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-09 01:07:30,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 63 conjunts are in the unsatisfiable core [2022-02-09 01:07:30,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 01:07:31,864 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:07:31,864 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-02-09 01:07:32,135 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:07:32,136 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 01:07:32,327 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:07:32,327 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-02-09 01:07:33,159 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:07:33,159 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608200132] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 01:07:33,159 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 01:07:33,159 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 22] total 61 [2022-02-09 01:07:33,159 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873968656] [2022-02-09 01:07:33,159 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 01:07:33,160 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-02-09 01:07:33,160 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:07:33,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-02-09 01:07:33,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=432, Invalid=3228, Unknown=0, NotChecked=0, Total=3660 [2022-02-09 01:07:33,161 INFO L87 Difference]: Start difference. First operand 15893 states and 58079 transitions. Second operand has 61 states, 61 states have (on average 4.983606557377049) internal successors, (304), 61 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:07:43,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:07:43,409 INFO L93 Difference]: Finished difference Result 51103 states and 187785 transitions. [2022-02-09 01:07:43,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2022-02-09 01:07:43,409 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 4.983606557377049) internal successors, (304), 61 states have internal predecessors, (304), 0 states have call successors, (0), 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-02-09 01:07:43,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:07:43,584 INFO L225 Difference]: With dead ends: 51103 [2022-02-09 01:07:43,584 INFO L226 Difference]: Without dead ends: 50803 [2022-02-09 01:07:43,586 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 210 SyntacticMatches, 9 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9608 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=3107, Invalid=24283, Unknown=0, NotChecked=0, Total=27390 [2022-02-09 01:07:43,586 INFO L933 BasicCegarLoop]: 423 mSDtfsCounter, 3205 mSDsluCounter, 11717 mSDsCounter, 0 mSdLazyCounter, 6954 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3205 SdHoareTripleChecker+Valid, 11021 SdHoareTripleChecker+Invalid, 9434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 6954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2336 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-02-09 01:07:43,586 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3205 Valid, 11021 Invalid, 9434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 6954 Invalid, 0 Unknown, 2336 Unchecked, 3.2s Time] [2022-02-09 01:07:43,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50803 states. [2022-02-09 01:07:44,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50803 to 14983. [2022-02-09 01:07:44,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14983 states, 14982 states have (on average 3.658590308370044) internal successors, (54813), 14982 states have internal predecessors, (54813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:07:44,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14983 states to 14983 states and 54813 transitions. [2022-02-09 01:07:44,275 INFO L78 Accepts]: Start accepts. Automaton has 14983 states and 54813 transitions. Word has length 124 [2022-02-09 01:07:44,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:07:44,275 INFO L470 AbstractCegarLoop]: Abstraction has 14983 states and 54813 transitions. [2022-02-09 01:07:44,275 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 4.983606557377049) internal successors, (304), 61 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:07:44,276 INFO L276 IsEmpty]: Start isEmpty. Operand 14983 states and 54813 transitions. [2022-02-09 01:07:44,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-09 01:07:44,304 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:07:44,304 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-02-09 01:07:44,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-02-09 01:07:44,505 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-02-09 01:07:44,505 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-09 01:07:44,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:07:44,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1336949438, now seen corresponding path program 18 times [2022-02-09 01:07:44,506 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:07:44,506 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327630824] [2022-02-09 01:07:44,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:07:44,506 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:07:44,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:07:44,988 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:07:44,989 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:07:44,989 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327630824] [2022-02-09 01:07:44,989 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327630824] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 01:07:44,989 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683795660] [2022-02-09 01:07:44,989 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-09 01:07:44,989 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 01:07:44,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 01:07:44,990 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-02-09 01:07:44,991 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-02-09 01:07:45,104 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-02-09 01:07:45,104 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-09 01:07:45,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 54 conjunts are in the unsatisfiable core [2022-02-09 01:07:45,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 01:07:45,537 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:07:45,538 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 27 [2022-02-09 01:07:45,909 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-09 01:07:45,910 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 01:07:46,223 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:07:46,223 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-02-09 01:07:46,602 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-09 01:07:46,602 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [683795660] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 01:07:46,603 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 01:07:46,603 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 18, 17] total 51 [2022-02-09 01:07:46,603 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184562416] [2022-02-09 01:07:46,603 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 01:07:46,603 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-02-09 01:07:46,603 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:07:46,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-02-09 01:07:46,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=2193, Unknown=0, NotChecked=0, Total=2550 [2022-02-09 01:07:46,604 INFO L87 Difference]: Start difference. First operand 14983 states and 54813 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-02-09 01:08:12,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:08:12,072 INFO L93 Difference]: Finished difference Result 90743 states and 331982 transitions. [2022-02-09 01:08:12,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 456 states. [2022-02-09 01:08:12,073 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-02-09 01:08:12,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:08:12,534 INFO L225 Difference]: With dead ends: 90743 [2022-02-09 01:08:12,534 INFO L226 Difference]: Without dead ends: 90443 [2022-02-09 01:08:12,542 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 759 GetRequests, 255 SyntacticMatches, 20 SemanticMatches, 484 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 108895 ImplicationChecksByTransitivity, 19.2s TimeCoverageRelationStatistics Valid=20436, Invalid=215274, Unknown=0, NotChecked=0, Total=235710 [2022-02-09 01:08:12,542 INFO L933 BasicCegarLoop]: 645 mSDtfsCounter, 3875 mSDsluCounter, 16372 mSDsCounter, 0 mSdLazyCounter, 10179 mSolverCounterSat, 393 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3875 SdHoareTripleChecker+Valid, 14950 SdHoareTripleChecker+Invalid, 19637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 393 IncrementalHoareTripleChecker+Valid, 10179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9065 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-02-09 01:08:12,543 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3875 Valid, 14950 Invalid, 19637 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [393 Valid, 10179 Invalid, 0 Unknown, 9065 Unchecked, 4.7s Time] [2022-02-09 01:08:12,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90443 states. [2022-02-09 01:08:13,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90443 to 17855. [2022-02-09 01:08:13,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17855 states, 17854 states have (on average 3.694130166909376) internal successors, (65955), 17854 states have internal predecessors, (65955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:08:13,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17855 states to 17855 states and 65955 transitions. [2022-02-09 01:08:13,546 INFO L78 Accepts]: Start accepts. Automaton has 17855 states and 65955 transitions. Word has length 124 [2022-02-09 01:08:13,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:08:13,546 INFO L470 AbstractCegarLoop]: Abstraction has 17855 states and 65955 transitions. [2022-02-09 01:08:13,546 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-02-09 01:08:13,546 INFO L276 IsEmpty]: Start isEmpty. Operand 17855 states and 65955 transitions. [2022-02-09 01:08:13,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-09 01:08:13,577 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:08:13,577 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-02-09 01:08:13,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2022-02-09 01:08:13,777 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-02-09 01:08:13,778 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-09 01:08:13,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:08:13,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1679196940, now seen corresponding path program 19 times [2022-02-09 01:08:13,778 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:08:13,778 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730503315] [2022-02-09 01:08:13,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:08:13,778 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:08:13,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:08:14,470 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:08:14,471 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:08:14,471 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730503315] [2022-02-09 01:08:14,471 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730503315] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 01:08:14,471 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812030042] [2022-02-09 01:08:14,471 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-02-09 01:08:14,471 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 01:08:14,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 01:08:14,472 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-02-09 01:08:14,472 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-02-09 01:08:14,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:08:14,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 82 conjunts are in the unsatisfiable core [2022-02-09 01:08:14,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 01:08:14,680 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-09 01:08:15,014 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-09 01:08:15,015 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-02-09 01:08:15,232 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-02-09 01:08:15,698 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-09 01:08:15,872 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-09 01:08:15,985 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-02-09 01:08:16,164 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:08:16,164 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-02-09 01:08:16,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-02-09 01:08:16,629 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 01:08:17,028 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1295 (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_1295) c_~A~0.base))) (= (+ (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0) (+ (select .cse0 (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0))))) is different from false [2022-02-09 01:08:17,084 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1295 (Array Int Int)) (v_ArrVal_1294 (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_1294) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1295) 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-02-09 01:08:17,142 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1295 (Array Int Int)) (v_ArrVal_1294 (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_1294) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1295) 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-02-09 01:08:17,163 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1295 (Array Int Int)) (v_ArrVal_1294 (Array Int Int)) (v_ArrVal_1293 (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_1293) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1295) c_~A~0.base))) (= (+ c_~res1~0 (select .cse0 c_~A~0.offset)) (+ c_~res2~0 (select .cse0 (+ c_~A~0.offset (* ~M~0 4)))))))) is different from false [2022-02-09 01:08:17,266 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1295 (Array Int Int)) (v_ArrVal_1294 (Array Int Int)) (v_ArrVal_1293 (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_1293) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1295) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (= (+ c_~res2~0 (select .cse0 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4)))) (+ c_~res1~0 (select .cse0 |c_ULTIMATE.start_main_#t~ret12#1.offset|)))) (not (< ~M~0 c_~N~0)))) is different from false [2022-02-09 01:08:17,288 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1295 (Array Int Int)) (v_ArrVal_1294 (Array Int Int)) (v_ArrVal_1293 (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_1293) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1295) |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))))) is different from false [2022-02-09 01:08:17,301 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1295 (Array Int Int)) (v_ArrVal_1294 (Array Int Int)) (v_ArrVal_1293 (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_1293) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1295) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (= (+ c_~res2~0 (select .cse0 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (+ (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~res1~0))))) is different from false [2022-02-09 01:08:17,538 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:08:17,539 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-02-09 01:08:17,547 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:08:17,547 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 3254 treesize of output 3074 [2022-02-09 01:08:17,563 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:08:17,563 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 3062 treesize of output 2562 [2022-02-09 01:08:17,579 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:08:17,579 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 2550 treesize of output 2434 [2022-02-09 01:08:17,596 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:08:17,596 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 2422 treesize of output 2178 [2022-02-09 01:08:28,494 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-02-09 01:08:28,517 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-02-09 01:08:28,517 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812030042] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 01:08:28,517 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 01:08:28,517 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 33, 31] total 79 [2022-02-09 01:08:28,517 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84639135] [2022-02-09 01:08:28,517 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 01:08:28,518 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2022-02-09 01:08:28,518 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:08:28,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2022-02-09 01:08:28,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=502, Invalid=4629, Unknown=9, NotChecked=1022, Total=6162 [2022-02-09 01:08:28,519 INFO L87 Difference]: Start difference. First operand 17855 states and 65955 transitions. Second operand has 79 states, 79 states have (on average 4.012658227848101) internal successors, (317), 79 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-02-09 01:08:46,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:08:46,258 INFO L93 Difference]: Finished difference Result 68810 states and 248981 transitions. [2022-02-09 01:08:46,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 200 states. [2022-02-09 01:08:46,258 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 79 states have (on average 4.012658227848101) internal successors, (317), 79 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-02-09 01:08:46,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:08:46,478 INFO L225 Difference]: With dead ends: 68810 [2022-02-09 01:08:46,478 INFO L226 Difference]: Without dead ends: 67910 [2022-02-09 01:08:46,481 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 213 SyntacticMatches, 24 SemanticMatches, 249 ConstructedPredicates, 7 IntricatePredicates, 1 DeprecatedPredicates, 25174 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=4694, Invalid=54617, Unknown=9, NotChecked=3430, Total=62750 [2022-02-09 01:08:46,481 INFO L933 BasicCegarLoop]: 392 mSDtfsCounter, 4491 mSDsluCounter, 15312 mSDsCounter, 0 mSdLazyCounter, 9415 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4491 SdHoareTripleChecker+Valid, 14193 SdHoareTripleChecker+Invalid, 22086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 9415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 12442 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-02-09 01:08:46,481 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4491 Valid, 14193 Invalid, 22086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 9415 Invalid, 0 Unknown, 12442 Unchecked, 4.3s Time] [2022-02-09 01:08:46,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67910 states. [2022-02-09 01:08:47,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67910 to 16397. [2022-02-09 01:08:47,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16397 states, 16396 states have (on average 3.6880336667479874) internal successors, (60469), 16396 states have internal predecessors, (60469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:08:47,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16397 states to 16397 states and 60469 transitions. [2022-02-09 01:08:47,326 INFO L78 Accepts]: Start accepts. Automaton has 16397 states and 60469 transitions. Word has length 124 [2022-02-09 01:08:47,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:08:47,326 INFO L470 AbstractCegarLoop]: Abstraction has 16397 states and 60469 transitions. [2022-02-09 01:08:47,327 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 79 states have (on average 4.012658227848101) internal successors, (317), 79 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-02-09 01:08:47,327 INFO L276 IsEmpty]: Start isEmpty. Operand 16397 states and 60469 transitions. [2022-02-09 01:08:47,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-09 01:08:47,357 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:08:47,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-02-09 01:08:47,374 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2022-02-09 01:08:47,558 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-02-09 01:08:47,558 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-09 01:08:47,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:08:47,663 INFO L85 PathProgramCache]: Analyzing trace with hash 677970192, now seen corresponding path program 20 times [2022-02-09 01:08:47,663 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:08:47,663 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337531669] [2022-02-09 01:08:47,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:08:47,663 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:08:47,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:08:48,199 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:08:48,200 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:08:48,200 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337531669] [2022-02-09 01:08:48,200 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337531669] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 01:08:48,200 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198060894] [2022-02-09 01:08:48,200 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-09 01:08:48,200 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 01:08:48,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 01:08:48,201 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-02-09 01:08:48,202 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-02-09 01:08:48,312 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-09 01:08:48,312 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-09 01:08:48,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 55 conjunts are in the unsatisfiable core [2022-02-09 01:08:48,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 01:08:48,741 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:08:48,741 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-02-09 01:08:49,048 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-09 01:08:49,049 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 01:08:49,354 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:08:49,354 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-02-09 01:08:49,739 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-09 01:08:49,740 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1198060894] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 01:08:49,740 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 01:08:49,740 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 18, 17] total 51 [2022-02-09 01:08:49,740 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264800884] [2022-02-09 01:08:49,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 01:08:49,740 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-02-09 01:08:49,740 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:08:49,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-02-09 01:08:49,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=2283, Unknown=0, NotChecked=0, Total=2550 [2022-02-09 01:08:49,741 INFO L87 Difference]: Start difference. First operand 16397 states and 60469 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-02-09 01:09:15,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:09:15,189 INFO L93 Difference]: Finished difference Result 116207 states and 425045 transitions. [2022-02-09 01:09:15,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 461 states. [2022-02-09 01:09:15,189 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-02-09 01:09:15,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:09:15,899 INFO L225 Difference]: With dead ends: 116207 [2022-02-09 01:09:15,899 INFO L226 Difference]: Without dead ends: 115649 [2022-02-09 01:09:15,906 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 780 GetRequests, 262 SyntacticMatches, 32 SemanticMatches, 486 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107252 ImplicationChecksByTransitivity, 19.5s TimeCoverageRelationStatistics Valid=17926, Invalid=219730, Unknown=0, NotChecked=0, Total=237656 [2022-02-09 01:09:15,907 INFO L933 BasicCegarLoop]: 726 mSDtfsCounter, 3625 mSDsluCounter, 20517 mSDsCounter, 0 mSdLazyCounter, 9186 mSolverCounterSat, 333 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3625 SdHoareTripleChecker+Valid, 19002 SdHoareTripleChecker+Invalid, 31185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 333 IncrementalHoareTripleChecker+Valid, 9186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 21666 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-02-09 01:09:15,907 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3625 Valid, 19002 Invalid, 31185 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [333 Valid, 9186 Invalid, 0 Unknown, 21666 Unchecked, 4.1s Time] [2022-02-09 01:09:16,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115649 states. [2022-02-09 01:09:17,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115649 to 16981. [2022-02-09 01:09:17,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16981 states, 16980 states have (on average 3.70547703180212) internal successors, (62919), 16980 states have internal predecessors, (62919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:09:17,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16981 states to 16981 states and 62919 transitions. [2022-02-09 01:09:17,127 INFO L78 Accepts]: Start accepts. Automaton has 16981 states and 62919 transitions. Word has length 124 [2022-02-09 01:09:17,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:09:17,128 INFO L470 AbstractCegarLoop]: Abstraction has 16981 states and 62919 transitions. [2022-02-09 01:09:17,128 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-02-09 01:09:17,128 INFO L276 IsEmpty]: Start isEmpty. Operand 16981 states and 62919 transitions. [2022-02-09 01:09:17,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-09 01:09:17,157 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:09:17,157 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-02-09 01:09:17,173 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-02-09 01:09:17,358 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-02-09 01:09:17,358 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-09 01:09:17,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:09:17,358 INFO L85 PathProgramCache]: Analyzing trace with hash 2092648740, now seen corresponding path program 21 times [2022-02-09 01:09:17,358 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:09:17,359 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183791931] [2022-02-09 01:09:17,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:09:17,359 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:09:17,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:09:17,880 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:09:17,880 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:09:17,880 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183791931] [2022-02-09 01:09:17,880 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183791931] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 01:09:17,880 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102433618] [2022-02-09 01:09:17,880 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-09 01:09:17,880 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 01:09:17,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 01:09:17,881 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-02-09 01:09:17,882 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-02-09 01:09:17,997 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-02-09 01:09:17,997 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-09 01:09:17,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 55 conjunts are in the unsatisfiable core [2022-02-09 01:09:18,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 01:09:18,517 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:09:18,517 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-02-09 01:09:18,866 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-09 01:09:18,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 01:09:19,195 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:09:19,195 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-02-09 01:09:19,584 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-09 01:09:19,585 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [102433618] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 01:09:19,585 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 01:09:19,585 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 18, 17] total 49 [2022-02-09 01:09:19,585 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701758001] [2022-02-09 01:09:19,585 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 01:09:19,585 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-02-09 01:09:19,585 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:09:19,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-02-09 01:09:19,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=2097, Unknown=0, NotChecked=0, Total=2352 [2022-02-09 01:09:19,586 INFO L87 Difference]: Start difference. First operand 16981 states and 62919 transitions. Second operand has 49 states, 49 states have (on average 6.204081632653061) internal successors, (304), 49 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:09:41,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:09:41,671 INFO L93 Difference]: Finished difference Result 93956 states and 341569 transitions. [2022-02-09 01:09:41,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 366 states. [2022-02-09 01:09:41,672 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 6.204081632653061) internal successors, (304), 49 states have internal predecessors, (304), 0 states have call successors, (0), 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-02-09 01:09:41,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:09:42,156 INFO L225 Difference]: With dead ends: 93956 [2022-02-09 01:09:42,156 INFO L226 Difference]: Without dead ends: 93371 [2022-02-09 01:09:42,166 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 637 GetRequests, 243 SyntacticMatches, 6 SemanticMatches, 388 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67865 ImplicationChecksByTransitivity, 17.3s TimeCoverageRelationStatistics Valid=13311, Invalid=138399, Unknown=0, NotChecked=0, Total=151710 [2022-02-09 01:09:42,166 INFO L933 BasicCegarLoop]: 541 mSDtfsCounter, 3398 mSDsluCounter, 15353 mSDsCounter, 0 mSdLazyCounter, 8406 mSolverCounterSat, 316 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3398 SdHoareTripleChecker+Valid, 14126 SdHoareTripleChecker+Invalid, 18378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 316 IncrementalHoareTripleChecker+Valid, 8406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9656 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-02-09 01:09:42,166 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3398 Valid, 14126 Invalid, 18378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [316 Valid, 8406 Invalid, 0 Unknown, 9656 Unchecked, 4.0s Time] [2022-02-09 01:09:42,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93371 states. [2022-02-09 01:09:43,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93371 to 17001. [2022-02-09 01:09:43,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17001 states, 17000 states have (on average 3.7067058823529413) internal successors, (63014), 17000 states have internal predecessors, (63014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:09:43,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17001 states to 17001 states and 63014 transitions. [2022-02-09 01:09:43,473 INFO L78 Accepts]: Start accepts. Automaton has 17001 states and 63014 transitions. Word has length 124 [2022-02-09 01:09:43,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:09:43,474 INFO L470 AbstractCegarLoop]: Abstraction has 17001 states and 63014 transitions. [2022-02-09 01:09:43,474 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 6.204081632653061) internal successors, (304), 49 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:09:43,474 INFO L276 IsEmpty]: Start isEmpty. Operand 17001 states and 63014 transitions. [2022-02-09 01:09:43,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-09 01:09:43,504 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:09:43,504 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-02-09 01:09:43,523 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-02-09 01:09:43,704 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-02-09 01:09:43,705 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-09 01:09:43,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:09:43,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1474847118, now seen corresponding path program 22 times [2022-02-09 01:09:43,706 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:09:43,706 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501916252] [2022-02-09 01:09:43,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:09:43,706 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:09:43,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:09:44,306 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:09:44,307 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:09:44,307 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501916252] [2022-02-09 01:09:44,307 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501916252] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 01:09:44,307 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210457310] [2022-02-09 01:09:44,307 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-09 01:09:44,307 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 01:09:44,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 01:09:44,308 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-02-09 01:09:44,309 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-02-09 01:09:44,422 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-09 01:09:44,422 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-09 01:09:44,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 78 conjunts are in the unsatisfiable core [2022-02-09 01:09:44,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 01:09:45,040 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-02-09 01:09:45,519 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-09 01:09:45,691 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-09 01:09:45,791 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-09 01:09:45,973 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:09:45,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-02-09 01:09:46,233 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:09:46,234 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 01:09:46,634 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1396 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1396) 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 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)))))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-02-09 01:09:46,701 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1396 (Array Int Int)) (v_ArrVal_1395 (Array Int 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_1395) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1396) 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-02-09 01:09:46,805 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1396 (Array Int Int)) (v_ArrVal_1395 (Array Int 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_1395) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1396) 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))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-02-09 01:09:46,827 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1396 (Array Int Int)) (v_ArrVal_1395 (Array Int Int)) (v_ArrVal_1394 (Array Int 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_1394) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1395) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1396) 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))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-02-09 01:09:46,936 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1396 (Array Int Int)) (v_ArrVal_1395 (Array Int Int)) (v_ArrVal_1394 (Array Int 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_1394) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1395) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1396) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (= (+ c_~res1~0 (select .cse0 |c_ULTIMATE.start_main_#t~ret12#1.offset|)) (+ c_~res2~0 (select .cse0 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4)))))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-02-09 01:09:46,959 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1396 (Array Int Int)) (v_ArrVal_1395 (Array Int Int)) (v_ArrVal_1394 (Array Int 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_1394) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1395) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1396) |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|)))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-02-09 01:09:46,972 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1396 (Array Int Int)) (v_ArrVal_1395 (Array Int Int)) (v_ArrVal_1394 (Array Int Int))) (or (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1394) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1395) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1396) |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))) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-02-09 01:09:47,232 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:09:47,233 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-02-09 01:09:47,240 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:09:47,240 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-02-09 01:09:47,251 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:09:47,251 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-02-09 01:09:47,288 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:09:47,288 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-02-09 01:09:47,298 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:09:47,299 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-02-09 01:09:48,308 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-02-09 01:09:48,308 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210457310] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 01:09:48,308 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 01:09:48,308 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 33, 29] total 77 [2022-02-09 01:09:48,309 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326810211] [2022-02-09 01:09:48,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 01:09:48,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-02-09 01:09:48,309 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:09:48,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-02-09 01:09:48,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=482, Invalid=4366, Unknown=10, NotChecked=994, Total=5852 [2022-02-09 01:09:48,310 INFO L87 Difference]: Start difference. First operand 17001 states and 63014 transitions. Second operand has 77 states, 77 states have (on average 3.8051948051948052) internal successors, (293), 77 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-02-09 01:09:55,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:09:55,539 INFO L93 Difference]: Finished difference Result 37388 states and 136707 transitions. [2022-02-09 01:09:55,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-02-09 01:09:55,539 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 77 states have (on average 3.8051948051948052) internal successors, (293), 77 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-02-09 01:09:55,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:09:55,643 INFO L225 Difference]: With dead ends: 37388 [2022-02-09 01:09:55,643 INFO L226 Difference]: Without dead ends: 37238 [2022-02-09 01:09:55,644 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 205 SyntacticMatches, 8 SemanticMatches, 122 ConstructedPredicates, 7 IntricatePredicates, 2 DeprecatedPredicates, 4502 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=1332, Invalid=12258, Unknown=10, NotChecked=1652, Total=15252 [2022-02-09 01:09:55,644 INFO L933 BasicCegarLoop]: 318 mSDtfsCounter, 1694 mSDsluCounter, 10497 mSDsCounter, 0 mSdLazyCounter, 3515 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1694 SdHoareTripleChecker+Valid, 10041 SdHoareTripleChecker+Invalid, 8014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 3515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4444 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-02-09 01:09:55,644 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1694 Valid, 10041 Invalid, 8014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 3515 Invalid, 0 Unknown, 4444 Unchecked, 1.4s Time] [2022-02-09 01:09:55,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37238 states. [2022-02-09 01:09:56,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37238 to 17561. [2022-02-09 01:09:56,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17561 states, 17560 states have (on average 3.715603644646925) internal successors, (65246), 17560 states have internal predecessors, (65246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:09:56,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17561 states to 17561 states and 65246 transitions. [2022-02-09 01:09:56,249 INFO L78 Accepts]: Start accepts. Automaton has 17561 states and 65246 transitions. Word has length 124 [2022-02-09 01:09:56,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:09:56,249 INFO L470 AbstractCegarLoop]: Abstraction has 17561 states and 65246 transitions. [2022-02-09 01:09:56,249 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 77 states have (on average 3.8051948051948052) internal successors, (293), 77 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-02-09 01:09:56,249 INFO L276 IsEmpty]: Start isEmpty. Operand 17561 states and 65246 transitions. [2022-02-09 01:09:56,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-09 01:09:56,281 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:09:56,282 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-02-09 01:09:56,298 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-02-09 01:09:56,482 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-02-09 01:09:56,482 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-09 01:09:56,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:09:56,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1421602086, now seen corresponding path program 23 times [2022-02-09 01:09:56,483 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:09:56,483 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216537681] [2022-02-09 01:09:56,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:09:56,483 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:09:56,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:09:56,985 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:09:56,985 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:09:56,985 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216537681] [2022-02-09 01:09:56,986 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216537681] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 01:09:56,986 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717962728] [2022-02-09 01:09:56,986 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-09 01:09:56,986 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 01:09:56,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 01:09:56,987 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-02-09 01:09:56,988 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-02-09 01:09:57,099 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-02-09 01:09:57,099 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-09 01:09:57,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 78 conjunts are in the unsatisfiable core [2022-02-09 01:09:57,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 01:09:57,164 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-09 01:09:57,196 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-09 01:09:57,197 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-02-09 01:09:57,442 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-02-09 01:09:57,442 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-02-09 01:09:57,579 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-02-09 01:09:57,834 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-09 01:09:58,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, 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-02-09 01:09:58,087 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-02-09 01:09:58,265 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:09:58,266 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-02-09 01:09:58,565 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:09:58,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 01:09:58,998 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1435 (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_1435) 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-02-09 01:09:59,055 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1435 (Array Int Int)) (v_ArrVal_1434 (Array Int Int)) (~M~0 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_1434) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1435) 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-02-09 01:09:59,108 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1435 (Array Int Int)) (v_ArrVal_1434 (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_1434) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1435) 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-02-09 01:09:59,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 10 treesize of output 8 [2022-02-09 01:09:59,479 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-02-09 01:09:59,479 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1717962728] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 01:09:59,479 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 01:09:59,479 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 30, 20] total 65 [2022-02-09 01:09:59,479 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444924824] [2022-02-09 01:09:59,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 01:09:59,479 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-02-09 01:09:59,479 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:09:59,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-02-09 01:09:59,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=3444, Unknown=3, NotChecked=366, Total=4160 [2022-02-09 01:09:59,480 INFO L87 Difference]: Start difference. First operand 17561 states and 65246 transitions. Second operand has 65 states, 65 states have (on average 4.630769230769231) internal successors, (301), 65 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:10:35,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:10:35,237 INFO L93 Difference]: Finished difference Result 94532 states and 345562 transitions. [2022-02-09 01:10:35,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 519 states. [2022-02-09 01:10:35,237 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 4.630769230769231) internal successors, (301), 65 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2022-02-09 01:10:35,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:10:35,582 INFO L225 Difference]: With dead ends: 94532 [2022-02-09 01:10:35,582 INFO L226 Difference]: Without dead ends: 94082 [2022-02-09 01:10:35,593 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 812 GetRequests, 232 SyntacticMatches, 20 SemanticMatches, 560 ConstructedPredicates, 3 IntricatePredicates, 5 DeprecatedPredicates, 141464 ImplicationChecksByTransitivity, 29.4s TimeCoverageRelationStatistics Valid=22968, Invalid=288963, Unknown=3, NotChecked=3348, Total=315282 [2022-02-09 01:10:35,594 INFO L933 BasicCegarLoop]: 701 mSDtfsCounter, 5523 mSDsluCounter, 16567 mSDsCounter, 0 mSdLazyCounter, 9442 mSolverCounterSat, 493 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5523 SdHoareTripleChecker+Valid, 15651 SdHoareTripleChecker+Invalid, 22439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 493 IncrementalHoareTripleChecker+Valid, 9442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 12504 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-02-09 01:10:35,594 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5523 Valid, 15651 Invalid, 22439 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [493 Valid, 9442 Invalid, 0 Unknown, 12504 Unchecked, 4.5s Time] [2022-02-09 01:10:35,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94082 states. [2022-02-09 01:10:36,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94082 to 17409. [2022-02-09 01:10:36,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17409 states, 17408 states have (on average 3.7111672794117645) internal successors, (64604), 17408 states have internal predecessors, (64604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:10:36,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17409 states to 17409 states and 64604 transitions. [2022-02-09 01:10:36,976 INFO L78 Accepts]: Start accepts. Automaton has 17409 states and 64604 transitions. Word has length 124 [2022-02-09 01:10:36,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:10:36,976 INFO L470 AbstractCegarLoop]: Abstraction has 17409 states and 64604 transitions. [2022-02-09 01:10:36,976 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 4.630769230769231) internal successors, (301), 65 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:10:36,976 INFO L276 IsEmpty]: Start isEmpty. Operand 17409 states and 64604 transitions. [2022-02-09 01:10:37,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-09 01:10:37,009 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:10:37,009 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-02-09 01:10:37,028 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-02-09 01:10:37,209 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-02-09 01:10:37,210 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-09 01:10:37,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:10:37,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1934802414, now seen corresponding path program 24 times [2022-02-09 01:10:37,210 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:10:37,210 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264459747] [2022-02-09 01:10:37,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:10:37,211 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:10:37,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:10:37,750 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:10:37,750 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:10:37,750 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264459747] [2022-02-09 01:10:37,750 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264459747] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 01:10:37,750 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753444671] [2022-02-09 01:10:37,750 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-09 01:10:37,750 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 01:10:37,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 01:10:37,751 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-02-09 01:10:37,754 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-02-09 01:10:37,876 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-02-09 01:10:37,876 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-09 01:10:37,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 55 conjunts are in the unsatisfiable core [2022-02-09 01:10:37,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 01:10:38,335 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:10:38,335 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-02-09 01:10:38,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-02-09 01:10:38,656 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 01:10:38,975 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:10:38,976 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-02-09 01:10:39,450 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-09 01:10:39,451 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [753444671] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 01:10:39,451 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 01:10:39,451 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 18, 17] total 51 [2022-02-09 01:10:39,451 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864132195] [2022-02-09 01:10:39,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 01:10:39,451 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-02-09 01:10:39,452 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:10:39,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-02-09 01:10:39,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=2260, Unknown=0, NotChecked=0, Total=2550 [2022-02-09 01:10:39,453 INFO L87 Difference]: Start difference. First operand 17409 states and 64604 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-02-09 01:11:02,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:11:02,502 INFO L93 Difference]: Finished difference Result 91418 states and 334526 transitions. [2022-02-09 01:11:02,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 385 states. [2022-02-09 01:11:02,503 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-02-09 01:11:02,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:11:02,830 INFO L225 Difference]: With dead ends: 91418 [2022-02-09 01:11:02,830 INFO L226 Difference]: Without dead ends: 90968 [2022-02-09 01:11:02,837 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 670 GetRequests, 235 SyntacticMatches, 25 SemanticMatches, 410 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76418 ImplicationChecksByTransitivity, 18.5s TimeCoverageRelationStatistics Valid=16789, Invalid=152543, Unknown=0, NotChecked=0, Total=169332 [2022-02-09 01:11:02,837 INFO L933 BasicCegarLoop]: 510 mSDtfsCounter, 3637 mSDsluCounter, 14201 mSDsCounter, 0 mSdLazyCounter, 6797 mSolverCounterSat, 321 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3637 SdHoareTripleChecker+Valid, 13314 SdHoareTripleChecker+Invalid, 19080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 321 IncrementalHoareTripleChecker+Valid, 6797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 11962 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-02-09 01:11:02,838 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3637 Valid, 13314 Invalid, 19080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [321 Valid, 6797 Invalid, 0 Unknown, 11962 Unchecked, 3.3s Time] [2022-02-09 01:11:02,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90968 states. [2022-02-09 01:11:04,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90968 to 17953. [2022-02-09 01:11:04,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17953 states, 17952 states have (on average 3.7199197860962565) internal successors, (66780), 17952 states have internal predecessors, (66780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:11:04,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17953 states to 17953 states and 66780 transitions. [2022-02-09 01:11:04,185 INFO L78 Accepts]: Start accepts. Automaton has 17953 states and 66780 transitions. Word has length 124 [2022-02-09 01:11:04,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:11:04,186 INFO L470 AbstractCegarLoop]: Abstraction has 17953 states and 66780 transitions. [2022-02-09 01:11:04,186 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-02-09 01:11:04,186 INFO L276 IsEmpty]: Start isEmpty. Operand 17953 states and 66780 transitions. [2022-02-09 01:11:04,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-09 01:11:04,220 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:11:04,221 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-02-09 01:11:04,239 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-02-09 01:11:04,421 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-02-09 01:11:04,421 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-09 01:11:04,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:11:04,422 INFO L85 PathProgramCache]: Analyzing trace with hash -945486334, now seen corresponding path program 25 times [2022-02-09 01:11:04,422 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:11:04,422 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816201765] [2022-02-09 01:11:04,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:11:04,422 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:11:04,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:11:04,999 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:11:04,999 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:11:04,999 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816201765] [2022-02-09 01:11:05,000 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816201765] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 01:11:05,000 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572491797] [2022-02-09 01:11:05,000 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-02-09 01:11:05,000 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 01:11:05,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 01:11:05,001 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-02-09 01:11:05,002 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-02-09 01:11:05,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:11:05,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 82 conjunts are in the unsatisfiable core [2022-02-09 01:11:05,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 01:11:05,249 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-09 01:11:05,578 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-09 01:11:05,579 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-02-09 01:11:05,786 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-02-09 01:11:06,263 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-09 01:11:06,437 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-09 01:11: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, 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-02-09 01:11:06,722 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:11:06,722 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-02-09 01:11:07,082 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:11:07,082 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 01:11:07,465 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1505 (Array Int Int)) (~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1505) 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)))) is different from false [2022-02-09 01:11:07,522 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1505 (Array Int Int)) (v_ArrVal_1504 (Array Int Int)) (~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1504) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1505) 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)))))) (not (< ~M~0 c_~N~0)))) is different from false [2022-02-09 01:11:07,583 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1505 (Array Int Int)) (v_ArrVal_1504 (Array Int Int)) (~M~0 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_1504) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1505) 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))))) is different from false [2022-02-09 01:11:07,607 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1505 (Array Int Int)) (v_ArrVal_1504 (Array Int Int)) (v_ArrVal_1503 (Array Int Int)) (~M~0 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_1503) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1504) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1505) 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-02-09 01:11:07,714 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1505 (Array Int Int)) (v_ArrVal_1504 (Array Int Int)) (v_ArrVal_1503 (Array Int Int)) (~M~0 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_1503) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1504) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1505) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (= (+ c_~res2~0 (select .cse0 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4)))) (+ c_~res1~0 (select .cse0 |c_ULTIMATE.start_main_#t~ret12#1.offset|)))))) is different from false [2022-02-09 01:11:07,739 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1505 (Array Int Int)) (v_ArrVal_1504 (Array Int Int)) (v_ArrVal_1503 (Array Int Int)) (~M~0 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_1503) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1504) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1505) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (= (+ c_~res1~0 (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (+ c_~res2~0 (select .cse0 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))))))) is different from false [2022-02-09 01:11:07,753 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1505 (Array Int Int)) (v_ArrVal_1504 (Array Int Int)) (v_ArrVal_1503 (Array Int Int)) (~M~0 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_1503) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1504) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1505) |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))) (not (< ~M~0 c_~N~0)))) is different from false [2022-02-09 01:11:07,993 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:11:07,993 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-02-09 01:11:08,015 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:11:08,016 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 806 treesize of output 770 [2022-02-09 01:11:08,026 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:11:08,026 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 758 treesize of output 642 [2022-02-09 01:11:08,037 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:11:08,038 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 630 treesize of output 578 [2022-02-09 01:11:08,050 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:11:08,051 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 299 treesize of output 280 [2022-02-09 01:11:10,831 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-02-09 01:11:10,854 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-02-09 01:11:10,854 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1572491797] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 01:11:10,854 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 01:11:10,854 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 33, 31] total 79 [2022-02-09 01:11:10,854 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131915001] [2022-02-09 01:11:10,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 01:11:10,855 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2022-02-09 01:11:10,855 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:11:10,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2022-02-09 01:11:10,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=619, Invalid=4512, Unknown=9, NotChecked=1022, Total=6162 [2022-02-09 01:11:10,855 INFO L87 Difference]: Start difference. First operand 17953 states and 66780 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-02-09 01:11:16,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:11:16,513 INFO L93 Difference]: Finished difference Result 48464 states and 177716 transitions. [2022-02-09 01:11:16,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2022-02-09 01:11:16,513 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-02-09 01:11:16,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:11:16,657 INFO L225 Difference]: With dead ends: 48464 [2022-02-09 01:11:16,657 INFO L226 Difference]: Without dead ends: 48164 [2022-02-09 01:11:16,659 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 205 SyntacticMatches, 9 SemanticMatches, 146 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 7117 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1996, Invalid=17763, Unknown=9, NotChecked=1988, Total=21756 [2022-02-09 01:11:16,659 INFO L933 BasicCegarLoop]: 324 mSDtfsCounter, 2342 mSDsluCounter, 12006 mSDsCounter, 0 mSdLazyCounter, 3905 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2342 SdHoareTripleChecker+Valid, 11244 SdHoareTripleChecker+Invalid, 11249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 3905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7254 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-02-09 01:11:16,659 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2342 Valid, 11244 Invalid, 11249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 3905 Invalid, 0 Unknown, 7254 Unchecked, 1.6s Time] [2022-02-09 01:11:16,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48164 states. [2022-02-09 01:11:17,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48164 to 18137. [2022-02-09 01:11:17,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18137 states, 18136 states have (on average 3.720004411116012) internal successors, (67466), 18136 states have internal predecessors, (67466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:11:17,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18137 states to 18137 states and 67466 transitions. [2022-02-09 01:11:17,315 INFO L78 Accepts]: Start accepts. Automaton has 18137 states and 67466 transitions. Word has length 124 [2022-02-09 01:11:17,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:11:17,315 INFO L470 AbstractCegarLoop]: Abstraction has 18137 states and 67466 transitions. [2022-02-09 01:11:17,316 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-02-09 01:11:17,316 INFO L276 IsEmpty]: Start isEmpty. Operand 18137 states and 67466 transitions. [2022-02-09 01:11:17,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-09 01:11:17,350 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:11:17,350 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-02-09 01:11:17,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-02-09 01:11:17,551 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-02-09 01:11:17,551 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-09 01:11:17,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:11:17,551 INFO L85 PathProgramCache]: Analyzing trace with hash 724968554, now seen corresponding path program 26 times [2022-02-09 01:11:17,551 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:11:17,551 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252935910] [2022-02-09 01:11:17,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:11:17,552 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:11:17,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:11:18,027 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:11:18,027 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:11:18,027 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252935910] [2022-02-09 01:11:18,028 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252935910] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 01:11:18,028 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214732568] [2022-02-09 01:11:18,028 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-09 01:11:18,028 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 01:11:18,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 01:11:18,029 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-02-09 01:11:18,029 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-02-09 01:11:18,143 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-09 01:11:18,143 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-09 01:11:18,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 55 conjunts are in the unsatisfiable core [2022-02-09 01:11:18,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 01:11:18,591 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:11:18,592 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-02-09 01:11:18,909 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-09 01:11:18,910 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 01:11:19,176 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:11:19,176 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-02-09 01:11:19,664 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-09 01:11:19,664 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214732568] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 01:11:19,664 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 01:11:19,664 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 18, 17] total 51 [2022-02-09 01:11:19,664 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679584408] [2022-02-09 01:11:19,664 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 01:11:19,664 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-02-09 01:11:19,665 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:11:19,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-02-09 01:11:19,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=374, Invalid=2176, Unknown=0, NotChecked=0, Total=2550 [2022-02-09 01:11:19,665 INFO L87 Difference]: Start difference. First operand 18137 states and 67466 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-02-09 01:11:38,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:11:38,729 INFO L93 Difference]: Finished difference Result 75431 states and 278135 transitions. [2022-02-09 01:11:38,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 345 states. [2022-02-09 01:11:38,729 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-02-09 01:11:38,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:11:39,023 INFO L225 Difference]: With dead ends: 75431 [2022-02-09 01:11:39,023 INFO L226 Difference]: Without dead ends: 75131 [2022-02-09 01:11:39,028 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 668 GetRequests, 267 SyntacticMatches, 27 SemanticMatches, 374 ConstructedPredicates, 0 IntricatePredicates, 5 DeprecatedPredicates, 66614 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=15372, Invalid=125628, Unknown=0, NotChecked=0, Total=141000 [2022-02-09 01:11:39,028 INFO L933 BasicCegarLoop]: 466 mSDtfsCounter, 3744 mSDsluCounter, 11413 mSDsCounter, 0 mSdLazyCounter, 5681 mSolverCounterSat, 297 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3744 SdHoareTripleChecker+Valid, 10847 SdHoareTripleChecker+Invalid, 15326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 297 IncrementalHoareTripleChecker+Valid, 5681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9348 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-02-09 01:11:39,029 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3744 Valid, 10847 Invalid, 15326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [297 Valid, 5681 Invalid, 0 Unknown, 9348 Unchecked, 2.9s Time] [2022-02-09 01:11:39,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75131 states. [2022-02-09 01:11:40,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75131 to 19778. [2022-02-09 01:11:40,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19778 states, 19777 states have (on average 3.7325681347019266) internal successors, (73819), 19777 states have internal predecessors, (73819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:11:40,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19778 states to 19778 states and 73819 transitions. [2022-02-09 01:11:40,112 INFO L78 Accepts]: Start accepts. Automaton has 19778 states and 73819 transitions. Word has length 124 [2022-02-09 01:11:40,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:11:40,112 INFO L470 AbstractCegarLoop]: Abstraction has 19778 states and 73819 transitions. [2022-02-09 01:11:40,112 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-02-09 01:11:40,112 INFO L276 IsEmpty]: Start isEmpty. Operand 19778 states and 73819 transitions. [2022-02-09 01:11:40,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-09 01:11:40,152 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:11:40,153 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-02-09 01:11:40,171 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-02-09 01:11:40,353 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-02-09 01:11:40,353 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-09 01:11:40,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:11:40,478 INFO L85 PathProgramCache]: Analyzing trace with hash -941104392, now seen corresponding path program 27 times [2022-02-09 01:11:40,478 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:11:40,478 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48939935] [2022-02-09 01:11:40,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:11:40,478 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:11:40,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:11:41,001 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:11:41,001 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:11:41,001 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48939935] [2022-02-09 01:11:41,001 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48939935] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 01:11:41,001 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518507052] [2022-02-09 01:11:41,001 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-09 01:11:41,001 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 01:11:41,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 01:11:41,003 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-02-09 01:11:41,004 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-02-09 01:11:41,124 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-02-09 01:11:41,124 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-09 01:11:41,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 58 conjunts are in the unsatisfiable core [2022-02-09 01:11:41,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 01:11:41,799 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:11:41,800 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-02-09 01:11:42,172 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-09 01:11:42,172 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 01:11:42,416 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:11:42,416 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-02-09 01:11:42,827 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-09 01:11:42,827 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1518507052] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 01:11:42,827 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 01:11:42,827 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 23, 17] total 54 [2022-02-09 01:11:42,827 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930344273] [2022-02-09 01:11:42,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 01:11:42,828 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-02-09 01:11:42,828 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:11:42,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-02-09 01:11:42,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=380, Invalid=2482, Unknown=0, NotChecked=0, Total=2862 [2022-02-09 01:11:42,828 INFO L87 Difference]: Start difference. First operand 19778 states and 73819 transitions. Second operand has 54 states, 54 states have (on average 5.648148148148148) internal successors, (305), 54 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-02-09 01:12:01,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:12:01,734 INFO L93 Difference]: Finished difference Result 75856 states and 279292 transitions. [2022-02-09 01:12:01,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 312 states. [2022-02-09 01:12:01,735 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 5.648148148148148) internal successors, (305), 54 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-02-09 01:12:01,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:12:02,036 INFO L225 Difference]: With dead ends: 75856 [2022-02-09 01:12:02,036 INFO L226 Difference]: Without dead ends: 75556 [2022-02-09 01:12:02,041 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 597 GetRequests, 228 SyntacticMatches, 20 SemanticMatches, 349 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56551 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=13291, Invalid=109559, Unknown=0, NotChecked=0, Total=122850 [2022-02-09 01:12:02,042 INFO L933 BasicCegarLoop]: 458 mSDtfsCounter, 3860 mSDsluCounter, 11231 mSDsCounter, 0 mSdLazyCounter, 7698 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3860 SdHoareTripleChecker+Valid, 10683 SdHoareTripleChecker+Invalid, 11738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 7698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3755 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-02-09 01:12:02,042 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3860 Valid, 10683 Invalid, 11738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 7698 Invalid, 0 Unknown, 3755 Unchecked, 3.8s Time] [2022-02-09 01:12:02,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75556 states. [2022-02-09 01:12:03,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75556 to 18430. [2022-02-09 01:12:03,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18430 states, 18429 states have (on average 3.7268978240816106) internal successors, (68683), 18429 states have internal predecessors, (68683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:12:03,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18430 states to 18430 states and 68683 transitions. [2022-02-09 01:12:03,267 INFO L78 Accepts]: Start accepts. Automaton has 18430 states and 68683 transitions. Word has length 124 [2022-02-09 01:12:03,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:12:03,268 INFO L470 AbstractCegarLoop]: Abstraction has 18430 states and 68683 transitions. [2022-02-09 01:12:03,268 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 5.648148148148148) internal successors, (305), 54 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-02-09 01:12:03,268 INFO L276 IsEmpty]: Start isEmpty. Operand 18430 states and 68683 transitions. [2022-02-09 01:12:03,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-09 01:12:03,308 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:12:03,308 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-02-09 01:12:03,325 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-02-09 01:12:03,508 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-02-09 01:12:03,509 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-09 01:12:03,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:12:03,509 INFO L85 PathProgramCache]: Analyzing trace with hash 65989308, now seen corresponding path program 28 times [2022-02-09 01:12:03,509 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:12:03,509 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874789305] [2022-02-09 01:12:03,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:12:03,509 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:12:03,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:12:04,114 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:12:04,114 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:12:04,114 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874789305] [2022-02-09 01:12:04,115 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874789305] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 01:12:04,115 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667523240] [2022-02-09 01:12:04,115 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-09 01:12:04,115 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 01:12:04,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 01:12:04,116 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-02-09 01:12:04,116 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-02-09 01:12:04,239 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-09 01:12:04,240 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-09 01:12:04,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 78 conjunts are in the unsatisfiable core [2022-02-09 01:12:04,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 01:12:04,890 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-02-09 01:12:05,402 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-09 01:12:05,581 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-09 01:12:05,692 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-09 01:12:05,879 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:12:05,880 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-02-09 01:12:06,157 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:12:06,158 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 01:12:06,563 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1606 (Array Int Int))) (or (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1606) 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))) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-02-09 01:12:06,626 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1606 (Array Int Int)) (v_ArrVal_1605 (Array Int 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_1605) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1606) c_~A~0.base))) (= (+ (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0) (+ (select .cse0 (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-02-09 01:12:06,689 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1606 (Array Int Int)) (v_ArrVal_1605 (Array Int 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_1605) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1606) 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))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-02-09 01:12:06,713 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1604 (Array Int Int)) (~M~0 Int) (v_ArrVal_1606 (Array Int Int)) (v_ArrVal_1605 (Array Int 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_1604) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1605) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1606) 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))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-02-09 01:12:06,835 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1604 (Array Int Int)) (~M~0 Int) (v_ArrVal_1606 (Array Int Int)) (v_ArrVal_1605 (Array Int Int))) (or (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1604) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1605) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1606) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (= (+ (select .cse0 |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~res1~0) (+ (select .cse0 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))) c_~res2~0))) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-02-09 01:12:06,861 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1604 (Array Int Int)) (~M~0 Int) (v_ArrVal_1606 (Array Int Int)) (v_ArrVal_1605 (Array Int 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_1604) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1605) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1606) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (= (+ c_~res1~0 (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (+ (select .cse0 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~res2~0))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-02-09 01:12:06,876 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1604 (Array Int Int)) (~M~0 Int) (v_ArrVal_1606 (Array Int Int)) (v_ArrVal_1605 (Array Int 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_1604) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1605) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1606) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (= (+ c_~res2~0 (select .cse0 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (+ (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~res1~0))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-02-09 01:12:07,121 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:12:07,121 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-02-09 01:12:07,128 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:12:07,128 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 194 treesize of output 194 [2022-02-09 01:12:07,135 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:12:07,136 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 182 treesize of output 162 [2022-02-09 01:12:07,144 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:12:07,144 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 150 treesize of output 146 [2022-02-09 01:12:07,154 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:12:07,154 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 70 treesize of output 75 [2022-02-09 01:12:08,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-02-09 01:12:08,242 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667523240] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 01:12:08,242 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 01:12:08,242 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 33, 29] total 78 [2022-02-09 01:12:08,242 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923005251] [2022-02-09 01:12:08,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 01:12:08,243 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2022-02-09 01:12:08,243 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:12:08,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2022-02-09 01:12:08,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=534, Invalid=4455, Unknown=9, NotChecked=1008, Total=6006 [2022-02-09 01:12:08,243 INFO L87 Difference]: Start difference. First operand 18430 states and 68683 transitions. Second operand has 78 states, 78 states have (on average 3.769230769230769) internal successors, (294), 78 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-02-09 01:12:16,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:12:16,806 INFO L93 Difference]: Finished difference Result 39809 states and 145982 transitions. [2022-02-09 01:12:16,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2022-02-09 01:12:16,806 INFO L78 Accepts]: Start accepts. Automaton has has 78 states, 78 states have (on average 3.769230769230769) internal successors, (294), 78 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-02-09 01:12:16,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:12:17,018 INFO L225 Difference]: With dead ends: 39809 [2022-02-09 01:12:17,019 INFO L226 Difference]: Without dead ends: 39509 [2022-02-09 01:12:17,019 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 210 SyntacticMatches, 16 SemanticMatches, 138 ConstructedPredicates, 7 IntricatePredicates, 3 DeprecatedPredicates, 6722 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=1949, Invalid=15626, Unknown=9, NotChecked=1876, Total=19460 [2022-02-09 01:12:17,020 INFO L933 BasicCegarLoop]: 281 mSDtfsCounter, 2348 mSDsluCounter, 8972 mSDsCounter, 0 mSdLazyCounter, 3128 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2348 SdHoareTripleChecker+Valid, 8635 SdHoareTripleChecker+Invalid, 7055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 3128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3853 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-02-09 01:12:17,020 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2348 Valid, 8635 Invalid, 7055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 3128 Invalid, 0 Unknown, 3853 Unchecked, 1.4s Time] [2022-02-09 01:12:17,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39509 states. [2022-02-09 01:12:17,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39509 to 18618. [2022-02-09 01:12:17,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18618 states, 18617 states have (on average 3.729064833216952) internal successors, (69424), 18617 states have internal predecessors, (69424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:12:17,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18618 states to 18618 states and 69424 transitions. [2022-02-09 01:12:17,666 INFO L78 Accepts]: Start accepts. Automaton has 18618 states and 69424 transitions. Word has length 124 [2022-02-09 01:12:17,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:12:17,666 INFO L470 AbstractCegarLoop]: Abstraction has 18618 states and 69424 transitions. [2022-02-09 01:12:17,667 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 78 states have (on average 3.769230769230769) internal successors, (294), 78 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-02-09 01:12:17,667 INFO L276 IsEmpty]: Start isEmpty. Operand 18618 states and 69424 transitions. [2022-02-09 01:12:17,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-09 01:12:17,710 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:12:17,710 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-02-09 01:12:17,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Ended with exit code 0 [2022-02-09 01:12:17,911 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-02-09 01:12:17,911 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-09 01:12:17,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:12:17,912 INFO L85 PathProgramCache]: Analyzing trace with hash 862866234, now seen corresponding path program 29 times [2022-02-09 01:12:17,912 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:12:17,912 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278287128] [2022-02-09 01:12:17,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:12:17,912 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:12:17,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:12:18,436 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:12:18,436 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:12:18,437 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278287128] [2022-02-09 01:12:18,437 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278287128] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 01:12:18,437 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417272397] [2022-02-09 01:12:18,437 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-09 01:12:18,437 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 01:12:18,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 01:12:18,438 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-02-09 01:12:18,439 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-02-09 01:12:18,562 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-02-09 01:12:18,562 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-09 01:12:18,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 63 conjunts are in the unsatisfiable core [2022-02-09 01:12:18,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 01:12:19,578 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:12:19,578 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-02-09 01:12:19,796 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:12:19,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 01:12:19,971 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:12:19,971 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-02-09 01:12:20,837 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:12:20,838 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1417272397] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 01:12:20,838 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 01:12:20,838 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27, 22] total 63 [2022-02-09 01:12:20,838 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6904394] [2022-02-09 01:12:20,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 01:12:20,838 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-02-09 01:12:20,839 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:12:20,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-02-09 01:12:20,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=409, Invalid=3497, Unknown=0, NotChecked=0, Total=3906 [2022-02-09 01:12:20,840 INFO L87 Difference]: Start difference. First operand 18618 states and 69424 transitions. Second operand has 63 states, 63 states have (on average 4.285714285714286) internal successors, (270), 63 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:12:23,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:12:23,749 INFO L93 Difference]: Finished difference Result 35127 states and 130024 transitions. [2022-02-09 01:12:23,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-02-09 01:12:23,749 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 4.285714285714286) internal successors, (270), 63 states have internal predecessors, (270), 0 states have call successors, (0), 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-02-09 01:12:23,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:12:23,868 INFO L225 Difference]: With dead ends: 35127 [2022-02-09 01:12:23,868 INFO L226 Difference]: Without dead ends: 34977 [2022-02-09 01:12:23,869 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 211 SyntacticMatches, 8 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3931 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1333, Invalid=10009, Unknown=0, NotChecked=0, Total=11342 [2022-02-09 01:12:23,869 INFO L933 BasicCegarLoop]: 280 mSDtfsCounter, 2007 mSDsluCounter, 6868 mSDsCounter, 0 mSdLazyCounter, 2108 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2007 SdHoareTripleChecker+Valid, 6643 SdHoareTripleChecker+Invalid, 3624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 2108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1449 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-09 01:12:23,869 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2007 Valid, 6643 Invalid, 3624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 2108 Invalid, 0 Unknown, 1449 Unchecked, 0.9s Time] [2022-02-09 01:12:24,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34977 states. [2022-02-09 01:12:24,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34977 to 18710. [2022-02-09 01:12:24,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18710 states, 18709 states have (on average 3.7289539793682187) internal successors, (69765), 18709 states have internal predecessors, (69765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:12:24,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18710 states to 18710 states and 69765 transitions. [2022-02-09 01:12:24,580 INFO L78 Accepts]: Start accepts. Automaton has 18710 states and 69765 transitions. Word has length 124 [2022-02-09 01:12:24,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:12:24,580 INFO L470 AbstractCegarLoop]: Abstraction has 18710 states and 69765 transitions. [2022-02-09 01:12:24,580 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 4.285714285714286) internal successors, (270), 63 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:12:24,580 INFO L276 IsEmpty]: Start isEmpty. Operand 18710 states and 69765 transitions. [2022-02-09 01:12:24,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-09 01:12:24,621 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:12:24,621 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-02-09 01:12:24,638 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-02-09 01:12:24,821 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-02-09 01:12:24,821 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-09 01:12:24,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:12:24,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1322821530, now seen corresponding path program 30 times [2022-02-09 01:12:24,822 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:12:24,822 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989724573] [2022-02-09 01:12:24,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:12:24,822 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:12:24,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:12:25,471 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:12:25,471 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:12:25,471 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989724573] [2022-02-09 01:12:25,471 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989724573] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 01:12:25,472 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328568297] [2022-02-09 01:12:25,472 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-09 01:12:25,472 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 01:12:25,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 01:12:25,473 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-02-09 01:12:25,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-02-09 01:12:25,599 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-02-09 01:12:25,600 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-09 01:12:25,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 76 conjunts are in the unsatisfiable core [2022-02-09 01:12:25,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 01:12:25,694 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-09 01:12:25,951 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-09 01:12:25,952 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-02-09 01:12:26,102 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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-02-09 01:12:26,377 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-09 01:12:26,596 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-09 01:12:26,681 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-02-09 01:12:26,882 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 01:12:26,882 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-02-09 01:12:27,234 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:12:27,234 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 01:12:27,708 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1676 (Array Int Int)) (~M~0 Int)) (or (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1676) 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)))))) (< 0 ~M~0) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-02-09 01:12:27,769 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1676 (Array Int Int)) (~M~0 Int) (v_ArrVal_1675 (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_1675) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1676) 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)))))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-02-09 01:12:27,823 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1676 (Array Int Int)) (~M~0 Int) (v_ArrVal_1675 (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_1675) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1676) 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-02-09 01:12:28,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 10 treesize of output 8 [2022-02-09 01:12:28,180 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-02-09 01:12:28,180 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328568297] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 01:12:28,180 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 01:12:28,180 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 30, 20] total 66 [2022-02-09 01:12:28,180 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635197338] [2022-02-09 01:12:28,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 01:12:28,181 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-02-09 01:12:28,181 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:12:28,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-02-09 01:12:28,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=3468, Unknown=3, NotChecked=372, Total=4290 [2022-02-09 01:12:28,181 INFO L87 Difference]: Start difference. First operand 18710 states and 69765 transitions. Second operand has 66 states, 66 states have (on average 4.803030303030303) internal successors, (317), 66 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) Received shutdown request... [2022-02-09 01:12:35,883 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-02-09 01:12:35,886 WARN L244 SmtUtils]: Removed 20 from assertion stack [2022-02-09 01:12:35,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-02-09 01:12:35,887 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 216 SyntacticMatches, 11 SemanticMatches, 134 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 4955 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=2883, Invalid=14682, Unknown=3, NotChecked=792, Total=18360 [2022-02-09 01:12:35,888 INFO L933 BasicCegarLoop]: 127 mSDtfsCounter, 1779 mSDsluCounter, 3792 mSDsCounter, 0 mSdLazyCounter, 2169 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1779 SdHoareTripleChecker+Valid, 3774 SdHoareTripleChecker+Invalid, 3734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 2169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1463 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-09 01:12:35,888 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1779 Valid, 3774 Invalid, 3734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 2169 Invalid, 0 Unknown, 1463 Unchecked, 1.0s Time] [2022-02-09 01:12:35,892 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-02-09 01:12:35,910 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-02-09 01:12:35,927 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-02-09 01:12:36,093 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-02-09 01:12:36,094 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was constructing difference of abstraction (18710states) and FLOYD_HOARE automaton (currently 81 states, 66 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 89 for 122ms.. [2022-02-09 01:12:36,095 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 4 remaining) [2022-02-09 01:12:36,096 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 4 remaining) [2022-02-09 01:12:36,096 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATION (0 of 4 remaining) [2022-02-09 01:12:36,102 INFO L732 BasicCegarLoop]: Path program histogram: [30, 9, 6, 1, 1, 1, 1, 1, 1] [2022-02-09 01:12:36,104 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-02-09 01:12:36,104 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-09 01:12:36,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.02 01:12:36 BasicIcfg [2022-02-09 01:12:36,105 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-09 01:12:36,105 INFO L158 Benchmark]: Toolchain (without parser) took 746946.65ms. Allocated memory was 191.9MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 134.4MB in the beginning and 429.4MB in the end (delta: -295.0MB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. [2022-02-09 01:12:36,105 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 191.9MB. Free memory is still 150.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-09 01:12:36,106 INFO L158 Benchmark]: CACSL2BoogieTranslator took 193.57ms. Allocated memory was 191.9MB in the beginning and 289.4MB in the end (delta: 97.5MB). Free memory was 134.1MB in the beginning and 257.8MB in the end (delta: -123.6MB). Peak memory consumption was 6.8MB. Max. memory is 8.0GB. [2022-02-09 01:12:36,106 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.80ms. Allocated memory is still 289.4MB. Free memory was 257.8MB in the beginning and 255.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-09 01:12:36,106 INFO L158 Benchmark]: Boogie Preprocessor took 42.67ms. Allocated memory is still 289.4MB. Free memory was 255.7MB in the beginning and 254.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-02-09 01:12:36,106 INFO L158 Benchmark]: RCFGBuilder took 469.68ms. Allocated memory is still 289.4MB. Free memory was 254.1MB in the beginning and 225.3MB in the end (delta: 28.8MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2022-02-09 01:12:36,106 INFO L158 Benchmark]: TraceAbstraction took 746204.45ms. Allocated memory was 289.4MB in the beginning and 2.4GB in the end (delta: 2.1GB). Free memory was 224.8MB in the beginning and 429.4MB in the end (delta: -204.6MB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. [2022-02-09 01:12:36,106 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 191.9MB. Free memory is still 150.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 193.57ms. Allocated memory was 191.9MB in the beginning and 289.4MB in the end (delta: 97.5MB). Free memory was 134.1MB in the beginning and 257.8MB in the end (delta: -123.6MB). Peak memory consumption was 6.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.80ms. Allocated memory is still 289.4MB. Free memory was 257.8MB in the beginning and 255.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.67ms. Allocated memory is still 289.4MB. Free memory was 255.7MB in the beginning and 254.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 469.68ms. Allocated memory is still 289.4MB. Free memory was 254.1MB in the beginning and 225.3MB in the end (delta: 28.8MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * TraceAbstraction took 746204.45ms. Allocated memory was 289.4MB in the beginning and 2.4GB in the end (delta: 2.1GB). Free memory was 224.8MB in the beginning and 429.4MB in the end (delta: -204.6MB). Peak memory consumption was 2.1GB. 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 (18710states) and FLOYD_HOARE automaton (currently 81 states, 66 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 89 for 122ms.. - 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 (18710states) and FLOYD_HOARE automaton (currently 81 states, 66 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 89 for 122ms.. - 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 (18710states) and FLOYD_HOARE automaton (currently 81 states, 66 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 89 for 122ms.. - 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 (18710states) and FLOYD_HOARE automaton (currently 81 states, 66 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 89 for 122ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 178 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 746.1s, OverallIterations: 51, TraceHistogramMax: 1, PathProgramHistogramMax: 30, EmptinessCheckTime: 1.4s, AutomataDifference: 472.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 104880 SdHoareTripleChecker+Valid, 90.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 104880 mSDsluCounter, 389228 SdHoareTripleChecker+Invalid, 75.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 221613 IncrementalHoareTripleChecker+Unchecked, 407732 mSDsCounter, 5737 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 203044 IncrementalHoareTripleChecker+Invalid, 430394 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5737 mSolverCounterUnsat, 16449 mSDtfsCounter, 203044 mSolverCounterSat, 1.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 18977 GetRequests, 10223 SyntacticMatches, 483 SemanticMatches, 8270 ConstructedPredicates, 144 IntricatePredicates, 47 DeprecatedPredicates, 1061587 ImplicationChecksByTransitivity, 388.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19778occurred in iteration=47, InterpolantAutomatonStates: 6356, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 27.3s AutomataMinimizationTime, 50 MinimizatonAttempts, 1342489 StatesRemovedByMinimization, 49 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 228.3s InterpolantComputationTime, 11867 NumberOfCodeBlocks, 11857 NumberOfCodeBlocksAsserted, 139 NumberOfCheckSat, 17386 ConstructedInterpolants, 1705 QuantifiedInterpolants, 210810 SizeOfPredicates, 1612 NumberOfNonLiveVariables, 14748 ConjunctsInSsa, 2740 ConjunctsInUnsatCore, 143 InterpolantComputations, 8 PerfectInterpolantSequences, 74/396 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