./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/openbsd_cstrcpy-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3a877d22 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/openbsd_cstrcpy-alloca-2.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 4b6873ae1a0d665798beb3dd9c0c48e89806da7dd46f1d2066800a52e0a2aa51 --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 13:57:09,851 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 13:57:09,853 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 13:57:09,893 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 13:57:09,894 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 13:57:09,897 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 13:57:09,898 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 13:57:09,901 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 13:57:09,903 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 13:57:09,906 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 13:57:09,907 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 13:57:09,908 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 13:57:09,908 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 13:57:09,911 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 13:57:09,912 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 13:57:09,918 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 13:57:09,919 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 13:57:09,920 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 13:57:09,922 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 13:57:09,930 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 13:57:09,932 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 13:57:09,933 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 13:57:09,934 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 13:57:09,935 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 13:57:09,939 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 13:57:09,939 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 13:57:09,939 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 13:57:09,941 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 13:57:09,941 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 13:57:09,941 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 13:57:09,942 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 13:57:09,942 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 13:57:09,943 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 13:57:09,943 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 13:57:09,944 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 13:57:09,944 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 13:57:09,944 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 13:57:09,944 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 13:57:09,945 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 13:57:09,945 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 13:57:09,945 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 13:57:09,947 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-15 13:57:09,977 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 13:57:09,978 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 13:57:09,978 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 13:57:09,978 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 13:57:09,979 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-15 13:57:09,979 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-15 13:57:09,980 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 13:57:09,980 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 13:57:09,980 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 13:57:09,981 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 13:57:09,981 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 13:57:09,982 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-15 13:57:09,982 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 13:57:09,982 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 13:57:09,982 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 13:57:09,982 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-15 13:57:09,983 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-15 13:57:09,983 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-15 13:57:09,983 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-15 13:57:09,983 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-15 13:57:09,983 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 13:57:09,984 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 13:57:09,984 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 13:57:09,984 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 13:57:09,984 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-15 13:57:09,984 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 13:57:09,985 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 13:57:09,986 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-15 13:57:09,986 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 13:57:09,986 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-15 13:57:09,986 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 13:57:09,986 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 -> 4b6873ae1a0d665798beb3dd9c0c48e89806da7dd46f1d2066800a52e0a2aa51 [2021-12-15 13:57:10,218 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 13:57:10,245 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 13:57:10,247 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 13:57:10,248 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 13:57:10,249 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 13:57:10,250 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/openbsd_cstrcpy-alloca-2.i [2021-12-15 13:57:10,316 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afe7bf383/a21689961d9a469b8cba18ecba9f5acd/FLAG96da49fa3 [2021-12-15 13:57:10,743 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 13:57:10,744 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/openbsd_cstrcpy-alloca-2.i [2021-12-15 13:57:10,753 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afe7bf383/a21689961d9a469b8cba18ecba9f5acd/FLAG96da49fa3 [2021-12-15 13:57:10,765 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afe7bf383/a21689961d9a469b8cba18ecba9f5acd [2021-12-15 13:57:10,773 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 13:57:10,774 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 13:57:10,776 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 13:57:10,776 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 13:57:10,779 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 13:57:10,779 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 01:57:10" (1/1) ... [2021-12-15 13:57:10,780 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46f3906d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:57:10, skipping insertion in model container [2021-12-15 13:57:10,780 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 01:57:10" (1/1) ... [2021-12-15 13:57:10,786 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 13:57:10,833 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 13:57:11,046 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 13:57:11,052 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 13:57:11,083 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 13:57:11,107 INFO L208 MainTranslator]: Completed translation [2021-12-15 13:57:11,107 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:57:11 WrapperNode [2021-12-15 13:57:11,107 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 13:57:11,108 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 13:57:11,108 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 13:57:11,108 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 13:57:11,119 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:57:11" (1/1) ... [2021-12-15 13:57:11,130 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:57:11" (1/1) ... [2021-12-15 13:57:11,145 INFO L137 Inliner]: procedures = 117, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 65 [2021-12-15 13:57:11,145 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 13:57:11,146 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 13:57:11,146 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 13:57:11,146 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 13:57:11,152 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:57:11" (1/1) ... [2021-12-15 13:57:11,154 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:57:11" (1/1) ... [2021-12-15 13:57:11,158 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:57:11" (1/1) ... [2021-12-15 13:57:11,158 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:57:11" (1/1) ... [2021-12-15 13:57:11,163 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:57:11" (1/1) ... [2021-12-15 13:57:11,166 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:57:11" (1/1) ... [2021-12-15 13:57:11,167 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:57:11" (1/1) ... [2021-12-15 13:57:11,168 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 13:57:11,169 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 13:57:11,169 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 13:57:11,169 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 13:57:11,175 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:57:11" (1/1) ... [2021-12-15 13:57:11,181 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 13:57:11,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:57:11,202 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-15 13:57:11,220 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-15 13:57:11,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-15 13:57:11,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-15 13:57:11,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-15 13:57:11,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-15 13:57:11,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 13:57:11,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 13:57:11,299 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 13:57:11,300 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 13:57:11,463 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 13:57:11,468 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 13:57:11,469 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-15 13:57:11,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 01:57:11 BoogieIcfgContainer [2021-12-15 13:57:11,471 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 13:57:11,474 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-15 13:57:11,474 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-15 13:57:11,481 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-15 13:57:11,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 01:57:10" (1/3) ... [2021-12-15 13:57:11,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34f05217 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 01:57:11, skipping insertion in model container [2021-12-15 13:57:11,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:57:11" (2/3) ... [2021-12-15 13:57:11,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34f05217 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 01:57:11, skipping insertion in model container [2021-12-15 13:57:11,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 01:57:11" (3/3) ... [2021-12-15 13:57:11,484 INFO L111 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcpy-alloca-2.i [2021-12-15 13:57:11,487 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-15 13:57:11,488 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2021-12-15 13:57:11,521 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-15 13:57:11,526 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-15 13:57:11,526 INFO L340 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2021-12-15 13:57:11,540 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-15 13:57:11,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-15 13:57:11,546 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:57:11,547 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-15 13:57:11,547 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-15 13:57:11,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:57:11,551 INFO L85 PathProgramCache]: Analyzing trace with hash 889510840, now seen corresponding path program 1 times [2021-12-15 13:57:11,556 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:57:11,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048829188] [2021-12-15 13:57:11,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:57:11,558 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:57:11,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:11,723 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-15 13:57:11,723 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:57:11,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048829188] [2021-12-15 13:57:11,725 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048829188] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:57:11,725 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:57:11,725 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 13:57:11,727 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806802254] [2021-12-15 13:57:11,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:57:11,732 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 13:57:11,733 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:57:11,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 13:57:11,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 13:57:11,785 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-15 13:57:11,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:57:11,844 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2021-12-15 13:57:11,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 13:57:11,846 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-15 13:57:11,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:57:11,855 INFO L225 Difference]: With dead ends: 34 [2021-12-15 13:57:11,855 INFO L226 Difference]: Without dead ends: 30 [2021-12-15 13:57:11,858 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-15 13:57:11,861 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-15 13:57:11,862 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-15 13:57:11,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-12-15 13:57:11,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2021-12-15 13:57:11,888 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-15 13:57:11,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2021-12-15 13:57:11,891 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 6 [2021-12-15 13:57:11,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:57:11,891 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2021-12-15 13:57:11,892 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-15 13:57:11,892 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2021-12-15 13:57:11,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-15 13:57:11,893 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:57:11,893 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-15 13:57:11,893 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-15 13:57:11,894 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-15 13:57:11,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:57:11,897 INFO L85 PathProgramCache]: Analyzing trace with hash 889512762, now seen corresponding path program 1 times [2021-12-15 13:57:11,897 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:57:11,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553824832] [2021-12-15 13:57:11,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:57:11,898 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:57:11,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:11,944 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-15 13:57:11,945 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:57:11,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553824832] [2021-12-15 13:57:11,946 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553824832] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:57:11,946 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:57:11,946 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 13:57:11,947 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377171075] [2021-12-15 13:57:11,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:57:11,948 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 13:57:11,948 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:57:11,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 13:57:11,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 13:57:11,950 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-15 13:57:11,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:57:11,975 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2021-12-15 13:57:11,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 13:57:11,976 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-15 13:57:11,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:57:11,978 INFO L225 Difference]: With dead ends: 29 [2021-12-15 13:57:11,978 INFO L226 Difference]: Without dead ends: 28 [2021-12-15 13:57:11,979 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-15 13:57:11,984 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-15 13:57:11,985 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-15 13:57:11,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2021-12-15 13:57:11,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2021-12-15 13:57:11,991 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-15 13:57:11,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2021-12-15 13:57:11,992 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 6 [2021-12-15 13:57:11,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:57:11,993 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2021-12-15 13:57:11,994 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-15 13:57:11,994 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2021-12-15 13:57:11,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-15 13:57:11,994 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:57:11,995 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:57:11,995 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-15 13:57:11,996 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-15 13:57:11,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:57:11,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1805033015, now seen corresponding path program 1 times [2021-12-15 13:57:11,999 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:57:12,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055001708] [2021-12-15 13:57:12,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:57:12,002 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:57:12,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:12,065 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-15 13:57:12,065 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:57:12,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055001708] [2021-12-15 13:57:12,070 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055001708] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:57:12,070 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:57:12,071 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 13:57:12,072 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996612458] [2021-12-15 13:57:12,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:57:12,072 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 13:57:12,073 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:57:12,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 13:57:12,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 13:57:12,074 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-15 13:57:12,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:57:12,098 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2021-12-15 13:57:12,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 13:57:12,098 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-15 13:57:12,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:57:12,099 INFO L225 Difference]: With dead ends: 25 [2021-12-15 13:57:12,099 INFO L226 Difference]: Without dead ends: 25 [2021-12-15 13:57:12,100 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-15 13:57:12,105 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-15 13:57:12,106 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-15 13:57:12,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-12-15 13:57:12,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2021-12-15 13:57:12,112 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-15 13:57:12,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2021-12-15 13:57:12,113 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 7 [2021-12-15 13:57:12,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:57:12,114 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2021-12-15 13:57:12,114 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-15 13:57:12,114 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2021-12-15 13:57:12,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-15 13:57:12,115 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:57:12,115 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:57:12,116 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-15 13:57:12,116 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-15 13:57:12,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:57:12,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1805033016, now seen corresponding path program 1 times [2021-12-15 13:57:12,117 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:57:12,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191898549] [2021-12-15 13:57:12,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:57:12,118 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:57:12,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:12,205 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-15 13:57:12,206 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:57:12,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191898549] [2021-12-15 13:57:12,206 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191898549] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:57:12,206 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:57:12,207 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 13:57:12,207 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253118425] [2021-12-15 13:57:12,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:57:12,207 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 13:57:12,208 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:57:12,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 13:57:12,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-15 13:57:12,209 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-15 13:57:12,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:57:12,240 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2021-12-15 13:57:12,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 13:57:12,240 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-15 13:57:12,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:57:12,241 INFO L225 Difference]: With dead ends: 24 [2021-12-15 13:57:12,242 INFO L226 Difference]: Without dead ends: 24 [2021-12-15 13:57:12,242 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-15 13:57:12,247 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-15 13:57:12,248 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-15 13:57:12,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2021-12-15 13:57:12,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2021-12-15 13:57:12,251 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-15 13:57:12,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2021-12-15 13:57:12,252 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 7 [2021-12-15 13:57:12,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:57:12,253 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2021-12-15 13:57:12,253 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-15 13:57:12,253 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2021-12-15 13:57:12,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-15 13:57:12,253 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:57:12,254 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:57:12,254 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-15 13:57:12,254 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-15 13:57:12,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:57:12,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1805033069, now seen corresponding path program 1 times [2021-12-15 13:57:12,255 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:57:12,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905392169] [2021-12-15 13:57:12,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:57:12,256 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:57:12,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:12,309 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-15 13:57:12,309 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:57:12,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905392169] [2021-12-15 13:57:12,309 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905392169] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:57:12,310 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:57:12,310 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 13:57:12,310 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297983948] [2021-12-15 13:57:12,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:57:12,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 13:57:12,311 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:57:12,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 13:57:12,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-15 13:57:12,311 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-15 13:57:12,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:57:12,324 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2021-12-15 13:57:12,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 13:57:12,325 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-15 13:57:12,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:57:12,326 INFO L225 Difference]: With dead ends: 40 [2021-12-15 13:57:12,326 INFO L226 Difference]: Without dead ends: 40 [2021-12-15 13:57:12,326 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-15 13:57:12,327 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-15 13:57:12,327 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-15 13:57:12,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2021-12-15 13:57:12,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 26. [2021-12-15 13:57:12,329 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-15 13:57:12,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2021-12-15 13:57:12,330 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 7 [2021-12-15 13:57:12,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:57:12,330 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2021-12-15 13:57:12,331 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-15 13:57:12,331 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2021-12-15 13:57:12,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-15 13:57:12,331 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:57:12,331 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:57:12,332 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-15 13:57:12,332 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-15 13:57:12,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:57:12,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1805092651, now seen corresponding path program 1 times [2021-12-15 13:57:12,332 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:57:12,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035942016] [2021-12-15 13:57:12,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:57:12,333 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:57:12,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:12,387 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-15 13:57:12,387 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:57:12,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035942016] [2021-12-15 13:57:12,388 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035942016] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:57:12,388 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:57:12,388 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 13:57:12,388 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204841635] [2021-12-15 13:57:12,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:57:12,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 13:57:12,389 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:57:12,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 13:57:12,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-15 13:57:12,389 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 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-15 13:57:12,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:57:12,428 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2021-12-15 13:57:12,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 13:57:12,429 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 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-15 13:57:12,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:57:12,429 INFO L225 Difference]: With dead ends: 44 [2021-12-15 13:57:12,429 INFO L226 Difference]: Without dead ends: 44 [2021-12-15 13:57:12,430 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-15 13:57:12,430 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 39 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 13:57:12,431 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 45 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 13:57:12,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2021-12-15 13:57:12,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 28. [2021-12-15 13:57:12,433 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-15 13:57:12,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2021-12-15 13:57:12,434 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 7 [2021-12-15 13:57:12,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:57:12,434 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2021-12-15 13:57:12,434 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 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-15 13:57:12,434 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2021-12-15 13:57:12,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-15 13:57:12,435 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:57:12,435 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:57:12,435 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-15 13:57:12,435 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-15 13:57:12,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:57:12,436 INFO L85 PathProgramCache]: Analyzing trace with hash -530059845, now seen corresponding path program 1 times [2021-12-15 13:57:12,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:57:12,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183809298] [2021-12-15 13:57:12,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:57:12,437 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:57:12,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:12,479 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-15 13:57:12,479 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:57:12,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183809298] [2021-12-15 13:57:12,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183809298] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:57:12,480 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:57:12,480 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 13:57:12,480 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985463129] [2021-12-15 13:57:12,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:57:12,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 13:57:12,481 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:57:12,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 13:57:12,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 13:57:12,481 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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-15 13:57:12,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:57:12,507 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2021-12-15 13:57:12,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 13:57:12,508 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2021-12-15 13:57:12,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:57:12,508 INFO L225 Difference]: With dead ends: 27 [2021-12-15 13:57:12,508 INFO L226 Difference]: Without dead ends: 27 [2021-12-15 13:57:12,509 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-15 13:57:12,509 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 23 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 13:57:12,510 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 28 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 13:57:12,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-12-15 13:57:12,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2021-12-15 13:57:12,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.4090909090909092) 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-15 13:57:12,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2021-12-15 13:57:12,512 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 9 [2021-12-15 13:57:12,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:57:12,513 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2021-12-15 13:57:12,513 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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-15 13:57:12,513 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2021-12-15 13:57:12,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-15 13:57:12,513 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:57:12,513 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:57:12,514 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-15 13:57:12,514 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-15 13:57:12,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:57:12,514 INFO L85 PathProgramCache]: Analyzing trace with hash -530059844, now seen corresponding path program 1 times [2021-12-15 13:57:12,515 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:57:12,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723038207] [2021-12-15 13:57:12,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:57:12,515 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:57:12,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:12,575 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-15 13:57:12,575 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:57:12,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723038207] [2021-12-15 13:57:12,576 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723038207] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:57:12,576 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:57:12,576 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 13:57:12,576 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464668058] [2021-12-15 13:57:12,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:57:12,577 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-15 13:57:12,577 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:57:12,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-15 13:57:12,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-15 13:57:12,578 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 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-15 13:57:12,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:57:12,622 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2021-12-15 13:57:12,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 13:57:12,622 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2021-12-15 13:57:12,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:57:12,623 INFO L225 Difference]: With dead ends: 37 [2021-12-15 13:57:12,623 INFO L226 Difference]: Without dead ends: 37 [2021-12-15 13:57:12,624 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-15 13:57:12,624 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 65 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 13:57:12,624 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 39 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 13:57:12,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-12-15 13:57:12,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 28. [2021-12-15 13:57:12,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.391304347826087) 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-15 13:57:12,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2021-12-15 13:57:12,627 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 9 [2021-12-15 13:57:12,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:57:12,627 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2021-12-15 13:57:12,628 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 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-15 13:57:12,628 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2021-12-15 13:57:12,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-15 13:57:12,628 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:57:12,628 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:57:12,629 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-15 13:57:12,629 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-15 13:57:12,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:57:12,629 INFO L85 PathProgramCache]: Analyzing trace with hash 748014006, now seen corresponding path program 1 times [2021-12-15 13:57:12,629 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:57:12,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973486887] [2021-12-15 13:57:12,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:57:12,630 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:57:12,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:12,682 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-15 13:57:12,682 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:57:12,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973486887] [2021-12-15 13:57:12,683 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973486887] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:57:12,683 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:57:12,683 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 13:57:12,683 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974433793] [2021-12-15 13:57:12,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:57:12,684 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 13:57:12,684 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:57:12,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 13:57:12,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-15 13:57:12,685 INFO L87 Difference]: Start difference. First operand 28 states and 32 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-15 13:57:12,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:57:12,720 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2021-12-15 13:57:12,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 13:57:12,721 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-15 13:57:12,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:57:12,721 INFO L225 Difference]: With dead ends: 27 [2021-12-15 13:57:12,722 INFO L226 Difference]: Without dead ends: 27 [2021-12-15 13:57:12,722 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-12-15 13:57:12,722 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 26 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 13:57:12,723 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 28 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 13:57:12,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-12-15 13:57:12,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2021-12-15 13:57:12,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.3478260869565217) 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-15 13:57:12,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2021-12-15 13:57:12,725 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 10 [2021-12-15 13:57:12,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:57:12,726 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2021-12-15 13:57:12,726 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-15 13:57:12,726 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2021-12-15 13:57:12,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-15 13:57:12,726 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:57:12,727 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:57:12,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-15 13:57:12,727 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-15 13:57:12,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:57:12,728 INFO L85 PathProgramCache]: Analyzing trace with hash 748014007, now seen corresponding path program 1 times [2021-12-15 13:57:12,728 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:57:12,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504070171] [2021-12-15 13:57:12,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:57:12,728 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:57:12,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:12,771 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-15 13:57:12,771 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:57:12,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504070171] [2021-12-15 13:57:12,772 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504070171] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:57:12,772 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:57:12,772 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 13:57:12,772 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206413701] [2021-12-15 13:57:12,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:57:12,773 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 13:57:12,773 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:57:12,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 13:57:12,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 13:57:12,774 INFO L87 Difference]: Start difference. First operand 27 states and 31 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-15 13:57:12,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:57:12,808 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2021-12-15 13:57:12,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 13:57:12,809 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-15 13:57:12,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:57:12,809 INFO L225 Difference]: With dead ends: 34 [2021-12-15 13:57:12,809 INFO L226 Difference]: Without dead ends: 34 [2021-12-15 13:57:12,810 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-15 13:57:12,810 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 56 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 13:57:12,810 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 36 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 13:57:12,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-12-15 13:57:12,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2021-12-15 13:57:12,812 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-15 13:57:12,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2021-12-15 13:57:12,813 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 10 [2021-12-15 13:57:12,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:57:12,813 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2021-12-15 13:57:12,813 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-15 13:57:12,814 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2021-12-15 13:57:12,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-15 13:57:12,814 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:57:12,814 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:57:12,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-15 13:57:12,815 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-15 13:57:12,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:57:12,815 INFO L85 PathProgramCache]: Analyzing trace with hash 952918382, now seen corresponding path program 1 times [2021-12-15 13:57:12,815 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:57:12,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736064818] [2021-12-15 13:57:12,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:57:12,816 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:57:12,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:12,844 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-15 13:57:12,845 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:57:12,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736064818] [2021-12-15 13:57:12,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736064818] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:57:12,845 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:57:12,846 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 13:57:12,846 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604091977] [2021-12-15 13:57:12,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:57:12,846 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 13:57:12,846 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:57:12,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 13:57:12,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 13:57:12,847 INFO L87 Difference]: Start difference. First operand 28 states and 32 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-15 13:57:12,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:57:12,869 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2021-12-15 13:57:12,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 13:57:12,869 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-15 13:57:12,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:57:12,870 INFO L225 Difference]: With dead ends: 47 [2021-12-15 13:57:12,870 INFO L226 Difference]: Without dead ends: 47 [2021-12-15 13:57:12,870 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-15 13:57:12,871 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-15 13:57:12,871 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-15 13:57:12,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-12-15 13:57:12,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 29. [2021-12-15 13:57:12,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.36) internal successors, (34), 28 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-15 13:57:12,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2021-12-15 13:57:12,874 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 11 [2021-12-15 13:57:12,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:57:12,874 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2021-12-15 13:57:12,874 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-15 13:57:12,874 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2021-12-15 13:57:12,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-15 13:57:12,875 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:57:12,875 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:57:12,875 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-15 13:57:12,875 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-15 13:57:12,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:57:12,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1632976752, now seen corresponding path program 1 times [2021-12-15 13:57:12,876 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:57:12,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329484136] [2021-12-15 13:57:12,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:57:12,877 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:57:12,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:12,956 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-15 13:57:12,957 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:57:12,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329484136] [2021-12-15 13:57:12,962 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329484136] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:57:12,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570037936] [2021-12-15 13:57:12,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:57:12,963 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:57:12,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:57:12,965 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-15 13:57:12,994 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-15 13:57:13,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:13,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-15 13:57:13,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:57:13,121 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-15 13:57:13,122 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-15 13:57:13,212 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-15 13:57:13,212 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:57:13,409 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-15 13:57:13,410 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [570037936] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:57:13,410 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:57:13,410 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2021-12-15 13:57:13,410 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667900558] [2021-12-15 13:57:13,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:57:13,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-15 13:57:13,411 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:57:13,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-15 13:57:13,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-12-15 13:57:13,411 INFO L87 Difference]: Start difference. First operand 29 states and 34 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-15 13:57:13,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:57:13,540 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2021-12-15 13:57:13,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-15 13:57:13,540 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-15 13:57:13,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:57:13,541 INFO L225 Difference]: With dead ends: 59 [2021-12-15 13:57:13,541 INFO L226 Difference]: Without dead ends: 59 [2021-12-15 13:57:13,541 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2021-12-15 13:57:13,542 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 84 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 13:57:13,543 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 88 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 13:57:13,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-12-15 13:57:13,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 26. [2021-12-15 13:57:13,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 25 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-15 13:57:13,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2021-12-15 13:57:13,548 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 11 [2021-12-15 13:57:13,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:57:13,548 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2021-12-15 13:57:13,549 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-15 13:57:13,549 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2021-12-15 13:57:13,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-15 13:57:13,549 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:57:13,549 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:57:13,575 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-15 13:57:13,767 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-15 13:57:13,768 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-15 13:57:13,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:57:13,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1794944983, now seen corresponding path program 1 times [2021-12-15 13:57:13,768 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:57:13,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692871147] [2021-12-15 13:57:13,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:57:13,768 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:57:13,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:13,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:13,848 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:57:13,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692871147] [2021-12-15 13:57:13,848 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692871147] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:57:13,848 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:57:13,848 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-15 13:57:13,848 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756944646] [2021-12-15 13:57:13,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:57:13,849 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-15 13:57:13,849 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:57:13,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-15 13:57:13,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-15 13:57:13,849 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 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-15 13:57:13,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:57:13,918 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2021-12-15 13:57:13,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-15 13:57:13,918 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2021-12-15 13:57:13,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:57:13,919 INFO L225 Difference]: With dead ends: 37 [2021-12-15 13:57:13,919 INFO L226 Difference]: Without dead ends: 37 [2021-12-15 13:57:13,919 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-15 13:57:13,919 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 17 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 13:57:13,920 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 96 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 13:57:13,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-12-15 13:57:13,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2021-12-15 13:57:13,921 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-15 13:57:13,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2021-12-15 13:57:13,921 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 13 [2021-12-15 13:57:13,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:57:13,922 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2021-12-15 13:57:13,922 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 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-15 13:57:13,922 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2021-12-15 13:57:13,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-15 13:57:13,922 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:57:13,922 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:57:13,922 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-15 13:57:13,922 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-15 13:57:13,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:57:13,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1401917973, now seen corresponding path program 1 times [2021-12-15 13:57:13,923 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:57:13,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123068825] [2021-12-15 13:57:13,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:57:13,923 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:57:13,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:14,022 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:14,022 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:57:14,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123068825] [2021-12-15 13:57:14,022 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123068825] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:57:14,022 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:57:14,023 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-15 13:57:14,023 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900745808] [2021-12-15 13:57:14,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:57:14,024 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-15 13:57:14,024 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:57:14,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-15 13:57:14,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-15 13:57:14,025 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 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-15 13:57:14,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:57:14,107 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2021-12-15 13:57:14,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-15 13:57:14,107 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2021-12-15 13:57:14,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:57:14,108 INFO L225 Difference]: With dead ends: 49 [2021-12-15 13:57:14,108 INFO L226 Difference]: Without dead ends: 49 [2021-12-15 13:57:14,108 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-12-15 13:57:14,109 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 33 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 13:57:14,109 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 99 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 13:57:14,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2021-12-15 13:57:14,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 31. [2021-12-15 13:57:14,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 28 states have (on average 1.25) internal successors, (35), 30 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-15 13:57:14,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2021-12-15 13:57:14,118 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 13 [2021-12-15 13:57:14,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:57:14,118 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2021-12-15 13:57:14,118 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 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-15 13:57:14,119 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2021-12-15 13:57:14,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-15 13:57:14,119 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:57:14,119 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:57:14,119 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-15 13:57:14,119 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-15 13:57:14,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:57:14,120 INFO L85 PathProgramCache]: Analyzing trace with hash 2102982551, now seen corresponding path program 1 times [2021-12-15 13:57:14,120 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:57:14,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204677830] [2021-12-15 13:57:14,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:57:14,120 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:57:14,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:14,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:14,206 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:57:14,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204677830] [2021-12-15 13:57:14,206 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204677830] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:57:14,206 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:57:14,206 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-15 13:57:14,206 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359190297] [2021-12-15 13:57:14,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:57:14,207 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-15 13:57:14,207 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:57:14,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-15 13:57:14,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-15 13:57:14,207 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 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-15 13:57:14,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:57:14,308 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2021-12-15 13:57:14,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-15 13:57:14,308 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2021-12-15 13:57:14,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:57:14,309 INFO L225 Difference]: With dead ends: 44 [2021-12-15 13:57:14,309 INFO L226 Difference]: Without dead ends: 44 [2021-12-15 13:57:14,310 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-12-15 13:57:14,311 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 47 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 13:57:14,311 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 82 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 13:57:14,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2021-12-15 13:57:14,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 32. [2021-12-15 13:57:14,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 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-15 13:57:14,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2021-12-15 13:57:14,316 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 13 [2021-12-15 13:57:14,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:57:14,317 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2021-12-15 13:57:14,318 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 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-15 13:57:14,318 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2021-12-15 13:57:14,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-15 13:57:14,320 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:57:14,320 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:57:14,320 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-15 13:57:14,320 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-15 13:57:14,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:57:14,321 INFO L85 PathProgramCache]: Analyzing trace with hash -191335553, now seen corresponding path program 1 times [2021-12-15 13:57:14,321 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:57:14,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723836317] [2021-12-15 13:57:14,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:57:14,321 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:57:14,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:14,394 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-15 13:57:14,394 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:57:14,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723836317] [2021-12-15 13:57:14,394 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723836317] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:57:14,394 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:57:14,395 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 13:57:14,395 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074553421] [2021-12-15 13:57:14,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:57:14,395 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 13:57:14,395 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:57:14,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 13:57:14,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 13:57:14,396 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 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-15 13:57:14,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:57:14,407 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2021-12-15 13:57:14,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 13:57:14,408 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 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-15 13:57:14,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:57:14,408 INFO L225 Difference]: With dead ends: 31 [2021-12-15 13:57:14,408 INFO L226 Difference]: Without dead ends: 20 [2021-12-15 13:57:14,409 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-15 13:57:14,409 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 10 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 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-15 13:57:14,409 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 32 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 13:57:14,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-12-15 13:57:14,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2021-12-15 13:57:14,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 0 states have call successors, (0), 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-15 13:57:14,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2021-12-15 13:57:14,412 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 14 [2021-12-15 13:57:14,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:57:14,412 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2021-12-15 13:57:14,412 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 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-15 13:57:14,412 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2021-12-15 13:57:14,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-15 13:57:14,413 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:57:14,413 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:57:14,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-15 13:57:14,413 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-15 13:57:14,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:57:14,413 INFO L85 PathProgramCache]: Analyzing trace with hash 70337178, now seen corresponding path program 1 times [2021-12-15 13:57:14,414 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:57:14,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931678457] [2021-12-15 13:57:14,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:57:14,414 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:57:14,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:14,500 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-15 13:57:14,500 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:57:14,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931678457] [2021-12-15 13:57:14,500 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931678457] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:57:14,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687330870] [2021-12-15 13:57:14,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:57:14,501 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:57:14,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:57:14,503 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-15 13:57:14,520 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-15 13:57:14,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:14,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-15 13:57:14,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:57:14,682 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-15 13:57:14,682 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:57:14,788 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-15 13:57:14,819 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-15 13:57:14,819 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687330870] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:57:14,819 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:57:14,819 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2021-12-15 13:57:14,820 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291661345] [2021-12-15 13:57:14,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:57:14,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-15 13:57:14,820 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:57:14,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-15 13:57:14,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2021-12-15 13:57:14,821 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 17 states, 16 states have (on average 2.25) internal successors, (36), 17 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-15 13:57:14,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:57:14,939 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2021-12-15 13:57:14,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-15 13:57:14,939 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 17 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 17 [2021-12-15 13:57:14,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:57:14,940 INFO L225 Difference]: With dead ends: 30 [2021-12-15 13:57:14,940 INFO L226 Difference]: Without dead ends: 30 [2021-12-15 13:57:14,940 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2021-12-15 13:57:14,941 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 87 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 13:57:14,941 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 50 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 13:57:14,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-12-15 13:57:14,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 23. [2021-12-15 13:57:14,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 0 states have call successors, (0), 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-15 13:57:14,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2021-12-15 13:57:14,942 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 17 [2021-12-15 13:57:14,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:57:14,942 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2021-12-15 13:57:14,943 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 17 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-15 13:57:14,943 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2021-12-15 13:57:14,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-15 13:57:14,943 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:57:14,943 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:57:14,967 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-15 13:57:15,152 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-15 13:57:15,152 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-15 13:57:15,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:57:15,152 INFO L85 PathProgramCache]: Analyzing trace with hash -2114514791, now seen corresponding path program 1 times [2021-12-15 13:57:15,153 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:57:15,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767473377] [2021-12-15 13:57:15,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:57:15,153 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:57:15,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:15,241 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-15 13:57:15,242 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:57:15,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767473377] [2021-12-15 13:57:15,242 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767473377] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:57:15,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115534651] [2021-12-15 13:57:15,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:57:15,242 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:57:15,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:57:15,244 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-15 13:57:15,245 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-15 13:57:15,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:15,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 29 conjunts are in the unsatisfiable core [2021-12-15 13:57:15,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:57:15,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 13:57:15,342 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-15 13:57:15,347 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-15 13:57:15,459 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-15 13:57:15,459 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:57:15,648 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:15,649 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115534651] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:57:15,649 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:57:15,649 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2021-12-15 13:57:15,649 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538031080] [2021-12-15 13:57:15,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:57:15,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-15 13:57:15,650 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:57:15,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-15 13:57:15,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2021-12-15 13:57:15,651 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 16 states, 15 states have (on average 3.0) internal successors, (45), 16 states have internal predecessors, (45), 0 states have call successors, (0), 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-15 13:57:15,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:57:15,813 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2021-12-15 13:57:15,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-15 13:57:15,814 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.0) internal successors, (45), 16 states have internal predecessors, (45), 0 states have call successors, (0), 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-15 13:57:15,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:57:15,814 INFO L225 Difference]: With dead ends: 29 [2021-12-15 13:57:15,814 INFO L226 Difference]: Without dead ends: 29 [2021-12-15 13:57:15,814 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2021-12-15 13:57:15,815 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 70 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 13:57:15,815 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 45 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 13:57:15,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-12-15 13:57:15,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2021-12-15 13:57:15,816 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-15 13:57:15,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2021-12-15 13:57:15,816 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 18 [2021-12-15 13:57:15,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:57:15,816 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2021-12-15 13:57:15,817 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.0) internal successors, (45), 16 states have internal predecessors, (45), 0 states have call successors, (0), 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-15 13:57:15,817 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2021-12-15 13:57:15,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-15 13:57:15,817 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:57:15,817 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:57:15,837 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-15 13:57:16,031 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-15 13:57:16,031 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-15 13:57:16,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:57:16,032 INFO L85 PathProgramCache]: Analyzing trace with hash 775185845, now seen corresponding path program 2 times [2021-12-15 13:57:16,032 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:57:16,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193677289] [2021-12-15 13:57:16,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:57:16,032 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:57:16,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:16,191 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:16,191 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:57:16,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193677289] [2021-12-15 13:57:16,192 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193677289] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:57:16,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438118529] [2021-12-15 13:57:16,192 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 13:57:16,192 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:57:16,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:57:16,193 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-15 13:57:16,197 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-15 13:57:16,254 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 13:57:16,254 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 13:57:16,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 47 conjunts are in the unsatisfiable core [2021-12-15 13:57:16,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:57:16,281 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-15 13:57:16,282 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-15 13:57:16,291 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-15 13:57:16,377 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-15 13:57:16,481 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-15 13:57:16,572 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:57:16,573 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 17 treesize of output 17 [2021-12-15 13:57:16,671 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:16,672 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:57:17,030 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:57:17,030 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-15 13:57:17,037 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:57:17,037 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-15 13:57:17,041 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-15 13:57:17,196 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:17,197 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438118529] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:57:17,197 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:57:17,197 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 29 [2021-12-15 13:57:17,197 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792813936] [2021-12-15 13:57:17,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:57:17,197 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-12-15 13:57:17,198 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:57:17,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-12-15 13:57:17,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=709, Unknown=2, NotChecked=0, Total=812 [2021-12-15 13:57:17,199 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 29 states, 29 states have (on average 1.896551724137931) internal successors, (55), 29 states have internal predecessors, (55), 0 states have call successors, (0), 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-15 13:57:17,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:57:17,529 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2021-12-15 13:57:17,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-15 13:57:17,530 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.896551724137931) internal successors, (55), 29 states have internal predecessors, (55), 0 states have call successors, (0), 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 21 [2021-12-15 13:57:17,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:57:17,530 INFO L225 Difference]: With dead ends: 44 [2021-12-15 13:57:17,530 INFO L226 Difference]: Without dead ends: 35 [2021-12-15 13:57:17,531 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=173, Invalid=1157, Unknown=2, NotChecked=0, Total=1332 [2021-12-15 13:57:17,532 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 32 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 13:57:17,532 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 94 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 181 Invalid, 0 Unknown, 54 Unchecked, 0.1s Time] [2021-12-15 13:57:17,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-12-15 13:57:17,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2021-12-15 13:57:17,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 29 states have (on average 1.103448275862069) internal successors, (32), 30 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-15 13:57:17,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2021-12-15 13:57:17,533 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 21 [2021-12-15 13:57:17,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:57:17,533 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2021-12-15 13:57:17,534 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.896551724137931) internal successors, (55), 29 states have internal predecessors, (55), 0 states have call successors, (0), 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-15 13:57:17,534 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2021-12-15 13:57:17,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-15 13:57:17,534 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:57:17,535 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:57:17,559 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-15 13:57:17,743 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-15 13:57:17,743 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-15 13:57:17,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:57:17,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1518290629, now seen corresponding path program 2 times [2021-12-15 13:57:17,744 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:57:17,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132438531] [2021-12-15 13:57:17,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:57:17,744 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:57:17,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:17,843 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:17,843 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:57:17,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132438531] [2021-12-15 13:57:17,844 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132438531] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:57:17,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111514862] [2021-12-15 13:57:17,844 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 13:57:17,844 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:57:17,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:57:17,845 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-15 13:57:17,875 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-15 13:57:17,918 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 13:57:17,918 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 13:57:17,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 34 conjunts are in the unsatisfiable core [2021-12-15 13:57:17,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:57:17,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 13:57:17,941 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-15 13:57:17,944 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-15 13:57:18,118 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:18,119 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:57:18,374 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:18,375 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1111514862] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:57:18,375 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:57:18,375 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 20 [2021-12-15 13:57:18,375 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568873410] [2021-12-15 13:57:18,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:57:18,376 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-15 13:57:18,376 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:57:18,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-15 13:57:18,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2021-12-15 13:57:18,377 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand has 21 states, 20 states have (on average 3.45) internal successors, (69), 21 states have internal predecessors, (69), 0 states have call successors, (0), 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-15 13:57:18,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:57:18,622 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2021-12-15 13:57:18,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-15 13:57:18,623 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.45) internal successors, (69), 21 states have internal predecessors, (69), 0 states have call successors, (0), 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 26 [2021-12-15 13:57:18,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:57:18,623 INFO L225 Difference]: With dead ends: 34 [2021-12-15 13:57:18,623 INFO L226 Difference]: Without dead ends: 34 [2021-12-15 13:57:18,624 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=155, Invalid=547, Unknown=0, NotChecked=0, Total=702 [2021-12-15 13:57:18,624 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 84 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 13:57:18,625 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 77 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 13:57:18,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-12-15 13:57:18,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2021-12-15 13:57:18,626 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-15 13:57:18,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2021-12-15 13:57:18,626 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 26 [2021-12-15 13:57:18,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:57:18,626 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2021-12-15 13:57:18,627 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.45) internal successors, (69), 21 states have internal predecessors, (69), 0 states have call successors, (0), 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-15 13:57:18,627 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2021-12-15 13:57:18,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-15 13:57:18,627 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:57:18,627 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:57:18,650 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-15 13:57:18,843 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-15 13:57:18,844 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-15 13:57:18,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:57:18,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1095540269, now seen corresponding path program 3 times [2021-12-15 13:57:18,844 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:57:18,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248147562] [2021-12-15 13:57:18,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:57:18,844 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:57:18,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:19,024 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:19,025 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:57:19,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248147562] [2021-12-15 13:57:19,025 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248147562] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:57:19,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883652255] [2021-12-15 13:57:19,025 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-15 13:57:19,025 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:57:19,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:57:19,026 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-15 13:57:19,032 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-15 13:57:19,113 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-12-15 13:57:19,113 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 13:57:19,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 48 conjunts are in the unsatisfiable core [2021-12-15 13:57:19,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:57:19,129 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-15 13:57:19,263 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-15 13:57:19,341 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-15 13:57:19,403 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-15 13:57:19,428 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-15 13:57:19,434 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:19,434 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:57:19,462 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_262 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_262) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 1)) 0)) is different from false [2021-12-15 13:57:19,470 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_262 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_262) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 2)) 0)) is different from false [2021-12-15 13:57:19,483 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_262 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_262) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |c_ULTIMATE.start_main_~nondetString~0#1.offset| 2)) 0)) is different from false [2021-12-15 13:57:19,490 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:57:19,493 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-15 13:57:19,498 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:57:19,500 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-15 13:57:19,503 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-15 13:57:19,679 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2021-12-15 13:57:19,680 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1883652255] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:57:19,680 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:57:19,680 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 25 [2021-12-15 13:57:19,680 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463390656] [2021-12-15 13:57:19,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:57:19,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-12-15 13:57:19,681 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:57:19,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-12-15 13:57:19,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=402, Unknown=3, NotChecked=126, Total=600 [2021-12-15 13:57:19,682 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 25 states, 25 states have (on average 2.44) internal successors, (61), 25 states have internal predecessors, (61), 0 states have call successors, (0), 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-15 13:57:19,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:57:19,895 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2021-12-15 13:57:19,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-15 13:57:19,896 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.44) internal successors, (61), 25 states have internal predecessors, (61), 0 states have call successors, (0), 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 29 [2021-12-15 13:57:19,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:57:19,896 INFO L225 Difference]: With dead ends: 52 [2021-12-15 13:57:19,896 INFO L226 Difference]: Without dead ends: 39 [2021-12-15 13:57:19,897 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 43 SyntacticMatches, 6 SemanticMatches, 28 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=604, Unknown=3, NotChecked=156, Total=870 [2021-12-15 13:57:19,897 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 25 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 111 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 13:57:19,897 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 143 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 202 Invalid, 0 Unknown, 111 Unchecked, 0.1s Time] [2021-12-15 13:57:19,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2021-12-15 13:57:19,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2021-12-15 13:57:19,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 34 states have (on average 1.088235294117647) internal successors, (37), 35 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-15 13:57:19,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2021-12-15 13:57:19,899 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 29 [2021-12-15 13:57:19,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:57:19,899 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2021-12-15 13:57:19,899 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.44) internal successors, (61), 25 states have internal predecessors, (61), 0 states have call successors, (0), 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-15 13:57:19,899 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2021-12-15 13:57:19,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-15 13:57:19,899 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:57:19,899 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:57:19,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-15 13:57:20,100 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-15 13:57:20,100 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-15 13:57:20,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:57:20,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1267943126, now seen corresponding path program 4 times [2021-12-15 13:57:20,101 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:57:20,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304367577] [2021-12-15 13:57:20,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:57:20,101 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:57:20,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:20,213 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:20,214 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:57:20,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304367577] [2021-12-15 13:57:20,214 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304367577] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:57:20,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625126683] [2021-12-15 13:57:20,214 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-15 13:57:20,214 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:57:20,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:57:20,215 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-15 13:57:20,215 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-15 13:57:20,278 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-15 13:57:20,278 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 13:57:20,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 54 conjunts are in the unsatisfiable core [2021-12-15 13:57:20,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:57:20,303 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-15 13:57:20,304 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-15 13:57:20,311 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-15 13:57:20,521 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-15 13:57:20,635 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-15 13:57:20,764 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-15 13:57:20,874 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:57:20,875 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-15 13:57:21,004 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:21,004 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:57:21,347 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrcpy_~from#1.offset_32| Int) (v_ArrVal_309 (Array Int Int))) (or (<= (+ |v_ULTIMATE.start_cstrcpy_~from#1.offset_32| 4) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)) (< |v_ULTIMATE.start_cstrcpy_~from#1.offset_32| 0) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrcpy_~from#1.offset_32|) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |v_ULTIMATE.start_cstrcpy_~from#1.offset_32| 2))))) is different from false [2021-12-15 13:57:21,362 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:57:21,363 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-15 13:57:21,368 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:57:21,368 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-15 13:57:21,372 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-15 13:57:22,143 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:22,144 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1625126683] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:57:22,144 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:57:22,144 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 14] total 36 [2021-12-15 13:57:22,144 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016014365] [2021-12-15 13:57:22,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:57:22,145 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2021-12-15 13:57:22,145 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:57:22,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-12-15 13:57:22,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1103, Unknown=2, NotChecked=68, Total=1332 [2021-12-15 13:57:22,146 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand has 37 states, 36 states have (on average 2.5277777777777777) internal successors, (91), 37 states have internal predecessors, (91), 0 states have call successors, (0), 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-15 13:57:22,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:57:22,830 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2021-12-15 13:57:22,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-15 13:57:22,831 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.5277777777777777) internal successors, (91), 37 states have internal predecessors, (91), 0 states have call successors, (0), 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 33 [2021-12-15 13:57:22,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:57:22,832 INFO L225 Difference]: With dead ends: 48 [2021-12-15 13:57:22,832 INFO L226 Difference]: Without dead ends: 48 [2021-12-15 13:57:22,833 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=378, Invalid=2373, Unknown=9, NotChecked=102, Total=2862 [2021-12-15 13:57:22,834 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 51 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 94 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 13:57:22,834 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 115 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 196 Invalid, 0 Unknown, 94 Unchecked, 0.1s Time] [2021-12-15 13:57:22,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2021-12-15 13:57:22,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 43. [2021-12-15 13:57:22,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 42 states have internal predecessors, (45), 0 states have call successors, (0), 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-15 13:57:22,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2021-12-15 13:57:22,836 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 33 [2021-12-15 13:57:22,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:57:22,836 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2021-12-15 13:57:22,836 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.5277777777777777) internal successors, (91), 37 states have internal predecessors, (91), 0 states have call successors, (0), 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-15 13:57:22,836 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2021-12-15 13:57:22,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-15 13:57:22,837 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:57:22,837 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:57:22,859 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-15 13:57:23,051 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-15 13:57:23,051 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-15 13:57:23,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:57:23,052 INFO L85 PathProgramCache]: Analyzing trace with hash 651531229, now seen corresponding path program 3 times [2021-12-15 13:57:23,052 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:57:23,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182433758] [2021-12-15 13:57:23,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:57:23,052 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:57:23,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:23,170 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-15 13:57:23,170 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:57:23,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182433758] [2021-12-15 13:57:23,170 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182433758] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:57:23,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908843548] [2021-12-15 13:57:23,171 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-15 13:57:23,171 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:57:23,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:57:23,176 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-15 13:57:23,177 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-15 13:57:23,252 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-12-15 13:57:23,252 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 13:57:23,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 33 conjunts are in the unsatisfiable core [2021-12-15 13:57:23,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:57:23,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 13:57:23,283 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-15 13:57:23,285 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-15 13:57:23,562 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:23,563 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:57:23,893 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 15 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:23,893 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [908843548] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:57:23,893 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:57:23,893 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 27 [2021-12-15 13:57:23,893 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261879230] [2021-12-15 13:57:23,894 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:57:23,894 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-12-15 13:57:23,894 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:57:23,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-12-15 13:57:23,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=636, Unknown=0, NotChecked=0, Total=756 [2021-12-15 13:57:23,895 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand has 28 states, 27 states have (on average 3.4814814814814814) internal successors, (94), 28 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-15 13:57:24,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:57:24,204 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2021-12-15 13:57:24,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-15 13:57:24,204 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 3.4814814814814814) internal successors, (94), 28 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-15 13:57:24,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:57:24,204 INFO L225 Difference]: With dead ends: 43 [2021-12-15 13:57:24,204 INFO L226 Difference]: Without dead ends: 43 [2021-12-15 13:57:24,205 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=267, Invalid=993, Unknown=0, NotChecked=0, Total=1260 [2021-12-15 13:57:24,205 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 131 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 13:57:24,206 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 90 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 13:57:24,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2021-12-15 13:57:24,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2021-12-15 13:57:24,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 42 states have internal predecessors, (44), 0 states have call successors, (0), 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-15 13:57:24,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2021-12-15 13:57:24,207 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 34 [2021-12-15 13:57:24,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:57:24,207 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2021-12-15 13:57:24,208 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.4814814814814814) internal successors, (94), 28 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-15 13:57:24,208 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2021-12-15 13:57:24,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-15 13:57:24,208 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:57:24,209 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:57:24,225 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-15 13:57:24,415 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-15 13:57:24,416 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-15 13:57:24,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:57:24,416 INFO L85 PathProgramCache]: Analyzing trace with hash -671378910, now seen corresponding path program 4 times [2021-12-15 13:57:24,416 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:57:24,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041687347] [2021-12-15 13:57:24,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:57:24,417 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:57:24,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:24,575 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 19 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:24,575 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:57:24,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041687347] [2021-12-15 13:57:24,575 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041687347] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:57:24,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707469554] [2021-12-15 13:57:24,575 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-15 13:57:24,575 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:57:24,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:57:24,577 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-15 13:57:24,578 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-15 13:57:24,642 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-15 13:57:24,643 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 13:57:24,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 27 conjunts are in the unsatisfiable core [2021-12-15 13:57:24,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:57:24,676 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-15 13:57:24,676 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-15 13:57:24,966 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 32 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:24,967 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:57:25,174 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 28 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:25,175 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [707469554] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:57:25,175 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:57:25,175 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 29 [2021-12-15 13:57:25,175 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825206430] [2021-12-15 13:57:25,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:57:25,175 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-12-15 13:57:25,175 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:57:25,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-12-15 13:57:25,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=651, Unknown=0, NotChecked=0, Total=812 [2021-12-15 13:57:25,176 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand has 29 states, 29 states have (on average 3.0689655172413794) internal successors, (89), 29 states have internal predecessors, (89), 0 states have call successors, (0), 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-15 13:57:25,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:57:25,373 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2021-12-15 13:57:25,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-15 13:57:25,374 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.0689655172413794) internal successors, (89), 29 states have internal predecessors, (89), 0 states have call successors, (0), 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-15 13:57:25,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:57:25,374 INFO L225 Difference]: With dead ends: 69 [2021-12-15 13:57:25,374 INFO L226 Difference]: Without dead ends: 50 [2021-12-15 13:57:25,375 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=274, Invalid=916, Unknown=0, NotChecked=0, Total=1190 [2021-12-15 13:57:25,375 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 65 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 13:57:25,375 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 77 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 13:57:25,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-12-15 13:57:25,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2021-12-15 13:57:25,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 46 states have internal predecessors, (48), 0 states have call successors, (0), 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-15 13:57:25,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2021-12-15 13:57:25,377 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 38 [2021-12-15 13:57:25,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:57:25,377 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2021-12-15 13:57:25,377 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.0689655172413794) internal successors, (89), 29 states have internal predecessors, (89), 0 states have call successors, (0), 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-15 13:57:25,377 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2021-12-15 13:57:25,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-15 13:57:25,378 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:57:25,378 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:57:25,404 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-15 13:57:25,587 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-15 13:57:25,588 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-15 13:57:25,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:57:25,588 INFO L85 PathProgramCache]: Analyzing trace with hash -452353921, now seen corresponding path program 5 times [2021-12-15 13:57:25,588 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:57:25,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391152549] [2021-12-15 13:57:25,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:57:25,588 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:57:25,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:25,759 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-15 13:57:25,759 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:57:25,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391152549] [2021-12-15 13:57:25,759 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391152549] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:57:25,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975869753] [2021-12-15 13:57:25,759 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-15 13:57:25,760 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:57:25,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:57:25,764 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-15 13:57:25,793 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-15 13:57:25,880 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2021-12-15 13:57:25,880 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 13:57:25,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 52 conjunts are in the unsatisfiable core [2021-12-15 13:57:25,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:57:25,912 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-15 13:57:25,913 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-15 13:57:25,927 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-15 13:57:26,391 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-15 13:57:26,391 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:57:26,807 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-15 13:57:26,807 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1975869753] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:57:26,807 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:57:26,807 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 33 [2021-12-15 13:57:26,808 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310581941] [2021-12-15 13:57:26,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:57:26,808 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-12-15 13:57:26,808 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:57:26,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-12-15 13:57:26,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=968, Unknown=0, NotChecked=0, Total=1122 [2021-12-15 13:57:26,809 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand has 34 states, 33 states have (on average 3.5757575757575757) internal successors, (118), 34 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-15 13:57:27,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:57:27,302 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2021-12-15 13:57:27,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-15 13:57:27,302 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 3.5757575757575757) internal successors, (118), 34 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-15 13:57:27,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:57:27,303 INFO L225 Difference]: With dead ends: 50 [2021-12-15 13:57:27,303 INFO L226 Difference]: Without dead ends: 50 [2021-12-15 13:57:27,303 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=364, Invalid=1616, Unknown=0, NotChecked=0, Total=1980 [2021-12-15 13:57:27,304 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 231 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 13:57:27,304 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [231 Valid, 150 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 13:57:27,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-12-15 13:57:27,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2021-12-15 13:57:27,305 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-15 13:57:27,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2021-12-15 13:57:27,306 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 42 [2021-12-15 13:57:27,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:57:27,306 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2021-12-15 13:57:27,306 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 3.5757575757575757) internal successors, (118), 34 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-15 13:57:27,306 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2021-12-15 13:57:27,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-15 13:57:27,307 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:57:27,307 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:57:27,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-15 13:57:27,511 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-15 13:57:27,511 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-15 13:57:27,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:57:27,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1531708431, now seen corresponding path program 5 times [2021-12-15 13:57:27,512 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:57:27,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491099602] [2021-12-15 13:57:27,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:57:27,512 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:57:27,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:27,771 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 9 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:27,771 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:57:27,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491099602] [2021-12-15 13:57:27,771 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491099602] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:57:27,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304413162] [2021-12-15 13:57:27,771 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-15 13:57:27,772 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:57:27,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:57:27,772 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-15 13:57:27,773 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-15 13:57:27,879 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2021-12-15 13:57:27,879 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 13:57:27,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 66 conjunts are in the unsatisfiable core [2021-12-15 13:57:27,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:57:27,904 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-15 13:57:28,114 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-15 13:57:28,193 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-15 13:57:28,237 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-15 13:57:28,262 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-15 13:57:28,289 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-15 13:57:28,316 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-15 13:57:28,321 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 9 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:28,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:57:28,345 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_502 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_502) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 1)) 0)) is different from false [2021-12-15 13:57:28,352 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_502 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_502) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 2)) 0)) is different from false [2021-12-15 13:57:28,374 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_502 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_502) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 3)) 0)) is different from false [2021-12-15 13:57:28,389 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_502 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_502) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 4)) 0)) is different from false [2021-12-15 13:57:28,401 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_502 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_502) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |c_ULTIMATE.start_main_~nondetString~0#1.offset| 4)) 0)) is different from false [2021-12-15 13:57:28,407 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:57:28,407 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-15 13:57:28,412 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:57:28,413 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-15 13:57:28,416 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-15 13:57:28,607 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 9 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 35 not checked. [2021-12-15 13:57:28,608 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304413162] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:57:28,608 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:57:28,608 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 33 [2021-12-15 13:57:28,608 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579492359] [2021-12-15 13:57:28,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:57:28,608 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-12-15 13:57:28,608 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:57:28,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-12-15 13:57:28,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=684, Unknown=5, NotChecked=280, Total=1056 [2021-12-15 13:57:28,609 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand has 33 states, 33 states have (on average 2.8181818181818183) internal successors, (93), 33 states have internal predecessors, (93), 0 states have call successors, (0), 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-15 13:57:29,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:57:29,043 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2021-12-15 13:57:29,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-15 13:57:29,043 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.8181818181818183) internal successors, (93), 33 states have internal predecessors, (93), 0 states have call successors, (0), 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 45 [2021-12-15 13:57:29,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:57:29,044 INFO L225 Difference]: With dead ends: 76 [2021-12-15 13:57:29,044 INFO L226 Difference]: Without dead ends: 55 [2021-12-15 13:57:29,044 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 73 SyntacticMatches, 8 SemanticMatches, 39 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=149, Invalid=1126, Unknown=5, NotChecked=360, Total=1640 [2021-12-15 13:57:29,045 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 36 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 249 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 13:57:29,045 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 273 Invalid, 792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 534 Invalid, 0 Unknown, 249 Unchecked, 0.2s Time] [2021-12-15 13:57:29,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-12-15 13:57:29,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2021-12-15 13:57:29,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 50 states have (on average 1.06) internal successors, (53), 51 states have internal predecessors, (53), 0 states have call successors, (0), 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-15 13:57:29,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2021-12-15 13:57:29,047 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 45 [2021-12-15 13:57:29,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:57:29,047 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2021-12-15 13:57:29,047 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.8181818181818183) internal successors, (93), 33 states have internal predecessors, (93), 0 states have call successors, (0), 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-15 13:57:29,047 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2021-12-15 13:57:29,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-12-15 13:57:29,048 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:57:29,048 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:57:29,067 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-15 13:57:29,259 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-15 13:57:29,259 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-15 13:57:29,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:57:29,260 INFO L85 PathProgramCache]: Analyzing trace with hash 801080082, now seen corresponding path program 6 times [2021-12-15 13:57:29,260 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:57:29,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650510505] [2021-12-15 13:57:29,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:57:29,260 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:57:29,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:29,454 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 15 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:29,454 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:57:29,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650510505] [2021-12-15 13:57:29,454 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650510505] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:57:29,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088996244] [2021-12-15 13:57:29,454 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-15 13:57:29,455 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:57:29,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:57:29,456 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-15 13:57:29,462 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-15 13:57:29,596 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2021-12-15 13:57:29,596 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 13:57:29,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 36 conjunts are in the unsatisfiable core [2021-12-15 13:57:29,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:57:29,622 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-15 13:57:29,622 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-15 13:57:30,022 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 28 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:30,022 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:57:30,471 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 45 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:30,471 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1088996244] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:57:30,471 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:57:30,471 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 40 [2021-12-15 13:57:30,471 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076693220] [2021-12-15 13:57:30,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:57:30,472 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2021-12-15 13:57:30,472 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:57:30,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-12-15 13:57:30,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=1391, Unknown=0, NotChecked=0, Total=1640 [2021-12-15 13:57:30,473 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand has 41 states, 40 states have (on average 3.475) internal successors, (139), 41 states have internal predecessors, (139), 0 states have call successors, (0), 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-15 13:57:30,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:57:30,812 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2021-12-15 13:57:30,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-15 13:57:30,812 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 3.475) internal successors, (139), 41 states have internal predecessors, (139), 0 states have call successors, (0), 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 49 [2021-12-15 13:57:30,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:57:30,812 INFO L225 Difference]: With dead ends: 59 [2021-12-15 13:57:30,812 INFO L226 Difference]: Without dead ends: 59 [2021-12-15 13:57:30,813 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=480, Invalid=1872, Unknown=0, NotChecked=0, Total=2352 [2021-12-15 13:57:30,814 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 225 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 13:57:30,814 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [225 Valid, 124 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 13:57:30,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-12-15 13:57:30,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2021-12-15 13:57:30,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 53 states have (on average 1.0566037735849056) internal successors, (56), 54 states have internal predecessors, (56), 0 states have call successors, (0), 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-15 13:57:30,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2021-12-15 13:57:30,816 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 49 [2021-12-15 13:57:30,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:57:30,816 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2021-12-15 13:57:30,816 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 3.475) internal successors, (139), 41 states have internal predecessors, (139), 0 states have call successors, (0), 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-15 13:57:30,816 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2021-12-15 13:57:30,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-12-15 13:57:30,817 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:57:30,817 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:57:30,838 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-15 13:57:31,027 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-15 13:57:31,027 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-15 13:57:31,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:57:31,028 INFO L85 PathProgramCache]: Analyzing trace with hash -936321247, now seen corresponding path program 6 times [2021-12-15 13:57:31,028 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:57:31,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711363497] [2021-12-15 13:57:31,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:57:31,028 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:57:31,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:31,238 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-15 13:57:31,238 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:57:31,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711363497] [2021-12-15 13:57:31,238 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711363497] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:57:31,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365551240] [2021-12-15 13:57:31,238 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-15 13:57:31,239 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:57:31,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:57:31,239 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-15 13:57:31,240 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-15 13:57:31,345 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2021-12-15 13:57:31,345 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 13:57:31,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 64 conjunts are in the unsatisfiable core [2021-12-15 13:57:31,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:57:31,364 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-15 13:57:31,370 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-15 13:57:31,916 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-12-15 13:57:31,916 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:57:32,432 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-12-15 13:57:32,433 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [365551240] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:57:32,433 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:57:32,433 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 31 [2021-12-15 13:57:32,433 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901025674] [2021-12-15 13:57:32,433 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:57:32,433 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-12-15 13:57:32,433 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:57:32,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-12-15 13:57:32,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=847, Unknown=0, NotChecked=0, Total=992 [2021-12-15 13:57:32,434 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand has 32 states, 31 states have (on average 3.5483870967741935) internal successors, (110), 32 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:33,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:57:33,585 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2021-12-15 13:57:33,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-15 13:57:33,586 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.5483870967741935) internal successors, (110), 32 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2021-12-15 13:57:33,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:57:33,586 INFO L225 Difference]: With dead ends: 81 [2021-12-15 13:57:33,586 INFO L226 Difference]: Without dead ends: 81 [2021-12-15 13:57:33,587 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=554, Invalid=2308, Unknown=0, NotChecked=0, Total=2862 [2021-12-15 13:57:33,587 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 170 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-15 13:57:33,587 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 205 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 545 Invalid, 0 Unknown, 30 Unchecked, 0.3s Time] [2021-12-15 13:57:33,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-12-15 13:57:33,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 76. [2021-12-15 13:57:33,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 74 states have (on average 1.1081081081081081) internal successors, (82), 75 states have internal predecessors, (82), 0 states have call successors, (0), 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-15 13:57:33,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2021-12-15 13:57:33,589 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 50 [2021-12-15 13:57:33,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:57:33,590 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2021-12-15 13:57:33,590 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.5483870967741935) internal successors, (110), 32 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:33,590 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2021-12-15 13:57:33,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-12-15 13:57:33,591 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:57:33,591 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:57:33,608 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-15 13:57:33,795 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-15 13:57:33,795 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-15 13:57:33,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:57:33,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1866312237, now seen corresponding path program 7 times [2021-12-15 13:57:33,796 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:57:33,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089878627] [2021-12-15 13:57:33,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:57:33,796 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:57:33,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:34,078 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 11 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:34,079 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:57:34,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089878627] [2021-12-15 13:57:34,079 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089878627] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:57:34,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [618990774] [2021-12-15 13:57:34,079 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-12-15 13:57:34,079 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:57:34,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:57:34,080 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-15 13:57:34,095 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-15 13:57:34,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:34,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 73 conjunts are in the unsatisfiable core [2021-12-15 13:57:34,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:57:34,191 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-15 13:57:34,442 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-15 13:57:34,532 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-15 13:57:34,576 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-15 13:57:34,596 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-15 13:57:34,614 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-15 13:57:34,630 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-15 13:57:34,656 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-15 13:57:34,661 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 11 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:34,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:57:34,685 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_682 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_682) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 1)) 0)) is different from false [2021-12-15 13:57:34,692 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_682 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_682) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 2)) 0)) is different from false [2021-12-15 13:57:34,706 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_682 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_682) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 3)) 0)) is different from false [2021-12-15 13:57:34,719 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_682 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_682) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 4)) 0)) is different from false [2021-12-15 13:57:34,733 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_682 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_682) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 5)) 0)) is different from false [2021-12-15 13:57:34,743 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_682 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_682) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |c_ULTIMATE.start_main_~nondetString~0#1.offset| 5)) 0)) is different from false [2021-12-15 13:57:34,747 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:57:34,747 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-15 13:57:34,754 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:57:34,754 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-15 13:57:34,757 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-15 13:57:34,972 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 11 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 54 not checked. [2021-12-15 13:57:34,972 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [618990774] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:57:34,972 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:57:34,972 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 19] total 37 [2021-12-15 13:57:34,972 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315396618] [2021-12-15 13:57:34,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:57:34,972 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2021-12-15 13:57:34,972 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:57:34,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-12-15 13:57:34,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=852, Unknown=6, NotChecked=378, Total=1332 [2021-12-15 13:57:34,973 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand has 37 states, 37 states have (on average 2.945945945945946) internal successors, (109), 37 states have internal predecessors, (109), 0 states have call successors, (0), 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-15 13:57:35,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:57:35,501 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2021-12-15 13:57:35,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-15 13:57:35,502 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.945945945945946) internal successors, (109), 37 states have internal predecessors, (109), 0 states have call successors, (0), 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 53 [2021-12-15 13:57:35,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:57:35,503 INFO L225 Difference]: With dead ends: 108 [2021-12-15 13:57:35,503 INFO L226 Difference]: Without dead ends: 83 [2021-12-15 13:57:35,504 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 88 SyntacticMatches, 9 SemanticMatches, 44 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=163, Invalid=1415, Unknown=6, NotChecked=486, Total=2070 [2021-12-15 13:57:35,504 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 37 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 1021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 346 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-15 13:57:35,504 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 327 Invalid, 1021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 665 Invalid, 0 Unknown, 346 Unchecked, 0.3s Time] [2021-12-15 13:57:35,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-12-15 13:57:35,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. [2021-12-15 13:57:35,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 78 states have (on average 1.1025641025641026) internal successors, (86), 79 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-15 13:57:35,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2021-12-15 13:57:35,507 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 53 [2021-12-15 13:57:35,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:57:35,508 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2021-12-15 13:57:35,508 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.945945945945946) internal successors, (109), 37 states have internal predecessors, (109), 0 states have call successors, (0), 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-15 13:57:35,508 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2021-12-15 13:57:35,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-15 13:57:35,508 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:57:35,509 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:57:35,533 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-15 13:57:35,722 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-15 13:57:35,723 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-15 13:57:35,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:57:35,723 INFO L85 PathProgramCache]: Analyzing trace with hash -795904464, now seen corresponding path program 8 times [2021-12-15 13:57:35,723 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:57:35,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219318464] [2021-12-15 13:57:35,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:57:35,723 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:57:35,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:35,913 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 28 proven. 104 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:35,913 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:57:35,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219318464] [2021-12-15 13:57:35,914 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219318464] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:57:35,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286573051] [2021-12-15 13:57:35,914 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 13:57:35,914 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:57:35,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:57:35,915 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-15 13:57:35,916 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-15 13:57:36,011 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 13:57:36,012 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 13:57:36,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 45 conjunts are in the unsatisfiable core [2021-12-15 13:57:36,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:57:36,033 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-15 13:57:36,034 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-15 13:57:36,509 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 45 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:36,510 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:57:37,116 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 66 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:37,116 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286573051] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:57:37,116 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:57:37,116 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 16] total 44 [2021-12-15 13:57:37,117 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862506595] [2021-12-15 13:57:37,117 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:57:37,118 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2021-12-15 13:57:37,118 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:57:37,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-12-15 13:57:37,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=1730, Unknown=0, NotChecked=0, Total=1980 [2021-12-15 13:57:37,119 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand has 45 states, 44 states have (on average 3.659090909090909) internal successors, (161), 45 states have internal predecessors, (161), 0 states have call successors, (0), 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-15 13:57:37,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:57:37,698 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2021-12-15 13:57:37,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-15 13:57:37,698 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 3.659090909090909) internal successors, (161), 45 states have internal predecessors, (161), 0 states have call successors, (0), 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 57 [2021-12-15 13:57:37,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:57:37,699 INFO L225 Difference]: With dead ends: 80 [2021-12-15 13:57:37,699 INFO L226 Difference]: Without dead ends: 80 [2021-12-15 13:57:37,700 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 681 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=627, Invalid=2795, Unknown=0, NotChecked=0, Total=3422 [2021-12-15 13:57:37,700 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 147 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 13:57:37,700 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 229 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 13:57:37,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-12-15 13:57:37,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2021-12-15 13:57:37,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 78 states have (on average 1.0897435897435896) internal successors, (85), 79 states have internal predecessors, (85), 0 states have call successors, (0), 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-15 13:57:37,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2021-12-15 13:57:37,703 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 57 [2021-12-15 13:57:37,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:57:37,703 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2021-12-15 13:57:37,703 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 3.659090909090909) internal successors, (161), 45 states have internal predecessors, (161), 0 states have call successors, (0), 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-15 13:57:37,703 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2021-12-15 13:57:37,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-12-15 13:57:37,704 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:57:37,704 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:57:37,723 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-15 13:57:37,915 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-15 13:57:37,915 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-15 13:57:37,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:57:37,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1921179211, now seen corresponding path program 9 times [2021-12-15 13:57:37,916 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:57:37,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414558911] [2021-12-15 13:57:37,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:57:37,916 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:57:37,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:38,316 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 13 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:38,316 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:57:38,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414558911] [2021-12-15 13:57:38,316 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414558911] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:57:38,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1243012444] [2021-12-15 13:57:38,316 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-15 13:57:38,317 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:57:38,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:57:38,317 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-15 13:57:38,318 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-15 13:57:38,508 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2021-12-15 13:57:38,509 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 13:57:38,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 86 conjunts are in the unsatisfiable core [2021-12-15 13:57:38,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:57:38,526 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-15 13:57:38,786 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-15 13:57:38,896 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-15 13:57:38,947 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-15 13:57:38,966 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-15 13:57:38,982 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-15 13:57:39,000 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-15 13:57:39,016 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-15 13:57:39,028 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-15 13:57:39,033 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 13 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:39,033 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:57:39,090 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_821 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_821) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 1)) 0)) is different from false [2021-12-15 13:57:39,098 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_821 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_821) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 2)) 0)) is different from false [2021-12-15 13:57:39,109 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_821 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_821) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 3)) 0)) is different from false [2021-12-15 13:57:39,125 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_821 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_821) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 4)) 0)) is different from false [2021-12-15 13:57:39,135 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_821 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_821) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 5)) 0)) is different from false [2021-12-15 13:57:39,145 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_821 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_821) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 6)) 0)) is different from false [2021-12-15 13:57:39,154 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_821 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_821) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |c_ULTIMATE.start_main_~nondetString~0#1.offset| 6)) 0)) is different from false [2021-12-15 13:57:39,158 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:57:39,158 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-15 13:57:39,163 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:57:39,164 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-15 13:57:39,168 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-15 13:57:39,393 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 13 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 77 not checked. [2021-12-15 13:57:39,393 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1243012444] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:57:39,393 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:57:39,393 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 21] total 41 [2021-12-15 13:57:39,393 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583835840] [2021-12-15 13:57:39,393 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:57:39,393 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2021-12-15 13:57:39,394 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:57:39,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-12-15 13:57:39,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1038, Unknown=7, NotChecked=490, Total=1640 [2021-12-15 13:57:39,394 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand has 41 states, 41 states have (on average 3.024390243902439) internal successors, (124), 41 states have internal predecessors, (124), 0 states have call successors, (0), 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-15 13:57:40,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:57:40,089 INFO L93 Difference]: Finished difference Result 116 states and 121 transitions. [2021-12-15 13:57:40,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-15 13:57:40,089 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 3.024390243902439) internal successors, (124), 41 states have internal predecessors, (124), 0 states have call successors, (0), 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 61 [2021-12-15 13:57:40,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:57:40,090 INFO L225 Difference]: With dead ends: 116 [2021-12-15 13:57:40,090 INFO L226 Difference]: Without dead ends: 87 [2021-12-15 13:57:40,091 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 103 SyntacticMatches, 10 SemanticMatches, 48 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=163, Invalid=1664, Unknown=7, NotChecked=616, Total=2450 [2021-12-15 13:57:40,091 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 26 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 904 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 1418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 504 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-15 13:57:40,091 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 427 Invalid, 1418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 904 Invalid, 0 Unknown, 504 Unchecked, 0.4s Time] [2021-12-15 13:57:40,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-12-15 13:57:40,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2021-12-15 13:57:40,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 82 states have (on average 1.0853658536585367) internal successors, (89), 83 states have internal predecessors, (89), 0 states have call successors, (0), 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-15 13:57:40,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2021-12-15 13:57:40,099 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 61 [2021-12-15 13:57:40,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:57:40,099 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2021-12-15 13:57:40,100 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 3.024390243902439) internal successors, (124), 41 states have internal predecessors, (124), 0 states have call successors, (0), 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-15 13:57:40,100 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2021-12-15 13:57:40,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-15 13:57:40,100 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:57:40,100 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:57:40,122 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-15 13:57:40,308 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-15 13:57:40,308 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-15 13:57:40,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:57:40,309 INFO L85 PathProgramCache]: Analyzing trace with hash 940963662, now seen corresponding path program 10 times [2021-12-15 13:57:40,309 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:57:40,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610324896] [2021-12-15 13:57:40,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:57:40,309 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:57:40,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:40,544 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 45 proven. 137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:40,545 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:57:40,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610324896] [2021-12-15 13:57:40,545 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610324896] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:57:40,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1630316961] [2021-12-15 13:57:40,545 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-15 13:57:40,545 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:57:40,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:57:40,546 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-15 13:57:40,548 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-15 13:57:40,673 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-15 13:57:40,673 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 13:57:40,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 88 conjunts are in the unsatisfiable core [2021-12-15 13:57:40,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:57:40,693 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-15 13:57:40,693 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-15 13:57:40,702 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-15 13:57:41,069 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-15 13:57:41,178 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-15 13:57:41,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 18 treesize of output 20 [2021-12-15 13:57:41,320 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-15 13:57:41,396 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-15 13:57:41,460 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-15 13:57:41,532 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-15 13:57:41,617 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:57:41,617 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 19 treesize of output 19 [2021-12-15 13:57:41,734 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 72 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:41,734 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:57:42,395 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_904 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_~from#1.offset_136| Int)) (or (< |v_ULTIMATE.start_cstrcpy_~from#1.offset_136| 0) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_904) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |v_ULTIMATE.start_cstrcpy_~from#1.offset_136| 6))) (<= (+ |v_ULTIMATE.start_cstrcpy_~from#1.offset_136| 8) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrcpy_~from#1.offset_136|))) is different from false [2021-12-15 13:57:42,404 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:57:42,404 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-15 13:57:42,409 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:57:42,409 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-15 13:57:42,413 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-15 13:57:43,677 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 91 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:43,677 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1630316961] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:57:43,678 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:57:43,678 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 22, 22] total 59 [2021-12-15 13:57:43,678 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189427624] [2021-12-15 13:57:43,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:57:43,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2021-12-15 13:57:43,678 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:57:43,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2021-12-15 13:57:43,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=3046, Unknown=2, NotChecked=114, Total=3540 [2021-12-15 13:57:43,680 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand has 60 states, 59 states have (on average 3.169491525423729) internal successors, (187), 60 states have internal predecessors, (187), 0 states have call successors, (0), 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-15 13:57:44,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:57:44,911 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2021-12-15 13:57:44,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-12-15 13:57:44,911 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 59 states have (on average 3.169491525423729) internal successors, (187), 60 states have internal predecessors, (187), 0 states have call successors, (0), 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 65 [2021-12-15 13:57:44,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:57:44,912 INFO L225 Difference]: With dead ends: 84 [2021-12-15 13:57:44,912 INFO L226 Difference]: Without dead ends: 84 [2021-12-15 13:57:44,913 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 92 SyntacticMatches, 4 SemanticMatches, 76 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 987 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=858, Invalid=4986, Unknown=12, NotChecked=150, Total=6006 [2021-12-15 13:57:44,914 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 153 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 921 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 1398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 365 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-15 13:57:44,914 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 416 Invalid, 1398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 921 Invalid, 0 Unknown, 365 Unchecked, 0.4s Time] [2021-12-15 13:57:44,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-12-15 13:57:44,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2021-12-15 13:57:44,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 82 states have (on average 1.0609756097560976) internal successors, (87), 83 states have internal predecessors, (87), 0 states have call successors, (0), 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-15 13:57:44,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2021-12-15 13:57:44,916 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 65 [2021-12-15 13:57:44,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:57:44,916 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2021-12-15 13:57:44,917 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 59 states have (on average 3.169491525423729) internal successors, (187), 60 states have internal predecessors, (187), 0 states have call successors, (0), 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-15 13:57:44,917 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2021-12-15 13:57:44,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-12-15 13:57:44,917 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:57:44,917 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:57:44,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-12-15 13:57:45,131 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:57:45,131 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-15 13:57:45,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:57:45,132 INFO L85 PathProgramCache]: Analyzing trace with hash -75938812, now seen corresponding path program 11 times [2021-12-15 13:57:45,132 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:57:45,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236230696] [2021-12-15 13:57:45,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:57:45,132 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:57:45,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:45,387 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 124 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:45,387 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:57:45,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236230696] [2021-12-15 13:57:45,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236230696] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:57:45,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383839716] [2021-12-15 13:57:45,387 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-15 13:57:45,387 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:57:45,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:57:45,389 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 13:57:45,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-12-15 13:57:45,648 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2021-12-15 13:57:45,648 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 13:57:45,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 46 conjunts are in the unsatisfiable core [2021-12-15 13:57:45,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:57:45,681 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-15 13:57:45,682 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-15 13:57:46,347 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 153 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:46,347 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:57:46,807 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 153 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:46,807 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [383839716] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:57:46,807 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:57:46,807 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 49 [2021-12-15 13:57:46,807 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689796172] [2021-12-15 13:57:46,807 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:57:46,808 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2021-12-15 13:57:46,808 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:57:46,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2021-12-15 13:57:46,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=444, Invalid=1908, Unknown=0, NotChecked=0, Total=2352 [2021-12-15 13:57:46,809 INFO L87 Difference]: Start difference. First operand 84 states and 87 transitions. Second operand has 49 states, 49 states have (on average 3.5510204081632653) internal successors, (174), 49 states have internal predecessors, (174), 0 states have call successors, (0), 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-15 13:57:47,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:57:47,126 INFO L93 Difference]: Finished difference Result 126 states and 129 transitions. [2021-12-15 13:57:47,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-15 13:57:47,127 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 3.5510204081632653) internal successors, (174), 49 states have internal predecessors, (174), 0 states have call successors, (0), 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 73 [2021-12-15 13:57:47,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:57:47,127 INFO L225 Difference]: With dead ends: 126 [2021-12-15 13:57:47,128 INFO L226 Difference]: Without dead ends: 91 [2021-12-15 13:57:47,128 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 117 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=732, Invalid=2690, Unknown=0, NotChecked=0, Total=3422 [2021-12-15 13:57:47,129 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 83 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 13:57:47,129 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 146 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 13:57:47,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-12-15 13:57:47,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 88. [2021-12-15 13:57:47,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 86 states have (on average 1.058139534883721) internal successors, (91), 87 states have internal predecessors, (91), 0 states have call successors, (0), 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-15 13:57:47,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 91 transitions. [2021-12-15 13:57:47,131 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 91 transitions. Word has length 73 [2021-12-15 13:57:47,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:57:47,131 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 91 transitions. [2021-12-15 13:57:47,132 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 3.5510204081632653) internal successors, (174), 49 states have internal predecessors, (174), 0 states have call successors, (0), 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-15 13:57:47,132 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 91 transitions. [2021-12-15 13:57:47,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-12-15 13:57:47,132 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:57:47,132 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:57:47,149 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2021-12-15 13:57:47,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:57:47,335 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-15 13:57:47,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:57:47,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1816661881, now seen corresponding path program 12 times [2021-12-15 13:57:47,336 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:57:47,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850715256] [2021-12-15 13:57:47,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:57:47,336 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:57:47,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:47,801 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 17 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:47,801 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:57:47,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850715256] [2021-12-15 13:57:47,801 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850715256] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:57:47,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [829857914] [2021-12-15 13:57:47,801 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-15 13:57:47,801 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:57:47,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:57:47,803 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 13:57:47,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-12-15 13:57:48,348 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2021-12-15 13:57:48,348 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 13:57:48,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 102 conjunts are in the unsatisfiable core [2021-12-15 13:57:48,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:57:48,366 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-15 13:57:48,740 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-15 13:57:48,833 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-15 13:57:48,878 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-15 13:57:48,895 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-15 13:57:48,915 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-15 13:57:48,932 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-15 13:57:48,949 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-15 13:57:48,965 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-15 13:57:48,985 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-15 13:57:49,018 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-15 13:57:49,024 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 17 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:49,024 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:57:49,057 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1078 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1078) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 1)) 0)) is different from false [2021-12-15 13:57:49,065 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1078 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1078) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 2)) 0)) is different from false [2021-12-15 13:57:49,075 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1078 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1078) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 3)) 0)) is different from false [2021-12-15 13:57:49,085 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1078 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1078) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 4)) 0)) is different from false [2021-12-15 13:57:49,099 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1078 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1078) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 5)) 0)) is different from false [2021-12-15 13:57:49,109 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1078 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1078) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 6)) 0)) is different from false [2021-12-15 13:57:49,119 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1078 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1078) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 7)) 0)) is different from false [2021-12-15 13:57:49,129 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1078 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1078) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 8)) 0)) is different from false [2021-12-15 13:57:49,140 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1078 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1078) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |c_ULTIMATE.start_main_~nondetString~0#1.offset| 8)) 0)) is different from false [2021-12-15 13:57:49,144 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:57:49,144 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-15 13:57:49,149 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:57:49,149 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-15 13:57:49,151 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-15 13:57:49,416 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 17 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 135 not checked. [2021-12-15 13:57:49,417 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [829857914] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:57:49,417 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:57:49,417 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25, 25] total 49 [2021-12-15 13:57:49,417 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234640861] [2021-12-15 13:57:49,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:57:49,417 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2021-12-15 13:57:49,417 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:57:49,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2021-12-15 13:57:49,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1464, Unknown=9, NotChecked=756, Total=2352 [2021-12-15 13:57:49,419 INFO L87 Difference]: Start difference. First operand 88 states and 91 transitions. Second operand has 49 states, 49 states have (on average 3.204081632653061) internal successors, (157), 49 states have internal predecessors, (157), 0 states have call successors, (0), 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-15 13:57:50,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:57:50,284 INFO L93 Difference]: Finished difference Result 132 states and 135 transitions. [2021-12-15 13:57:50,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-12-15 13:57:50,285 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 3.204081632653061) internal successors, (157), 49 states have internal predecessors, (157), 0 states have call successors, (0), 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 77 [2021-12-15 13:57:50,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:57:50,285 INFO L225 Difference]: With dead ends: 132 [2021-12-15 13:57:50,286 INFO L226 Difference]: Without dead ends: 95 [2021-12-15 13:57:50,286 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 133 SyntacticMatches, 12 SemanticMatches, 59 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=205, Invalid=2474, Unknown=9, NotChecked=972, Total=3660 [2021-12-15 13:57:50,287 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 52 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 1302 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 1942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 626 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-15 13:57:50,287 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 607 Invalid, 1942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1302 Invalid, 0 Unknown, 626 Unchecked, 0.4s Time] [2021-12-15 13:57:50,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-12-15 13:57:50,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2021-12-15 13:57:50,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 90 states have (on average 1.0555555555555556) internal successors, (95), 91 states have internal predecessors, (95), 0 states have call successors, (0), 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-15 13:57:50,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 95 transitions. [2021-12-15 13:57:50,289 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 95 transitions. Word has length 77 [2021-12-15 13:57:50,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:57:50,289 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 95 transitions. [2021-12-15 13:57:50,289 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 3.204081632653061) internal successors, (157), 49 states have internal predecessors, (157), 0 states have call successors, (0), 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-15 13:57:50,289 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 95 transitions. [2021-12-15 13:57:50,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-12-15 13:57:50,289 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:57:50,290 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:57:50,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2021-12-15 13:57:50,490 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:57:50,490 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-15 13:57:50,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:57:50,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1542890378, now seen corresponding path program 13 times [2021-12-15 13:57:50,491 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:57:50,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180619385] [2021-12-15 13:57:50,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:57:50,491 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:57:50,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:50,823 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 91 proven. 215 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:50,823 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:57:50,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180619385] [2021-12-15 13:57:50,823 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180619385] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:57:50,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435036165] [2021-12-15 13:57:50,823 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-12-15 13:57:50,823 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:57:50,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:57:50,828 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 13:57:50,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-12-15 13:57:50,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:50,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 57 conjunts are in the unsatisfiable core [2021-12-15 13:57:50,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:57:51,366 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 120 proven. 186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:51,367 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:57:51,779 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-15 13:57:51,875 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 120 proven. 186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:51,875 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435036165] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:57:51,875 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:57:51,876 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23, 23] total 46 [2021-12-15 13:57:51,876 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20964637] [2021-12-15 13:57:51,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:57:51,876 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2021-12-15 13:57:51,876 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:57:51,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-12-15 13:57:51,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=1930, Unknown=0, NotChecked=0, Total=2162 [2021-12-15 13:57:51,877 INFO L87 Difference]: Start difference. First operand 92 states and 95 transitions. Second operand has 47 states, 46 states have (on average 3.5652173913043477) internal successors, (164), 47 states have internal predecessors, (164), 0 states have call successors, (0), 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-15 13:57:52,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:57:52,710 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2021-12-15 13:57:52,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-15 13:57:52,710 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 3.5652173913043477) internal successors, (164), 47 states have internal predecessors, (164), 0 states have call successors, (0), 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 81 [2021-12-15 13:57:52,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:57:52,711 INFO L225 Difference]: With dead ends: 92 [2021-12-15 13:57:52,711 INFO L226 Difference]: Without dead ends: 92 [2021-12-15 13:57:52,712 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 134 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=818, Invalid=3604, Unknown=0, NotChecked=0, Total=4422 [2021-12-15 13:57:52,712 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 277 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 1164 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 1248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-15 13:57:52,712 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [277 Valid, 433 Invalid, 1248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1164 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-15 13:57:52,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-12-15 13:57:52,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2021-12-15 13:57:52,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 90 states have (on average 1.0444444444444445) internal successors, (94), 91 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-15 13:57:52,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 94 transitions. [2021-12-15 13:57:52,714 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 94 transitions. Word has length 81 [2021-12-15 13:57:52,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:57:52,714 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 94 transitions. [2021-12-15 13:57:52,715 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 3.5652173913043477) internal successors, (164), 47 states have internal predecessors, (164), 0 states have call successors, (0), 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-15 13:57:52,715 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2021-12-15 13:57:52,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-12-15 13:57:52,715 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:57:52,715 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:57:52,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2021-12-15 13:57:52,923 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2021-12-15 13:57:52,923 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-15 13:57:52,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:57:52,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1904201381, now seen corresponding path program 14 times [2021-12-15 13:57:52,924 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:57:52,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995162537] [2021-12-15 13:57:52,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:57:52,924 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:57:52,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:53,456 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 19 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:53,456 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:57:53,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995162537] [2021-12-15 13:57:53,456 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995162537] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:57:53,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649917974] [2021-12-15 13:57:53,456 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 13:57:53,457 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:57:53,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:57:53,459 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 13:57:53,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-12-15 13:57:53,585 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 13:57:53,586 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 13:57:53,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 106 conjunts are in the unsatisfiable core [2021-12-15 13:57:53,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:57:53,603 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-15 13:57:53,607 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-15 13:57:54,166 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-15 13:57:54,346 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-15 13:57:54,499 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-15 13:57:54,647 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-15 13:57:54,806 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-15 13:57:54,965 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-15 13:57:55,133 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-15 13:57:55,290 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-15 13:57:55,438 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-15 13:57:55,590 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-15 13:57:55,814 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:57:55,814 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 18 [2021-12-15 13:57:56,025 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 120 proven. 223 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:56,025 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:57:57,170 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrcpy_~from#1.offset_212| Int) (v_ArrVal_1268 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrcpy_~from#1.offset_212|) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1268) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |v_ULTIMATE.start_cstrcpy_~from#1.offset_212| 9))) (< |v_ULTIMATE.start_cstrcpy_~from#1.offset_212| 0) (<= (+ |v_ULTIMATE.start_cstrcpy_~from#1.offset_212| 11) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)))) is different from false [2021-12-15 13:57:57,181 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:57:57,181 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-15 13:57:57,190 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:57:57,190 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-15 13:57:57,194 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-15 13:57:58,907 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 153 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:58,907 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [649917974] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:57:58,907 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:57:58,907 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27, 27] total 78 [2021-12-15 13:57:58,907 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729875025] [2021-12-15 13:57:58,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:57:58,908 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2021-12-15 13:57:58,908 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:57:58,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2021-12-15 13:57:58,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=425, Invalid=5428, Unknown=3, NotChecked=150, Total=6006 [2021-12-15 13:57:58,909 INFO L87 Difference]: Start difference. First operand 92 states and 94 transitions. Second operand has 78 states, 78 states have (on average 3.1666666666666665) internal successors, (247), 78 states have internal predecessors, (247), 0 states have call successors, (0), 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-15 13:58:00,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:58:00,587 INFO L93 Difference]: Finished difference Result 142 states and 143 transitions. [2021-12-15 13:58:00,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-12-15 13:58:00,588 INFO L78 Accepts]: Start accepts. Automaton has has 78 states, 78 states have (on average 3.1666666666666665) internal successors, (247), 78 states have internal predecessors, (247), 0 states have call successors, (0), 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 85 [2021-12-15 13:58:00,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:58:00,589 INFO L225 Difference]: With dead ends: 142 [2021-12-15 13:58:00,589 INFO L226 Difference]: Without dead ends: 101 [2021-12-15 13:58:00,590 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1326 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=915, Invalid=10006, Unknown=3, NotChecked=206, Total=11130 [2021-12-15 13:58:00,590 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 145 mSDsluCounter, 801 mSDsCounter, 0 mSdLazyCounter, 966 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 827 SdHoareTripleChecker+Invalid, 1592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 596 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-15 13:58:00,590 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 827 Invalid, 1592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 966 Invalid, 0 Unknown, 596 Unchecked, 0.4s Time] [2021-12-15 13:58:00,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-12-15 13:58:00,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 96. [2021-12-15 13:58:00,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 94 states have (on average 1.0319148936170213) internal successors, (97), 95 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-15 13:58:00,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2021-12-15 13:58:00,593 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 85 [2021-12-15 13:58:00,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:58:00,593 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2021-12-15 13:58:00,593 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 78 states have (on average 3.1666666666666665) internal successors, (247), 78 states have internal predecessors, (247), 0 states have call successors, (0), 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-15 13:58:00,593 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2021-12-15 13:58:00,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-12-15 13:58:00,594 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:58:00,594 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:58:00,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2021-12-15 13:58:00,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2021-12-15 13:58:00,815 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-15 13:58:00,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:58:00,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1102366013, now seen corresponding path program 15 times [2021-12-15 13:58:00,816 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:58:00,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258402368] [2021-12-15 13:58:00,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:58:00,816 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:58:00,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:58:01,452 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 21 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:58:01,452 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:58:01,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258402368] [2021-12-15 13:58:01,452 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258402368] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:58:01,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616864715] [2021-12-15 13:58:01,452 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-15 13:58:01,452 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:58:01,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:58:01,456 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 13:58:01,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2021-12-15 13:58:01,972 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2021-12-15 13:58:01,972 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 13:58:01,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 120 conjunts are in the unsatisfiable core [2021-12-15 13:58:01,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:58:01,988 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-15 13:58:02,450 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-15 13:58:02,548 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-15 13:58:02,595 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-15 13:58:02,612 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-15 13:58:02,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-15 13:58:02,645 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-15 13:58:02,661 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-15 13:58:02,678 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-15 13:58:02,700 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-15 13:58:02,719 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-15 13:58:02,743 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-15 13:58:02,753 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-15 13:58:02,758 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 21 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:58:02,758 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:58:02,814 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1379 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1379) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 1)) 0)) is different from false [2021-12-15 13:58:02,819 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1379 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1379) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 2)) 0)) is different from false [2021-12-15 13:58:02,829 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1379 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1379) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 3)) 0)) is different from false [2021-12-15 13:58:02,849 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1379 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1379) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 4)) 0)) is different from false [2021-12-15 13:58:02,858 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1379 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1379) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 5)) 0)) is different from false [2021-12-15 13:58:02,870 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1379 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1379) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 6)) 0)) is different from false [2021-12-15 13:58:02,879 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1379 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1379) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 7)) 0)) is different from false [2021-12-15 13:58:02,888 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1379 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1379) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 8)) 0)) is different from false [2021-12-15 13:58:02,898 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1379 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1379) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 9)) 0)) is different from false [2021-12-15 13:58:02,907 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1379 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1379) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 10)) 0)) is different from false [2021-12-15 13:58:02,916 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1379 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1379) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |c_ULTIMATE.start_main_~nondetString~0#1.offset| 10)) 0)) is different from false [2021-12-15 13:58:02,920 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:58:02,920 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-15 13:58:02,924 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:58:02,924 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-15 13:58:02,927 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-15 13:58:03,245 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 21 proven. 191 refuted. 0 times theorem prover too weak. 0 trivial. 209 not checked. [2021-12-15 13:58:03,246 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1616864715] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:58:03,246 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:58:03,246 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 29] total 57 [2021-12-15 13:58:03,246 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104483273] [2021-12-15 13:58:03,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:58:03,246 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2021-12-15 13:58:03,246 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:58:03,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2021-12-15 13:58:03,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1962, Unknown=11, NotChecked=1078, Total=3192 [2021-12-15 13:58:03,247 INFO L87 Difference]: Start difference. First operand 96 states and 97 transitions. Second operand has 57 states, 57 states have (on average 3.2982456140350878) internal successors, (188), 57 states have internal predecessors, (188), 0 states have call successors, (0), 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-15 13:58:04,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:58:04,465 INFO L93 Difference]: Finished difference Result 148 states and 149 transitions. [2021-12-15 13:58:04,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-12-15 13:58:04,465 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 3.2982456140350878) internal successors, (188), 57 states have internal predecessors, (188), 0 states have call successors, (0), 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 93 [2021-12-15 13:58:04,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:58:04,466 INFO L225 Difference]: With dead ends: 148 [2021-12-15 13:58:04,466 INFO L226 Difference]: Without dead ends: 103 [2021-12-15 13:58:04,466 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 163 SyntacticMatches, 14 SemanticMatches, 68 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=219, Invalid=3236, Unknown=11, NotChecked=1364, Total=4830 [2021-12-15 13:58:04,466 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 51 mSDsluCounter, 851 mSDsCounter, 0 mSdLazyCounter, 2063 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 3137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2063 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1058 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-15 13:58:04,467 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 878 Invalid, 3137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2063 Invalid, 0 Unknown, 1058 Unchecked, 0.7s Time] [2021-12-15 13:58:04,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-12-15 13:58:04,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 100. [2021-12-15 13:58:04,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 98 states have (on average 1.030612244897959) internal successors, (101), 99 states have internal predecessors, (101), 0 states have call successors, (0), 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-15 13:58:04,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2021-12-15 13:58:04,468 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 93 [2021-12-15 13:58:04,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:58:04,469 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2021-12-15 13:58:04,469 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 3.2982456140350878) internal successors, (188), 57 states have internal predecessors, (188), 0 states have call successors, (0), 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-15 13:58:04,469 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2021-12-15 13:58:04,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-12-15 13:58:04,469 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:58:04,469 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:58:04,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2021-12-15 13:58:04,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2021-12-15 13:58:04,683 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-15 13:58:04,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:58:04,684 INFO L85 PathProgramCache]: Analyzing trace with hash 46237638, now seen corresponding path program 16 times [2021-12-15 13:58:04,684 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:58:04,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236849975] [2021-12-15 13:58:04,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:58:04,684 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:58:04,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:58:05,157 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 153 proven. 309 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:58:05,157 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:58:05,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236849975] [2021-12-15 13:58:05,157 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236849975] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:58:05,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177034996] [2021-12-15 13:58:05,158 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-15 13:58:05,158 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:58:05,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:58:05,159 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 13:58:05,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2021-12-15 13:58:05,341 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-15 13:58:05,342 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 13:58:05,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 120 conjunts are in the unsatisfiable core [2021-12-15 13:58:05,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:58:05,363 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-15 13:58:05,367 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-15 13:58:06,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 16 treesize of output 12 [2021-12-15 13:58:06,233 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-15 13:58:06,306 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-15 13:58:06,388 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-15 13:58:06,461 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-15 13:58:06,534 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-15 13:58:06,610 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-15 13:58:06,687 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-15 13:58:06,767 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-15 13:58:06,846 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-15 13:58:06,924 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-15 13:58:07,028 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:58:07,029 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 19 treesize of output 19 [2021-12-15 13:58:07,186 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 200 proven. 262 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:58:07,186 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:58:08,258 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrcpy_~from#1.offset_257| Int) (v_ArrVal_1497 (Array Int Int))) (or (<= (+ |v_ULTIMATE.start_cstrcpy_~from#1.offset_257| 12) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1497) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |v_ULTIMATE.start_cstrcpy_~from#1.offset_257| 10))) (< |v_ULTIMATE.start_cstrcpy_~from#1.offset_257| 0) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrcpy_~from#1.offset_257|))) is different from false [2021-12-15 13:58:08,267 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:58:08,267 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-15 13:58:08,273 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:58:08,273 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-15 13:58:08,276 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