./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/cstrcpy-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 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/cstrcpy-alloca-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fa78fde783b634840a8dd117d9f71a3fa4064d7e1622444edf74e6b44f549a34 --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 13:55:42,120 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 13:55:42,121 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 13:55:42,168 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 13:55:42,169 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 13:55:42,170 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 13:55:42,171 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 13:55:42,173 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 13:55:42,174 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 13:55:42,175 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 13:55:42,176 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 13:55:42,177 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 13:55:42,177 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 13:55:42,178 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 13:55:42,179 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 13:55:42,180 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 13:55:42,181 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 13:55:42,188 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 13:55:42,189 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 13:55:42,191 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 13:55:42,192 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 13:55:42,193 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 13:55:42,194 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 13:55:42,194 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 13:55:42,196 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 13:55:42,196 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 13:55:42,196 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 13:55:42,197 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 13:55:42,202 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 13:55:42,202 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 13:55:42,203 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 13:55:42,203 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 13:55:42,204 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 13:55:42,204 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 13:55:42,205 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 13:55:42,205 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 13:55:42,205 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 13:55:42,206 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 13:55:42,206 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 13:55:42,206 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 13:55:42,208 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 13:55:42,209 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:55:42,224 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 13:55:42,225 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 13:55:42,226 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 13:55:42,226 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 13:55:42,227 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-15 13:55:42,227 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-15 13:55:42,228 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 13:55:42,228 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 13:55:42,228 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 13:55:42,228 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 13:55:42,229 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 13:55:42,229 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-15 13:55:42,229 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 13:55:42,229 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 13:55:42,229 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 13:55:42,229 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-15 13:55:42,230 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-15 13:55:42,230 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-15 13:55:42,230 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-15 13:55:42,230 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-15 13:55:42,230 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 13:55:42,230 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 13:55:42,231 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 13:55:42,231 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 13:55:42,231 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-15 13:55:42,231 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 13:55:42,231 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 13:55:42,231 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-15 13:55:42,232 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 13:55:42,232 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-15 13:55:42,232 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 13:55:42,232 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fa78fde783b634840a8dd117d9f71a3fa4064d7e1622444edf74e6b44f549a34 [2021-12-15 13:55:42,439 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 13:55:42,458 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 13:55:42,460 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 13:55:42,460 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 13:55:42,461 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 13:55:42,462 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/cstrcpy-alloca-1.i [2021-12-15 13:55:42,509 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc386692e/62ef681eb6cb4e04b835461bca45be7e/FLAG4be83dcd3 [2021-12-15 13:55:42,929 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 13:55:42,931 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrcpy-alloca-1.i [2021-12-15 13:55:42,946 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc386692e/62ef681eb6cb4e04b835461bca45be7e/FLAG4be83dcd3 [2021-12-15 13:55:42,959 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc386692e/62ef681eb6cb4e04b835461bca45be7e [2021-12-15 13:55:42,961 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 13:55:42,962 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 13:55:42,965 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 13:55:42,965 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 13:55:42,967 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 13:55:42,968 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 01:55:42" (1/1) ... [2021-12-15 13:55:42,968 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2292a21e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:55:42, skipping insertion in model container [2021-12-15 13:55:42,969 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 01:55:42" (1/1) ... [2021-12-15 13:55:42,977 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 13:55:43,012 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 13:55:43,298 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 13:55:43,305 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 13:55:43,326 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 13:55:43,344 INFO L208 MainTranslator]: Completed translation [2021-12-15 13:55:43,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:55:43 WrapperNode [2021-12-15 13:55:43,344 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 13:55:43,345 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 13:55:43,345 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 13:55:43,346 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 13:55:43,355 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:55:43" (1/1) ... [2021-12-15 13:55:43,374 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:55:43" (1/1) ... [2021-12-15 13:55:43,386 INFO L137 Inliner]: procedures = 117, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 68 [2021-12-15 13:55:43,387 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 13:55:43,387 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 13:55:43,387 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 13:55:43,387 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 13:55:43,395 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:55:43" (1/1) ... [2021-12-15 13:55:43,395 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:55:43" (1/1) ... [2021-12-15 13:55:43,409 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:55:43" (1/1) ... [2021-12-15 13:55:43,409 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:55:43" (1/1) ... [2021-12-15 13:55:43,413 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:55:43" (1/1) ... [2021-12-15 13:55:43,415 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:55:43" (1/1) ... [2021-12-15 13:55:43,416 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:55:43" (1/1) ... [2021-12-15 13:55:43,417 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 13:55:43,418 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 13:55:43,418 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 13:55:43,418 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 13:55:43,425 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:55:43" (1/1) ... [2021-12-15 13:55:43,431 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 13:55:43,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:55:43,448 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:55:43,449 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:55:43,474 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-15 13:55:43,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-15 13:55:43,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-15 13:55:43,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-15 13:55:43,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 13:55:43,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 13:55:43,580 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 13:55:43,581 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 13:55:43,709 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 13:55:43,712 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 13:55:43,719 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-15 13:55:43,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 01:55:43 BoogieIcfgContainer [2021-12-15 13:55:43,720 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 13:55:43,721 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-15 13:55:43,722 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-15 13:55:43,724 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-15 13:55:43,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 01:55:42" (1/3) ... [2021-12-15 13:55:43,725 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ca4fff4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 01:55:43, skipping insertion in model container [2021-12-15 13:55:43,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:55:43" (2/3) ... [2021-12-15 13:55:43,726 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ca4fff4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 01:55:43, skipping insertion in model container [2021-12-15 13:55:43,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 01:55:43" (3/3) ... [2021-12-15 13:55:43,727 INFO L111 eAbstractionObserver]: Analyzing ICFG cstrcpy-alloca-1.i [2021-12-15 13:55:43,731 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-15 13:55:43,733 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2021-12-15 13:55:43,770 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-15 13:55:43,775 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:55:43,776 INFO L340 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2021-12-15 13:55:43,787 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:55:43,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-15 13:55:43,792 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:55:43,792 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-15 13:55:43,793 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:55:43,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:55:43,802 INFO L85 PathProgramCache]: Analyzing trace with hash 889510840, now seen corresponding path program 1 times [2021-12-15 13:55:43,808 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:55:43,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431518162] [2021-12-15 13:55:43,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:55:43,809 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:55:43,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:55:43,948 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:55:43,948 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:55:43,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431518162] [2021-12-15 13:55:43,949 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431518162] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:55:43,950 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:55:43,950 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 13:55:43,951 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718776629] [2021-12-15 13:55:43,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:55:43,954 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 13:55:43,955 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:55:43,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 13:55:43,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 13:55:43,976 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:55:44,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:55:44,024 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2021-12-15 13:55:44,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 13:55:44,027 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:55:44,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:55:44,032 INFO L225 Difference]: With dead ends: 34 [2021-12-15 13:55:44,032 INFO L226 Difference]: Without dead ends: 30 [2021-12-15 13:55:44,034 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:55:44,037 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:55:44,038 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:55:44,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-12-15 13:55:44,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2021-12-15 13:55:44,058 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:55:44,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2021-12-15 13:55:44,059 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 6 [2021-12-15 13:55:44,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:55:44,060 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2021-12-15 13:55:44,061 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:55:44,061 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2021-12-15 13:55:44,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-15 13:55:44,061 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:55:44,061 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-15 13:55:44,062 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-15 13:55:44,062 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:55:44,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:55:44,063 INFO L85 PathProgramCache]: Analyzing trace with hash 889512762, now seen corresponding path program 1 times [2021-12-15 13:55:44,063 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:55:44,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710810353] [2021-12-15 13:55:44,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:55:44,065 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:55:44,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:55:44,100 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:55:44,100 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:55:44,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710810353] [2021-12-15 13:55:44,100 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710810353] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:55:44,101 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:55:44,101 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 13:55:44,101 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163330628] [2021-12-15 13:55:44,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:55:44,102 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 13:55:44,102 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:55:44,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 13:55:44,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 13:55:44,103 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:55:44,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:55:44,128 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2021-12-15 13:55:44,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 13:55:44,129 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:55:44,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:55:44,129 INFO L225 Difference]: With dead ends: 29 [2021-12-15 13:55:44,129 INFO L226 Difference]: Without dead ends: 28 [2021-12-15 13:55:44,130 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:55:44,131 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:55:44,131 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:55:44,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2021-12-15 13:55:44,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2021-12-15 13:55:44,134 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:55:44,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2021-12-15 13:55:44,135 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 6 [2021-12-15 13:55:44,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:55:44,135 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2021-12-15 13:55:44,136 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:55:44,136 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2021-12-15 13:55:44,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-15 13:55:44,136 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:55:44,136 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:55:44,137 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-15 13:55:44,137 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:55:44,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:55:44,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1805033015, now seen corresponding path program 1 times [2021-12-15 13:55:44,140 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:55:44,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673153502] [2021-12-15 13:55:44,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:55:44,142 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:55:44,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:55:44,176 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:55:44,177 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:55:44,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673153502] [2021-12-15 13:55:44,177 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673153502] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:55:44,177 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:55:44,177 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 13:55:44,177 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455907472] [2021-12-15 13:55:44,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:55:44,178 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 13:55:44,178 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:55:44,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 13:55:44,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 13:55:44,178 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:55:44,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:55:44,194 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2021-12-15 13:55:44,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 13:55:44,194 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:55:44,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:55:44,195 INFO L225 Difference]: With dead ends: 25 [2021-12-15 13:55:44,195 INFO L226 Difference]: Without dead ends: 25 [2021-12-15 13:55:44,196 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:55:44,197 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:55:44,199 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:55:44,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-12-15 13:55:44,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2021-12-15 13:55:44,205 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:55:44,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2021-12-15 13:55:44,206 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 7 [2021-12-15 13:55:44,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:55:44,206 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2021-12-15 13:55:44,206 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:55:44,208 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2021-12-15 13:55:44,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-15 13:55:44,209 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:55:44,209 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:55:44,209 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-15 13:55:44,209 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:55:44,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:55:44,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1805033016, now seen corresponding path program 1 times [2021-12-15 13:55:44,211 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:55:44,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019026469] [2021-12-15 13:55:44,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:55:44,212 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:55:44,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:55:44,287 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:55:44,288 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:55:44,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019026469] [2021-12-15 13:55:44,288 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019026469] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:55:44,288 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:55:44,288 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 13:55:44,288 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368874048] [2021-12-15 13:55:44,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:55:44,289 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 13:55:44,289 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:55:44,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 13:55:44,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-15 13:55:44,290 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:55:44,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:55:44,317 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2021-12-15 13:55:44,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 13:55:44,318 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:55:44,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:55:44,319 INFO L225 Difference]: With dead ends: 24 [2021-12-15 13:55:44,320 INFO L226 Difference]: Without dead ends: 24 [2021-12-15 13:55:44,320 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:55:44,321 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:55:44,323 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:55:44,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2021-12-15 13:55:44,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2021-12-15 13:55:44,327 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:55:44,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2021-12-15 13:55:44,328 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 7 [2021-12-15 13:55:44,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:55:44,328 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2021-12-15 13:55:44,328 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:55:44,328 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2021-12-15 13:55:44,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-15 13:55:44,329 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:55:44,329 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:55:44,329 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-15 13:55:44,330 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:55:44,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:55:44,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1805033069, now seen corresponding path program 1 times [2021-12-15 13:55:44,332 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:55:44,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830921259] [2021-12-15 13:55:44,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:55:44,333 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:55:44,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:55:44,373 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:55:44,374 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:55:44,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830921259] [2021-12-15 13:55:44,374 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830921259] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:55:44,374 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:55:44,374 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 13:55:44,374 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027939918] [2021-12-15 13:55:44,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:55:44,375 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 13:55:44,375 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:55:44,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 13:55:44,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-15 13:55:44,377 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:55:44,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:55:44,393 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2021-12-15 13:55:44,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 13:55:44,394 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:55:44,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:55:44,395 INFO L225 Difference]: With dead ends: 40 [2021-12-15 13:55:44,395 INFO L226 Difference]: Without dead ends: 40 [2021-12-15 13:55:44,395 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:55:44,396 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:55:44,396 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:55:44,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2021-12-15 13:55:44,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 26. [2021-12-15 13:55:44,402 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:55:44,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2021-12-15 13:55:44,402 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 7 [2021-12-15 13:55:44,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:55:44,402 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2021-12-15 13:55:44,402 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:55:44,403 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2021-12-15 13:55:44,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-15 13:55:44,403 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:55:44,403 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:55:44,403 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-15 13:55:44,403 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:55:44,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:55:44,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1805092651, now seen corresponding path program 1 times [2021-12-15 13:55:44,404 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:55:44,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029350969] [2021-12-15 13:55:44,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:55:44,404 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:55:44,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:55:44,490 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:55:44,491 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:55:44,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029350969] [2021-12-15 13:55:44,491 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029350969] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:55:44,491 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:55:44,491 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 13:55:44,492 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515412040] [2021-12-15 13:55:44,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:55:44,492 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 13:55:44,492 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:55:44,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 13:55:44,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-15 13:55:44,493 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:55:44,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:55:44,555 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2021-12-15 13:55:44,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 13:55:44,555 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:55:44,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:55:44,558 INFO L225 Difference]: With dead ends: 44 [2021-12-15 13:55:44,558 INFO L226 Difference]: Without dead ends: 44 [2021-12-15 13:55:44,558 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:55:44,560 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.1s IncrementalHoareTripleChecker+Time [2021-12-15 13:55:44,565 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.1s Time] [2021-12-15 13:55:44,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2021-12-15 13:55:44,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 28. [2021-12-15 13:55:44,569 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:55:44,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2021-12-15 13:55:44,571 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 7 [2021-12-15 13:55:44,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:55:44,572 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2021-12-15 13:55:44,572 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:55:44,572 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2021-12-15 13:55:44,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-15 13:55:44,573 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:55:44,573 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:55:44,573 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-15 13:55:44,574 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-15 13:55:44,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:55:44,574 INFO L85 PathProgramCache]: Analyzing trace with hash 748014037, now seen corresponding path program 1 times [2021-12-15 13:55:44,574 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:55:44,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930640647] [2021-12-15 13:55:44,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:55:44,575 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:55:44,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:55:44,648 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:55:44,649 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:55:44,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930640647] [2021-12-15 13:55:44,649 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930640647] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:55:44,649 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:55:44,649 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-15 13:55:44,649 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691015696] [2021-12-15 13:55:44,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:55:44,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-15 13:55:44,650 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:55:44,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-15 13:55:44,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-15 13:55:44,651 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:44,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:55:44,718 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2021-12-15 13:55:44,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-15 13:55:44,718 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-15 13:55:44,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:55:44,719 INFO L225 Difference]: With dead ends: 35 [2021-12-15 13:55:44,719 INFO L226 Difference]: Without dead ends: 35 [2021-12-15 13:55:44,720 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2021-12-15 13:55:44,721 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 59 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 13:55:44,722 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 51 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 13:55:44,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-12-15 13:55:44,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2021-12-15 13:55:44,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 29 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:44,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2021-12-15 13:55:44,724 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 10 [2021-12-15 13:55:44,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:55:44,725 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2021-12-15 13:55:44,725 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:44,725 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2021-12-15 13:55:44,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-15 13:55:44,725 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:55:44,725 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:55:44,726 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-15 13:55:44,726 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-15 13:55:44,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:55:44,726 INFO L85 PathProgramCache]: Analyzing trace with hash 748014036, now seen corresponding path program 1 times [2021-12-15 13:55:44,726 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:55:44,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087660742] [2021-12-15 13:55:44,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:55:44,727 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:55:44,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:55:44,768 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:55:44,769 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:55:44,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087660742] [2021-12-15 13:55:44,769 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087660742] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:55:44,769 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:55:44,770 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 13:55:44,770 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140994552] [2021-12-15 13:55:44,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:55:44,770 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 13:55:44,770 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:55:44,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 13:55:44,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 13:55:44,771 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:44,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:55:44,819 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2021-12-15 13:55:44,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 13:55:44,820 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:55:44,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:55:44,820 INFO L225 Difference]: With dead ends: 29 [2021-12-15 13:55:44,821 INFO L226 Difference]: Without dead ends: 29 [2021-12-15 13:55:44,821 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:55:44,821 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 28 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 13:55:44,822 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 37 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 13:55:44,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-12-15 13:55:44,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2021-12-15 13:55:44,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.375) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:44,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2021-12-15 13:55:44,824 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 10 [2021-12-15 13:55:44,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:55:44,824 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2021-12-15 13:55:44,825 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:55:44,825 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2021-12-15 13:55:44,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-15 13:55:44,825 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:55:44,825 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:55:44,825 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-15 13:55:44,826 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:55:44,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:55:44,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1713598655, now seen corresponding path program 1 times [2021-12-15 13:55:44,826 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:55:44,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202419378] [2021-12-15 13:55:44,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:55:44,827 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:55:44,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:55:44,901 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:55:44,901 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:55:44,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202419378] [2021-12-15 13:55:44,901 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202419378] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:55:44,902 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:55:44,902 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 13:55:44,902 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616527630] [2021-12-15 13:55:44,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:55:44,902 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-15 13:55:44,902 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:55:44,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-15 13:55:44,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-15 13:55:44,903 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:44,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:55:44,931 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2021-12-15 13:55:44,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 13:55:44,932 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-15 13:55:44,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:55:44,932 INFO L225 Difference]: With dead ends: 28 [2021-12-15 13:55:44,933 INFO L226 Difference]: Without dead ends: 28 [2021-12-15 13:55:44,933 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:55:44,933 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 38 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 13:55:44,934 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 40 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 13:55:44,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2021-12-15 13:55:44,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2021-12-15 13:55:44,935 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:55:44,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2021-12-15 13:55:44,935 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 11 [2021-12-15 13:55:44,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:55:44,936 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2021-12-15 13:55:44,936 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:44,936 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2021-12-15 13:55:44,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-15 13:55:44,936 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:55:44,936 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:55:44,937 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-15 13:55:44,937 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:55:44,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:55:44,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1713598656, now seen corresponding path program 1 times [2021-12-15 13:55:44,937 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:55:44,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616868126] [2021-12-15 13:55:44,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:55:44,938 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:55:44,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:55:45,016 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:55:45,017 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:55:45,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616868126] [2021-12-15 13:55:45,017 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616868126] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:55:45,017 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:55:45,017 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 13:55:45,017 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740694800] [2021-12-15 13:55:45,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:55:45,017 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-15 13:55:45,017 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:55:45,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-15 13:55:45,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-15 13:55:45,018 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:45,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:55:45,074 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2021-12-15 13:55:45,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-15 13:55:45,075 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-15 13:55:45,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:55:45,075 INFO L225 Difference]: With dead ends: 30 [2021-12-15 13:55:45,076 INFO L226 Difference]: Without dead ends: 30 [2021-12-15 13:55:45,076 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-12-15 13:55:45,076 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 45 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 13:55:45,077 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 49 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 13:55:45,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-12-15 13:55:45,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2021-12-15 13:55:45,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.32) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:45,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2021-12-15 13:55:45,079 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 11 [2021-12-15 13:55:45,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:55:45,080 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2021-12-15 13:55:45,080 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:45,080 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2021-12-15 13:55:45,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-15 13:55:45,080 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:55:45,081 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:55:45,081 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-15 13:55:45,081 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:55:45,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:55:45,081 INFO L85 PathProgramCache]: Analyzing trace with hash 952918382, now seen corresponding path program 1 times [2021-12-15 13:55:45,082 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:55:45,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564377686] [2021-12-15 13:55:45,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:55:45,082 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:55:45,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:55:45,140 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:55:45,141 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:55:45,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564377686] [2021-12-15 13:55:45,141 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564377686] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:55:45,141 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:55:45,141 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 13:55:45,141 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049537264] [2021-12-15 13:55:45,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:55:45,141 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 13:55:45,142 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:55:45,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 13:55:45,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 13:55:45,142 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:45,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:55:45,159 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2021-12-15 13:55:45,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 13:55:45,160 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:55:45,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:55:45,160 INFO L225 Difference]: With dead ends: 49 [2021-12-15 13:55:45,160 INFO L226 Difference]: Without dead ends: 49 [2021-12-15 13:55:45,160 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:55:45,161 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:55:45,161 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:55:45,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2021-12-15 13:55:45,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 30. [2021-12-15 13:55:45,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 29 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:45,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2021-12-15 13:55:45,163 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 11 [2021-12-15 13:55:45,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:55:45,163 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2021-12-15 13:55:45,163 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:55:45,164 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2021-12-15 13:55:45,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-15 13:55:45,164 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:55:45,164 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:55:45,164 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-15 13:55:45,164 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:55:45,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:55:45,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1632976752, now seen corresponding path program 1 times [2021-12-15 13:55:45,165 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:55:45,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870375092] [2021-12-15 13:55:45,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:55:45,165 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:55:45,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:55:45,209 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:55:45,209 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:55:45,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870375092] [2021-12-15 13:55:45,209 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870375092] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:55:45,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799677269] [2021-12-15 13:55:45,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:55:45,210 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:55:45,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:55:45,210 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:55:45,211 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:55:45,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:55:45,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-15 13:55:45,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:55:45,359 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-15 13:55:45,360 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:55:45,457 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:55:45,457 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:55:45,614 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:55:45,615 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799677269] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:55:45,615 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:55:45,615 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2021-12-15 13:55:45,615 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521583537] [2021-12-15 13:55:45,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:55:45,615 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-15 13:55:45,616 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:55:45,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-15 13:55:45,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-12-15 13:55:45,616 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:45,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:55:45,712 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2021-12-15 13:55:45,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-15 13:55:45,712 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:55:45,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:55:45,713 INFO L225 Difference]: With dead ends: 62 [2021-12-15 13:55:45,713 INFO L226 Difference]: Without dead ends: 62 [2021-12-15 13:55:45,714 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:55:45,714 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 60 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 13:55:45,715 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 86 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 13:55:45,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-12-15 13:55:45,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 27. [2021-12-15 13:55:45,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:45,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2021-12-15 13:55:45,721 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 11 [2021-12-15 13:55:45,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:55:45,721 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2021-12-15 13:55:45,721 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:55:45,721 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2021-12-15 13:55:45,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-15 13:55:45,722 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:55:45,722 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:55:45,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-15 13:55:45,963 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:55:45,964 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:55:45,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:55:45,964 INFO L85 PathProgramCache]: Analyzing trace with hash -163723683, now seen corresponding path program 1 times [2021-12-15 13:55:45,964 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:55:45,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015188652] [2021-12-15 13:55:45,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:55:45,965 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:55:45,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:55:46,044 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:55:46,045 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:55:46,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015188652] [2021-12-15 13:55:46,045 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015188652] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:55:46,045 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:55:46,045 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-15 13:55:46,045 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752621441] [2021-12-15 13:55:46,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:55:46,046 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-15 13:55:46,046 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:55:46,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-15 13:55:46,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-15 13:55:46,046 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:46,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:55:46,114 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2021-12-15 13:55:46,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-15 13:55:46,114 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-12-15 13:55:46,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:55:46,115 INFO L225 Difference]: With dead ends: 39 [2021-12-15 13:55:46,115 INFO L226 Difference]: Without dead ends: 39 [2021-12-15 13:55:46,115 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2021-12-15 13:55:46,115 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 14 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 13:55:46,116 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 107 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 13:55:46,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2021-12-15 13:55:46,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2021-12-15 13:55:46,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 32 states have (on average 1.21875) internal successors, (39), 34 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:46,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2021-12-15 13:55:46,118 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 14 [2021-12-15 13:55:46,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:55:46,118 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2021-12-15 13:55:46,118 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:46,118 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2021-12-15 13:55:46,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-15 13:55:46,119 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:55:46,119 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:55:46,119 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-15 13:55:46,119 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:55:46,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:55:46,120 INFO L85 PathProgramCache]: Analyzing trace with hash 537340895, now seen corresponding path program 1 times [2021-12-15 13:55:46,120 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:55:46,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107788470] [2021-12-15 13:55:46,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:55:46,120 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:55:46,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:55:46,205 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:55:46,206 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:55:46,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107788470] [2021-12-15 13:55:46,206 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107788470] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:55:46,206 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:55:46,206 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-15 13:55:46,206 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601030777] [2021-12-15 13:55:46,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:55:46,207 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-15 13:55:46,207 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:55:46,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-15 13:55:46,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-15 13:55:46,209 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 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:55:46,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:55:46,298 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2021-12-15 13:55:46,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-15 13:55:46,300 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 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:55:46,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:55:46,301 INFO L225 Difference]: With dead ends: 53 [2021-12-15 13:55:46,301 INFO L226 Difference]: Without dead ends: 53 [2021-12-15 13:55:46,301 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2021-12-15 13:55:46,302 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 30 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 13:55:46,302 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 110 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 13:55:46,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-12-15 13:55:46,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 33. [2021-12-15 13:55:46,312 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:55:46,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2021-12-15 13:55:46,313 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 14 [2021-12-15 13:55:46,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:55:46,313 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2021-12-15 13:55:46,313 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 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:55:46,313 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2021-12-15 13:55:46,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-15 13:55:46,314 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:55:46,314 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:55:46,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-15 13:55:46,315 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:55:46,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:55:46,315 INFO L85 PathProgramCache]: Analyzing trace with hash 795506333, now seen corresponding path program 1 times [2021-12-15 13:55:46,315 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:55:46,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961702002] [2021-12-15 13:55:46,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:55:46,316 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:55:46,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:55:46,417 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:55:46,417 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:55:46,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961702002] [2021-12-15 13:55:46,417 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961702002] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:55:46,417 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:55:46,417 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-15 13:55:46,418 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842963281] [2021-12-15 13:55:46,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:55:46,418 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-15 13:55:46,418 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:55:46,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-15 13:55:46,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-15 13:55:46,419 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 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:55:46,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:55:46,509 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2021-12-15 13:55:46,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-15 13:55:46,510 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 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:55:46,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:55:46,512 INFO L225 Difference]: With dead ends: 47 [2021-12-15 13:55:46,512 INFO L226 Difference]: Without dead ends: 47 [2021-12-15 13:55:46,514 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2021-12-15 13:55:46,514 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 50 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 13:55:46,515 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 88 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 13:55:46,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-12-15 13:55:46,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2021-12-15 13:55:46,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 33 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:46,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2021-12-15 13:55:46,517 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 14 [2021-12-15 13:55:46,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:55:46,517 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2021-12-15 13:55:46,517 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 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:55:46,517 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2021-12-15 13:55:46,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-15 13:55:46,518 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:55:46,518 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:55:46,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-15 13:55:46,518 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:55:46,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:55:46,519 INFO L85 PathProgramCache]: Analyzing trace with hash -780511546, now seen corresponding path program 1 times [2021-12-15 13:55:46,519 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:55:46,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976687488] [2021-12-15 13:55:46,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:55:46,519 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:55:46,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:55:46,565 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:55:46,565 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:55:46,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976687488] [2021-12-15 13:55:46,566 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976687488] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:55:46,566 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:55:46,566 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 13:55:46,566 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165700813] [2021-12-15 13:55:46,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:55:46,566 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 13:55:46,566 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:55:46,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 13:55:46,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 13:55:46,567 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:46,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:55:46,577 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2021-12-15 13:55:46,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 13:55:46,577 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-15 13:55:46,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:55:46,578 INFO L225 Difference]: With dead ends: 33 [2021-12-15 13:55:46,578 INFO L226 Difference]: Without dead ends: 21 [2021-12-15 13:55:46,578 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:55:46,578 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 9 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 13:55:46,579 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 32 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 13:55:46,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2021-12-15 13:55:46,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2021-12-15 13:55:46,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:46,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2021-12-15 13:55:46,582 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 15 [2021-12-15 13:55:46,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:55:46,582 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2021-12-15 13:55:46,582 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:46,583 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2021-12-15 13:55:46,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-15 13:55:46,583 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:55:46,583 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:55:46,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-15 13:55:46,583 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:55:46,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:55:46,584 INFO L85 PathProgramCache]: Analyzing trace with hash -2086958086, now seen corresponding path program 1 times [2021-12-15 13:55:46,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:55:46,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682797889] [2021-12-15 13:55:46,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:55:46,584 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:55:46,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:55:46,704 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:55:46,704 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:55:46,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682797889] [2021-12-15 13:55:46,705 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682797889] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:55:46,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569459329] [2021-12-15 13:55:46,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:55:46,705 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:55:46,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:55:46,706 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:55:46,708 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:55:46,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:55:46,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 27 conjunts are in the unsatisfiable core [2021-12-15 13:55:46,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:55:46,865 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:55:46,865 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:55:46,982 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:55:47,004 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:55:47,005 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [569459329] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:55:47,005 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:55:47,005 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2021-12-15 13:55:47,005 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255417287] [2021-12-15 13:55:47,005 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:55:47,006 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-15 13:55:47,006 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:55:47,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-15 13:55:47,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2021-12-15 13:55:47,007 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 20 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:47,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:55:47,147 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2021-12-15 13:55:47,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-15 13:55:47,147 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 20 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-12-15 13:55:47,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:55:47,148 INFO L225 Difference]: With dead ends: 30 [2021-12-15 13:55:47,148 INFO L226 Difference]: Without dead ends: 30 [2021-12-15 13:55:47,148 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=511, Unknown=0, NotChecked=0, Total=650 [2021-12-15 13:55:47,148 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 60 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 13:55:47,148 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 57 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 13:55:47,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-12-15 13:55:47,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2021-12-15 13:55:47,149 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:55:47,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2021-12-15 13:55:47,150 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 18 [2021-12-15 13:55:47,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:55:47,150 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2021-12-15 13:55:47,150 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 20 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:47,150 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2021-12-15 13:55:47,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-15 13:55:47,150 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:55:47,150 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:55:47,174 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-15 13:55:47,350 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:55:47,351 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:55:47,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:55:47,351 INFO L85 PathProgramCache]: Analyzing trace with hash -271191237, now seen corresponding path program 1 times [2021-12-15 13:55:47,351 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:55:47,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141813200] [2021-12-15 13:55:47,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:55:47,351 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:55:47,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:55:47,435 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:55:47,435 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:55:47,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141813200] [2021-12-15 13:55:47,435 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141813200] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:55:47,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362549873] [2021-12-15 13:55:47,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:55:47,436 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:55:47,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:55:47,437 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:55:47,438 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:55:47,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:55:47,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 39 conjunts are in the unsatisfiable core [2021-12-15 13:55:47,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:55:47,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 13:55:47,532 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:55:47,536 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:55:47,684 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:55:47,684 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:55:47,843 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:55:47,843 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1362549873] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:55:47,843 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:55:47,843 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2021-12-15 13:55:47,843 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299400157] [2021-12-15 13:55:47,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:55:47,844 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-15 13:55:47,844 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:55:47,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-15 13:55:47,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2021-12-15 13:55:47,845 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 21 states, 20 states have (on average 2.45) internal successors, (49), 21 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:48,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:55:48,036 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2021-12-15 13:55:48,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-15 13:55:48,036 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.45) internal successors, (49), 21 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-12-15 13:55:48,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:55:48,036 INFO L225 Difference]: With dead ends: 29 [2021-12-15 13:55:48,036 INFO L226 Difference]: Without dead ends: 29 [2021-12-15 13:55:48,037 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=151, Invalid=605, Unknown=0, NotChecked=0, Total=756 [2021-12-15 13:55:48,037 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 59 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 13:55:48,037 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 50 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 13:55:48,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-12-15 13:55:48,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2021-12-15 13:55:48,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:48,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2021-12-15 13:55:48,039 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 19 [2021-12-15 13:55:48,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:55:48,039 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2021-12-15 13:55:48,039 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.45) internal successors, (49), 21 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:48,039 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2021-12-15 13:55:48,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-15 13:55:48,039 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:55:48,039 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:55:48,067 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:55:48,239 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:55:48,240 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:55:48,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:55:48,240 INFO L85 PathProgramCache]: Analyzing trace with hash -224662014, now seen corresponding path program 2 times [2021-12-15 13:55:48,240 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:55:48,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316319063] [2021-12-15 13:55:48,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:55:48,241 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:55:48,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:55:48,425 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:55:48,425 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:55:48,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316319063] [2021-12-15 13:55:48,425 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316319063] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:55:48,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858423496] [2021-12-15 13:55:48,426 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 13:55:48,426 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:55:48,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:55:48,427 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:55:48,444 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:55:48,510 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 13:55:48,510 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 13:55:48,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 60 conjunts are in the unsatisfiable core [2021-12-15 13:55:48,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:55:48,548 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-15 13:55:48,548 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:55:48,556 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:55:48,623 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:55:48,845 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:55:48,977 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:55:48,978 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:55:49,122 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:55:49,122 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:55:49,371 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_19| Int) (v_ArrVal_189 (Array Int Int))) (or (< |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_19| 0) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_189) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_19| 1))) (<= (+ |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_19| 3) (select |c_#length| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|)) (< |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_19|))) is different from false [2021-12-15 13:55:49,389 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_19| Int) (v_ArrVal_189 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_19|) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_189) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_19| 1))) (< |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_19| 0) (<= (+ |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_19| 3) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)))) is different from false [2021-12-15 13:55:49,399 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:55:49,400 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:55:49,405 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:55:49,406 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:55:49,410 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:55:49,743 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-15 13:55:49,744 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1858423496] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:55:49,744 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:55:49,744 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 35 [2021-12-15 13:55:49,744 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959770115] [2021-12-15 13:55:49,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:55:49,746 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-12-15 13:55:49,746 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:55:49,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-12-15 13:55:49,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=948, Unknown=2, NotChecked=126, Total=1190 [2021-12-15 13:55:49,747 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 35 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 35 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:50,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:55:50,278 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2021-12-15 13:55:50,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-15 13:55:50,278 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 35 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-12-15 13:55:50,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:55:50,279 INFO L225 Difference]: With dead ends: 48 [2021-12-15 13:55:50,279 INFO L226 Difference]: Without dead ends: 38 [2021-12-15 13:55:50,280 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=244, Invalid=1832, Unknown=2, NotChecked=178, Total=2256 [2021-12-15 13:55:50,280 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 53 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 115 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 13:55:50,280 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 95 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 135 Invalid, 0 Unknown, 115 Unchecked, 0.1s Time] [2021-12-15 13:55:50,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-12-15 13:55:50,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2021-12-15 13:55:50,281 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:55:50,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2021-12-15 13:55:50,282 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 22 [2021-12-15 13:55:50,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:55:50,282 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2021-12-15 13:55:50,282 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 35 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:50,282 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2021-12-15 13:55:50,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-15 13:55:50,282 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:55:50,282 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:55:50,316 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:55:50,487 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:55:50,487 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:55:50,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:55:50,488 INFO L85 PathProgramCache]: Analyzing trace with hash -121211530, now seen corresponding path program 2 times [2021-12-15 13:55:50,488 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:55:50,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376987472] [2021-12-15 13:55:50,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:55:50,488 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:55:50,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:55:50,602 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:55:50,602 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:55:50,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376987472] [2021-12-15 13:55:50,602 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376987472] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:55:50,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193693232] [2021-12-15 13:55:50,602 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 13:55:50,602 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:55:50,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:55:50,604 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:55:50,624 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:55:50,662 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 13:55:50,662 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 13:55:50,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 48 conjunts are in the unsatisfiable core [2021-12-15 13:55:50,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:55:50,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 13:55:50,679 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:55:50,681 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:55:50,890 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:55:50,890 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:55:51,145 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:55:51,145 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1193693232] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:55:51,145 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:55:51,145 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 26 [2021-12-15 13:55:51,145 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379331343] [2021-12-15 13:55:51,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:55:51,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-12-15 13:55:51,146 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:55:51,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-12-15 13:55:51,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=605, Unknown=0, NotChecked=0, Total=702 [2021-12-15 13:55:51,147 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 27 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 27 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:51,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:55:51,511 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2021-12-15 13:55:51,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-15 13:55:51,512 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 27 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-15 13:55:51,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:55:51,512 INFO L225 Difference]: With dead ends: 34 [2021-12-15 13:55:51,512 INFO L226 Difference]: Without dead ends: 34 [2021-12-15 13:55:51,513 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=235, Invalid=1025, Unknown=0, NotChecked=0, Total=1260 [2021-12-15 13:55:51,513 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 84 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 13:55:51,513 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 100 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 13:55:51,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-12-15 13:55:51,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2021-12-15 13:55:51,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 31 states have (on average 1.096774193548387) internal successors, (34), 32 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:51,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2021-12-15 13:55:51,515 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 27 [2021-12-15 13:55:51,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:55:51,515 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2021-12-15 13:55:51,515 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 27 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:51,515 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2021-12-15 13:55:51,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-15 13:55:51,515 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:55:51,515 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:55:51,535 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:55:51,719 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:55:51,719 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:55:51,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:55:51,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1054801383, now seen corresponding path program 3 times [2021-12-15 13:55:51,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:55:51,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101821351] [2021-12-15 13:55:51,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:55:51,720 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:55:51,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:55:51,942 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:55:51,943 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:55:51,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101821351] [2021-12-15 13:55:51,943 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101821351] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:55:51,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256412421] [2021-12-15 13:55:51,943 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-15 13:55:51,943 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:55:51,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:55:51,944 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:55:51,945 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:55:52,021 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-12-15 13:55:52,022 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 13:55:52,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 73 conjunts are in the unsatisfiable core [2021-12-15 13:55:52,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:55:52,043 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:55:52,185 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:55:52,263 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 13:55:52,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 14 treesize of output 16 [2021-12-15 13:55:52,375 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:55:52,380 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:55:52,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:55:52,404 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_262 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_262) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0)) is different from false [2021-12-15 13:55:52,410 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_262 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_262) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 1)) 0)) is different from false [2021-12-15 13:55:52,417 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_261 (Array Int Int)) (v_ArrVal_262 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_261) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_262) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 1)) 0)) is different from false [2021-12-15 13:55:52,424 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_262 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_262) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 2)) 0)) is different from false [2021-12-15 13:55:52,431 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:55:52,436 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:55:52,436 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:55:52,445 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:55:52,445 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:55:52,448 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:55:52,609 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2021-12-15 13:55:52,609 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256412421] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:55:52,609 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:55:52,609 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 34 [2021-12-15 13:55:52,609 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980463755] [2021-12-15 13:55:52,609 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:55:52,610 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-12-15 13:55:52,610 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:55:52,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-12-15 13:55:52,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=727, Unknown=5, NotChecked=290, Total=1122 [2021-12-15 13:55:52,611 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 34 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 34 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:52,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:55:52,952 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2021-12-15 13:55:52,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-15 13:55:52,952 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 34 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-12-15 13:55:52,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:55:52,952 INFO L225 Difference]: With dead ends: 54 [2021-12-15 13:55:52,952 INFO L226 Difference]: Without dead ends: 40 [2021-12-15 13:55:52,953 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 37 SyntacticMatches, 10 SemanticMatches, 38 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=1063, Unknown=5, NotChecked=350, Total=1560 [2021-12-15 13:55:52,953 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 21 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 142 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 13:55:52,954 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 226 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 413 Invalid, 0 Unknown, 142 Unchecked, 0.2s Time] [2021-12-15 13:55:52,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2021-12-15 13:55:52,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2021-12-15 13:55:52,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 36 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:52,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2021-12-15 13:55:52,955 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 30 [2021-12-15 13:55:52,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:55:52,955 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2021-12-15 13:55:52,955 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 34 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:52,955 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2021-12-15 13:55:52,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-15 13:55:52,956 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:55:52,956 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:55:52,982 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:55:53,156 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:55:53,156 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:55:53,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:55:53,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1308342596, now seen corresponding path program 4 times [2021-12-15 13:55:53,157 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:55:53,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42906965] [2021-12-15 13:55:53,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:55:53,157 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:55:53,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:55:53,312 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:55:53,313 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:55:53,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42906965] [2021-12-15 13:55:53,313 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42906965] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:55:53,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849165867] [2021-12-15 13:55:53,313 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-15 13:55:53,313 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:55:53,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:55:53,314 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:55:53,316 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:55:53,380 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-15 13:55:53,380 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 13:55:53,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 78 conjunts are in the unsatisfiable core [2021-12-15 13:55:53,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:55:53,412 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-15 13:55:53,412 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:55:53,419 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:55:53,609 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:55:53,770 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:55:53,886 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:55:53,995 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:55:53,995 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2021-12-15 13:55:54,118 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:55:54,118 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:55:54,531 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_308 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_41| Int)) (or (<= (+ |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_41| 4) (select |c_#length| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|)) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_308) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_41| 2))) (< |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_41| 0) (< |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_41|))) is different from false [2021-12-15 13:55:54,549 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_308 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_41| Int)) (or (<= (+ |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_41| 4) (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_308) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_41| 2))) (< |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_41| 0) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_41|))) is different from false [2021-12-15 13:55:54,558 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:55:54,558 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:55:54,563 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:55:54,563 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:55:54,567 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:55:55,137 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2021-12-15 13:55:55,137 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849165867] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:55:55,137 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:55:55,137 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 16] total 42 [2021-12-15 13:55:55,137 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441179369] [2021-12-15 13:55:55,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:55:55,138 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2021-12-15 13:55:55,138 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:55:55,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-12-15 13:55:55,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1456, Unknown=3, NotChecked=158, Total=1806 [2021-12-15 13:55:55,139 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand has 43 states, 42 states have (on average 2.238095238095238) internal successors, (94), 43 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:55:55,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:55:55,713 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2021-12-15 13:55:55,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-15 13:55:55,715 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.238095238095238) internal successors, (94), 43 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:55:55,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:55:55,715 INFO L225 Difference]: With dead ends: 43 [2021-12-15 13:55:55,715 INFO L226 Difference]: Without dead ends: 43 [2021-12-15 13:55:55,716 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=380, Invalid=2595, Unknown=3, NotChecked=214, Total=3192 [2021-12-15 13:55:55,716 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 35 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 190 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 13:55:55,716 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 256 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 279 Invalid, 0 Unknown, 190 Unchecked, 0.1s Time] [2021-12-15 13:55:55,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2021-12-15 13:55:55,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2021-12-15 13:55:55,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 39 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:55,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2021-12-15 13:55:55,717 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 34 [2021-12-15 13:55:55,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:55:55,718 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2021-12-15 13:55:55,718 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.238095238095238) internal successors, (94), 43 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:55:55,718 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2021-12-15 13:55:55,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-15 13:55:55,718 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:55:55,718 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:55:55,742 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:55:55,918 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:55:55,919 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:55:55,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:55:55,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1903914801, now seen corresponding path program 3 times [2021-12-15 13:55:55,919 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:55:55,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707958943] [2021-12-15 13:55:55,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:55:55,919 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:55:55,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:55:56,079 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:55:56,080 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:55:56,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707958943] [2021-12-15 13:55:56,080 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707958943] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:55:56,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880974147] [2021-12-15 13:55:56,080 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-15 13:55:56,080 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:55:56,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:55:56,088 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:55:56,089 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:55:56,171 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-12-15 13:55:56,171 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 13:55:56,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 49 conjunts are in the unsatisfiable core [2021-12-15 13:55:56,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:55:56,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 13:55:56,190 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:55:56,192 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:55:56,515 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:55:56,515 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:55:56,864 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:55:56,865 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880974147] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:55:56,865 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:55:56,865 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 32 [2021-12-15 13:55:56,865 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066442880] [2021-12-15 13:55:56,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:55:56,866 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-12-15 13:55:56,866 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:55:56,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-12-15 13:55:56,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=916, Unknown=0, NotChecked=0, Total=1056 [2021-12-15 13:55:56,867 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand has 33 states, 32 states have (on average 3.03125) internal successors, (97), 33 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:57,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:55:57,342 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2021-12-15 13:55:57,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-15 13:55:57,343 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 3.03125) internal successors, (97), 33 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-12-15 13:55:57,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:55:57,343 INFO L225 Difference]: With dead ends: 42 [2021-12-15 13:55:57,343 INFO L226 Difference]: Without dead ends: 42 [2021-12-15 13:55:57,344 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=383, Invalid=1597, Unknown=0, NotChecked=0, Total=1980 [2021-12-15 13:55:57,344 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 130 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 13:55:57,344 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 106 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 13:55:57,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-12-15 13:55:57,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2021-12-15 13:55:57,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 40 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:57,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2021-12-15 13:55:57,345 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 35 [2021-12-15 13:55:57,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:55:57,346 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2021-12-15 13:55:57,346 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 3.03125) internal successors, (97), 33 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:57,346 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2021-12-15 13:55:57,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-15 13:55:57,346 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:55:57,346 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:55:57,366 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:55:57,563 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:55:57,564 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-15 13:55:57,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:55:57,564 INFO L85 PathProgramCache]: Analyzing trace with hash 187721292, now seen corresponding path program 5 times [2021-12-15 13:55:57,565 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:55:57,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312644119] [2021-12-15 13:55:57,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:55:57,565 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:55:57,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:55:57,848 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:55:57,848 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:55:57,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312644119] [2021-12-15 13:55:57,848 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312644119] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:55:57,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533465259] [2021-12-15 13:55:57,848 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-15 13:55:57,848 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:55:57,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:55:57,849 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:55:57,850 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:55:57,934 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2021-12-15 13:55:57,934 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 13:55:57,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 89 conjunts are in the unsatisfiable core [2021-12-15 13:55:57,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:55:57,955 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:55:58,125 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:55:58,255 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:55:58,318 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:55:58,374 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 13:55:58,403 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:55:58,408 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:55:58,409 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:55:58,438 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_398 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_398) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0)) is different from false [2021-12-15 13:55:58,445 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_398 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_398) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 1)) 0)) is different from false [2021-12-15 13:55:58,453 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_397 (Array Int Int)) (v_ArrVal_398 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_397) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_398) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 1)) 0)) is different from false [2021-12-15 13:55:58,461 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_398 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_398) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 2)) 0)) is different from false [2021-12-15 13:55:58,470 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_396 (Array Int Int)) (v_ArrVal_398 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_396) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_398) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 2)) 0)) is different from false [2021-12-15 13:55:58,478 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_398 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_398) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 3)) 0)) is different from false [2021-12-15 13:55:58,483 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_398 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_398) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |c_ULTIMATE.start_main_~nondetString~0#1.offset| 3)) 0)) is different from false [2021-12-15 13:55:58,488 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:55:58,489 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:55:58,494 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:55:58,495 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:55:58,498 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:55:58,676 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 23 not checked. [2021-12-15 13:55:58,677 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533465259] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:55:58,677 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:55:58,677 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18, 18] total 42 [2021-12-15 13:55:58,677 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165350090] [2021-12-15 13:55:58,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:55:58,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2021-12-15 13:55:58,677 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:55:58,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-12-15 13:55:58,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1091, Unknown=7, NotChecked=504, Total=1722 [2021-12-15 13:55:58,678 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand has 42 states, 42 states have (on average 1.9761904761904763) internal successors, (83), 42 states have internal predecessors, (83), 0 states have call successors, (0), 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:55:59,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:55:59,155 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2021-12-15 13:55:59,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-15 13:55:59,158 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.9761904761904763) internal successors, (83), 42 states have internal predecessors, (83), 0 states have call successors, (0), 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:55:59,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:55:59,158 INFO L225 Difference]: With dead ends: 66 [2021-12-15 13:55:59,158 INFO L226 Difference]: Without dead ends: 48 [2021-12-15 13:55:59,159 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 50 SyntacticMatches, 12 SemanticMatches, 48 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=178, Invalid=1649, Unknown=7, NotChecked=616, Total=2450 [2021-12-15 13:55:59,159 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 24 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 222 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 13:55:59,159 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 257 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 343 Invalid, 0 Unknown, 222 Unchecked, 0.1s Time] [2021-12-15 13:55:59,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2021-12-15 13:55:59,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2021-12-15 13:55:59,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 43 states have (on average 1.069767441860465) internal successors, (46), 44 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:59,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2021-12-15 13:55:59,160 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 38 [2021-12-15 13:55:59,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:55:59,160 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2021-12-15 13:55:59,160 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.9761904761904763) internal successors, (83), 42 states have internal predecessors, (83), 0 states have call successors, (0), 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:55:59,160 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2021-12-15 13:55:59,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-15 13:55:59,161 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:55:59,161 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:55:59,179 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:55:59,361 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:55:59,361 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-15 13:55:59,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:55:59,361 INFO L85 PathProgramCache]: Analyzing trace with hash 406746281, now seen corresponding path program 6 times [2021-12-15 13:55:59,362 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:55:59,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467757039] [2021-12-15 13:55:59,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:55:59,362 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:55:59,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:55:59,511 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:55:59,512 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:55:59,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467757039] [2021-12-15 13:55:59,512 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467757039] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:55:59,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684543842] [2021-12-15 13:55:59,512 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-15 13:55:59,512 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:55:59,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:55:59,513 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:55:59,555 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:55:59,629 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2021-12-15 13:55:59,629 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 13:55:59,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 62 conjunts are in the unsatisfiable core [2021-12-15 13:55:59,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:55:59,651 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-15 13:55:59,652 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:55:59,947 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:55:59,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:56:00,316 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:56:00,316 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [684543842] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:56:00,316 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:56:00,316 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 33 [2021-12-15 13:56:00,316 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35265967] [2021-12-15 13:56:00,317 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:56:00,317 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-12-15 13:56:00,317 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:56:00,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-12-15 13:56:00,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=969, Unknown=0, NotChecked=0, Total=1122 [2021-12-15 13:56:00,318 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand has 34 states, 33 states have (on average 3.393939393939394) internal successors, (112), 34 states have internal predecessors, (112), 0 states have call successors, (0), 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:56:00,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:56:00,758 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2021-12-15 13:56:00,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-15 13:56:00,758 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 3.393939393939394) internal successors, (112), 34 states have internal predecessors, (112), 0 states have call successors, (0), 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:56:00,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:56:00,759 INFO L225 Difference]: With dead ends: 51 [2021-12-15 13:56:00,759 INFO L226 Difference]: Without dead ends: 51 [2021-12-15 13:56:00,759 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=404, Invalid=1666, Unknown=0, NotChecked=0, Total=2070 [2021-12-15 13:56:00,759 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 119 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 13:56:00,760 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 167 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 13:56:00,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-12-15 13:56:00,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2021-12-15 13:56:00,760 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:56:00,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2021-12-15 13:56:00,761 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 42 [2021-12-15 13:56:00,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:56:00,761 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2021-12-15 13:56:00,761 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 3.393939393939394) internal successors, (112), 34 states have internal predecessors, (112), 0 states have call successors, (0), 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:56:00,761 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2021-12-15 13:56:00,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-15 13:56:00,761 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:56:00,761 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:56:00,781 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:56:00,967 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:56:00,967 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-15 13:56:00,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:56:00,968 INFO L85 PathProgramCache]: Analyzing trace with hash -275767188, now seen corresponding path program 4 times [2021-12-15 13:56:00,968 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:56:00,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062156564] [2021-12-15 13:56:00,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:56:00,968 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:56:00,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:56:01,142 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 6 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:56:01,142 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:56:01,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062156564] [2021-12-15 13:56:01,142 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062156564] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:56:01,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275231653] [2021-12-15 13:56:01,143 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-15 13:56:01,143 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:56:01,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:56:01,144 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:56:01,144 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:56:01,220 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-15 13:56:01,220 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 13:56:01,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 96 conjunts are in the unsatisfiable core [2021-12-15 13:56:01,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:56:01,238 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:56:01,241 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:56:01,715 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-12-15 13:56:01,715 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:56:02,203 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-12-15 13:56:02,204 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [275231653] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:56:02,204 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:56:02,204 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 34 [2021-12-15 13:56:02,204 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463105989] [2021-12-15 13:56:02,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:56:02,204 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-12-15 13:56:02,204 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:56:02,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-12-15 13:56:02,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1048, Unknown=0, NotChecked=0, Total=1190 [2021-12-15 13:56:02,205 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand has 35 states, 34 states have (on average 2.8529411764705883) internal successors, (97), 35 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:56:03,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:56:03,669 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2021-12-15 13:56:03,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-12-15 13:56:03,669 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.8529411764705883) internal successors, (97), 35 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2021-12-15 13:56:03,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:56:03,670 INFO L225 Difference]: With dead ends: 69 [2021-12-15 13:56:03,670 INFO L226 Difference]: Without dead ends: 69 [2021-12-15 13:56:03,671 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 606 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=715, Invalid=3317, Unknown=0, NotChecked=0, Total=4032 [2021-12-15 13:56:03,671 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 106 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 18 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 13:56:03,671 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 149 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 490 Invalid, 0 Unknown, 18 Unchecked, 0.2s Time] [2021-12-15 13:56:03,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-12-15 13:56:03,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2021-12-15 13:56:03,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 64 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:56:03,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2021-12-15 13:56:03,673 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 43 [2021-12-15 13:56:03,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:56:03,673 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2021-12-15 13:56:03,673 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.8529411764705883) internal successors, (97), 35 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:56:03,673 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2021-12-15 13:56:03,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-15 13:56:03,674 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:56:03,674 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:56:03,694 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:56:03,882 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:56:03,883 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:56:03,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:56:03,883 INFO L85 PathProgramCache]: Analyzing trace with hash 892135217, now seen corresponding path program 7 times [2021-12-15 13:56:03,884 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:56:03,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970619904] [2021-12-15 13:56:03,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:56:03,884 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:56:03,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:56:04,291 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 10 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:56:04,291 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:56:04,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970619904] [2021-12-15 13:56:04,291 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970619904] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:56:04,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078513645] [2021-12-15 13:56:04,291 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-12-15 13:56:04,292 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:56:04,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:56:04,293 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:56:04,315 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:56:04,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:56:04,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 98 conjunts are in the unsatisfiable core [2021-12-15 13:56:04,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:56:04,391 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:56:04,605 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:56:04,726 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:56:04,786 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:56:04,831 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:56:04,851 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 13:56:04,860 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:56:04,866 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 10 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:56:04,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:56:04,893 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_553 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_553) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0)) is different from false [2021-12-15 13:56:04,899 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_553 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_553) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 1)) 0)) is different from false [2021-12-15 13:56:04,905 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_553 (Array Int Int)) (v_ArrVal_552 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_552) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_553) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 1)) 0)) is different from false [2021-12-15 13:56:04,911 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_553 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_553) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 2)) 0)) is different from false [2021-12-15 13:56:04,917 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_551 (Array Int Int)) (v_ArrVal_553 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_551) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_553) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 2)) 0)) is different from false [2021-12-15 13:56:04,923 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_553 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_553) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 3)) 0)) is different from false [2021-12-15 13:56:04,929 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_550 (Array Int Int)) (v_ArrVal_553 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_550) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_553) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 3)) 0)) is different from false [2021-12-15 13:56:04,934 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_553 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_553) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 4)) 0)) is different from false [2021-12-15 13:56:04,938 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_553 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_553) |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:56:04,942 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:56:04,942 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:56:04,946 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:56:04,946 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:56:04,950 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:56:05,143 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 10 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 39 not checked. [2021-12-15 13:56:05,143 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2078513645] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:56:05,143 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:56:05,143 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 21, 21] total 48 [2021-12-15 13:56:05,144 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805312315] [2021-12-15 13:56:05,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:56:05,144 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2021-12-15 13:56:05,144 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:56:05,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-12-15 13:56:05,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1375, Unknown=9, NotChecked=738, Total=2256 [2021-12-15 13:56:05,145 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand has 48 states, 48 states have (on average 2.0625) internal successors, (99), 48 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:56:05,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:56:05,771 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2021-12-15 13:56:05,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-12-15 13:56:05,771 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.0625) internal successors, (99), 48 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-12-15 13:56:05,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:56:05,772 INFO L225 Difference]: With dead ends: 94 [2021-12-15 13:56:05,772 INFO L226 Difference]: Without dead ends: 72 [2021-12-15 13:56:05,773 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 66 SyntacticMatches, 12 SemanticMatches, 57 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 553 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=214, Invalid=2263, Unknown=9, NotChecked=936, Total=3422 [2021-12-15 13:56:05,774 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 46 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 414 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 13:56:05,774 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 328 Invalid, 997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 561 Invalid, 0 Unknown, 414 Unchecked, 0.2s Time] [2021-12-15 13:56:05,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-12-15 13:56:05,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2021-12-15 13:56:05,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 67 states have (on average 1.1044776119402986) internal successors, (74), 68 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:56:05,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2021-12-15 13:56:05,776 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 46 [2021-12-15 13:56:05,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:56:05,776 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2021-12-15 13:56:05,776 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 2.0625) internal successors, (99), 48 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:56:05,776 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2021-12-15 13:56:05,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-12-15 13:56:05,777 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:56:05,777 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:56:05,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2021-12-15 13:56:05,991 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:56:05,991 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-15 13:56:05,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:56:05,992 INFO L85 PathProgramCache]: Analyzing trace with hash -282507122, now seen corresponding path program 8 times [2021-12-15 13:56:05,992 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:56:05,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705727332] [2021-12-15 13:56:05,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:56:05,992 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:56:06,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:56:06,200 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:56:06,200 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:56:06,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705727332] [2021-12-15 13:56:06,200 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705727332] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:56:06,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1168090519] [2021-12-15 13:56:06,200 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 13:56:06,201 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:56:06,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:56:06,201 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:56:06,249 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:56:06,355 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 13:56:06,355 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 13:56:06,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 66 conjunts are in the unsatisfiable core [2021-12-15 13:56:06,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:56:06,377 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-15 13:56:06,377 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:56:06,802 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 28 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:56:06,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:56:07,301 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 45 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:56:07,302 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1168090519] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:56:07,302 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:56:07,302 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 44 [2021-12-15 13:56:07,302 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550677392] [2021-12-15 13:56:07,302 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:56:07,302 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2021-12-15 13:56:07,302 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:56:07,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-12-15 13:56:07,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=1738, Unknown=0, NotChecked=0, Total=1980 [2021-12-15 13:56:07,303 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand has 45 states, 44 states have (on average 3.227272727272727) internal successors, (142), 45 states have internal predecessors, (142), 0 states have call successors, (0), 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:56:07,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:56:07,764 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2021-12-15 13:56:07,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-15 13:56:07,765 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 3.227272727272727) internal successors, (142), 45 states have internal predecessors, (142), 0 states have call successors, (0), 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:56:07,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:56:07,765 INFO L225 Difference]: With dead ends: 69 [2021-12-15 13:56:07,765 INFO L226 Difference]: Without dead ends: 69 [2021-12-15 13:56:07,766 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 772 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=618, Invalid=2804, Unknown=0, NotChecked=0, Total=3422 [2021-12-15 13:56:07,766 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 197 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 13:56:07,766 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [197 Valid, 190 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 13:56:07,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-12-15 13:56:07,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2021-12-15 13:56:07,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 67 states have (on average 1.0895522388059702) internal successors, (73), 68 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:56:07,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2021-12-15 13:56:07,768 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 50 [2021-12-15 13:56:07,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:56:07,768 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2021-12-15 13:56:07,775 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 3.227272727272727) internal successors, (142), 45 states have internal predecessors, (142), 0 states have call successors, (0), 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:56:07,775 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2021-12-15 13:56:07,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-12-15 13:56:07,776 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:56:07,776 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:56:07,793 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:56:07,991 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:56:07,991 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:56:07,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:56:07,992 INFO L85 PathProgramCache]: Analyzing trace with hash 823214230, now seen corresponding path program 9 times [2021-12-15 13:56:07,992 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:56:07,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072251641] [2021-12-15 13:56:07,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:56:07,992 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:56:08,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:56:08,463 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 12 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:56:08,463 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:56:08,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072251641] [2021-12-15 13:56:08,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072251641] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:56:08,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961227281] [2021-12-15 13:56:08,463 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-15 13:56:08,463 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:56:08,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:56:08,464 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:56:08,465 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:56:08,618 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2021-12-15 13:56:08,618 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 13:56:08,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 119 conjunts are in the unsatisfiable core [2021-12-15 13:56:08,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:56:08,631 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:56:08,874 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:56:09,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 17 treesize of output 19 [2021-12-15 13:56:09,081 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:56:09,132 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-15 13:56:09,191 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:56:09,254 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 13:56:09,288 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:56:09,293 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 12 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:56:09,293 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:56:09,321 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_676 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_676) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0)) is different from false [2021-12-15 13:56:09,327 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_676 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_676) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 1)) 0)) is different from false [2021-12-15 13:56:09,345 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_676 (Array Int Int)) (v_ArrVal_675 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_675) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_676) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 1)) 0)) is different from false [2021-12-15 13:56:09,353 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_676 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_676) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 2)) 0)) is different from false [2021-12-15 13:56:09,361 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_674 (Array Int Int)) (v_ArrVal_676 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_674) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_676) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 2)) 0)) is different from false [2021-12-15 13:56:09,368 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_676 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_676) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 3)) 0)) is different from false [2021-12-15 13:56:09,375 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_673 (Array Int Int)) (v_ArrVal_676 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_673) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_676) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 3)) 0)) is different from false [2021-12-15 13:56:09,382 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_676 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_676) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 4)) 0)) is different from false [2021-12-15 13:56:09,388 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_672 (Array Int Int)) (v_ArrVal_676 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_672) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_676) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 4)) 0)) is different from false [2021-12-15 13:56:09,401 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_676 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_676) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 5)) 0)) is different from false [2021-12-15 13:56:09,405 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_676 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_676) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |c_ULTIMATE.start_main_~nondetString~0#1.offset| 5)) 0)) is different from false [2021-12-15 13:56:09,408 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:56:09,409 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:56:09,414 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:56:09,414 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:56:09,417 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:56:09,635 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 12 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 59 not checked. [2021-12-15 13:56:09,635 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [961227281] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:56:09,635 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:56:09,635 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 24, 24] total 58 [2021-12-15 13:56:09,635 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543314900] [2021-12-15 13:56:09,635 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:56:09,635 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2021-12-15 13:56:09,635 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:56:09,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2021-12-15 13:56:09,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=2031, Unknown=11, NotChecked=1100, Total=3306 [2021-12-15 13:56:09,637 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand has 58 states, 58 states have (on average 2.086206896551724) internal successors, (121), 58 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:56:10,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:56:10,537 INFO L93 Difference]: Finished difference Result 102 states and 106 transitions. [2021-12-15 13:56:10,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-12-15 13:56:10,538 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 2.086206896551724) internal successors, (121), 58 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-12-15 13:56:10,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:56:10,539 INFO L225 Difference]: With dead ends: 102 [2021-12-15 13:56:10,539 INFO L226 Difference]: Without dead ends: 76 [2021-12-15 13:56:10,540 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 74 SyntacticMatches, 16 SemanticMatches, 69 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 890 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=248, Invalid=3325, Unknown=11, NotChecked=1386, Total=4970 [2021-12-15 13:56:10,540 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 29 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 911 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 1478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 545 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-15 13:56:10,541 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 484 Invalid, 1478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 911 Invalid, 0 Unknown, 545 Unchecked, 0.3s Time] [2021-12-15 13:56:10,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-12-15 13:56:10,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2021-12-15 13:56:10,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 71 states have (on average 1.0845070422535212) internal successors, (77), 72 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:56:10,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2021-12-15 13:56:10,542 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 54 [2021-12-15 13:56:10,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:56:10,543 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2021-12-15 13:56:10,543 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 2.086206896551724) internal successors, (121), 58 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:56:10,543 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2021-12-15 13:56:10,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-15 13:56:10,543 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:56:10,543 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:56:10,566 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:56:10,755 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:56:10,755 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:56:10,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:56:10,756 INFO L85 PathProgramCache]: Analyzing trace with hash -101124877, now seen corresponding path program 10 times [2021-12-15 13:56:10,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:56:10,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256666008] [2021-12-15 13:56:10,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:56:10,756 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:56:10,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:56:10,992 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 28 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:56:10,993 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:56:10,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256666008] [2021-12-15 13:56:10,993 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256666008] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:56:10,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048045027] [2021-12-15 13:56:10,993 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-15 13:56:10,993 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:56:10,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:56:10,994 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:56:10,995 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:56:11,088 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-15 13:56:11,089 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 13:56:11,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 120 conjunts are in the unsatisfiable core [2021-12-15 13:56:11,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:56:11,115 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-15 13:56:11,115 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:56:11,120 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:56:11,422 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:56:11,560 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:56:11,667 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:56:11,769 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:56:11,883 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:56:12,005 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:56:12,111 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:56:12,112 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2021-12-15 13:56:12,240 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 50 proven. 88 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:56:12,240 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:56:13,062 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_748 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_131| Int)) (or (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_748) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_131| 5))) (< |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_131|) (<= (+ |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_131| 7) (select |c_#length| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|)) (< |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_131| 0))) is different from false [2021-12-15 13:56:13,077 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_748 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_131| Int)) (or (<= (+ |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_131| 7) (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_748) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_131| 5))) (< |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_131| 0) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_131|))) is different from false [2021-12-15 13:56:13,090 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:56:13,090 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:56:13,096 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:56:13,096 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:56:13,099 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:56:14,155 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 66 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2021-12-15 13:56:14,155 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2048045027] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:56:14,155 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:56:14,155 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 25, 25] total 66 [2021-12-15 13:56:14,156 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136648577] [2021-12-15 13:56:14,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:56:14,156 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2021-12-15 13:56:14,156 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:56:14,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2021-12-15 13:56:14,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=3727, Unknown=6, NotChecked=254, Total=4422 [2021-12-15 13:56:14,157 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand has 67 states, 66 states have (on average 2.515151515151515) internal successors, (166), 67 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:56:15,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:56:15,891 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2021-12-15 13:56:15,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-12-15 13:56:15,891 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 66 states have (on average 2.515151515151515) internal successors, (166), 67 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-12-15 13:56:15,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:56:15,892 INFO L225 Difference]: With dead ends: 73 [2021-12-15 13:56:15,892 INFO L226 Difference]: Without dead ends: 73 [2021-12-15 13:56:15,893 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 68 SyntacticMatches, 7 SemanticMatches, 89 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1354 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1107, Invalid=6701, Unknown=32, NotChecked=350, Total=8190 [2021-12-15 13:56:15,894 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 80 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 1237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 388 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-15 13:56:15,894 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 343 Invalid, 1237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 763 Invalid, 0 Unknown, 388 Unchecked, 0.3s Time] [2021-12-15 13:56:15,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-12-15 13:56:15,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2021-12-15 13:56:15,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 71 states have (on average 1.056338028169014) internal successors, (75), 72 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:56:15,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2021-12-15 13:56:15,895 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 58 [2021-12-15 13:56:15,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:56:15,895 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2021-12-15 13:56:15,896 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 66 states have (on average 2.515151515151515) internal successors, (166), 67 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:56:15,896 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2021-12-15 13:56:15,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-15 13:56:15,896 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:56:15,896 INFO L514 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:56:15,913 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:56:16,096 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:56:16,097 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:56:16,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:56:16,097 INFO L85 PathProgramCache]: Analyzing trace with hash 336686083, now seen corresponding path program 11 times [2021-12-15 13:56:16,097 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:56:16,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108298205] [2021-12-15 13:56:16,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:56:16,097 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:56:16,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:56:16,336 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 108 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:56:16,336 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:56:16,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108298205] [2021-12-15 13:56:16,336 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108298205] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:56:16,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018475113] [2021-12-15 13:56:16,336 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-15 13:56:16,336 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:56:16,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:56:16,337 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:56:16,338 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:56:16,622 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2021-12-15 13:56:16,622 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 13:56:16,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 69 conjunts are in the unsatisfiable core [2021-12-15 13:56:16,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:56:16,645 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-15 13:56:16,645 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:56:17,160 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 121 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:56:17,160 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:56:17,533 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 121 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:56:17,533 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018475113] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:56:17,533 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:56:17,533 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 19] total 47 [2021-12-15 13:56:17,533 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965261498] [2021-12-15 13:56:17,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:56:17,533 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2021-12-15 13:56:17,534 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:56:17,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-12-15 13:56:17,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=369, Invalid=1793, Unknown=0, NotChecked=0, Total=2162 [2021-12-15 13:56:17,535 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand has 47 states, 47 states have (on average 3.276595744680851) internal successors, (154), 47 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:56:17,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:56:17,895 INFO L93 Difference]: Finished difference Result 112 states and 114 transitions. [2021-12-15 13:56:17,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-15 13:56:17,895 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 3.276595744680851) internal successors, (154), 47 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2021-12-15 13:56:17,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:56:17,896 INFO L225 Difference]: With dead ends: 112 [2021-12-15 13:56:17,896 INFO L226 Difference]: Without dead ends: 80 [2021-12-15 13:56:17,896 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 751 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=669, Invalid=2637, Unknown=0, NotChecked=0, Total=3306 [2021-12-15 13:56:17,897 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 102 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 13:56:17,897 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 166 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 13:56:17,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-12-15 13:56:17,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2021-12-15 13:56:17,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 75 states have (on average 1.0533333333333332) internal successors, (79), 76 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:56:17,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 79 transitions. [2021-12-15 13:56:17,898 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 79 transitions. Word has length 66 [2021-12-15 13:56:17,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:56:17,898 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 79 transitions. [2021-12-15 13:56:17,898 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 3.276595744680851) internal successors, (154), 47 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:56:17,898 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 79 transitions. [2021-12-15 13:56:17,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-15 13:56:17,899 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:56:17,899 INFO L514 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:56:17,916 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:56:18,099 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:56:18,100 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:56:18,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:56:18,100 INFO L85 PathProgramCache]: Analyzing trace with hash -2136703776, now seen corresponding path program 12 times [2021-12-15 13:56:18,100 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:56:18,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746004037] [2021-12-15 13:56:18,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:56:18,100 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:56:18,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:56:18,802 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 16 proven. 203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:56:18,802 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:56:18,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746004037] [2021-12-15 13:56:18,802 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746004037] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:56:18,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378858157] [2021-12-15 13:56:18,802 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-15 13:56:18,802 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:56:18,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:56:18,803 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:56:18,804 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:56:19,169 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2021-12-15 13:56:19,169 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 13:56:19,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 153 conjunts are in the unsatisfiable core [2021-12-15 13:56:19,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:56:19,183 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:56:19,546 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:56:19,704 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:56:19,771 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:56:19,822 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:56:19,876 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:56:19,927 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:56:19,978 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:56:20,048 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 13:56:20,129 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:56:20,136 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 16 proven. 203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:56:20,136 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:56:20,172 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_905 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_905) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0)) is different from false [2021-12-15 13:56:20,178 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_905 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_905) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 1)) 0)) is different from false [2021-12-15 13:56:20,184 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_904 (Array Int Int)) (v_ArrVal_905 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_904) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_905) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 1)) 0)) is different from false [2021-12-15 13:56:20,190 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_905 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_905) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 2)) 0)) is different from false [2021-12-15 13:56:20,196 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_903 (Array Int Int)) (v_ArrVal_905 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_903) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_905) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 2)) 0)) is different from false [2021-12-15 13:56:20,203 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_905 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_905) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 3)) 0)) is different from false [2021-12-15 13:56:20,209 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_902 (Array Int Int)) (v_ArrVal_905 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_902) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_905) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 3)) 0)) is different from false [2021-12-15 13:56:20,215 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_905 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_905) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 4)) 0)) is different from false [2021-12-15 13:56:20,221 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_901 (Array Int Int)) (v_ArrVal_905 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_901) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_905) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 4)) 0)) is different from false [2021-12-15 13:56:20,227 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_905 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_905) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 5)) 0)) is different from false [2021-12-15 13:56:20,234 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_900 (Array Int Int)) (v_ArrVal_905 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_900) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_905) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 5)) 0)) is different from false [2021-12-15 13:56:20,241 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_905 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_905) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 6)) 0)) is different from false [2021-12-15 13:56:20,247 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_899 (Array Int Int)) (v_ArrVal_905 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_899) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_905) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 6)) 0)) is different from false [2021-12-15 13:56:20,254 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_905 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_905) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 7)) 0)) is different from false [2021-12-15 13:56:20,259 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_905 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_905) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |c_ULTIMATE.start_main_~nondetString~0#1.offset| 7)) 0)) is different from false [2021-12-15 13:56:20,264 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:56:20,264 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:56:20,276 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:56:20,277 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:56:20,279 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:56:20,537 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 16 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 111 not checked. [2021-12-15 13:56:20,537 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1378858157] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:56:20,537 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:56:20,537 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 30, 30] total 75 [2021-12-15 13:56:20,537 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821011010] [2021-12-15 13:56:20,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:56:20,538 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2021-12-15 13:56:20,538 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:56:20,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2021-12-15 13:56:20,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=3374, Unknown=15, NotChecked=1950, Total=5550 [2021-12-15 13:56:20,539 INFO L87 Difference]: Start difference. First operand 77 states and 79 transitions. Second operand has 75 states, 75 states have (on average 2.1333333333333333) internal successors, (160), 75 states have internal predecessors, (160), 0 states have call successors, (0), 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:56:22,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:56:22,039 INFO L93 Difference]: Finished difference Result 118 states and 120 transitions. [2021-12-15 13:56:22,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-12-15 13:56:22,040 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 75 states have (on average 2.1333333333333333) internal successors, (160), 75 states have internal predecessors, (160), 0 states have call successors, (0), 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 70 [2021-12-15 13:56:22,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:56:22,040 INFO L225 Difference]: With dead ends: 118 [2021-12-15 13:56:22,040 INFO L226 Difference]: Without dead ends: 84 [2021-12-15 13:56:22,040 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 97 SyntacticMatches, 24 SemanticMatches, 89 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 1613 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=313, Invalid=5432, Unknown=15, NotChecked=2430, Total=8190 [2021-12-15 13:56:22,041 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 31 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 1202 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 2058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 824 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-15 13:56:22,041 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 726 Invalid, 2058 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1202 Invalid, 0 Unknown, 824 Unchecked, 0.4s Time] [2021-12-15 13:56:22,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-12-15 13:56:22,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2021-12-15 13:56:22,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 79 states have (on average 1.0506329113924051) internal successors, (83), 80 states have internal predecessors, (83), 0 states have call successors, (0), 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:56:22,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 83 transitions. [2021-12-15 13:56:22,043 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 83 transitions. Word has length 70 [2021-12-15 13:56:22,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:56:22,043 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 83 transitions. [2021-12-15 13:56:22,043 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 75 states have (on average 2.1333333333333333) internal successors, (160), 75 states have internal predecessors, (160), 0 states have call successors, (0), 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:56:22,043 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2021-12-15 13:56:22,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-12-15 13:56:22,044 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:56:22,044 INFO L514 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:56:22,065 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:56:22,259 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:56:22,259 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:56:22,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:56:22,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1499060029, now seen corresponding path program 13 times [2021-12-15 13:56:22,260 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:56:22,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445079764] [2021-12-15 13:56:22,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:56:22,260 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:56:22,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:56:22,524 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 66 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:56:22,524 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:56:22,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445079764] [2021-12-15 13:56:22,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445079764] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:56:22,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396091952] [2021-12-15 13:56:22,525 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-12-15 13:56:22,525 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:56:22,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:56:22,532 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:56:22,533 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:56:22,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:56:22,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 90 conjunts are in the unsatisfiable core [2021-12-15 13:56:22,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:56:23,025 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 91 proven. 157 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:56:23,025 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:56:23,418 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:56:23,484 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 91 proven. 157 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:56:23,484 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1396091952] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:56:23,485 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:56:23,485 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22, 22] total 45 [2021-12-15 13:56:23,485 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738740817] [2021-12-15 13:56:23,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:56:23,485 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2021-12-15 13:56:23,485 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:56:23,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-12-15 13:56:23,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=1866, Unknown=0, NotChecked=0, Total=2070 [2021-12-15 13:56:23,486 INFO L87 Difference]: Start difference. First operand 81 states and 83 transitions. Second operand has 46 states, 45 states have (on average 3.2888888888888888) internal successors, (148), 46 states have internal predecessors, (148), 0 states have call successors, (0), 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:56:24,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:56:24,511 INFO L93 Difference]: Finished difference Result 82 states and 83 transitions. [2021-12-15 13:56:24,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-12-15 13:56:24,512 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 3.2888888888888888) internal successors, (148), 46 states have internal predecessors, (148), 0 states have call successors, (0), 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 74 [2021-12-15 13:56:24,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:56:24,512 INFO L225 Difference]: With dead ends: 82 [2021-12-15 13:56:24,512 INFO L226 Difference]: Without dead ends: 82 [2021-12-15 13:56:24,513 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 121 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 694 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1013, Invalid=4243, Unknown=0, NotChecked=0, Total=5256 [2021-12-15 13:56:24,513 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 352 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 1052 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 1150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-15 13:56:24,514 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [352 Valid, 357 Invalid, 1150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 1052 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-15 13:56:24,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-12-15 13:56:24,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2021-12-15 13:56:24,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 79 states have (on average 1.0379746835443038) internal successors, (82), 80 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:56:24,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2021-12-15 13:56:24,515 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 74 [2021-12-15 13:56:24,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:56:24,515 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2021-12-15 13:56:24,516 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 3.2888888888888888) internal successors, (148), 46 states have internal predecessors, (148), 0 states have call successors, (0), 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:56:24,516 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2021-12-15 13:56:24,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-12-15 13:56:24,516 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:56:24,516 INFO L514 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:56:24,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-12-15 13:56:24,719 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:56:24,719 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:56:24,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:56:24,720 INFO L85 PathProgramCache]: Analyzing trace with hash -571678779, now seen corresponding path program 14 times [2021-12-15 13:56:24,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:56:24,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942913767] [2021-12-15 13:56:24,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:56:24,720 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:56:24,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:56:25,609 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 18 proven. 264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:56:25,609 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:56:25,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942913767] [2021-12-15 13:56:25,609 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942913767] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:56:25,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525150308] [2021-12-15 13:56:25,610 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 13:56:25,610 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:56:25,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:56:25,611 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:56:25,612 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:56:25,743 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 13:56:25,743 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 13:56:25,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 158 conjunts are in the unsatisfiable core [2021-12-15 13:56:25,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:56:25,765 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-15 13:56:25,766 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:56:25,772 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:56:26,295 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:56:26,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 17 treesize of output 19 [2021-12-15 13:56:26,821 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:56:27,035 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:56:27,246 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:56:27,489 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:56:27,723 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:56:27,957 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:56:28,174 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:56:28,388 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:56:28,388 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:56:28,611 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 91 proven. 191 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:56:28,611 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:56:29,015 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1078 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1078) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 1)))) (and (<= (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 3) (select |c_#length| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|)) (<= 0 (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 2)))) is different from false [2021-12-15 13:56:30,247 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_205| Int) (v_ArrVal_1078 (Array Int Int))) (or (<= (+ |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_205| 10) (select |c_#length| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|)) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1078) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_205| 8))) (< |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_205| 0) (< |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_205|))) is different from false [2021-12-15 13:56:30,259 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_205| Int) (v_ArrVal_1078 (Array Int Int))) (or (= 0 (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|) (+ |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_205| 8))) (<= (+ |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_205| 10) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)) (< |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_205| 0) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_205|))) is different from false [2021-12-15 13:56:30,268 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:56:30,268 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:56:30,273 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:56:30,274 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:56:30,277 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:56:31,893 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 120 proven. 137 refuted. 0 times theorem prover too weak. 0 trivial. 25 not checked. [2021-12-15 13:56:31,893 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1525150308] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:56:31,893 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:56:31,893 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 33, 33] total 105 [2021-12-15 13:56:31,893 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586211358] [2021-12-15 13:56:31,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:56:31,893 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 105 states [2021-12-15 13:56:31,893 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:56:31,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2021-12-15 13:56:31,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=584, Invalid=9720, Unknown=10, NotChecked=606, Total=10920 [2021-12-15 13:56:31,895 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand has 105 states, 105 states have (on average 2.1523809523809523) internal successors, (226), 105 states have internal predecessors, (226), 0 states have call successors, (0), 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:56:36,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:56:36,408 INFO L93 Difference]: Finished difference Result 132 states and 133 transitions. [2021-12-15 13:56:36,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2021-12-15 13:56:36,409 INFO L78 Accepts]: Start accepts. Automaton has has 105 states, 105 states have (on average 2.1523809523809523) internal successors, (226), 105 states have internal predecessors, (226), 0 states have call successors, (0), 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 78 [2021-12-15 13:56:36,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:56:36,409 INFO L225 Difference]: With dead ends: 132 [2021-12-15 13:56:36,409 INFO L226 Difference]: Without dead ends: 94 [2021-12-15 13:56:36,411 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 105 SyntacticMatches, 5 SemanticMatches, 156 ConstructedPredicates, 3 IntricatePredicates, 5 DeprecatedPredicates, 4324 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=1498, Invalid=22374, Unknown=10, NotChecked=924, Total=24806 [2021-12-15 13:56:36,411 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 78 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 1661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 687 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-15 13:56:36,411 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 880 Invalid, 1661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 961 Invalid, 0 Unknown, 687 Unchecked, 0.3s Time] [2021-12-15 13:56:36,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-12-15 13:56:36,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 88. [2021-12-15 13:56:36,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 86 states have (on average 1.0348837209302326) internal successors, (89), 87 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:56:36,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2021-12-15 13:56:36,414 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 78 [2021-12-15 13:56:36,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:56:36,414 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2021-12-15 13:56:36,414 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 105 states, 105 states have (on average 2.1523809523809523) internal successors, (226), 105 states have internal predecessors, (226), 0 states have call successors, (0), 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:56:36,414 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2021-12-15 13:56:36,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-12-15 13:56:36,415 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:56:36,415 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:56:36,432 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:56:36,623 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:56:36,623 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-15 13:56:36,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:56:36,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1827858669, now seen corresponding path program 5 times [2021-12-15 13:56:36,624 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:56:36,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845701211] [2021-12-15 13:56:36,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:56:36,624 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:56:36,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:56:36,968 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 91 proven. 233 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:56:36,968 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:56:36,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845701211] [2021-12-15 13:56:36,969 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845701211] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:56:36,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455736904] [2021-12-15 13:56:36,969 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-15 13:56:36,969 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:56:36,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:56:36,970 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:56:36,970 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:56:38,234 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2021-12-15 13:56:38,234 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 13:56:38,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 126 conjunts are in the unsatisfiable core [2021-12-15 13:56:38,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:56:38,257 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:56:38,263 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:56:39,547 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 120 proven. 204 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:56:39,548 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:56:40,499 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 153 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:56:40,500 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455736904] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:56:40,500 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:56:40,500 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22, 22] total 66 [2021-12-15 13:56:40,500 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108149620] [2021-12-15 13:56:40,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:56:40,500 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2021-12-15 13:56:40,500 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:56:40,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2021-12-15 13:56:40,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=530, Invalid=3892, Unknown=0, NotChecked=0, Total=4422 [2021-12-15 13:56:40,501 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand has 67 states, 66 states have (on average 3.6515151515151514) internal successors, (241), 67 states have internal predecessors, (241), 0 states have call successors, (0), 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:56:41,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:56:41,090 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2021-12-15 13:56:41,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-12-15 13:56:41,090 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 66 states have (on average 3.6515151515151514) internal successors, (241), 67 states have internal predecessors, (241), 0 states have call successors, (0), 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 83 [2021-12-15 13:56:41,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:56:41,091 INFO L225 Difference]: With dead ends: 89 [2021-12-15 13:56:41,091 INFO L226 Difference]: Without dead ends: 89 [2021-12-15 13:56:41,091 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1701 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=748, Invalid=5572, Unknown=0, NotChecked=0, Total=6320 [2021-12-15 13:56:41,092 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 12 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 62 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 13:56:41,092 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 388 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 637 Invalid, 0 Unknown, 62 Unchecked, 0.2s Time] [2021-12-15 13:56:41,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-12-15 13:56:41,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2021-12-15 13:56:41,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 87 states have (on average 1.0344827586206897) internal successors, (90), 88 states have internal predecessors, (90), 0 states have call successors, (0), 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:56:41,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2021-12-15 13:56:41,093 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 83 [2021-12-15 13:56:41,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:56:41,093 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2021-12-15 13:56:41,093 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 66 states have (on average 3.6515151515151514) internal successors, (241), 67 states have internal predecessors, (241), 0 states have call successors, (0), 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:56:41,093 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2021-12-15 13:56:41,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-12-15 13:56:41,094 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:56:41,094 INFO L514 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:56:41,116 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:56:41,316 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:56:41,316 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:56:41,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:56:41,317 INFO L85 PathProgramCache]: Analyzing trace with hash -2142233814, now seen corresponding path program 15 times [2021-12-15 13:56:41,317 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:56:41,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221116689] [2021-12-15 13:56:41,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:56:41,317 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:56:41,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:56:42,326 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 20 proven. 333 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:56:42,327 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:56:42,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221116689] [2021-12-15 13:56:42,327 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221116689] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:56:42,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244924755] [2021-12-15 13:56:42,327 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-15 13:56:42,327 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:56:42,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:56:42,328 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:56:42,329 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:56:43,114 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2021-12-15 13:56:43,114 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 13:56:43,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 229 conjunts are in the unsatisfiable core [2021-12-15 13:56:43,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:56:43,138 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:56:43,785 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:56:43,983 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:56:44,145 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:56:44,307 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:56:44,449 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:56:44,603 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:56:44,754 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:56:44,909 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:56:45,081 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:56:45,232 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:56:45,355 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 13:56:45,356 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:56:45,357 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 10 [2021-12-15 13:56:45,362 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 20 proven. 333 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:56:45,362 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:56:45,409 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1270 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1270) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0)) is different from false [2021-12-15 13:56:45,416 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1270 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1270) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 1)) 0)) is different from false [2021-12-15 13:56:45,423 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1269 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1269) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1270) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 1)) 0)) is different from false [2021-12-15 13:56:45,429 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1270 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1270) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 2)) 0)) is different from false [2021-12-15 13:56:45,435 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1268 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1268) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1270) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 2)) 0)) is different from false [2021-12-15 13:56:45,442 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1270 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1270) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 3)) 0)) is different from false [2021-12-15 13:56:45,447 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1267 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1267) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1270) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 3)) 0)) is different from false [2021-12-15 13:56:45,453 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1270 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1270) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 4)) 0)) is different from false [2021-12-15 13:56:45,459 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1266 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1266) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1270) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 4)) 0)) is different from false [2021-12-15 13:56:45,464 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1270 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1270) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 5)) 0)) is different from false [2021-12-15 13:56:45,469 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1265 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1265) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1270) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 5)) 0)) is different from false [2021-12-15 13:56:45,475 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1270 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1270) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 6)) 0)) is different from false [2021-12-15 13:56:45,481 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1264 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1264) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1270) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 6)) 0)) is different from false [2021-12-15 13:56:45,499 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1270 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1270) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 7)) 0)) is different from false [2021-12-15 13:56:45,505 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1263 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1263) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1270) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 7)) 0)) is different from false [2021-12-15 13:56:45,511 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1270 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1270) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 8)) 0)) is different from false [2021-12-15 13:56:45,516 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1262 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1262) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1270) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 8)) 0)) is different from false [2021-12-15 13:56:45,531 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1270 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1270) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 9)) 0)) is different from false [2021-12-15 13:56:45,536 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1270 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1270) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |c_ULTIMATE.start_main_~nondetString~0#1.offset| 9)) 0)) is different from false [2021-12-15 13:56:45,541 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:56:45,542 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:56:45,546 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:56:45,547 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:56:45,549 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