./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/cstrcpy-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/array-memsafety/cstrcpy-alloca-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fa78fde783b634840a8dd117d9f71a3fa4064d7e1622444edf74e6b44f549a34 --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 19:31:10,992 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 19:31:10,994 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 19:31:11,026 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 19:31:11,026 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 19:31:11,027 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 19:31:11,028 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 19:31:11,029 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 19:31:11,030 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 19:31:11,031 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 19:31:11,031 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 19:31:11,032 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 19:31:11,032 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 19:31:11,033 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 19:31:11,034 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 19:31:11,035 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 19:31:11,035 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 19:31:11,036 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 19:31:11,037 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 19:31:11,038 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 19:31:11,039 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 19:31:11,040 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 19:31:11,041 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 19:31:11,042 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 19:31:11,043 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 19:31:11,044 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 19:31:11,044 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 19:31:11,045 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 19:31:11,045 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 19:31:11,046 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 19:31:11,046 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 19:31:11,046 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 19:31:11,047 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 19:31:11,052 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 19:31:11,053 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 19:31:11,053 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 19:31:11,054 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 19:31:11,054 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 19:31:11,054 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 19:31:11,055 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 19:31:11,055 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 19:31:11,056 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-14 19:31:11,073 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 19:31:11,074 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 19:31:11,074 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 19:31:11,074 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 19:31:11,075 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 19:31:11,075 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 19:31:11,076 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 19:31:11,076 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 19:31:11,076 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 19:31:11,076 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 19:31:11,076 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 19:31:11,077 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-14 19:31:11,077 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 19:31:11,077 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 19:31:11,077 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 19:31:11,077 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-14 19:31:11,078 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-14 19:31:11,078 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-14 19:31:11,078 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 19:31:11,078 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-14 19:31:11,078 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 19:31:11,078 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 19:31:11,079 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 19:31:11,079 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 19:31:11,079 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 19:31:11,079 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:31:11,079 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 19:31:11,080 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 19:31:11,080 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 19:31:11,080 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 19:31:11,080 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 19:31:11,080 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fa78fde783b634840a8dd117d9f71a3fa4064d7e1622444edf74e6b44f549a34 [2021-12-14 19:31:11,269 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 19:31:11,290 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 19:31:11,293 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 19:31:11,293 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 19:31:11,294 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 19:31:11,295 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/cstrcpy-alloca-1.i [2021-12-14 19:31:11,351 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af0c2169f/774c304b5bb84a7ab8fa0747af45f860/FLAG74a174c1e [2021-12-14 19:31:11,730 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 19:31:11,730 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrcpy-alloca-1.i [2021-12-14 19:31:11,743 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af0c2169f/774c304b5bb84a7ab8fa0747af45f860/FLAG74a174c1e [2021-12-14 19:31:11,751 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af0c2169f/774c304b5bb84a7ab8fa0747af45f860 [2021-12-14 19:31:11,753 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 19:31:11,754 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 19:31:11,755 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 19:31:11,755 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 19:31:11,757 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 19:31:11,757 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:31:11" (1/1) ... [2021-12-14 19:31:11,758 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61cf01a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:31:11, skipping insertion in model container [2021-12-14 19:31:11,758 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:31:11" (1/1) ... [2021-12-14 19:31:11,762 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 19:31:11,783 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 19:31:11,996 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:31:12,001 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 19:31:12,035 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:31:12,052 INFO L208 MainTranslator]: Completed translation [2021-12-14 19:31:12,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:31:12 WrapperNode [2021-12-14 19:31:12,052 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 19:31:12,053 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 19:31:12,053 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 19:31:12,055 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 19:31:12,059 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:31:12" (1/1) ... [2021-12-14 19:31:12,067 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:31:12" (1/1) ... [2021-12-14 19:31:12,081 INFO L137 Inliner]: procedures = 117, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 68 [2021-12-14 19:31:12,082 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 19:31:12,082 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 19:31:12,082 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 19:31:12,083 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 19:31:12,087 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:31:12" (1/1) ... [2021-12-14 19:31:12,088 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:31:12" (1/1) ... [2021-12-14 19:31:12,092 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:31:12" (1/1) ... [2021-12-14 19:31:12,093 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:31:12" (1/1) ... [2021-12-14 19:31:12,098 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:31:12" (1/1) ... [2021-12-14 19:31:12,106 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:31:12" (1/1) ... [2021-12-14 19:31:12,109 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:31:12" (1/1) ... [2021-12-14 19:31:12,120 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 19:31:12,121 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 19:31:12,121 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 19:31:12,121 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 19:31:12,123 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:31:12" (1/1) ... [2021-12-14 19:31:12,128 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:31:12,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:31:12,152 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) [2021-12-14 19:31:12,158 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 [2021-12-14 19:31:12,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-14 19:31:12,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-14 19:31:12,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-14 19:31:12,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 19:31:12,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 19:31:12,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 19:31:12,274 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 19:31:12,283 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 19:31:12,404 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 19:31:12,408 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 19:31:12,408 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-14 19:31:12,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:31:12 BoogieIcfgContainer [2021-12-14 19:31:12,410 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 19:31:12,411 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 19:31:12,411 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 19:31:12,416 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 19:31:12,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 07:31:11" (1/3) ... [2021-12-14 19:31:12,417 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1112216d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:31:12, skipping insertion in model container [2021-12-14 19:31:12,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:31:12" (2/3) ... [2021-12-14 19:31:12,418 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1112216d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:31:12, skipping insertion in model container [2021-12-14 19:31:12,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:31:12" (3/3) ... [2021-12-14 19:31:12,419 INFO L111 eAbstractionObserver]: Analyzing ICFG cstrcpy-alloca-1.i [2021-12-14 19:31:12,422 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 19:31:12,425 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2021-12-14 19:31:12,452 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 19:31:12,456 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=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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 [2021-12-14 19:31:12,456 INFO L340 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2021-12-14 19:31:12,465 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 28 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:31:12,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-14 19:31:12,469 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:31:12,469 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-14 19:31:12,469 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-14 19:31:12,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:31:12,473 INFO L85 PathProgramCache]: Analyzing trace with hash 889510840, now seen corresponding path program 1 times [2021-12-14 19:31:12,479 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:31:12,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519701884] [2021-12-14 19:31:12,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:31:12,480 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:31:12,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:31:12,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:31:12,629 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:31:12,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519701884] [2021-12-14 19:31:12,630 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519701884] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:31:12,630 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:31:12,631 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:31:12,632 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454911330] [2021-12-14 19:31:12,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:31:12,635 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:31:12,636 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:31:12,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:31:12,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:31:12,661 INFO L87 Difference]: Start difference. First operand has 29 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 28 states have internal predecessors, (35), 0 states have call successors, (0), 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 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:31:12,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:31:12,711 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2021-12-14 19:31:12,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 19:31:12,713 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2021-12-14 19:31:12,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:31:12,717 INFO L225 Difference]: With dead ends: 34 [2021-12-14 19:31:12,718 INFO L226 Difference]: Without dead ends: 30 [2021-12-14 19:31:12,720 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:31:12,722 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 56 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:31:12,723 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 35 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:31:12,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-12-14 19:31:12,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2021-12-14 19:31:12,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 27 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:31:12,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2021-12-14 19:31:12,745 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 6 [2021-12-14 19:31:12,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:31:12,746 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2021-12-14 19:31:12,746 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:31:12,746 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2021-12-14 19:31:12,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-14 19:31:12,747 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:31:12,747 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-14 19:31:12,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 19:31:12,747 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-14 19:31:12,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:31:12,750 INFO L85 PathProgramCache]: Analyzing trace with hash 889512762, now seen corresponding path program 1 times [2021-12-14 19:31:12,750 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:31:12,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279800087] [2021-12-14 19:31:12,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:31:12,751 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:31:12,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:31:12,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:31:12,790 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:31:12,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279800087] [2021-12-14 19:31:12,791 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279800087] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:31:12,791 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:31:12,791 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:31:12,791 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029158515] [2021-12-14 19:31:12,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:31:12,792 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:31:12,793 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:31:12,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:31:12,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:31:12,794 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:31:12,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:31:12,814 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2021-12-14 19:31:12,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:31:12,815 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2021-12-14 19:31:12,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:31:12,816 INFO L225 Difference]: With dead ends: 29 [2021-12-14 19:31:12,817 INFO L226 Difference]: Without dead ends: 28 [2021-12-14 19:31:12,817 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:31:12,821 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:31:12,821 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 43 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:31:12,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2021-12-14 19:31:12,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2021-12-14 19:31:12,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 26 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:31:12,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2021-12-14 19:31:12,827 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 6 [2021-12-14 19:31:12,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:31:12,828 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2021-12-14 19:31:12,828 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:31:12,828 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2021-12-14 19:31:12,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-14 19:31:12,829 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:31:12,829 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:31:12,829 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 19:31:12,830 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-14 19:31:12,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:31:12,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1805033015, now seen corresponding path program 1 times [2021-12-14 19:31:12,833 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:31:12,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477822599] [2021-12-14 19:31:12,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:31:12,835 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:31:12,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:31:12,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:31:12,886 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:31:12,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477822599] [2021-12-14 19:31:12,887 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477822599] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:31:12,887 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:31:12,887 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:31:12,887 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956867021] [2021-12-14 19:31:12,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:31:12,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:31:12,888 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:31:12,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:31:12,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:31:12,888 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:31:12,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:31:12,908 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2021-12-14 19:31:12,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:31:12,908 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2021-12-14 19:31:12,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:31:12,909 INFO L225 Difference]: With dead ends: 25 [2021-12-14 19:31:12,909 INFO L226 Difference]: Without dead ends: 25 [2021-12-14 19:31:12,909 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:31:12,914 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 18 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:31:12,915 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 22 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:31:12,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-12-14 19:31:12,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2021-12-14 19:31:12,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:31:12,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2021-12-14 19:31:12,920 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 7 [2021-12-14 19:31:12,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:31:12,921 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2021-12-14 19:31:12,921 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:31:12,921 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2021-12-14 19:31:12,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-14 19:31:12,922 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:31:12,922 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:31:12,922 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-14 19:31:12,922 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-14 19:31:12,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:31:12,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1805033016, now seen corresponding path program 1 times [2021-12-14 19:31:12,924 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:31:12,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942453903] [2021-12-14 19:31:12,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:31:12,925 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:31:12,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:31:12,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:31:12,994 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:31:12,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942453903] [2021-12-14 19:31:12,995 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942453903] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:31:12,995 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:31:12,995 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:31:12,995 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785464255] [2021-12-14 19:31:12,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:31:12,996 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:31:12,996 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:31:12,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:31:12,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:31:12,997 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:31:13,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:31:13,020 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2021-12-14 19:31:13,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 19:31:13,020 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2021-12-14 19:31:13,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:31:13,021 INFO L225 Difference]: With dead ends: 24 [2021-12-14 19:31:13,021 INFO L226 Difference]: Without dead ends: 24 [2021-12-14 19:31:13,022 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:31:13,026 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 40 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:31:13,027 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 19 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:31:13,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2021-12-14 19:31:13,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2021-12-14 19:31:13,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.5) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:31:13,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2021-12-14 19:31:13,031 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 7 [2021-12-14 19:31:13,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:31:13,031 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2021-12-14 19:31:13,031 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:31:13,031 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2021-12-14 19:31:13,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-14 19:31:13,032 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:31:13,032 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:31:13,032 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-14 19:31:13,032 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-14 19:31:13,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:31:13,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1805033069, now seen corresponding path program 1 times [2021-12-14 19:31:13,033 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:31:13,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632339572] [2021-12-14 19:31:13,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:31:13,034 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:31:13,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:31:13,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:31:13,073 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:31:13,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632339572] [2021-12-14 19:31:13,073 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632339572] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:31:13,073 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:31:13,074 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:31:13,074 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622128203] [2021-12-14 19:31:13,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:31:13,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:31:13,074 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:31:13,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:31:13,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:31:13,093 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:31:13,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:31:13,112 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2021-12-14 19:31:13,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 19:31:13,112 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2021-12-14 19:31:13,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:31:13,113 INFO L225 Difference]: With dead ends: 40 [2021-12-14 19:31:13,113 INFO L226 Difference]: Without dead ends: 40 [2021-12-14 19:31:13,114 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:31:13,114 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 31 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:31:13,114 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 44 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:31:13,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2021-12-14 19:31:13,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 26. [2021-12-14 19:31:13,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.45) internal successors, (29), 25 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:31:13,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2021-12-14 19:31:13,118 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 7 [2021-12-14 19:31:13,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:31:13,118 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2021-12-14 19:31:13,119 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:31:13,119 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2021-12-14 19:31:13,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-14 19:31:13,122 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:31:13,122 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:31:13,122 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-14 19:31:13,123 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-14 19:31:13,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:31:13,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1805092651, now seen corresponding path program 1 times [2021-12-14 19:31:13,123 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:31:13,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909413443] [2021-12-14 19:31:13,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:31:13,124 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:31:13,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:31:13,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:31:13,166 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:31:13,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909413443] [2021-12-14 19:31:13,166 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909413443] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:31:13,166 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:31:13,167 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:31:13,167 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522047191] [2021-12-14 19:31:13,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:31:13,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:31:13,167 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:31:13,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:31:13,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:31:13,168 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:31:13,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:31:13,214 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2021-12-14 19:31:13,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 19:31:13,215 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2021-12-14 19:31:13,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:31:13,216 INFO L225 Difference]: With dead ends: 44 [2021-12-14 19:31:13,216 INFO L226 Difference]: Without dead ends: 44 [2021-12-14 19:31:13,217 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:31:13,217 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 56 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:31:13,218 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 33 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:31:13,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2021-12-14 19:31:13,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 28. [2021-12-14 19:31:13,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 27 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:31:13,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2021-12-14 19:31:13,222 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 7 [2021-12-14 19:31:13,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:31:13,222 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2021-12-14 19:31:13,222 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:31:13,222 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2021-12-14 19:31:13,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-14 19:31:13,222 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:31:13,223 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:31:13,223 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-14 19:31:13,223 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-14 19:31:13,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:31:13,223 INFO L85 PathProgramCache]: Analyzing trace with hash 748014037, now seen corresponding path program 1 times [2021-12-14 19:31:13,223 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:31:13,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047731280] [2021-12-14 19:31:13,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:31:13,224 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:31:13,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:31:13,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:31:13,311 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:31:13,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047731280] [2021-12-14 19:31:13,311 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047731280] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:31:13,311 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:31:13,312 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:31:13,312 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096885085] [2021-12-14 19:31:13,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:31:13,312 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 19:31:13,312 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:31:13,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 19:31:13,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:31:13,313 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:31:13,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:31:13,366 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2021-12-14 19:31:13,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:31:13,366 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2021-12-14 19:31:13,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:31:13,367 INFO L225 Difference]: With dead ends: 35 [2021-12-14 19:31:13,367 INFO L226 Difference]: Without dead ends: 35 [2021-12-14 19:31:13,367 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:31:13,367 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 85 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:31:13,368 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 48 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:31:13,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-12-14 19:31:13,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2021-12-14 19:31:13,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 29 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:31:13,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2021-12-14 19:31:13,370 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 10 [2021-12-14 19:31:13,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:31:13,370 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2021-12-14 19:31:13,370 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:31:13,370 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2021-12-14 19:31:13,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-14 19:31:13,371 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:31:13,371 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:31:13,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-14 19:31:13,371 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-14 19:31:13,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:31:13,371 INFO L85 PathProgramCache]: Analyzing trace with hash 748014036, now seen corresponding path program 1 times [2021-12-14 19:31:13,372 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:31:13,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134815234] [2021-12-14 19:31:13,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:31:13,372 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:31:13,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:31:13,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:31:13,405 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:31:13,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134815234] [2021-12-14 19:31:13,405 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134815234] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:31:13,405 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:31:13,406 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:31:13,406 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651426113] [2021-12-14 19:31:13,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:31:13,406 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:31:13,406 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:31:13,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:31:13,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:31:13,407 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:31:13,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:31:13,437 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2021-12-14 19:31:13,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 19:31:13,439 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2021-12-14 19:31:13,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:31:13,441 INFO L225 Difference]: With dead ends: 29 [2021-12-14 19:31:13,441 INFO L226 Difference]: Without dead ends: 29 [2021-12-14 19:31:13,441 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:31:13,442 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 28 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:31:13,442 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 37 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:31:13,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-12-14 19:31:13,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2021-12-14 19:31:13,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.375) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:31:13,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2021-12-14 19:31:13,449 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 10 [2021-12-14 19:31:13,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:31:13,450 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2021-12-14 19:31:13,450 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:31:13,450 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2021-12-14 19:31:13,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-14 19:31:13,451 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:31:13,451 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:31:13,451 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-14 19:31:13,451 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-14 19:31:13,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:31:13,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1713598655, now seen corresponding path program 1 times [2021-12-14 19:31:13,454 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:31:13,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784179996] [2021-12-14 19:31:13,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:31:13,455 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:31:13,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:31:13,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:31:13,520 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:31:13,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784179996] [2021-12-14 19:31:13,520 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784179996] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:31:13,520 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:31:13,520 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 19:31:13,521 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759709014] [2021-12-14 19:31:13,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:31:13,521 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:31:13,521 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:31:13,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:31:13,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:31:13,526 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:31:13,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:31:13,561 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2021-12-14 19:31:13,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 19:31:13,562 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2021-12-14 19:31:13,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:31:13,562 INFO L225 Difference]: With dead ends: 28 [2021-12-14 19:31:13,562 INFO L226 Difference]: Without dead ends: 28 [2021-12-14 19:31:13,563 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:31:13,564 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 25 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:31:13,564 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 44 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:31:13,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2021-12-14 19:31:13,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2021-12-14 19:31:13,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 27 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:31:13,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2021-12-14 19:31:13,568 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 11 [2021-12-14 19:31:13,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:31:13,569 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2021-12-14 19:31:13,569 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:31:13,569 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2021-12-14 19:31:13,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-14 19:31:13,569 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:31:13,570 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:31:13,570 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-14 19:31:13,570 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-14 19:31:13,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:31:13,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1713598656, now seen corresponding path program 1 times [2021-12-14 19:31:13,570 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:31:13,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881213969] [2021-12-14 19:31:13,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:31:13,571 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:31:13,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:31:13,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:31:13,633 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:31:13,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881213969] [2021-12-14 19:31:13,633 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881213969] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:31:13,633 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:31:13,633 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 19:31:13,633 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527865065] [2021-12-14 19:31:13,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:31:13,634 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:31:13,634 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:31:13,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:31:13,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:31:13,634 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:31:13,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:31:13,675 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2021-12-14 19:31:13,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:31:13,676 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2021-12-14 19:31:13,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:31:13,676 INFO L225 Difference]: With dead ends: 30 [2021-12-14 19:31:13,676 INFO L226 Difference]: Without dead ends: 30 [2021-12-14 19:31:13,677 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-12-14 19:31:13,677 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 45 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:31:13,677 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 49 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:31:13,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-12-14 19:31:13,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2021-12-14 19:31:13,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.32) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:31:13,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2021-12-14 19:31:13,679 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 11 [2021-12-14 19:31:13,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:31:13,679 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2021-12-14 19:31:13,679 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:31:13,679 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2021-12-14 19:31:13,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-14 19:31:13,680 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:31:13,680 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:31:13,680 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-14 19:31:13,680 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-14 19:31:13,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:31:13,681 INFO L85 PathProgramCache]: Analyzing trace with hash 952918382, now seen corresponding path program 1 times [2021-12-14 19:31:13,681 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:31:13,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791459528] [2021-12-14 19:31:13,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:31:13,681 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:31:13,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:31:13,713 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:31:13,713 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:31:13,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791459528] [2021-12-14 19:31:13,714 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791459528] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:31:13,714 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:31:13,714 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:31:13,714 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112932889] [2021-12-14 19:31:13,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:31:13,714 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:31:13,714 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:31:13,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:31:13,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:31:13,715 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:31:13,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:31:13,734 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2021-12-14 19:31:13,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 19:31:13,734 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2021-12-14 19:31:13,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:31:13,735 INFO L225 Difference]: With dead ends: 49 [2021-12-14 19:31:13,735 INFO L226 Difference]: Without dead ends: 49 [2021-12-14 19:31:13,735 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:31:13,736 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 28 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:31:13,736 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 58 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:31:13,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2021-12-14 19:31:13,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 30. [2021-12-14 19:31:13,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 29 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:31:13,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2021-12-14 19:31:13,738 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 11 [2021-12-14 19:31:13,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:31:13,738 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2021-12-14 19:31:13,738 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:31:13,738 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2021-12-14 19:31:13,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-14 19:31:13,738 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:31:13,738 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:31:13,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-14 19:31:13,739 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-14 19:31:13,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:31:13,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1632976752, now seen corresponding path program 1 times [2021-12-14 19:31:13,739 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:31:13,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132403274] [2021-12-14 19:31:13,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:31:13,740 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:31:13,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:31:13,790 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:31:13,791 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:31:13,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132403274] [2021-12-14 19:31:13,791 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132403274] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:31:13,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347144518] [2021-12-14 19:31:13,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:31:13,792 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:31:13,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:31:13,796 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) [2021-12-14 19:31:13,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-14 19:31:13,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:31:13,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-14 19:31:13,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:31:13,936 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-14 19:31:13,936 INFO L388 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 1 case distinctions, treesize of input 9 treesize of output 15 [2021-12-14 19:31:14,020 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:31:14,020 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:31:14,191 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:31:14,191 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1347144518] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:31:14,192 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:31:14,192 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2021-12-14 19:31:14,192 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309499220] [2021-12-14 19:31:14,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:31:14,192 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 19:31:14,193 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:31:14,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 19:31:14,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-12-14 19:31:14,193 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:31:14,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:31:14,290 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2021-12-14 19:31:14,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:31:14,290 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 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 11 [2021-12-14 19:31:14,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:31:14,291 INFO L225 Difference]: With dead ends: 62 [2021-12-14 19:31:14,291 INFO L226 Difference]: Without dead ends: 62 [2021-12-14 19:31:14,291 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2021-12-14 19:31:14,292 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 84 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:31:14,293 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 91 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:31:14,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-12-14 19:31:14,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 27. [2021-12-14 19:31:14,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:31:14,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2021-12-14 19:31:14,296 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 11 [2021-12-14 19:31:14,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:31:14,296 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2021-12-14 19:31:14,296 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:31:14,296 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2021-12-14 19:31:14,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-14 19:31:14,297 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:31:14,297 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:31:14,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-14 19:31:14,506 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,SelfDestructingSolverStorable11 [2021-12-14 19:31:14,507 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-14 19:31:14,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:31:14,507 INFO L85 PathProgramCache]: Analyzing trace with hash -163723683, now seen corresponding path program 1 times [2021-12-14 19:31:14,507 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:31:14,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641900204] [2021-12-14 19:31:14,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:31:14,507 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:31:14,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:31:14,587 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:31:14,588 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:31:14,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641900204] [2021-12-14 19:31:14,588 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641900204] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:31:14,588 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:31:14,588 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 19:31:14,588 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730172780] [2021-12-14 19:31:14,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:31:14,589 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 19:31:14,589 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:31:14,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 19:31:14,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:31:14,590 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:31:14,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:31:14,648 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2021-12-14 19:31:14,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 19:31:14,648 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2021-12-14 19:31:14,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:31:14,649 INFO L225 Difference]: With dead ends: 39 [2021-12-14 19:31:14,649 INFO L226 Difference]: Without dead ends: 39 [2021-12-14 19:31:14,649 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2021-12-14 19:31:14,650 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 20 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:31:14,650 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 92 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:31:14,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2021-12-14 19:31:14,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2021-12-14 19:31:14,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 32 states have (on average 1.21875) internal successors, (39), 34 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:31:14,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2021-12-14 19:31:14,654 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 14 [2021-12-14 19:31:14,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:31:14,654 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2021-12-14 19:31:14,654 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:31:14,655 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2021-12-14 19:31:14,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-14 19:31:14,656 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:31:14,656 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:31:14,656 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-14 19:31:14,656 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-14 19:31:14,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:31:14,657 INFO L85 PathProgramCache]: Analyzing trace with hash 537340895, now seen corresponding path program 1 times [2021-12-14 19:31:14,657 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:31:14,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275146099] [2021-12-14 19:31:14,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:31:14,657 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:31:14,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:31:14,730 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:31:14,730 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:31:14,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275146099] [2021-12-14 19:31:14,731 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275146099] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:31:14,731 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:31:14,731 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 19:31:14,736 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050661606] [2021-12-14 19:31:14,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:31:14,737 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 19:31:14,737 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:31:14,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 19:31:14,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:31:14,737 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:31:14,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:31:14,816 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2021-12-14 19:31:14,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 19:31:14,817 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2021-12-14 19:31:14,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:31:14,817 INFO L225 Difference]: With dead ends: 53 [2021-12-14 19:31:14,817 INFO L226 Difference]: Without dead ends: 53 [2021-12-14 19:31:14,817 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-12-14 19:31:14,818 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 21 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:31:14,818 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 110 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:31:14,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-12-14 19:31:14,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 33. [2021-12-14 19:31:14,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 32 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:31:14,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2021-12-14 19:31:14,820 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 14 [2021-12-14 19:31:14,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:31:14,820 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2021-12-14 19:31:14,820 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:31:14,820 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2021-12-14 19:31:14,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-14 19:31:14,820 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:31:14,821 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:31:14,821 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-14 19:31:14,821 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-14 19:31:14,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:31:14,821 INFO L85 PathProgramCache]: Analyzing trace with hash 795506333, now seen corresponding path program 1 times [2021-12-14 19:31:14,821 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:31:14,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324876327] [2021-12-14 19:31:14,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:31:14,822 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:31:14,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:31:14,910 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:31:14,910 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:31:14,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324876327] [2021-12-14 19:31:14,910 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324876327] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:31:14,910 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:31:14,910 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 19:31:14,911 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145433182] [2021-12-14 19:31:14,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:31:14,911 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 19:31:14,911 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:31:14,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 19:31:14,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:31:14,911 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:31:15,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:31:15,049 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2021-12-14 19:31:15,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 19:31:15,050 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2021-12-14 19:31:15,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:31:15,050 INFO L225 Difference]: With dead ends: 47 [2021-12-14 19:31:15,050 INFO L226 Difference]: Without dead ends: 47 [2021-12-14 19:31:15,050 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-12-14 19:31:15,051 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 22 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:31:15,051 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 95 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:31:15,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-12-14 19:31:15,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2021-12-14 19:31:15,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 33 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:31:15,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2021-12-14 19:31:15,052 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 14 [2021-12-14 19:31:15,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:31:15,052 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2021-12-14 19:31:15,052 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:31:15,053 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2021-12-14 19:31:15,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-14 19:31:15,053 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:31:15,053 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:31:15,053 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-14 19:31:15,053 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-14 19:31:15,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:31:15,053 INFO L85 PathProgramCache]: Analyzing trace with hash -780511546, now seen corresponding path program 1 times [2021-12-14 19:31:15,053 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:31:15,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430485205] [2021-12-14 19:31:15,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:31:15,053 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:31:15,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:31:15,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:31:15,097 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:31:15,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430485205] [2021-12-14 19:31:15,097 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430485205] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:31:15,097 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:31:15,097 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:31:15,098 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271106300] [2021-12-14 19:31:15,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:31:15,098 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:31:15,098 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:31:15,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:31:15,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:31:15,099 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:31:15,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:31:15,108 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2021-12-14 19:31:15,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 19:31:15,108 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2021-12-14 19:31:15,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:31:15,109 INFO L225 Difference]: With dead ends: 33 [2021-12-14 19:31:15,109 INFO L226 Difference]: Without dead ends: 21 [2021-12-14 19:31:15,109 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:31:15,109 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 9 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:31:15,110 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 32 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:31:15,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2021-12-14 19:31:15,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2021-12-14 19:31:15,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:31:15,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2021-12-14 19:31:15,111 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 15 [2021-12-14 19:31:15,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:31:15,111 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2021-12-14 19:31:15,111 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:31:15,111 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2021-12-14 19:31:15,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-14 19:31:15,112 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:31:15,112 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:31:15,112 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-14 19:31:15,112 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-14 19:31:15,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:31:15,112 INFO L85 PathProgramCache]: Analyzing trace with hash -2086958086, now seen corresponding path program 1 times [2021-12-14 19:31:15,113 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:31:15,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872565670] [2021-12-14 19:31:15,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:31:15,113 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:31:15,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:31:15,205 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:31:15,205 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:31:15,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872565670] [2021-12-14 19:31:15,205 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872565670] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:31:15,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166096299] [2021-12-14 19:31:15,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:31:15,206 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:31:15,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:31:15,207 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) [2021-12-14 19:31:15,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-14 19:31:15,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:31:15,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 27 conjunts are in the unsatisfiable core [2021-12-14 19:31:15,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:31:15,360 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:31:15,361 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:31:15,492 INFO L388 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 5 treesize of output 3 [2021-12-14 19:31:15,519 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:31:15,519 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166096299] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:31:15,519 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:31:15,519 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2021-12-14 19:31:15,519 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249910087] [2021-12-14 19:31:15,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:31:15,520 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-14 19:31:15,520 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:31:15,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-14 19:31:15,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2021-12-14 19:31:15,522 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 20 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:31:15,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:31:15,697 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2021-12-14 19:31:15,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 19:31:15,697 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 20 states have internal predecessors, (36), 0 states have call successors, (0), 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 18 [2021-12-14 19:31:15,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:31:15,698 INFO L225 Difference]: With dead ends: 30 [2021-12-14 19:31:15,698 INFO L226 Difference]: Without dead ends: 30 [2021-12-14 19:31:15,698 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=511, Unknown=0, NotChecked=0, Total=650 [2021-12-14 19:31:15,698 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 88 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:31:15,698 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 70 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:31:15,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-12-14 19:31:15,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2021-12-14 19:31:15,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:31:15,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2021-12-14 19:31:15,700 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 18 [2021-12-14 19:31:15,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:31:15,700 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2021-12-14 19:31:15,700 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 20 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:31:15,700 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2021-12-14 19:31:15,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-14 19:31:15,700 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:31:15,700 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:31:15,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-14 19:31:15,900 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,SelfDestructingSolverStorable16 [2021-12-14 19:31:15,901 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-14 19:31:15,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:31:15,901 INFO L85 PathProgramCache]: Analyzing trace with hash -271191237, now seen corresponding path program 1 times [2021-12-14 19:31:15,901 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:31:15,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293141779] [2021-12-14 19:31:15,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:31:15,902 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:31:15,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:31:15,987 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:31:15,987 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:31:15,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293141779] [2021-12-14 19:31:15,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293141779] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:31:15,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199020905] [2021-12-14 19:31:15,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:31:15,988 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:31:15,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:31:15,989 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) [2021-12-14 19:31:15,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-14 19:31:16,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:31:16,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 39 conjunts are in the unsatisfiable core [2021-12-14 19:31:16,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:31:16,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:31:16,073 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 11 [2021-12-14 19:31:16,077 INFO L388 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 [2021-12-14 19:31:16,212 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:31:16,213 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:31:16,369 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:31:16,369 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1199020905] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:31:16,370 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:31:16,370 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2021-12-14 19:31:16,370 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350659694] [2021-12-14 19:31:16,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:31:16,370 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-14 19:31:16,370 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:31:16,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-14 19:31:16,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2021-12-14 19:31:16,371 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 21 states, 20 states have (on average 2.45) internal successors, (49), 21 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:31:16,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:31:16,596 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2021-12-14 19:31:16,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 19:31:16,596 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.45) internal successors, (49), 21 states have internal predecessors, (49), 0 states have call successors, (0), 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 19 [2021-12-14 19:31:16,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:31:16,596 INFO L225 Difference]: With dead ends: 29 [2021-12-14 19:31:16,596 INFO L226 Difference]: Without dead ends: 29 [2021-12-14 19:31:16,597 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=151, Invalid=605, Unknown=0, NotChecked=0, Total=756 [2021-12-14 19:31:16,597 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 58 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:31:16,597 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 73 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:31:16,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-12-14 19:31:16,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2021-12-14 19:31:16,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:31:16,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2021-12-14 19:31:16,598 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 19 [2021-12-14 19:31:16,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:31:16,598 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2021-12-14 19:31:16,598 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.45) internal successors, (49), 21 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:31:16,598 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2021-12-14 19:31:16,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-14 19:31:16,599 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:31:16,599 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:31:16,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-14 19:31:16,799 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-14 19:31:16,799 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-14 19:31:16,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:31:16,800 INFO L85 PathProgramCache]: Analyzing trace with hash -224662014, now seen corresponding path program 2 times [2021-12-14 19:31:16,800 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:31:16,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459416350] [2021-12-14 19:31:16,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:31:16,800 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:31:16,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:31:16,997 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:31:16,997 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:31:16,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459416350] [2021-12-14 19:31:16,998 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459416350] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:31:16,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535522462] [2021-12-14 19:31:16,998 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 19:31:16,998 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:31:16,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:31:16,999 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) [2021-12-14 19:31:17,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-14 19:31:17,074 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 19:31:17,074 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 19:31:17,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 59 conjunts are in the unsatisfiable core [2021-12-14 19:31:17,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:31:17,094 INFO L388 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 [2021-12-14 19:31:17,146 INFO L388 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 14 treesize of output 10 [2021-12-14 19:31:17,335 INFO L388 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 17 treesize of output 19 [2021-12-14 19:31:17,471 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:31:17,471 INFO L388 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 20 treesize of output 20 [2021-12-14 19:31:17,580 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:31:17,580 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:31:17,836 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_19| Int) (v_ArrVal_188 (Array Int Int))) (or (<= (+ 3 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_19|) (select |c_#length| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|)) (< |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_19|) (< |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_19| 0) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_188) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_19| 1)) 0))) is different from false [2021-12-14 19:31:17,852 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_19| Int) (v_ArrVal_188 (Array Int Int))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_188) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_19| 1)) 0) (< |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_19| 0) (<= (+ 3 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_19|) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_19|))) is different from false [2021-12-14 19:31:17,866 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:31:17,866 INFO L388 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 23 treesize of output 24 [2021-12-14 19:31:17,874 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:31:17,874 INFO L388 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 37 treesize of output 37 [2021-12-14 19:31:17,878 INFO L388 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 11 treesize of output 7 [2021-12-14 19:31:17,881 INFO L388 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 15 treesize of output 11 [2021-12-14 19:31:18,006 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-14 19:31:18,007 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1535522462] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:31:18,007 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:31:18,007 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 35 [2021-12-14 19:31:18,007 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263184640] [2021-12-14 19:31:18,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:31:18,007 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-12-14 19:31:18,007 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:31:18,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-12-14 19:31:18,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=950, Unknown=2, NotChecked=126, Total=1190 [2021-12-14 19:31:18,008 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 35 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 35 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:31:18,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:31:18,486 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2021-12-14 19:31:18,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-14 19:31:18,486 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 35 states have internal predecessors, (58), 0 states have call successors, (0), 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 22 [2021-12-14 19:31:18,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:31:18,487 INFO L225 Difference]: With dead ends: 48 [2021-12-14 19:31:18,487 INFO L226 Difference]: Without dead ends: 38 [2021-12-14 19:31:18,488 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=234, Invalid=1842, Unknown=2, NotChecked=178, Total=2256 [2021-12-14 19:31:18,488 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 33 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 134 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:31:18,488 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 141 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 212 Invalid, 0 Unknown, 134 Unchecked, 0.1s Time] [2021-12-14 19:31:18,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-12-14 19:31:18,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2021-12-14 19:31:18,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:31:18,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2021-12-14 19:31:18,489 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 22 [2021-12-14 19:31:18,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:31:18,489 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2021-12-14 19:31:18,490 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 35 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:31:18,490 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2021-12-14 19:31:18,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-14 19:31:18,490 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:31:18,490 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:31:18,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-14 19:31:18,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:31:18,699 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-14 19:31:18,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:31:18,700 INFO L85 PathProgramCache]: Analyzing trace with hash -121211530, now seen corresponding path program 2 times [2021-12-14 19:31:18,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:31:18,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208467356] [2021-12-14 19:31:18,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:31:18,700 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:31:18,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:31:18,812 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:31:18,813 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:31:18,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208467356] [2021-12-14 19:31:18,813 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208467356] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:31:18,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381270737] [2021-12-14 19:31:18,813 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 19:31:18,813 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:31:18,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:31:18,814 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) [2021-12-14 19:31:18,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-14 19:31:18,879 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 19:31:18,879 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 19:31:18,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 44 conjunts are in the unsatisfiable core [2021-12-14 19:31:18,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:31:18,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:31:18,896 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 11 [2021-12-14 19:31:18,917 INFO L388 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 [2021-12-14 19:31:19,133 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:31:19,133 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:31:19,360 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:31:19,360 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381270737] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:31:19,360 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:31:19,361 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 26 [2021-12-14 19:31:19,361 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629487589] [2021-12-14 19:31:19,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:31:19,361 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-12-14 19:31:19,361 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:31:19,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-12-14 19:31:19,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=605, Unknown=0, NotChecked=0, Total=702 [2021-12-14 19:31:19,362 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 27 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 27 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:31:19,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:31:19,698 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2021-12-14 19:31:19,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-14 19:31:19,698 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 27 states have internal predecessors, (73), 0 states have call successors, (0), 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 27 [2021-12-14 19:31:19,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:31:19,698 INFO L225 Difference]: With dead ends: 34 [2021-12-14 19:31:19,698 INFO L226 Difference]: Without dead ends: 34 [2021-12-14 19:31:19,699 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=235, Invalid=1025, Unknown=0, NotChecked=0, Total=1260 [2021-12-14 19:31:19,699 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 108 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:31:19,700 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 92 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:31:19,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-12-14 19:31:19,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2021-12-14 19:31:19,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 31 states have (on average 1.096774193548387) internal successors, (34), 32 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:31:19,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2021-12-14 19:31:19,701 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 27 [2021-12-14 19:31:19,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:31:19,701 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2021-12-14 19:31:19,701 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 27 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:31:19,701 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2021-12-14 19:31:19,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-14 19:31:19,702 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:31:19,702 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:31:19,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-14 19:31:19,918 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:31:19,918 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-14 19:31:19,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:31:19,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1054801383, now seen corresponding path program 3 times [2021-12-14 19:31:19,918 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:31:19,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989263541] [2021-12-14 19:31:19,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:31:19,919 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:31:19,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:31:20,127 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:31:20,128 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:31:20,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989263541] [2021-12-14 19:31:20,128 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989263541] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:31:20,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809314283] [2021-12-14 19:31:20,128 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-14 19:31:20,128 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:31:20,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:31:20,129 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) [2021-12-14 19:31:20,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-14 19:31:20,192 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-12-14 19:31:20,192 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 19:31:20,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 77 conjunts are in the unsatisfiable core [2021-12-14 19:31:20,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:31:20,209 INFO L388 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 [2021-12-14 19:31:20,329 INFO L388 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 14 treesize of output 10 [2021-12-14 19:31:20,392 INFO L388 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 [2021-12-14 19:31:20,459 INFO L388 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 [2021-12-14 19:31:20,505 INFO L388 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 15 treesize of output 7 [2021-12-14 19:31:20,510 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:31:20,510 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:31:20,524 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_261 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_261) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0)) is different from false [2021-12-14 19:31:20,536 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_261 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_261) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 1)))) is different from false [2021-12-14 19:31:20,543 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_261 (Array Int Int)) (v_ArrVal_260 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_260) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_261) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 1)) 0)) is different from false [2021-12-14 19:31:20,551 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_261 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_261) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 2)) 0)) is different from false [2021-12-14 19:31:20,556 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_261 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_261) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2021-12-14 19:31:20,560 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:31:20,560 INFO L388 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 23 treesize of output 24 [2021-12-14 19:31:20,565 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:31:20,565 INFO L388 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 37 treesize of output 37 [2021-12-14 19:31:20,568 INFO L388 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 11 treesize of output 7 [2021-12-14 19:31:20,732 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2021-12-14 19:31:20,732 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809314283] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:31:20,732 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:31:20,732 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 34 [2021-12-14 19:31:20,732 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071989831] [2021-12-14 19:31:20,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:31:20,732 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-12-14 19:31:20,732 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:31:20,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-12-14 19:31:20,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=727, Unknown=5, NotChecked=290, Total=1122 [2021-12-14 19:31:20,733 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 34 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 34 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:31:21,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:31:21,074 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2021-12-14 19:31:21,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-14 19:31:21,075 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 34 states have internal predecessors, (64), 0 states have call successors, (0), 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 30 [2021-12-14 19:31:21,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:31:21,075 INFO L225 Difference]: With dead ends: 54 [2021-12-14 19:31:21,075 INFO L226 Difference]: Without dead ends: 40 [2021-12-14 19:31:21,076 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 41 SyntacticMatches, 6 SemanticMatches, 39 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=154, Invalid=1121, Unknown=5, NotChecked=360, Total=1640 [2021-12-14 19:31:21,076 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 41 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 128 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:31:21,077 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 194 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 339 Invalid, 0 Unknown, 128 Unchecked, 0.1s Time] [2021-12-14 19:31:21,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2021-12-14 19:31:21,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2021-12-14 19:31:21,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 36 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:31:21,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2021-12-14 19:31:21,078 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 30 [2021-12-14 19:31:21,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:31:21,078 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2021-12-14 19:31:21,078 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 34 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:31:21,079 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2021-12-14 19:31:21,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-14 19:31:21,079 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:31:21,079 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:31:21,096 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-12-14 19:31:21,295 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:31:21,297 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-14 19:31:21,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:31:21,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1308342596, now seen corresponding path program 4 times [2021-12-14 19:31:21,298 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:31:21,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786953837] [2021-12-14 19:31:21,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:31:21,299 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:31:21,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:31:21,439 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:31:21,439 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:31:21,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786953837] [2021-12-14 19:31:21,439 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786953837] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:31:21,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594059239] [2021-12-14 19:31:21,439 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-14 19:31:21,440 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:31:21,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:31:21,440 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) [2021-12-14 19:31:21,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-14 19:31:21,502 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-14 19:31:21,503 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 19:31:21,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 78 conjunts are in the unsatisfiable core [2021-12-14 19:31:21,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:31:21,537 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-14 19:31:21,537 INFO L388 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 1 case distinctions, treesize of input 9 treesize of output 15 [2021-12-14 19:31:21,543 INFO L388 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 [2021-12-14 19:31:21,717 INFO L388 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 16 treesize of output 12 [2021-12-14 19:31:21,879 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2021-12-14 19:31:21,988 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2021-12-14 19:31:22,090 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:31:22,090 INFO L388 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 22 treesize of output 22 [2021-12-14 19:31:22,212 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:31:22,212 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:31:22,587 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_308 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_41| Int)) (or (< |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_41|) (<= (+ |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_41| 4) (select |c_#length| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_308) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_41|)) 0) (< |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_41| 0))) is different from false [2021-12-14 19:31:22,602 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_308 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_41| Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_308) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 2 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_41|)) 0) (<= (+ |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_41| 4) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_41|) (< |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_41| 0))) is different from false [2021-12-14 19:31:22,612 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:31:22,612 INFO L388 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 23 treesize of output 24 [2021-12-14 19:31:22,618 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:31:22,618 INFO L388 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 37 treesize of output 37 [2021-12-14 19:31:22,622 INFO L388 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 11 treesize of output 7 [2021-12-14 19:31:23,193 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2021-12-14 19:31:23,193 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594059239] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:31:23,194 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:31:23,194 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16, 16] total 41 [2021-12-14 19:31:23,194 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528906675] [2021-12-14 19:31:23,194 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:31:23,195 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2021-12-14 19:31:23,195 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:31:23,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-12-14 19:31:23,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1386, Unknown=3, NotChecked=154, Total=1722 [2021-12-14 19:31:23,196 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand has 42 states, 41 states have (on average 2.292682926829268) internal successors, (94), 42 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:31:23,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:31:23,765 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2021-12-14 19:31:23,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-14 19:31:23,767 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.292682926829268) internal successors, (94), 42 states have internal predecessors, (94), 0 states have call successors, (0), 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 34 [2021-12-14 19:31:23,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:31:23,768 INFO L225 Difference]: With dead ends: 43 [2021-12-14 19:31:23,768 INFO L226 Difference]: Without dead ends: 43 [2021-12-14 19:31:23,769 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=367, Invalid=2500, Unknown=3, NotChecked=210, Total=3080 [2021-12-14 19:31:23,770 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 36 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 181 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:31:23,770 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 249 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 311 Invalid, 0 Unknown, 181 Unchecked, 0.1s Time] [2021-12-14 19:31:23,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2021-12-14 19:31:23,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2021-12-14 19:31:23,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 39 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:31:23,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2021-12-14 19:31:23,776 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 34 [2021-12-14 19:31:23,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:31:23,777 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2021-12-14 19:31:23,777 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.292682926829268) internal successors, (94), 42 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:31:23,777 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2021-12-14 19:31:23,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-14 19:31:23,780 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:31:23,780 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:31:23,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-14 19:31:23,997 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:31:23,997 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-14 19:31:23,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:31:23,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1903914801, now seen corresponding path program 3 times [2021-12-14 19:31:23,998 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:31:23,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242363374] [2021-12-14 19:31:23,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:31:23,998 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:31:24,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:31:24,142 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:31:24,143 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:31:24,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242363374] [2021-12-14 19:31:24,143 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242363374] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:31:24,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335903999] [2021-12-14 19:31:24,143 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-14 19:31:24,143 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:31:24,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:31:24,144 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) [2021-12-14 19:31:24,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-14 19:31:24,218 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-12-14 19:31:24,218 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 19:31:24,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 49 conjunts are in the unsatisfiable core [2021-12-14 19:31:24,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:31:24,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:31:24,262 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 11 [2021-12-14 19:31:24,265 INFO L388 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 [2021-12-14 19:31:24,544 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:31:24,544 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:31:24,880 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:31:24,881 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [335903999] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:31:24,881 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:31:24,881 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 32 [2021-12-14 19:31:24,881 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855818812] [2021-12-14 19:31:24,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:31:24,881 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-12-14 19:31:24,881 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:31:24,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-12-14 19:31:24,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=916, Unknown=0, NotChecked=0, Total=1056 [2021-12-14 19:31:24,882 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand has 33 states, 32 states have (on average 3.03125) internal successors, (97), 33 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:31:25,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:31:25,346 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2021-12-14 19:31:25,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-14 19:31:25,347 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 3.03125) internal successors, (97), 33 states have internal predecessors, (97), 0 states have call successors, (0), 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 35 [2021-12-14 19:31:25,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:31:25,347 INFO L225 Difference]: With dead ends: 42 [2021-12-14 19:31:25,347 INFO L226 Difference]: Without dead ends: 42 [2021-12-14 19:31:25,348 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=383, Invalid=1597, Unknown=0, NotChecked=0, Total=1980 [2021-12-14 19:31:25,348 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 130 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:31:25,348 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 106 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:31:25,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-12-14 19:31:25,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2021-12-14 19:31:25,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 40 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:31:25,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2021-12-14 19:31:25,349 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 35 [2021-12-14 19:31:25,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:31:25,350 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2021-12-14 19:31:25,350 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 3.03125) internal successors, (97), 33 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:31:25,350 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2021-12-14 19:31:25,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-14 19:31:25,352 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:31:25,352 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:31:25,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-14 19:31:25,558 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,SelfDestructingSolverStorable22 [2021-12-14 19:31:25,558 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-14 19:31:25,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:31:25,559 INFO L85 PathProgramCache]: Analyzing trace with hash 187721292, now seen corresponding path program 5 times [2021-12-14 19:31:25,559 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:31:25,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732614178] [2021-12-14 19:31:25,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:31:25,559 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:31:25,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:31:25,819 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:31:25,819 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:31:25,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732614178] [2021-12-14 19:31:25,819 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732614178] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:31:25,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796664005] [2021-12-14 19:31:25,819 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-14 19:31:25,819 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:31:25,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:31:25,820 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) [2021-12-14 19:31:25,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-14 19:31:25,906 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2021-12-14 19:31:25,906 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 19:31:25,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 87 conjunts are in the unsatisfiable core [2021-12-14 19:31:25,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:31:26,097 INFO L388 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 14 treesize of output 10 [2021-12-14 19:31:26,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:31:26,266 INFO L388 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 22 treesize of output 21 [2021-12-14 19:31:26,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:31:26,390 INFO L388 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 22 treesize of output 21 [2021-12-14 19:31:26,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:31:26,526 INFO L388 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 22 treesize of output 21 [2021-12-14 19:31:26,626 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:31:26,627 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:31:26,628 INFO L388 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 18 treesize of output 10 [2021-12-14 19:31:26,633 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:31:26,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:31:54,933 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_55| Int) (v_ArrVal_398 Int) (|v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57| Int) (v_ArrVal_396 Int) (v_ArrVal_394 Int)) (or (< (+ |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57| 1) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_55|) (< |c_ULTIMATE.start_cstrcpy_~dst~0#1.offset| |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57|) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base|) |c_ULTIMATE.start_cstrcpy_#t~post2#1.offset| v_ArrVal_394)))) (store .cse0 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| (store (store (select .cse0 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base|) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57| v_ArrVal_396) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_55| v_ArrVal_398))) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 2)) 0))) is different from false [2021-12-14 19:31:59,274 INFO L388 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 778 treesize of output 766 [2021-12-14 19:32:00,154 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2021-12-14 19:32:00,154 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796664005] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:32:00,154 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:32:00,154 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 19] total 47 [2021-12-14 19:32:00,154 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925801797] [2021-12-14 19:32:00,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:32:00,155 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2021-12-14 19:32:00,155 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:32:00,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-12-14 19:32:00,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1914, Unknown=21, NotChecked=88, Total=2162 [2021-12-14 19:32:00,156 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand has 47 states, 47 states have (on average 1.8297872340425532) internal successors, (86), 47 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:32:00,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:32:00,901 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2021-12-14 19:32:00,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-14 19:32:00,902 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 1.8297872340425532) internal successors, (86), 47 states have internal predecessors, (86), 0 states have call successors, (0), 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 38 [2021-12-14 19:32:00,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:32:00,902 INFO L225 Difference]: With dead ends: 66 [2021-12-14 19:32:00,902 INFO L226 Difference]: Without dead ends: 48 [2021-12-14 19:32:00,903 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 618 ImplicationChecksByTransitivity, 33.6s TimeCoverageRelationStatistics Valid=264, Invalid=3625, Unknown=21, NotChecked=122, Total=4032 [2021-12-14 19:32:00,903 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 45 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 347 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:32:00,903 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 325 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 360 Invalid, 0 Unknown, 347 Unchecked, 0.1s Time] [2021-12-14 19:32:00,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2021-12-14 19:32:00,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2021-12-14 19:32:00,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 43 states have (on average 1.069767441860465) internal successors, (46), 44 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:32:00,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2021-12-14 19:32:00,905 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 38 [2021-12-14 19:32:00,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:32:00,905 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2021-12-14 19:32:00,905 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 1.8297872340425532) internal successors, (86), 47 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:32:00,905 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2021-12-14 19:32:00,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-14 19:32:00,906 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:32:00,906 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:32:00,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-14 19:32:01,119 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,SelfDestructingSolverStorable23 [2021-12-14 19:32:01,119 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-14 19:32:01,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:32:01,120 INFO L85 PathProgramCache]: Analyzing trace with hash 406746281, now seen corresponding path program 6 times [2021-12-14 19:32:01,120 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:32:01,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320746654] [2021-12-14 19:32:01,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:32:01,120 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:32:01,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:32:01,292 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:32:01,293 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:32:01,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320746654] [2021-12-14 19:32:01,293 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320746654] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:32:01,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551561159] [2021-12-14 19:32:01,293 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-14 19:32:01,293 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:32:01,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:32:01,294 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) [2021-12-14 19:32:01,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-14 19:32:01,406 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2021-12-14 19:32:01,406 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 19:32:01,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 51 conjunts are in the unsatisfiable core [2021-12-14 19:32:01,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:32:01,430 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-14 19:32:01,431 INFO L388 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 1 case distinctions, treesize of input 9 treesize of output 15 [2021-12-14 19:32:01,795 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 15 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:32:01,795 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:32:02,205 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 28 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:32:02,205 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [551561159] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:32:02,205 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:32:02,205 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 37 [2021-12-14 19:32:02,205 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544076367] [2021-12-14 19:32:02,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:32:02,206 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-12-14 19:32:02,206 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:32:02,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-12-14 19:32:02,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1224, Unknown=0, NotChecked=0, Total=1406 [2021-12-14 19:32:02,207 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand has 38 states, 37 states have (on average 3.189189189189189) internal successors, (118), 38 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) [2021-12-14 19:32:02,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:32:02,835 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2021-12-14 19:32:02,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-14 19:32:02,835 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 3.189189189189189) internal successors, (118), 38 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 42 [2021-12-14 19:32:02,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:32:02,835 INFO L225 Difference]: With dead ends: 51 [2021-12-14 19:32:02,835 INFO L226 Difference]: Without dead ends: 51 [2021-12-14 19:32:02,836 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=546, Invalid=2210, Unknown=0, NotChecked=0, Total=2756 [2021-12-14 19:32:02,836 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 225 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:32:02,836 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [225 Valid, 144 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:32:02,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-12-14 19:32:02,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2021-12-14 19:32:02,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 46 states have (on average 1.065217391304348) internal successors, (49), 47 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:32:02,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2021-12-14 19:32:02,838 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 42 [2021-12-14 19:32:02,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:32:02,838 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2021-12-14 19:32:02,838 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 3.189189189189189) internal successors, (118), 38 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) [2021-12-14 19:32:02,838 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2021-12-14 19:32:02,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-14 19:32:02,839 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:32:02,839 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:32:02,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-14 19:32:03,047 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,SelfDestructingSolverStorable24 [2021-12-14 19:32:03,047 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-14 19:32:03,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:32:03,048 INFO L85 PathProgramCache]: Analyzing trace with hash -275767188, now seen corresponding path program 4 times [2021-12-14 19:32:03,048 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:32:03,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212391484] [2021-12-14 19:32:03,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:32:03,048 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:32:03,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:32:03,275 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 6 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:32:03,275 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:32:03,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212391484] [2021-12-14 19:32:03,275 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212391484] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:32:03,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739408432] [2021-12-14 19:32:03,275 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-14 19:32:03,275 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:32:03,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:32:03,277 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) [2021-12-14 19:32:03,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-14 19:32:03,360 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-14 19:32:03,360 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 19:32:03,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 96 conjunts are in the unsatisfiable core [2021-12-14 19:32:03,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:32:03,373 INFO L388 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 [2021-12-14 19:32:03,378 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 11 [2021-12-14 19:32:03,865 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-12-14 19:32:03,865 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:32:04,375 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-12-14 19:32:04,376 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [739408432] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:32:04,376 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:32:04,376 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 34 [2021-12-14 19:32:04,376 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401981033] [2021-12-14 19:32:04,376 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:32:04,376 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-12-14 19:32:04,376 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:32:04,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-12-14 19:32:04,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1050, Unknown=0, NotChecked=0, Total=1190 [2021-12-14 19:32:04,378 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand has 35 states, 34 states have (on average 2.8529411764705883) internal successors, (97), 35 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:32:06,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:32:06,042 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2021-12-14 19:32:06,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-12-14 19:32:06,042 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.8529411764705883) internal successors, (97), 35 states have internal predecessors, (97), 0 states have call successors, (0), 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 43 [2021-12-14 19:32:06,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:32:06,042 INFO L225 Difference]: With dead ends: 68 [2021-12-14 19:32:06,043 INFO L226 Difference]: Without dead ends: 68 [2021-12-14 19:32:06,044 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 634 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=734, Invalid=3426, Unknown=0, NotChecked=0, Total=4160 [2021-12-14 19:32:06,044 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 100 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 34 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:32:06,044 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 160 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 425 Invalid, 0 Unknown, 34 Unchecked, 0.2s Time] [2021-12-14 19:32:06,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-12-14 19:32:06,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 65. [2021-12-14 19:32:06,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 64 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:32:06,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2021-12-14 19:32:06,048 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 43 [2021-12-14 19:32:06,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:32:06,048 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2021-12-14 19:32:06,048 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.8529411764705883) internal successors, (97), 35 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:32:06,048 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2021-12-14 19:32:06,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-14 19:32:06,049 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:32:06,049 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:32:06,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-12-14 19:32:06,249 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,SelfDestructingSolverStorable25 [2021-12-14 19:32:06,250 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-14 19:32:06,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:32:06,250 INFO L85 PathProgramCache]: Analyzing trace with hash 892135217, now seen corresponding path program 7 times [2021-12-14 19:32:06,250 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:32:06,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35835440] [2021-12-14 19:32:06,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:32:06,250 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:32:06,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:32:06,711 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 10 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:32:06,712 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:32:06,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35835440] [2021-12-14 19:32:06,712 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35835440] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:32:06,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634159943] [2021-12-14 19:32:06,712 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-12-14 19:32:06,712 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:32:06,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:32:06,713 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) [2021-12-14 19:32:06,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-14 19:32:06,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:32:06,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 100 conjunts are in the unsatisfiable core [2021-12-14 19:32:06,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:32:06,803 INFO L388 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 [2021-12-14 19:32:07,029 INFO L388 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 14 treesize of output 10 [2021-12-14 19:32:07,202 INFO L388 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 17 treesize of output 19 [2021-12-14 19:32:07,264 INFO L388 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 16 treesize of output 18 [2021-12-14 19:32:07,316 INFO L388 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 16 treesize of output 18 [2021-12-14 19:32:07,337 INFO L388 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 [2021-12-14 19:32:07,345 INFO L388 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 15 treesize of output 7 [2021-12-14 19:32:07,350 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 10 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:32:07,350 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:32:07,364 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_555 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_555) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0)) is different from false [2021-12-14 19:32:07,370 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_555 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_555) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 1)) 0)) is different from false [2021-12-14 19:32:07,378 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_555 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_554) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_555) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 1)) 0)) is different from false [2021-12-14 19:32:07,383 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_555 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_555) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 2)) 0)) is different from false [2021-12-14 19:32:07,397 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_553 (Array Int Int)) (v_ArrVal_555 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_553) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_555) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 2)) 0)) is different from false [2021-12-14 19:32:07,403 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_555 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_555) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 3)) 0)) is different from false [2021-12-14 19:32:07,409 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_552 (Array Int Int)) (v_ArrVal_555 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_552) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_555) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 3)) 0)) is different from false [2021-12-14 19:32:07,444 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_555 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_555) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 4)) 0)) is different from false [2021-12-14 19:32:07,448 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_555 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_555) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |c_ULTIMATE.start_main_~nondetString~0#1.offset| 4)) 0)) is different from false [2021-12-14 19:32:07,451 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:32:07,452 INFO L388 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 23 treesize of output 24 [2021-12-14 19:32:07,455 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:32:07,456 INFO L388 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 37 treesize of output 37 [2021-12-14 19:32:07,458 INFO L388 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 11 treesize of output 7 [2021-12-14 19:32:07,647 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 10 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 39 not checked. [2021-12-14 19:32:07,647 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634159943] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:32:07,647 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:32:07,647 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 21, 21] total 48 [2021-12-14 19:32:07,648 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181120351] [2021-12-14 19:32:07,648 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:32:07,648 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2021-12-14 19:32:07,648 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:32:07,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-12-14 19:32:07,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1375, Unknown=9, NotChecked=738, Total=2256 [2021-12-14 19:32:07,649 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand has 48 states, 48 states have (on average 2.0625) internal successors, (99), 48 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:32:08,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:32:08,297 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2021-12-14 19:32:08,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-14 19:32:08,298 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.0625) internal successors, (99), 48 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-12-14 19:32:08,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:32:08,299 INFO L225 Difference]: With dead ends: 94 [2021-12-14 19:32:08,299 INFO L226 Difference]: Without dead ends: 72 [2021-12-14 19:32:08,299 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 66 SyntacticMatches, 11 SemanticMatches, 56 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=200, Invalid=2179, Unknown=9, NotChecked=918, Total=3306 [2021-12-14 19:32:08,300 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 31 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 1025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 403 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:32:08,300 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 322 Invalid, 1025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 601 Invalid, 0 Unknown, 403 Unchecked, 0.2s Time] [2021-12-14 19:32:08,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-12-14 19:32:08,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2021-12-14 19:32:08,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 67 states have (on average 1.1044776119402986) internal successors, (74), 68 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:32:08,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2021-12-14 19:32:08,303 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 46 [2021-12-14 19:32:08,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:32:08,303 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2021-12-14 19:32:08,303 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 2.0625) internal successors, (99), 48 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:32:08,303 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2021-12-14 19:32:08,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-12-14 19:32:08,304 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:32:08,304 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:32:08,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-12-14 19:32:08,511 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,SelfDestructingSolverStorable26 [2021-12-14 19:32:08,511 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-14 19:32:08,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:32:08,512 INFO L85 PathProgramCache]: Analyzing trace with hash -282507122, now seen corresponding path program 8 times [2021-12-14 19:32:08,512 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:32:08,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677507151] [2021-12-14 19:32:08,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:32:08,512 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:32:08,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:32:08,722 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 15 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:32:08,722 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:32:08,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677507151] [2021-12-14 19:32:08,722 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677507151] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:32:08,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633256104] [2021-12-14 19:32:08,722 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 19:32:08,722 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:32:08,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:32:08,723 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) [2021-12-14 19:32:08,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-14 19:32:08,815 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 19:32:08,816 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 19:32:08,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 63 conjunts are in the unsatisfiable core [2021-12-14 19:32:08,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:32:09,052 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 28 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:32:09,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:32:09,337 INFO L388 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 5 treesize of output 3 [2021-12-14 19:32:09,387 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 28 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:32:09,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633256104] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:32:09,387 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:32:09,387 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 34 [2021-12-14 19:32:09,387 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606495585] [2021-12-14 19:32:09,387 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:32:09,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-12-14 19:32:09,388 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:32:09,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-12-14 19:32:09,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1050, Unknown=0, NotChecked=0, Total=1190 [2021-12-14 19:32:09,388 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand has 35 states, 34 states have (on average 2.9411764705882355) internal successors, (100), 35 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:32:09,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:32:09,846 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2021-12-14 19:32:09,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-14 19:32:09,846 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.9411764705882355) internal successors, (100), 35 states have internal predecessors, (100), 0 states have call successors, (0), 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 50 [2021-12-14 19:32:09,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:32:09,847 INFO L225 Difference]: With dead ends: 69 [2021-12-14 19:32:09,847 INFO L226 Difference]: Without dead ends: 69 [2021-12-14 19:32:09,847 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=449, Invalid=1903, Unknown=0, NotChecked=0, Total=2352 [2021-12-14 19:32:09,848 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 192 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:32:09,848 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [192 Valid, 169 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:32:09,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-12-14 19:32:09,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2021-12-14 19:32:09,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 67 states have (on average 1.0895522388059702) internal successors, (73), 68 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:32:09,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2021-12-14 19:32:09,850 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 50 [2021-12-14 19:32:09,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:32:09,850 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2021-12-14 19:32:09,850 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.9411764705882355) internal successors, (100), 35 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:32:09,850 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2021-12-14 19:32:09,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-12-14 19:32:09,850 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:32:09,851 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:32:09,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-12-14 19:32:10,058 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,SelfDestructingSolverStorable27 [2021-12-14 19:32:10,058 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-14 19:32:10,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:32:10,059 INFO L85 PathProgramCache]: Analyzing trace with hash 823214230, now seen corresponding path program 9 times [2021-12-14 19:32:10,059 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:32:10,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24703395] [2021-12-14 19:32:10,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:32:10,059 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:32:10,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:32:10,623 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 12 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:32:10,623 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:32:10,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24703395] [2021-12-14 19:32:10,623 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24703395] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:32:10,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198119236] [2021-12-14 19:32:10,623 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-14 19:32:10,623 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:32:10,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:32:10,631 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) [2021-12-14 19:32:10,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-14 19:32:10,844 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2021-12-14 19:32:10,845 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 19:32:10,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 119 conjunts are in the unsatisfiable core [2021-12-14 19:32:10,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:32:10,859 INFO L388 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 [2021-12-14 19:32:11,116 INFO L388 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 14 treesize of output 10 [2021-12-14 19:32:11,250 INFO L388 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 17 treesize of output 19 [2021-12-14 19:32:11,313 INFO L388 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 16 treesize of output 18 [2021-12-14 19:32:11,360 INFO L388 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 16 treesize of output 18 [2021-12-14 19:32:11,416 INFO L388 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 16 treesize of output 18 [2021-12-14 19:32:11,465 INFO L388 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 [2021-12-14 19:32:11,501 INFO L388 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 15 treesize of output 7 [2021-12-14 19:32:11,508 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 12 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:32:11,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:32:11,521 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_676 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_676) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0)) is different from false [2021-12-14 19:32:11,528 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_676 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_676) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 1)) 0)) is different from false [2021-12-14 19:32:11,533 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_676 (Array Int Int)) (v_ArrVal_675 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_675) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_676) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 1)) 0)) is different from false [2021-12-14 19:32:11,539 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_676 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_676) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 2)) 0)) is different from false [2021-12-14 19:32:11,544 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_674 (Array Int Int)) (v_ArrVal_676 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_674) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_676) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 2)) 0)) is different from false [2021-12-14 19:32:11,550 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_676 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_676) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 3)) 0)) is different from false [2021-12-14 19:32:11,556 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_673 (Array Int Int)) (v_ArrVal_676 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_673) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_676) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 3)))) is different from false [2021-12-14 19:32:11,562 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_676 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_676) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 4)) 0)) is different from false [2021-12-14 19:32:11,574 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_672 (Array Int Int)) (v_ArrVal_676 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_672) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_676) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 4)) 0)) is different from false [2021-12-14 19:32:11,581 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_676 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_676) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 5)) 0)) is different from false [2021-12-14 19:32:11,585 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_676 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_676) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 5 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2021-12-14 19:32:11,589 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:32:11,589 INFO L388 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 23 treesize of output 24 [2021-12-14 19:32:11,595 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:32:11,595 INFO L388 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 37 treesize of output 37 [2021-12-14 19:32:11,597 INFO L388 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 11 treesize of output 7 [2021-12-14 19:32:11,834 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 12 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 59 not checked. [2021-12-14 19:32:11,835 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198119236] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:32:11,835 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:32:11,835 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 24, 24] total 58 [2021-12-14 19:32:11,835 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996781657] [2021-12-14 19:32:11,835 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:32:11,835 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2021-12-14 19:32:11,835 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:32:11,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2021-12-14 19:32:11,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=2031, Unknown=11, NotChecked=1100, Total=3306 [2021-12-14 19:32:11,836 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand has 58 states, 58 states have (on average 2.086206896551724) internal successors, (121), 58 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:32:12,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:32:12,868 INFO L93 Difference]: Finished difference Result 102 states and 106 transitions. [2021-12-14 19:32:12,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-12-14 19:32:12,869 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 2.086206896551724) internal successors, (121), 58 states have internal predecessors, (121), 0 states have call successors, (0), 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 54 [2021-12-14 19:32:12,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:32:12,869 INFO L225 Difference]: With dead ends: 102 [2021-12-14 19:32:12,869 INFO L226 Difference]: Without dead ends: 76 [2021-12-14 19:32:12,871 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 76 SyntacticMatches, 14 SemanticMatches, 70 ConstructedPredicates, 11 IntricatePredicates, 1 DeprecatedPredicates, 910 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=265, Invalid=3428, Unknown=11, NotChecked=1408, Total=5112 [2021-12-14 19:32:12,871 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 32 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 1418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 587 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:32:12,871 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 495 Invalid, 1418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 811 Invalid, 0 Unknown, 587 Unchecked, 0.3s Time] [2021-12-14 19:32:12,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-12-14 19:32:12,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2021-12-14 19:32:12,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 71 states have (on average 1.0845070422535212) internal successors, (77), 72 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:32:12,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2021-12-14 19:32:12,873 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 54 [2021-12-14 19:32:12,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:32:12,873 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2021-12-14 19:32:12,873 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 2.086206896551724) internal successors, (121), 58 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:32:12,873 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2021-12-14 19:32:12,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-14 19:32:12,873 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:32:12,873 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:32:12,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-12-14 19:32:13,082 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:32:13,082 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-14 19:32:13,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:32:13,083 INFO L85 PathProgramCache]: Analyzing trace with hash -101124877, now seen corresponding path program 10 times [2021-12-14 19:32:13,083 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:32:13,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007080993] [2021-12-14 19:32:13,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:32:13,083 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:32:13,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:32:13,303 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 28 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:32:13,303 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:32:13,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007080993] [2021-12-14 19:32:13,303 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007080993] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:32:13,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928219627] [2021-12-14 19:32:13,303 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-14 19:32:13,303 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:32:13,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:32:13,305 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) [2021-12-14 19:32:13,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-12-14 19:32:13,400 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-14 19:32:13,400 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 19:32:13,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 122 conjunts are in the unsatisfiable core [2021-12-14 19:32:13,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:32:13,428 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-14 19:32:13,428 INFO L388 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 1 case distinctions, treesize of input 9 treesize of output 15 [2021-12-14 19:32:13,434 INFO L388 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 [2021-12-14 19:32:13,754 INFO L388 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 16 treesize of output 12 [2021-12-14 19:32:13,913 INFO L388 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 [2021-12-14 19:32:14,018 INFO L388 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 [2021-12-14 19:32:14,132 INFO L388 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 [2021-12-14 19:32:14,243 INFO L388 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 [2021-12-14 19:32:14,361 INFO L388 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 [2021-12-14 19:32:14,469 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:32:14,470 INFO L388 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 [2021-12-14 19:32:14,597 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 50 proven. 88 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:32:14,597 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:32:15,452 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_749 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_131| Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_749) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 5 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_131|)) 0) (< |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_131|) (< |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_131| 0) (<= (+ 7 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_131|) (select |c_#length| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|)))) is different from false [2021-12-14 19:32:15,469 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_749 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_131| Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_749) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 5 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_131|)) 0) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_131|) (< |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_131| 0) (<= (+ 7 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_131|) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)))) is different from false [2021-12-14 19:32:15,478 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:32:15,478 INFO L388 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 23 treesize of output 24 [2021-12-14 19:32:15,483 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:32:15,483 INFO L388 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 37 treesize of output 37 [2021-12-14 19:32:15,486 INFO L388 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 11 treesize of output 7 [2021-12-14 19:32:16,560 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 66 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2021-12-14 19:32:16,560 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928219627] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:32:16,560 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:32:16,561 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 25, 25] total 65 [2021-12-14 19:32:16,561 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702127482] [2021-12-14 19:32:16,561 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:32:16,562 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2021-12-14 19:32:16,562 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:32:16,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2021-12-14 19:32:16,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=410, Invalid=3623, Unknown=7, NotChecked=250, Total=4290 [2021-12-14 19:32:16,563 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand has 66 states, 65 states have (on average 2.5538461538461537) internal successors, (166), 66 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:32:18,065 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 1)) (.cse0 (select |c_#length| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|))) (and (<= |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 6) (<= 6 .cse0) (<= 6 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) (or (not (= |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| .cse0)) (= |c_ULTIMATE.start_cstrcpy_#t~mem4#1| 0)) (<= .cse1 .cse0) (or (and (<= 0 .cse1) (<= (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 2) .cse0)) (forall ((v_ArrVal_749 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_749) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0))))) is different from false [2021-12-14 19:32:18,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:32:18,262 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2021-12-14 19:32:18,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-12-14 19:32:18,262 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 65 states have (on average 2.5538461538461537) internal successors, (166), 66 states have internal predecessors, (166), 0 states have call successors, (0), 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 58 [2021-12-14 19:32:18,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:32:18,263 INFO L225 Difference]: With dead ends: 73 [2021-12-14 19:32:18,263 INFO L226 Difference]: Without dead ends: 73 [2021-12-14 19:32:18,264 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 68 SyntacticMatches, 5 SemanticMatches, 89 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1263 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1094, Invalid=6545, Unknown=29, NotChecked=522, Total=8190 [2021-12-14 19:32:18,265 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 107 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 174 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:32:18,265 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 311 Invalid, 830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 580 Invalid, 0 Unknown, 174 Unchecked, 0.3s Time] [2021-12-14 19:32:18,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-12-14 19:32:18,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2021-12-14 19:32:18,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 71 states have (on average 1.056338028169014) internal successors, (75), 72 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:32:18,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2021-12-14 19:32:18,266 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 58 [2021-12-14 19:32:18,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:32:18,266 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2021-12-14 19:32:18,266 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 65 states have (on average 2.5538461538461537) internal successors, (166), 66 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:32:18,267 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2021-12-14 19:32:18,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-14 19:32:18,267 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:32:18,267 INFO L514 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:32:18,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-12-14 19:32:18,467 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:32:18,467 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-14 19:32:18,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:32:18,468 INFO L85 PathProgramCache]: Analyzing trace with hash 336686083, now seen corresponding path program 11 times [2021-12-14 19:32:18,468 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:32:18,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754475416] [2021-12-14 19:32:18,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:32:18,468 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:32:18,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:32:18,683 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 108 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:32:18,683 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:32:18,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754475416] [2021-12-14 19:32:18,683 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754475416] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:32:18,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1279352572] [2021-12-14 19:32:18,683 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-14 19:32:18,683 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:32:18,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:32:18,685 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) [2021-12-14 19:32:18,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-12-14 19:32:18,900 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2021-12-14 19:32:18,900 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 19:32:18,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 69 conjunts are in the unsatisfiable core [2021-12-14 19:32:18,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:32:18,927 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-14 19:32:18,927 INFO L388 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 1 case distinctions, treesize of input 9 treesize of output 15 [2021-12-14 19:32:19,503 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 121 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:32:19,503 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:32:19,898 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 121 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:32:19,898 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1279352572] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:32:19,898 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:32:19,898 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 46 [2021-12-14 19:32:19,899 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537431369] [2021-12-14 19:32:19,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:32:19,899 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2021-12-14 19:32:19,899 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:32:19,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-12-14 19:32:19,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=336, Invalid=1734, Unknown=0, NotChecked=0, Total=2070 [2021-12-14 19:32:19,900 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand has 46 states, 46 states have (on average 3.347826086956522) internal successors, (154), 46 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:32:20,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:32:20,500 INFO L93 Difference]: Finished difference Result 112 states and 114 transitions. [2021-12-14 19:32:20,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-14 19:32:20,501 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 3.347826086956522) internal successors, (154), 46 states have internal predecessors, (154), 0 states have call successors, (0), 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 66 [2021-12-14 19:32:20,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:32:20,501 INFO L225 Difference]: With dead ends: 112 [2021-12-14 19:32:20,501 INFO L226 Difference]: Without dead ends: 80 [2021-12-14 19:32:20,501 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 900 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=732, Invalid=3174, Unknown=0, NotChecked=0, Total=3906 [2021-12-14 19:32:20,502 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 122 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:32:20,502 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 153 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:32:20,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-12-14 19:32:20,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2021-12-14 19:32:20,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 75 states have (on average 1.0533333333333332) internal successors, (79), 76 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:32:20,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 79 transitions. [2021-12-14 19:32:20,506 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 79 transitions. Word has length 66 [2021-12-14 19:32:20,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:32:20,506 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 79 transitions. [2021-12-14 19:32:20,506 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 3.347826086956522) internal successors, (154), 46 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:32:20,506 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 79 transitions. [2021-12-14 19:32:20,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-14 19:32:20,507 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:32:20,507 INFO L514 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:32:20,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-12-14 19:32:20,715 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:32:20,715 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-14 19:32:20,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:32:20,715 INFO L85 PathProgramCache]: Analyzing trace with hash -2136703776, now seen corresponding path program 12 times [2021-12-14 19:32:20,716 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:32:20,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351166902] [2021-12-14 19:32:20,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:32:20,716 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:32:20,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:32:21,484 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 16 proven. 203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:32:21,485 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:32:21,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351166902] [2021-12-14 19:32:21,485 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351166902] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:32:21,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707855213] [2021-12-14 19:32:21,485 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-14 19:32:21,485 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:32:21,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:32:21,486 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) [2021-12-14 19:32:21,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-12-14 19:32:21,991 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2021-12-14 19:32:21,991 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 19:32:21,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 149 conjunts are in the unsatisfiable core [2021-12-14 19:32:21,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:32:22,008 INFO L388 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 [2021-12-14 19:32:22,397 INFO L388 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 14 treesize of output 10 [2021-12-14 19:32:22,553 INFO L388 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 17 treesize of output 19 [2021-12-14 19:32:22,628 INFO L388 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 16 treesize of output 18 [2021-12-14 19:32:22,685 INFO L388 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 16 treesize of output 18 [2021-12-14 19:32:22,741 INFO L388 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 16 treesize of output 18 [2021-12-14 19:32:22,801 INFO L388 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 16 treesize of output 18 [2021-12-14 19:32:22,855 INFO L388 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 16 treesize of output 18 [2021-12-14 19:32:22,910 INFO L388 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 [2021-12-14 19:32:22,974 INFO L388 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 15 treesize of output 7 [2021-12-14 19:32:22,980 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 16 proven. 203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:32:22,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:32:22,995 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_906 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_906) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0)) is different from false [2021-12-14 19:32:23,001 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_906 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_906) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 1)) 0)) is different from false [2021-12-14 19:32:23,007 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_906 (Array Int Int)) (v_ArrVal_905 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_905) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_906) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 1)) 0)) is different from false [2021-12-14 19:32:23,014 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_906 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_906) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 2)) 0)) is different from false [2021-12-14 19:32:23,019 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_904 (Array Int Int)) (v_ArrVal_906 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_904) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_906) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 2)) 0)) is different from false [2021-12-14 19:32:23,026 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_906 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_906) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 3)) 0)) is different from false [2021-12-14 19:32:23,032 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_903 (Array Int Int)) (v_ArrVal_906 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_903) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_906) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 3)) 0)) is different from false [2021-12-14 19:32:23,038 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_906 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_906) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 4)) 0)) is different from false [2021-12-14 19:32:23,044 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_902 (Array Int Int)) (v_ArrVal_906 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_902) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_906) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 4)) 0)) is different from false [2021-12-14 19:32:23,050 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_906 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_906) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 5)) 0)) is different from false [2021-12-14 19:32:23,057 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_901 (Array Int Int)) (v_ArrVal_906 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_901) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_906) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 5)) 0)) is different from false [2021-12-14 19:32:23,064 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_906 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_906) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 6)) 0)) is different from false [2021-12-14 19:32:23,070 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_900 (Array Int Int)) (v_ArrVal_906 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_900) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_906) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 6)) 0)) is different from false [2021-12-14 19:32:23,076 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_906 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_906) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2021-12-14 19:32:23,080 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_906 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_906) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 7 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2021-12-14 19:32:23,089 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:32:23,089 INFO L388 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 23 treesize of output 24 [2021-12-14 19:32:23,094 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:32:23,095 INFO L388 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 37 treesize of output 37 [2021-12-14 19:32:23,097 INFO L388 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 11 treesize of output 7 [2021-12-14 19:32:23,378 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 16 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 111 not checked. [2021-12-14 19:32:23,378 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707855213] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:32:23,378 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:32:23,378 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 30, 30] total 74 [2021-12-14 19:32:23,379 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130913115] [2021-12-14 19:32:23,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:32:23,379 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2021-12-14 19:32:23,379 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:32:23,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2021-12-14 19:32:23,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=3259, Unknown=15, NotChecked=1920, Total=5402 [2021-12-14 19:32:23,380 INFO L87 Difference]: Start difference. First operand 77 states and 79 transitions. Second operand has 74 states, 74 states have (on average 2.1486486486486487) internal successors, (159), 74 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)