./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/openbsd_cstpncpy-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/openbsd_cstpncpy-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 36c3a12d89778d96e6058a4f11ff4e1483403bd2fab9b14de640491057c7f753 --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 13:57:07,789 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 13:57:07,791 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 13:57:07,832 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 13:57:07,833 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 13:57:07,836 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 13:57:07,837 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 13:57:07,839 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 13:57:07,841 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 13:57:07,845 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 13:57:07,846 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 13:57:07,847 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 13:57:07,847 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 13:57:07,849 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 13:57:07,850 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 13:57:07,851 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 13:57:07,854 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 13:57:07,855 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 13:57:07,856 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 13:57:07,857 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 13:57:07,861 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 13:57:07,876 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 13:57:07,877 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 13:57:07,878 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 13:57:07,881 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 13:57:07,881 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 13:57:07,881 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 13:57:07,882 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 13:57:07,883 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 13:57:07,883 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 13:57:07,883 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 13:57:07,884 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 13:57:07,885 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 13:57:07,886 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 13:57:07,887 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 13:57:07,887 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 13:57:07,887 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 13:57:07,887 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 13:57:07,888 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 13:57:07,888 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 13:57:07,889 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 13:57:07,889 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-15 13:57:07,915 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 13:57:07,915 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 13:57:07,915 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 13:57:07,916 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 13:57:07,916 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-15 13:57:07,917 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-15 13:57:07,917 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 13:57:07,917 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 13:57:07,917 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 13:57:07,917 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 13:57:07,918 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 13:57:07,918 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-15 13:57:07,918 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 13:57:07,919 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 13:57:07,919 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 13:57:07,919 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-15 13:57:07,919 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-15 13:57:07,919 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-15 13:57:07,919 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-15 13:57:07,920 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-15 13:57:07,920 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 13:57:07,920 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 13:57:07,920 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 13:57:07,920 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 13:57:07,920 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-15 13:57:07,920 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 13:57:07,921 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 13:57:07,921 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-15 13:57:07,921 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 13:57:07,921 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-15 13:57:07,921 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 13:57:07,922 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 -> 36c3a12d89778d96e6058a4f11ff4e1483403bd2fab9b14de640491057c7f753 [2021-12-15 13:57:08,106 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 13:57:08,142 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 13:57:08,144 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 13:57:08,145 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 13:57:08,146 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 13:57:08,146 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/openbsd_cstpncpy-alloca-1.i [2021-12-15 13:57:08,203 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a4cf9575/b628f671ca24419cad8864b9ff369759/FLAGc5ee97267 [2021-12-15 13:57:08,577 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 13:57:08,578 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/openbsd_cstpncpy-alloca-1.i [2021-12-15 13:57:08,600 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a4cf9575/b628f671ca24419cad8864b9ff369759/FLAGc5ee97267 [2021-12-15 13:57:08,963 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a4cf9575/b628f671ca24419cad8864b9ff369759 [2021-12-15 13:57:08,965 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 13:57:08,966 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 13:57:08,968 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 13:57:08,968 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 13:57:08,970 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 13:57:08,970 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 01:57:08" (1/1) ... [2021-12-15 13:57:08,972 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e5a223b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:57:08, skipping insertion in model container [2021-12-15 13:57:08,972 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 01:57:08" (1/1) ... [2021-12-15 13:57:08,976 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 13:57:09,004 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 13:57:09,225 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 13:57:09,230 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 13:57:09,266 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 13:57:09,287 INFO L208 MainTranslator]: Completed translation [2021-12-15 13:57:09,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:57:09 WrapperNode [2021-12-15 13:57:09,288 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 13:57:09,288 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 13:57:09,289 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 13:57:09,290 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 13:57:09,294 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:57:09" (1/1) ... [2021-12-15 13:57:09,302 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:57:09" (1/1) ... [2021-12-15 13:57:09,316 INFO L137 Inliner]: procedures = 119, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 98 [2021-12-15 13:57:09,317 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 13:57:09,330 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 13:57:09,330 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 13:57:09,331 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 13:57:09,335 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:57:09" (1/1) ... [2021-12-15 13:57:09,335 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:57:09" (1/1) ... [2021-12-15 13:57:09,338 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:57:09" (1/1) ... [2021-12-15 13:57:09,338 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:57:09" (1/1) ... [2021-12-15 13:57:09,343 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:57:09" (1/1) ... [2021-12-15 13:57:09,353 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:57:09" (1/1) ... [2021-12-15 13:57:09,354 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:57:09" (1/1) ... [2021-12-15 13:57:09,356 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 13:57:09,356 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 13:57:09,356 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 13:57:09,357 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 13:57:09,357 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:57:09" (1/1) ... [2021-12-15 13:57:09,373 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 13:57:09,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:57:09,390 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-15 13:57:09,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-15 13:57:09,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-15 13:57:09,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-15 13:57:09,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-15 13:57:09,416 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-15 13:57:09,416 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-15 13:57:09,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-15 13:57:09,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 13:57:09,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 13:57:09,477 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 13:57:09,478 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 13:57:09,644 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 13:57:09,648 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 13:57:09,648 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-12-15 13:57:09,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 01:57:09 BoogieIcfgContainer [2021-12-15 13:57:09,650 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 13:57:09,651 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-15 13:57:09,651 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-15 13:57:09,653 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-15 13:57:09,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 01:57:08" (1/3) ... [2021-12-15 13:57:09,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@660456aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 01:57:09, skipping insertion in model container [2021-12-15 13:57:09,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:57:09" (2/3) ... [2021-12-15 13:57:09,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@660456aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 01:57:09, skipping insertion in model container [2021-12-15 13:57:09,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 01:57:09" (3/3) ... [2021-12-15 13:57:09,662 INFO L111 eAbstractionObserver]: Analyzing ICFG openbsd_cstpncpy-alloca-1.i [2021-12-15 13:57:09,666 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-15 13:57:09,679 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 23 error locations. [2021-12-15 13:57:09,730 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-15 13:57:09,735 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-15 13:57:09,735 INFO L340 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2021-12-15 13:57:09,751 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 35 states have (on average 1.9428571428571428) internal successors, (68), 58 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:09,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-15 13:57:09,758 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:57:09,759 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:57:09,759 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-15 13:57:09,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:57:09,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1805029043, now seen corresponding path program 1 times [2021-12-15 13:57:09,768 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:57:09,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002961356] [2021-12-15 13:57:09,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:57:09,771 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:57:09,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:09,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:09,898 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:57:09,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002961356] [2021-12-15 13:57:09,898 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002961356] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:57:09,899 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:57:09,899 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 13:57:09,900 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471391404] [2021-12-15 13:57:09,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:57:09,905 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 13:57:09,905 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:57:09,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 13:57:09,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 13:57:09,929 INFO L87 Difference]: Start difference. First operand has 59 states, 35 states have (on average 1.9428571428571428) internal successors, (68), 58 states have internal predecessors, (68), 0 states have call successors, (0), 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 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:09,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:57:09,991 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2021-12-15 13:57:09,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 13:57:09,993 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-12-15 13:57:09,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:57:09,999 INFO L225 Difference]: With dead ends: 57 [2021-12-15 13:57:09,999 INFO L226 Difference]: Without dead ends: 55 [2021-12-15 13:57:10,001 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 13:57:10,005 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 49 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 13:57:10,006 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 44 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 13:57:10,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-12-15 13:57:10,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2021-12-15 13:57:10,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 54 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:10,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2021-12-15 13:57:10,034 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 7 [2021-12-15 13:57:10,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:57:10,035 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2021-12-15 13:57:10,035 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:10,035 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2021-12-15 13:57:10,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-15 13:57:10,036 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:57:10,036 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:57:10,036 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-15 13:57:10,037 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-15 13:57:10,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:57:10,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1805029044, now seen corresponding path program 1 times [2021-12-15 13:57:10,039 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:57:10,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145309352] [2021-12-15 13:57:10,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:57:10,040 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:57:10,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:10,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:10,135 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:57:10,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145309352] [2021-12-15 13:57:10,136 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145309352] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:57:10,136 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:57:10,136 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 13:57:10,136 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160854213] [2021-12-15 13:57:10,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:57:10,140 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 13:57:10,140 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:57:10,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 13:57:10,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-15 13:57:10,141 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:10,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:57:10,197 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2021-12-15 13:57:10,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 13:57:10,197 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-12-15 13:57:10,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:57:10,198 INFO L225 Difference]: With dead ends: 54 [2021-12-15 13:57:10,199 INFO L226 Difference]: Without dead ends: 54 [2021-12-15 13:57:10,199 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-15 13:57:10,203 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 60 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 13:57:10,204 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 83 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 13:57:10,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2021-12-15 13:57:10,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2021-12-15 13:57:10,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 34 states have (on average 1.7647058823529411) internal successors, (60), 53 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:10,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2021-12-15 13:57:10,213 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 7 [2021-12-15 13:57:10,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:57:10,214 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2021-12-15 13:57:10,214 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:10,214 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2021-12-15 13:57:10,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-15 13:57:10,215 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:57:10,215 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:57:10,216 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-15 13:57:10,218 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-15 13:57:10,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:57:10,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1805029097, now seen corresponding path program 1 times [2021-12-15 13:57:10,219 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:57:10,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848579987] [2021-12-15 13:57:10,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:57:10,221 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:57:10,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:10,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:10,287 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:57:10,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848579987] [2021-12-15 13:57:10,287 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848579987] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:57:10,288 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:57:10,288 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 13:57:10,288 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725630251] [2021-12-15 13:57:10,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:57:10,289 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 13:57:10,289 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:57:10,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 13:57:10,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-15 13:57:10,290 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:10,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:57:10,319 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2021-12-15 13:57:10,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 13:57:10,320 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-12-15 13:57:10,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:57:10,323 INFO L225 Difference]: With dead ends: 101 [2021-12-15 13:57:10,323 INFO L226 Difference]: Without dead ends: 101 [2021-12-15 13:57:10,324 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-15 13:57:10,328 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 98 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 13:57:10,329 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 112 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 13:57:10,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-12-15 13:57:10,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 57. [2021-12-15 13:57:10,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 37 states have (on average 1.7297297297297298) internal successors, (64), 56 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:57:10,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2021-12-15 13:57:10,346 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 7 [2021-12-15 13:57:10,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:57:10,346 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2021-12-15 13:57:10,347 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:10,347 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2021-12-15 13:57:10,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-15 13:57:10,347 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:57:10,347 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:57:10,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-15 13:57:10,347 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-15 13:57:10,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:57:10,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1806876139, now seen corresponding path program 1 times [2021-12-15 13:57:10,348 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:57:10,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039315424] [2021-12-15 13:57:10,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:57:10,348 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:57:10,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:10,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:10,430 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:57:10,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039315424] [2021-12-15 13:57:10,430 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039315424] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:57:10,430 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:57:10,431 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 13:57:10,431 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232962047] [2021-12-15 13:57:10,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:57:10,431 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 13:57:10,431 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:57:10,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 13:57:10,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 13:57:10,432 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:10,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:57:10,510 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2021-12-15 13:57:10,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 13:57:10,511 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-12-15 13:57:10,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:57:10,512 INFO L225 Difference]: With dead ends: 63 [2021-12-15 13:57:10,512 INFO L226 Difference]: Without dead ends: 63 [2021-12-15 13:57:10,512 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-15 13:57:10,513 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 7 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 13:57:10,513 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 118 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 13:57:10,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-12-15 13:57:10,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2021-12-15 13:57:10,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 39 states have (on average 1.7179487179487178) internal successors, (67), 58 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:10,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 67 transitions. [2021-12-15 13:57:10,516 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 67 transitions. Word has length 7 [2021-12-15 13:57:10,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:57:10,516 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 67 transitions. [2021-12-15 13:57:10,517 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:10,517 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2021-12-15 13:57:10,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-15 13:57:10,517 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:57:10,517 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:57:10,517 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-15 13:57:10,518 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-15 13:57:10,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:57:10,518 INFO L85 PathProgramCache]: Analyzing trace with hash -533877068, now seen corresponding path program 1 times [2021-12-15 13:57:10,518 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:57:10,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524118440] [2021-12-15 13:57:10,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:57:10,519 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:57:10,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:10,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:10,541 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:57:10,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524118440] [2021-12-15 13:57:10,542 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524118440] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:57:10,542 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:57:10,542 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 13:57:10,542 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484342527] [2021-12-15 13:57:10,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:57:10,542 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 13:57:10,543 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:57:10,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 13:57:10,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 13:57:10,544 INFO L87 Difference]: Start difference. First operand 59 states and 67 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:10,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:57:10,569 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2021-12-15 13:57:10,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 13:57:10,569 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-12-15 13:57:10,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:57:10,570 INFO L225 Difference]: With dead ends: 53 [2021-12-15 13:57:10,570 INFO L226 Difference]: Without dead ends: 53 [2021-12-15 13:57:10,570 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 13:57:10,571 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 36 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 13:57:10,571 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 44 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 13:57:10,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-12-15 13:57:10,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2021-12-15 13:57:10,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 39 states have (on average 1.564102564102564) internal successors, (61), 52 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:10,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2021-12-15 13:57:10,574 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 9 [2021-12-15 13:57:10,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:57:10,574 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2021-12-15 13:57:10,574 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:10,574 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2021-12-15 13:57:10,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-15 13:57:10,575 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:57:10,575 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:57:10,575 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-15 13:57:10,575 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-15 13:57:10,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:57:10,575 INFO L85 PathProgramCache]: Analyzing trace with hash -533877067, now seen corresponding path program 1 times [2021-12-15 13:57:10,576 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:57:10,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466587662] [2021-12-15 13:57:10,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:57:10,576 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:57:10,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:10,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:10,601 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:57:10,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466587662] [2021-12-15 13:57:10,602 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466587662] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:57:10,602 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:57:10,602 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 13:57:10,602 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601147565] [2021-12-15 13:57:10,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:57:10,602 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 13:57:10,602 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:57:10,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 13:57:10,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 13:57:10,603 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:10,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:57:10,623 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2021-12-15 13:57:10,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 13:57:10,623 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-12-15 13:57:10,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:57:10,624 INFO L225 Difference]: With dead ends: 47 [2021-12-15 13:57:10,624 INFO L226 Difference]: Without dead ends: 47 [2021-12-15 13:57:10,624 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 13:57:10,625 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 30 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 13:57:10,625 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 47 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 13:57:10,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-12-15 13:57:10,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2021-12-15 13:57:10,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 46 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:10,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2021-12-15 13:57:10,627 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 9 [2021-12-15 13:57:10,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:57:10,628 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2021-12-15 13:57:10,628 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:10,628 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2021-12-15 13:57:10,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-15 13:57:10,628 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:57:10,628 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:57:10,629 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-15 13:57:10,629 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-15 13:57:10,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:57:10,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1226025170, now seen corresponding path program 1 times [2021-12-15 13:57:10,629 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:57:10,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274497452] [2021-12-15 13:57:10,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:57:10,630 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:57:10,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:10,678 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:10,678 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:57:10,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274497452] [2021-12-15 13:57:10,679 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274497452] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:57:10,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1684808886] [2021-12-15 13:57:10,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:57:10,679 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:57:10,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:57:10,706 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 13:57:10,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-15 13:57:10,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:10,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-15 13:57:10,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:57:10,834 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-15 13:57:10,834 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2021-12-15 13:57:10,915 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:10,916 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:57:11,061 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:11,062 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1684808886] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:57:11,062 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:57:11,062 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2021-12-15 13:57:11,062 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182453220] [2021-12-15 13:57:11,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:57:11,063 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-15 13:57:11,063 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:57:11,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-15 13:57:11,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2021-12-15 13:57:11,063 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:11,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:57:11,209 INFO L93 Difference]: Finished difference Result 83 states and 95 transitions. [2021-12-15 13:57:11,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-15 13:57:11,210 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-15 13:57:11,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:57:11,210 INFO L225 Difference]: With dead ends: 83 [2021-12-15 13:57:11,210 INFO L226 Difference]: Without dead ends: 83 [2021-12-15 13:57:11,211 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2021-12-15 13:57:11,211 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 82 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 13:57:11,211 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 201 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 13:57:11,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-12-15 13:57:11,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 44. [2021-12-15 13:57:11,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 43 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:11,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2021-12-15 13:57:11,214 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 11 [2021-12-15 13:57:11,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:57:11,214 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2021-12-15 13:57:11,214 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:11,214 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2021-12-15 13:57:11,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-15 13:57:11,214 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:57:11,214 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:57:11,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-15 13:57:11,415 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:57:11,415 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-15 13:57:11,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:57:11,416 INFO L85 PathProgramCache]: Analyzing trace with hash 229648597, now seen corresponding path program 1 times [2021-12-15 13:57:11,416 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:57:11,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666303238] [2021-12-15 13:57:11,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:57:11,416 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:57:11,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:11,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:11,505 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:57:11,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666303238] [2021-12-15 13:57:11,506 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666303238] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:57:11,506 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:57:11,506 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 13:57:11,506 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548575860] [2021-12-15 13:57:11,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:57:11,506 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 13:57:11,507 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:57:11,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 13:57:11,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 13:57:11,507 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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:57:11,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:57:11,541 INFO L93 Difference]: Finished difference Result 94 states and 105 transitions. [2021-12-15 13:57:11,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 13:57:11,542 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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:57:11,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:57:11,542 INFO L225 Difference]: With dead ends: 94 [2021-12-15 13:57:11,543 INFO L226 Difference]: Without dead ends: 94 [2021-12-15 13:57:11,543 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-15 13:57:11,543 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 104 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 13:57:11,544 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 183 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 13:57:11,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-12-15 13:57:11,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 56. [2021-12-15 13:57:11,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 55 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:57:11,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2021-12-15 13:57:11,546 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 15 [2021-12-15 13:57:11,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:57:11,546 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2021-12-15 13:57:11,547 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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:57:11,547 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2021-12-15 13:57:11,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-15 13:57:11,547 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:57:11,547 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:57:11,547 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-15 13:57:11,548 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-15 13:57:11,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:57:11,548 INFO L85 PathProgramCache]: Analyzing trace with hash 487814035, now seen corresponding path program 1 times [2021-12-15 13:57:11,548 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:57:11,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067796380] [2021-12-15 13:57:11,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:57:11,548 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:57:11,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:11,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:11,595 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:57:11,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067796380] [2021-12-15 13:57:11,596 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067796380] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:57:11,596 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:57:11,596 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-15 13:57:11,596 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798593720] [2021-12-15 13:57:11,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:57:11,596 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-15 13:57:11,596 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:57:11,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-15 13:57:11,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-15 13:57:11,597 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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:57:11,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:57:11,625 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2021-12-15 13:57:11,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-15 13:57:11,626 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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:57:11,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:57:11,626 INFO L225 Difference]: With dead ends: 67 [2021-12-15 13:57:11,626 INFO L226 Difference]: Without dead ends: 67 [2021-12-15 13:57:11,626 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-15 13:57:11,627 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 156 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 13:57:11,627 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 83 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 13:57:11,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-12-15 13:57:11,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 44. [2021-12-15 13:57:11,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 43 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:11,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2021-12-15 13:57:11,629 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 15 [2021-12-15 13:57:11,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:57:11,629 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2021-12-15 13:57:11,629 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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:57:11,629 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2021-12-15 13:57:11,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-15 13:57:11,630 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:57:11,630 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:57:11,630 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-15 13:57:11,630 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-15 13:57:11,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:57:11,630 INFO L85 PathProgramCache]: Analyzing trace with hash -994678340, now seen corresponding path program 1 times [2021-12-15 13:57:11,630 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:57:11,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353965970] [2021-12-15 13:57:11,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:57:11,631 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:57:11,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:11,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:11,692 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:57:11,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353965970] [2021-12-15 13:57:11,692 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353965970] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:57:11,692 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:57:11,692 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-15 13:57:11,692 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500529998] [2021-12-15 13:57:11,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:57:11,693 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-15 13:57:11,693 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:57:11,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-15 13:57:11,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-15 13:57:11,693 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:11,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:57:11,801 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2021-12-15 13:57:11,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-15 13:57:11,802 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-12-15 13:57:11,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:57:11,802 INFO L225 Difference]: With dead ends: 43 [2021-12-15 13:57:11,802 INFO L226 Difference]: Without dead ends: 43 [2021-12-15 13:57:11,802 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-12-15 13:57:11,803 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 105 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 13:57:11,803 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 81 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 13:57:11,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2021-12-15 13:57:11,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2021-12-15 13:57:11,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 42 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:11,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2021-12-15 13:57:11,805 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 18 [2021-12-15 13:57:11,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:57:11,805 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2021-12-15 13:57:11,805 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:11,805 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2021-12-15 13:57:11,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-15 13:57:11,805 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:57:11,805 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:57:11,805 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-15 13:57:11,805 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-15 13:57:11,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:57:11,806 INFO L85 PathProgramCache]: Analyzing trace with hash -994678339, now seen corresponding path program 1 times [2021-12-15 13:57:11,806 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:57:11,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544633079] [2021-12-15 13:57:11,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:57:11,806 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:57:11,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:11,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:57:11,901 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:57:11,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544633079] [2021-12-15 13:57:11,902 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544633079] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:57:11,902 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:57:11,902 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-15 13:57:11,902 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314572209] [2021-12-15 13:57:11,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:57:11,902 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-15 13:57:11,903 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:57:11,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-15 13:57:11,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-15 13:57:11,903 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:12,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:57:12,036 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2021-12-15 13:57:12,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-15 13:57:12,036 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-12-15 13:57:12,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:57:12,037 INFO L225 Difference]: With dead ends: 49 [2021-12-15 13:57:12,037 INFO L226 Difference]: Without dead ends: 49 [2021-12-15 13:57:12,037 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2021-12-15 13:57:12,038 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 195 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 13:57:12,038 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [195 Valid, 82 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 13:57:12,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2021-12-15 13:57:12,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2021-12-15 13:57:12,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 44 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:12,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2021-12-15 13:57:12,039 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 18 [2021-12-15 13:57:12,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:57:12,039 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2021-12-15 13:57:12,040 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:12,040 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2021-12-15 13:57:12,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-15 13:57:12,040 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:57:12,040 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:57:12,040 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-15 13:57:12,040 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-15 13:57:12,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:57:12,041 INFO L85 PathProgramCache]: Analyzing trace with hash -770257435, now seen corresponding path program 1 times [2021-12-15 13:57:12,041 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:57:12,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581726463] [2021-12-15 13:57:12,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:57:12,041 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:57:12,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:12,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:12,141 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:57:12,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581726463] [2021-12-15 13:57:12,141 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581726463] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:57:12,141 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:57:12,141 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-15 13:57:12,141 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110120267] [2021-12-15 13:57:12,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:57:12,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-15 13:57:12,142 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:57:12,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-15 13:57:12,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-15 13:57:12,142 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:12,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:57:12,275 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2021-12-15 13:57:12,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-15 13:57:12,275 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 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:57:12,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:57:12,276 INFO L225 Difference]: With dead ends: 48 [2021-12-15 13:57:12,276 INFO L226 Difference]: Without dead ends: 48 [2021-12-15 13:57:12,276 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2021-12-15 13:57:12,276 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 117 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 13:57:12,276 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 141 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 13:57:12,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2021-12-15 13:57:12,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2021-12-15 13:57:12,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 40 states have (on average 1.325) internal successors, (53), 45 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:12,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2021-12-15 13:57:12,278 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 19 [2021-12-15 13:57:12,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:57:12,278 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2021-12-15 13:57:12,278 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:12,278 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2021-12-15 13:57:12,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-15 13:57:12,279 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:57:12,279 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:57:12,279 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-15 13:57:12,279 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-15 13:57:12,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:57:12,279 INFO L85 PathProgramCache]: Analyzing trace with hash -770257436, now seen corresponding path program 1 times [2021-12-15 13:57:12,279 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:57:12,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086593634] [2021-12-15 13:57:12,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:57:12,279 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:57:12,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:12,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:12,355 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:57:12,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086593634] [2021-12-15 13:57:12,355 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086593634] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:57:12,355 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:57:12,355 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-15 13:57:12,355 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015706290] [2021-12-15 13:57:12,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:57:12,356 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-15 13:57:12,356 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:57:12,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-15 13:57:12,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-15 13:57:12,356 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:12,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:57:12,593 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2021-12-15 13:57:12,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-15 13:57:12,594 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 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:57:12,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:57:12,594 INFO L225 Difference]: With dead ends: 92 [2021-12-15 13:57:12,594 INFO L226 Difference]: Without dead ends: 92 [2021-12-15 13:57:12,595 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=334, Unknown=0, NotChecked=0, Total=462 [2021-12-15 13:57:12,595 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 207 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 13:57:12,595 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [207 Valid, 119 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 13:57:12,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-12-15 13:57:12,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 45. [2021-12-15 13:57:12,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.275) internal successors, (51), 44 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:12,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2021-12-15 13:57:12,597 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 19 [2021-12-15 13:57:12,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:57:12,597 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2021-12-15 13:57:12,597 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:12,597 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2021-12-15 13:57:12,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-15 13:57:12,598 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:57:12,598 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:57:12,598 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-15 13:57:12,598 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-15 13:57:12,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:57:12,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1682807689, now seen corresponding path program 1 times [2021-12-15 13:57:12,599 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:57:12,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275516626] [2021-12-15 13:57:12,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:57:12,599 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:57:12,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:12,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:12,624 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:57:12,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275516626] [2021-12-15 13:57:12,625 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275516626] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:57:12,625 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:57:12,625 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 13:57:12,625 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043879885] [2021-12-15 13:57:12,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:57:12,625 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 13:57:12,625 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:57:12,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 13:57:12,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 13:57:12,626 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:12,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:57:12,669 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2021-12-15 13:57:12,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-15 13:57:12,670 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-12-15 13:57:12,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:57:12,670 INFO L225 Difference]: With dead ends: 44 [2021-12-15 13:57:12,670 INFO L226 Difference]: Without dead ends: 44 [2021-12-15 13:57:12,670 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-15 13:57:12,671 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 17 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 13:57:12,671 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 95 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 13:57:12,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2021-12-15 13:57:12,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2021-12-15 13:57:12,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 40 states have (on average 1.25) internal successors, (50), 43 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:12,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2021-12-15 13:57:12,672 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 24 [2021-12-15 13:57:12,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:57:12,673 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2021-12-15 13:57:12,673 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:12,673 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2021-12-15 13:57:12,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-15 13:57:12,673 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:57:12,673 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:57:12,674 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-15 13:57:12,674 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-15 13:57:12,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:57:12,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1682807690, now seen corresponding path program 1 times [2021-12-15 13:57:12,674 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:57:12,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014097588] [2021-12-15 13:57:12,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:57:12,674 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:57:12,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:12,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:12,740 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:57:12,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014097588] [2021-12-15 13:57:12,740 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014097588] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:57:12,740 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:57:12,740 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-15 13:57:12,740 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325753266] [2021-12-15 13:57:12,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:57:12,740 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-15 13:57:12,740 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:57:12,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-15 13:57:12,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-15 13:57:12,741 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:12,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:57:12,784 INFO L93 Difference]: Finished difference Result 88 states and 98 transitions. [2021-12-15 13:57:12,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-15 13:57:12,784 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-12-15 13:57:12,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:57:12,785 INFO L225 Difference]: With dead ends: 88 [2021-12-15 13:57:12,785 INFO L226 Difference]: Without dead ends: 88 [2021-12-15 13:57:12,785 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 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:57:12,786 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 75 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 13:57:12,786 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 199 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 13:57:12,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-12-15 13:57:12,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 68. [2021-12-15 13:57:12,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 64 states have (on average 1.1875) internal successors, (76), 67 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:12,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2021-12-15 13:57:12,787 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 24 [2021-12-15 13:57:12,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:57:12,788 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2021-12-15 13:57:12,788 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:12,788 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2021-12-15 13:57:12,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-15 13:57:12,788 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:57:12,789 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:57:12,789 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-15 13:57:12,789 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-15 13:57:12,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:57:12,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1703829822, now seen corresponding path program 1 times [2021-12-15 13:57:12,789 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:57:12,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142024597] [2021-12-15 13:57:12,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:57:12,790 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:57:12,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:12,836 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:57:12,836 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:57:12,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142024597] [2021-12-15 13:57:12,836 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142024597] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:57:12,836 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:57:12,837 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-15 13:57:12,837 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608865078] [2021-12-15 13:57:12,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:57:12,837 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-15 13:57:12,837 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:57:12,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-15 13:57:12,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-15 13:57:12,838 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:12,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:57:12,889 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2021-12-15 13:57:12,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-15 13:57:12,889 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-12-15 13:57:12,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:57:12,889 INFO L225 Difference]: With dead ends: 75 [2021-12-15 13:57:12,890 INFO L226 Difference]: Without dead ends: 75 [2021-12-15 13:57:12,890 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 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:57:12,890 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 44 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 13:57:12,890 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 182 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 13:57:12,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-12-15 13:57:12,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 70. [2021-12-15 13:57:12,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 66 states have (on average 1.1818181818181819) internal successors, (78), 69 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:12,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2021-12-15 13:57:12,892 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 24 [2021-12-15 13:57:12,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:57:12,892 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2021-12-15 13:57:12,892 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:12,892 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2021-12-15 13:57:12,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-15 13:57:12,893 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:57:12,893 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:57:12,893 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-15 13:57:12,893 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-15 13:57:12,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:57:12,894 INFO L85 PathProgramCache]: Analyzing trace with hash 2105509516, now seen corresponding path program 1 times [2021-12-15 13:57:12,894 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:57:12,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216209036] [2021-12-15 13:57:12,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:57:12,894 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:57:12,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:13,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:13,241 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:57:13,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216209036] [2021-12-15 13:57:13,241 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216209036] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:57:13,241 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:57:13,241 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-15 13:57:13,241 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511792558] [2021-12-15 13:57:13,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:57:13,241 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-15 13:57:13,242 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:57:13,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-15 13:57:13,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2021-12-15 13:57:13,242 INFO L87 Difference]: Start difference. First operand 70 states and 78 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:13,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:57:13,664 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2021-12-15 13:57:13,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-15 13:57:13,664 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-12-15 13:57:13,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:57:13,666 INFO L225 Difference]: With dead ends: 77 [2021-12-15 13:57:13,666 INFO L226 Difference]: Without dead ends: 77 [2021-12-15 13:57:13,666 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2021-12-15 13:57:13,666 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 90 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 13:57:13,667 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 165 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 13:57:13,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-12-15 13:57:13,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2021-12-15 13:57:13,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 71 states have (on average 1.1971830985915493) internal successors, (85), 74 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:13,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2021-12-15 13:57:13,668 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 24 [2021-12-15 13:57:13,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:57:13,669 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2021-12-15 13:57:13,669 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:13,669 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2021-12-15 13:57:13,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-15 13:57:13,669 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:57:13,669 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:57:13,669 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-15 13:57:13,669 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-15 13:57:13,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:57:13,669 INFO L85 PathProgramCache]: Analyzing trace with hash 2126531648, now seen corresponding path program 1 times [2021-12-15 13:57:13,670 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:57:13,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088153914] [2021-12-15 13:57:13,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:57:13,670 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:57:13,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:13,762 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:57:13,762 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:57:13,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088153914] [2021-12-15 13:57:13,763 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088153914] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:57:13,763 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:57:13,763 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-15 13:57:13,763 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815139359] [2021-12-15 13:57:13,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:57:13,763 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-15 13:57:13,764 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:57:13,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-15 13:57:13,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-12-15 13:57:13,764 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:13,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:57:13,949 INFO L93 Difference]: Finished difference Result 120 states and 131 transitions. [2021-12-15 13:57:13,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-15 13:57:13,950 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-12-15 13:57:13,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:57:13,951 INFO L225 Difference]: With dead ends: 120 [2021-12-15 13:57:13,951 INFO L226 Difference]: Without dead ends: 120 [2021-12-15 13:57:13,951 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2021-12-15 13:57:13,953 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 61 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 13:57:13,953 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 253 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 13:57:13,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-12-15 13:57:13,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 103. [2021-12-15 13:57:13,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 99 states have (on average 1.1414141414141414) internal successors, (113), 102 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:13,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 113 transitions. [2021-12-15 13:57:13,958 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 113 transitions. Word has length 24 [2021-12-15 13:57:13,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:57:13,958 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 113 transitions. [2021-12-15 13:57:13,958 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:13,959 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2021-12-15 13:57:13,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-15 13:57:13,959 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:57:13,959 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:57:13,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-15 13:57:13,960 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-15 13:57:13,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:57:13,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1949580930, now seen corresponding path program 1 times [2021-12-15 13:57:13,961 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:57:13,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829929601] [2021-12-15 13:57:13,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:57:13,961 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:57:13,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:14,095 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:57:14,095 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:57:14,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829929601] [2021-12-15 13:57:14,096 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829929601] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:57:14,096 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:57:14,096 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-15 13:57:14,096 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890430011] [2021-12-15 13:57:14,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:57:14,097 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-15 13:57:14,097 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:57:14,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-15 13:57:14,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-12-15 13:57:14,098 INFO L87 Difference]: Start difference. First operand 103 states and 113 transitions. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:14,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:57:14,300 INFO L93 Difference]: Finished difference Result 156 states and 169 transitions. [2021-12-15 13:57:14,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-15 13:57:14,300 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-12-15 13:57:14,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:57:14,301 INFO L225 Difference]: With dead ends: 156 [2021-12-15 13:57:14,301 INFO L226 Difference]: Without dead ends: 156 [2021-12-15 13:57:14,301 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2021-12-15 13:57:14,302 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 84 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 13:57:14,302 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 242 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 13:57:14,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-12-15 13:57:14,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 105. [2021-12-15 13:57:14,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 101 states have (on average 1.1584158415841583) internal successors, (117), 104 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:14,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2021-12-15 13:57:14,304 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 24 [2021-12-15 13:57:14,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:57:14,304 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2021-12-15 13:57:14,304 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:14,304 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2021-12-15 13:57:14,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-15 13:57:14,305 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:57:14,305 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:57:14,305 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-15 13:57:14,305 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-15 13:57:14,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:57:14,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1664467980, now seen corresponding path program 1 times [2021-12-15 13:57:14,305 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:57:14,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206894107] [2021-12-15 13:57:14,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:57:14,306 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:57:14,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:14,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:14,700 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:57:14,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206894107] [2021-12-15 13:57:14,700 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206894107] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:57:14,700 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:57:14,701 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-15 13:57:14,701 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116229243] [2021-12-15 13:57:14,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:57:14,701 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-15 13:57:14,701 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:57:14,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-15 13:57:14,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-12-15 13:57:14,702 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:14,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:57:14,988 INFO L93 Difference]: Finished difference Result 110 states and 123 transitions. [2021-12-15 13:57:14,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-15 13:57:14,989 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 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) Word has length 27 [2021-12-15 13:57:14,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:57:14,989 INFO L225 Difference]: With dead ends: 110 [2021-12-15 13:57:14,989 INFO L226 Difference]: Without dead ends: 63 [2021-12-15 13:57:14,989 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2021-12-15 13:57:14,990 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 89 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 13:57:14,990 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 178 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 13:57:14,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-12-15 13:57:14,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2021-12-15 13:57:14,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 58 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:57:14,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2021-12-15 13:57:14,991 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 27 [2021-12-15 13:57:14,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:57:14,992 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2021-12-15 13:57:14,992 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:14,992 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2021-12-15 13:57:14,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-15 13:57:14,992 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:57:14,992 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:57:14,992 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-15 13:57:14,992 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-15 13:57:14,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:57:14,992 INFO L85 PathProgramCache]: Analyzing trace with hash 235701316, now seen corresponding path program 1 times [2021-12-15 13:57:14,993 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:57:14,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393039089] [2021-12-15 13:57:14,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:57:14,993 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:57:15,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:15,370 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:15,371 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:57:15,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393039089] [2021-12-15 13:57:15,371 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393039089] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:57:15,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752977625] [2021-12-15 13:57:15,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:57:15,371 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:57:15,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:57:15,372 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 13:57:15,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-15 13:57:15,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:15,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 69 conjunts are in the unsatisfiable core [2021-12-15 13:57:15,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:57:15,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 13:57:15,553 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-12-15 13:57:15,568 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-12-15 13:57:15,613 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-15 13:57:15,614 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2021-12-15 13:57:15,660 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 13:57:15,663 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 13:57:15,746 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 35 treesize of output 19 [2021-12-15 13:57:15,750 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-15 13:57:16,422 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:16,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:57:17,143 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:17,143 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752977625] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:57:17,143 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:57:17,143 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 40 [2021-12-15 13:57:17,143 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814672212] [2021-12-15 13:57:17,143 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:57:17,144 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2021-12-15 13:57:17,144 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:57:17,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-12-15 13:57:17,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1511, Unknown=0, NotChecked=0, Total=1640 [2021-12-15 13:57:17,145 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand has 41 states, 40 states have (on average 1.825) internal successors, (73), 41 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:57:18,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:57:18,990 INFO L93 Difference]: Finished difference Result 87 states and 96 transitions. [2021-12-15 13:57:18,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-15 13:57:18,991 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.825) internal successors, (73), 41 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 28 [2021-12-15 13:57:18,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:57:18,991 INFO L225 Difference]: With dead ends: 87 [2021-12-15 13:57:18,991 INFO L226 Difference]: Without dead ends: 87 [2021-12-15 13:57:18,992 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=350, Invalid=3310, Unknown=0, NotChecked=0, Total=3660 [2021-12-15 13:57:18,993 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 119 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 146 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 13:57:18,993 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 307 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 249 Invalid, 0 Unknown, 146 Unchecked, 0.2s Time] [2021-12-15 13:57:18,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-12-15 13:57:18,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 77. [2021-12-15 13:57:18,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 74 states have (on average 1.162162162162162) internal successors, (86), 76 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:18,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2021-12-15 13:57:18,995 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 28 [2021-12-15 13:57:18,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:57:18,995 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2021-12-15 13:57:18,995 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.825) internal successors, (73), 41 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:57:18,995 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2021-12-15 13:57:18,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-15 13:57:18,995 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:57:18,996 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:57:19,022 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:57:19,222 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,SelfDestructingSolverStorable20 [2021-12-15 13:57:19,224 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-15 13:57:19,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:57:19,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1959516773, now seen corresponding path program 1 times [2021-12-15 13:57:19,225 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:57:19,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064672458] [2021-12-15 13:57:19,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:57:19,225 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:57:19,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:19,386 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:19,387 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:57:19,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064672458] [2021-12-15 13:57:19,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064672458] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:57:19,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408030127] [2021-12-15 13:57:19,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:57:19,387 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:57:19,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:57:19,388 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 13:57:19,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-15 13:57:19,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:19,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 32 conjunts are in the unsatisfiable core [2021-12-15 13:57:19,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:57:19,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 13:57:19,564 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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:57:19,569 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-15 13:57:19,569 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-15 13:57:19,631 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:19,631 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:57:19,763 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 27 treesize of output 23 [2021-12-15 13:57:19,851 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-15 13:57:19,851 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2021-12-15 13:57:19,867 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:19,868 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408030127] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:57:19,868 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:57:19,868 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 28 [2021-12-15 13:57:19,868 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405510469] [2021-12-15 13:57:19,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:57:19,868 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-12-15 13:57:19,868 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:57:19,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-12-15 13:57:19,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=712, Unknown=0, NotChecked=0, Total=812 [2021-12-15 13:57:19,869 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand has 29 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 29 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:20,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:57:20,316 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2021-12-15 13:57:20,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-15 13:57:20,318 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 29 states have internal predecessors, (68), 0 states have call successors, (0), 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 28 [2021-12-15 13:57:20,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:57:20,318 INFO L225 Difference]: With dead ends: 107 [2021-12-15 13:57:20,318 INFO L226 Difference]: Without dead ends: 107 [2021-12-15 13:57:20,319 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=265, Invalid=1141, Unknown=0, NotChecked=0, Total=1406 [2021-12-15 13:57:20,319 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 318 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-15 13:57:20,320 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [318 Valid, 402 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 611 Invalid, 0 Unknown, 33 Unchecked, 0.3s Time] [2021-12-15 13:57:20,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-12-15 13:57:20,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 77. [2021-12-15 13:57:20,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 74 states have (on average 1.1486486486486487) internal successors, (85), 76 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:20,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2021-12-15 13:57:20,332 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 28 [2021-12-15 13:57:20,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:57:20,333 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2021-12-15 13:57:20,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 29 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:20,333 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2021-12-15 13:57:20,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-15 13:57:20,333 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:57:20,333 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:57:20,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-15 13:57:20,549 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:57:20,550 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-15 13:57:20,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:57:20,550 INFO L85 PathProgramCache]: Analyzing trace with hash -615477817, now seen corresponding path program 1 times [2021-12-15 13:57:20,550 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:57:20,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113490357] [2021-12-15 13:57:20,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:57:20,551 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:57:20,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:21,075 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 13:57:21,075 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:57:21,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113490357] [2021-12-15 13:57:21,075 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113490357] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:57:21,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318844825] [2021-12-15 13:57:21,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:57:21,075 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:57:21,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:57:21,076 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 13:57:21,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-15 13:57:21,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:21,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 71 conjunts are in the unsatisfiable core [2021-12-15 13:57:21,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:57:21,282 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-15 13:57:21,283 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2021-12-15 13:57:21,387 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-15 13:57:21,387 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2021-12-15 13:57:21,442 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 13:57:21,447 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 13:57:21,580 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 32 treesize of output 16 [2021-12-15 13:57:21,582 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-15 13:57:22,245 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 13:57:22,245 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:57:23,099 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 13:57:23,100 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1318844825] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:57:23,100 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:57:23,100 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 44 [2021-12-15 13:57:23,100 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381397091] [2021-12-15 13:57:23,100 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:57:23,100 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2021-12-15 13:57:23,101 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:57:23,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-12-15 13:57:23,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1817, Unknown=0, NotChecked=0, Total=1980 [2021-12-15 13:57:23,102 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand has 45 states, 44 states have (on average 1.8181818181818181) internal successors, (80), 45 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:24,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:57:24,137 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2021-12-15 13:57:24,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-15 13:57:24,138 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 1.8181818181818181) internal successors, (80), 45 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-15 13:57:24,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:57:24,138 INFO L225 Difference]: With dead ends: 77 [2021-12-15 13:57:24,138 INFO L226 Difference]: Without dead ends: 77 [2021-12-15 13:57:24,139 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=290, Invalid=2902, Unknown=0, NotChecked=0, Total=3192 [2021-12-15 13:57:24,139 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 50 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 80 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 13:57:24,139 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 319 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 235 Invalid, 0 Unknown, 80 Unchecked, 0.1s Time] [2021-12-15 13:57:24,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-12-15 13:57:24,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2021-12-15 13:57:24,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 74 states have (on average 1.135135135135135) internal successors, (84), 76 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:24,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2021-12-15 13:57:24,143 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 29 [2021-12-15 13:57:24,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:57:24,143 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2021-12-15 13:57:24,143 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 1.8181818181818181) internal successors, (80), 45 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:24,143 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2021-12-15 13:57:24,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-15 13:57:24,144 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:57:24,144 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:57:24,172 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-12-15 13:57:24,344 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:57:24,344 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-15 13:57:24,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:57:24,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1510311704, now seen corresponding path program 1 times [2021-12-15 13:57:24,345 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:57:24,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622397620] [2021-12-15 13:57:24,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:57:24,345 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:57:24,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:24,831 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 13:57:24,831 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:57:24,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622397620] [2021-12-15 13:57:24,832 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622397620] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:57:24,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125204561] [2021-12-15 13:57:24,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:57:24,832 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:57:24,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:57:24,833 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 13:57:24,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-15 13:57:24,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:24,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 71 conjunts are in the unsatisfiable core [2021-12-15 13:57:24,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:57:24,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 13:57:24,957 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-12-15 13:57:24,959 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-12-15 13:57:25,028 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-15 13:57:25,029 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2021-12-15 13:57:25,076 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 13:57:25,080 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 13:57:25,170 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 35 treesize of output 19 [2021-12-15 13:57:25,172 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-15 13:57:25,815 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 13:57:25,815 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:57:26,509 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 13:57:26,509 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2125204561] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:57:26,510 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:57:26,510 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 14] total 42 [2021-12-15 13:57:26,510 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588738836] [2021-12-15 13:57:26,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:57:26,510 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2021-12-15 13:57:26,510 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:57:26,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-12-15 13:57:26,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1672, Unknown=0, NotChecked=0, Total=1806 [2021-12-15 13:57:26,511 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand has 43 states, 42 states have (on average 2.0714285714285716) internal successors, (87), 43 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:27,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:57:27,917 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2021-12-15 13:57:27,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-12-15 13:57:27,917 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.0714285714285716) internal successors, (87), 43 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-12-15 13:57:27,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:57:27,917 INFO L225 Difference]: With dead ends: 99 [2021-12-15 13:57:27,917 INFO L226 Difference]: Without dead ends: 99 [2021-12-15 13:57:27,918 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 567 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=383, Invalid=3777, Unknown=0, NotChecked=0, Total=4160 [2021-12-15 13:57:27,919 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 74 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 13:57:27,919 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 290 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 360 Invalid, 0 Unknown, 90 Unchecked, 0.2s Time] [2021-12-15 13:57:27,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-12-15 13:57:27,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 81. [2021-12-15 13:57:27,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 78 states have (on average 1.1538461538461537) internal successors, (90), 80 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:57:27,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2021-12-15 13:57:27,921 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 34 [2021-12-15 13:57:27,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:57:27,921 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2021-12-15 13:57:27,921 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.0714285714285716) internal successors, (87), 43 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:27,921 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2021-12-15 13:57:27,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-15 13:57:27,921 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:57:27,921 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:57:27,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-15 13:57:28,131 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-12-15 13:57:28,131 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-15 13:57:28,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:57:28,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1489289572, now seen corresponding path program 2 times [2021-12-15 13:57:28,132 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:57:28,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984675333] [2021-12-15 13:57:28,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:57:28,132 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:57:28,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:28,428 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:28,428 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:57:28,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984675333] [2021-12-15 13:57:28,428 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984675333] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:57:28,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353297079] [2021-12-15 13:57:28,428 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 13:57:28,428 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:57:28,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:57:28,438 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 13:57:28,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-15 13:57:28,553 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 13:57:28,553 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 13:57:28,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 69 conjunts are in the unsatisfiable core [2021-12-15 13:57:28,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:57:28,581 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-12-15 13:57:28,696 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2021-12-15 13:57:28,718 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-15 13:57:28,718 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-15 13:57:28,737 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:57:28,741 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 13:57:28,768 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 8 [2021-12-15 13:57:28,790 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 13:57:28,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:57:28,898 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-15 13:57:28,905 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:28,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:57:28,963 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_910 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_910) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |c_ULTIMATE.start_cstpncpy_~s~0#1.offset|) 0)) is different from false [2021-12-15 13:57:29,243 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:57:29,243 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 26 treesize of output 27 [2021-12-15 13:57:29,245 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 13:57:29,249 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:57:29,250 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2021-12-15 13:57:29,253 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 13:57:29,258 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-15 13:57:29,258 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2021-12-15 13:57:29,415 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-12-15 13:57:29,416 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353297079] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:57:29,416 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:57:29,416 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 39 [2021-12-15 13:57:29,416 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551089835] [2021-12-15 13:57:29,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:57:29,416 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-12-15 13:57:29,416 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:57:29,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-12-15 13:57:29,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1276, Unknown=2, NotChecked=72, Total=1482 [2021-12-15 13:57:29,417 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand has 39 states, 39 states have (on average 1.7179487179487178) internal successors, (67), 39 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:30,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:57:30,229 INFO L93 Difference]: Finished difference Result 143 states and 154 transitions. [2021-12-15 13:57:30,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-15 13:57:30,229 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.7179487179487178) internal successors, (67), 39 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-12-15 13:57:30,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:57:30,229 INFO L225 Difference]: With dead ends: 143 [2021-12-15 13:57:30,229 INFO L226 Difference]: Without dead ends: 143 [2021-12-15 13:57:30,230 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 42 SyntacticMatches, 7 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=367, Invalid=2287, Unknown=2, NotChecked=100, Total=2756 [2021-12-15 13:57:30,230 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 213 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 397 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 13:57:30,230 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [213 Valid, 640 Invalid, 858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 387 Invalid, 0 Unknown, 397 Unchecked, 0.2s Time] [2021-12-15 13:57:30,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-12-15 13:57:30,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 105. [2021-12-15 13:57:30,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 102 states have (on average 1.1372549019607843) internal successors, (116), 104 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:30,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 116 transitions. [2021-12-15 13:57:30,232 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 116 transitions. Word has length 34 [2021-12-15 13:57:30,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:57:30,232 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 116 transitions. [2021-12-15 13:57:30,232 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.7179487179487178) internal successors, (67), 39 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:30,232 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 116 transitions. [2021-12-15 13:57:30,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-15 13:57:30,233 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:57:30,233 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:57:30,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-15 13:57:30,433 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:57:30,433 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-15 13:57:30,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:57:30,434 INFO L85 PathProgramCache]: Analyzing trace with hash -412898380, now seen corresponding path program 2 times [2021-12-15 13:57:30,434 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:57:30,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239751260] [2021-12-15 13:57:30,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:57:30,434 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:57:30,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:30,910 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:30,910 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:57:30,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239751260] [2021-12-15 13:57:30,910 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239751260] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:57:30,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898526903] [2021-12-15 13:57:30,910 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 13:57:30,910 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:57:30,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:57:30,911 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 13:57:30,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-15 13:57:31,144 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 13:57:31,144 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 13:57:31,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 95 conjunts are in the unsatisfiable core [2021-12-15 13:57:31,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:57:31,165 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-15 13:57:31,166 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2021-12-15 13:57:31,178 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 13:57:31,179 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2021-12-15 13:57:31,269 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-15 13:57:31,269 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2021-12-15 13:57:31,281 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-12-15 13:57:31,281 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-12-15 13:57:31,313 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 11 treesize of output 7 [2021-12-15 13:57:31,317 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 13:57:31,379 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 25 treesize of output 13 [2021-12-15 13:57:31,381 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2021-12-15 13:57:31,822 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:31,822 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:57:32,746 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:32,747 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1898526903] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:57:32,747 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:57:32,747 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 52 [2021-12-15 13:57:32,747 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883712770] [2021-12-15 13:57:32,747 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:57:32,748 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2021-12-15 13:57:32,748 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:57:32,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-12-15 13:57:32,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=2549, Unknown=0, NotChecked=0, Total=2756 [2021-12-15 13:57:32,749 INFO L87 Difference]: Start difference. First operand 105 states and 116 transitions. Second operand has 53 states, 52 states have (on average 1.7884615384615385) internal successors, (93), 53 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:35,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:57:35,782 INFO L93 Difference]: Finished difference Result 185 states and 197 transitions. [2021-12-15 13:57:35,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2021-12-15 13:57:35,783 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 1.7884615384615385) internal successors, (93), 53 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-12-15 13:57:35,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:57:35,783 INFO L225 Difference]: With dead ends: 185 [2021-12-15 13:57:35,783 INFO L226 Difference]: Without dead ends: 185 [2021-12-15 13:57:35,785 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3301 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1156, Invalid=11500, Unknown=0, NotChecked=0, Total=12656 [2021-12-15 13:57:35,786 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 438 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 1033 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 1290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 1033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-15 13:57:35,786 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [438 Valid, 554 Invalid, 1290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 1033 Invalid, 0 Unknown, 55 Unchecked, 0.6s Time] [2021-12-15 13:57:35,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-12-15 13:57:35,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 155. [2021-12-15 13:57:35,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 152 states have (on average 1.1710526315789473) internal successors, (178), 154 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:35,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 178 transitions. [2021-12-15 13:57:35,789 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 178 transitions. Word has length 36 [2021-12-15 13:57:35,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:57:35,789 INFO L470 AbstractCegarLoop]: Abstraction has 155 states and 178 transitions. [2021-12-15 13:57:35,789 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 1.7884615384615385) internal successors, (93), 53 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:35,789 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 178 transitions. [2021-12-15 13:57:35,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-15 13:57:35,789 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:57:35,789 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:57:35,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-15 13:57:35,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:57:35,999 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-15 13:57:36,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:57:36,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1201741191, now seen corresponding path program 3 times [2021-12-15 13:57:36,000 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:57:36,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929891702] [2021-12-15 13:57:36,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:57:36,000 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:57:36,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:36,228 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:57:36,228 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:57:36,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929891702] [2021-12-15 13:57:36,228 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929891702] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:57:36,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [8051094] [2021-12-15 13:57:36,228 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-15 13:57:36,228 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:57:36,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:57:36,235 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 13:57:36,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-15 13:57:36,446 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-12-15 13:57:36,446 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 13:57:36,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 65 conjunts are in the unsatisfiable core [2021-12-15 13:57:36,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:57:36,612 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-15 13:57:36,613 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2021-12-15 13:57:36,628 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-15 13:57:36,628 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-15 13:57:36,664 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 11 treesize of output 7 [2021-12-15 13:57:36,737 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2021-12-15 13:57:37,019 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:57:37,019 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:57:37,290 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 13:57:37,291 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-12-15 13:57:37,296 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-15 13:57:37,296 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2021-12-15 13:57:37,399 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:57:37,399 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [8051094] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:57:37,399 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:57:37,399 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 12] total 37 [2021-12-15 13:57:37,399 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861608366] [2021-12-15 13:57:37,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:57:37,399 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-12-15 13:57:37,399 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:57:37,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-12-15 13:57:37,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1288, Unknown=0, NotChecked=0, Total=1406 [2021-12-15 13:57:37,401 INFO L87 Difference]: Start difference. First operand 155 states and 178 transitions. Second operand has 38 states, 37 states have (on average 2.864864864864865) internal successors, (106), 38 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:38,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:57:38,938 INFO L93 Difference]: Finished difference Result 291 states and 312 transitions. [2021-12-15 13:57:38,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-15 13:57:38,939 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.864864864864865) internal successors, (106), 38 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-12-15 13:57:38,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:57:38,940 INFO L225 Difference]: With dead ends: 291 [2021-12-15 13:57:38,940 INFO L226 Difference]: Without dead ends: 291 [2021-12-15 13:57:38,940 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=572, Invalid=2850, Unknown=0, NotChecked=0, Total=3422 [2021-12-15 13:57:38,941 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 486 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 1263 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 1369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-15 13:57:38,941 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [486 Valid, 823 Invalid, 1369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1263 Invalid, 0 Unknown, 30 Unchecked, 0.5s Time] [2021-12-15 13:57:38,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2021-12-15 13:57:38,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 155. [2021-12-15 13:57:38,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 152 states have (on average 1.1644736842105263) internal successors, (177), 154 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:38,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 177 transitions. [2021-12-15 13:57:38,945 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 177 transitions. Word has length 38 [2021-12-15 13:57:38,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:57:38,945 INFO L470 AbstractCegarLoop]: Abstraction has 155 states and 177 transitions. [2021-12-15 13:57:38,946 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.864864864864865) internal successors, (106), 38 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:38,946 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 177 transitions. [2021-12-15 13:57:38,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-15 13:57:38,946 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:57:38,946 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:57:38,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-15 13:57:39,163 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,SelfDestructingSolverStorable26 [2021-12-15 13:57:39,163 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-15 13:57:39,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:57:39,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1400728745, now seen corresponding path program 2 times [2021-12-15 13:57:39,164 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:57:39,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307303421] [2021-12-15 13:57:39,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:57:39,164 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:57:39,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:39,512 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-15 13:57:39,512 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:57:39,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307303421] [2021-12-15 13:57:39,512 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307303421] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:57:39,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150864838] [2021-12-15 13:57:39,512 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 13:57:39,512 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:57:39,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:57:39,513 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 13:57:39,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-15 13:57:39,621 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 13:57:39,622 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 13:57:39,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 75 conjunts are in the unsatisfiable core [2021-12-15 13:57:39,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:57:39,643 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 13:57:39,643 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2021-12-15 13:57:39,646 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-12-15 13:57:39,760 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-12-15 13:57:39,760 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-12-15 13:57:39,764 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2021-12-15 13:57:39,783 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 13:57:39,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 11 treesize of output 7 [2021-12-15 13:57:39,847 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 25 treesize of output 13 [2021-12-15 13:57:39,849 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2021-12-15 13:57:40,087 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-15 13:57:40,087 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:57:40,801 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-15 13:57:40,802 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150864838] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:57:40,802 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:57:40,802 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 16] total 48 [2021-12-15 13:57:40,802 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740030632] [2021-12-15 13:57:40,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:57:40,803 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2021-12-15 13:57:40,803 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:57:40,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2021-12-15 13:57:40,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=2181, Unknown=0, NotChecked=0, Total=2352 [2021-12-15 13:57:40,804 INFO L87 Difference]: Start difference. First operand 155 states and 177 transitions. Second operand has 49 states, 48 states have (on average 2.0208333333333335) internal successors, (97), 49 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:57:42,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:57:42,647 INFO L93 Difference]: Finished difference Result 162 states and 177 transitions. [2021-12-15 13:57:42,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-12-15 13:57:42,648 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 2.0208333333333335) internal successors, (97), 49 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 39 [2021-12-15 13:57:42,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:57:42,648 INFO L225 Difference]: With dead ends: 162 [2021-12-15 13:57:42,648 INFO L226 Difference]: Without dead ends: 162 [2021-12-15 13:57:42,650 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1643 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=724, Invalid=6932, Unknown=0, NotChecked=0, Total=7656 [2021-12-15 13:57:42,650 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 180 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 944 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 1084 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 42 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-15 13:57:42,651 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [180 Valid, 505 Invalid, 1084 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 944 Invalid, 0 Unknown, 42 Unchecked, 0.4s Time] [2021-12-15 13:57:42,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-12-15 13:57:42,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 155. [2021-12-15 13:57:42,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 152 states have (on average 1.138157894736842) internal successors, (173), 154 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:42,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 173 transitions. [2021-12-15 13:57:42,653 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 173 transitions. Word has length 39 [2021-12-15 13:57:42,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:57:42,653 INFO L470 AbstractCegarLoop]: Abstraction has 155 states and 173 transitions. [2021-12-15 13:57:42,653 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 2.0208333333333335) internal successors, (97), 49 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:57:42,654 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 173 transitions. [2021-12-15 13:57:42,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-15 13:57:42,654 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:57:42,654 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:57:42,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-15 13:57:42,867 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,SelfDestructingSolverStorable27 [2021-12-15 13:57:42,867 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-15 13:57:42,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:57:42,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1072669446, now seen corresponding path program 4 times [2021-12-15 13:57:42,868 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:57:42,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147810519] [2021-12-15 13:57:42,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:57:42,868 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:57:42,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:43,242 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:43,242 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:57:43,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147810519] [2021-12-15 13:57:43,242 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147810519] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:57:43,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591358627] [2021-12-15 13:57:43,242 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-15 13:57:43,242 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:57:43,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:57:43,244 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 13:57:43,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-15 13:57:43,382 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-15 13:57:43,382 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 13:57:43,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 79 conjunts are in the unsatisfiable core [2021-12-15 13:57:43,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:57:43,399 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 13:57:43,399 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2021-12-15 13:57:43,532 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2021-12-15 13:57:43,572 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-15 13:57:43,572 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-15 13:57:43,608 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 13:57:43,613 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2021-12-15 13:57:43,695 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 8 [2021-12-15 13:57:43,794 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2021-12-15 13:57:43,885 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2021-12-15 13:57:43,940 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:57:43,950 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-15 13:57:43,958 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:43,958 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:57:44,007 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1360 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_1360) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |c_ULTIMATE.start_cstpncpy_~s~0#1.offset|) 0)) is different from false [2021-12-15 13:57:44,012 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1360 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_1360) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2021-12-15 13:57:44,022 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1360 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_1359) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_1360) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2021-12-15 13:57:44,028 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1360 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_1360) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 2)) 0)) is different from false [2021-12-15 13:57:44,034 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1358 (Array Int Int)) (v_ArrVal_1360 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_1358) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_1360) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 2)) 0)) is different from false [2021-12-15 13:57:44,039 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1358 (Array Int Int)) (v_ArrVal_1360 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_1358) |c_ULTIMATE.start_cstpncpy_#t~mem2#1.base| v_ArrVal_1360) |c_ULTIMATE.start_cstpncpy_~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~src#1.offset| 2)) 0)) is different from false [2021-12-15 13:57:44,043 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1358 (Array Int Int)) (v_ArrVal_1360 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_1358) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_cstpncpy_~#dst#1.base|) |c_ULTIMATE.start_cstpncpy_~#dst#1.offset|) v_ArrVal_1360) |c_ULTIMATE.start_cstpncpy_~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~src#1.offset| 2)) 0)) is different from false [2021-12-15 13:57:44,049 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1358 (Array Int Int)) (v_ArrVal_1360 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_1358) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_cstpncpy_~#dst#1.base|) |c_ULTIMATE.start_cstpncpy_~#dst#1.offset|) v_ArrVal_1360) |c_ULTIMATE.start_cstpncpy_#in~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_#in~src#1.offset| 2)) 0)) is different from false [2021-12-15 13:57:44,053 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1358 (Array Int Int)) (v_ArrVal_1360 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_1358) |c_ULTIMATE.start_cstpncpy_#in~dst#1.base| v_ArrVal_1360) |c_ULTIMATE.start_cstpncpy_#in~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_#in~src#1.offset| 2)) 0)) is different from false [2021-12-15 13:57:44,061 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1358 (Array Int Int)) (|v_ULTIMATE.start_cstpncpy_~#dst#1.base_31| Int) (v_ArrVal_1360 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |v_ULTIMATE.start_cstpncpy_~#dst#1.base_31| v_ArrVal_1358) |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1360) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |c_ULTIMATE.start_main_~nondetString~0#1.offset| 2)) 0) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_cstpncpy_~#dst#1.base_31|))))) is different from false [2021-12-15 13:57:44,067 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:57:44,067 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 26 treesize of output 27 [2021-12-15 13:57:44,072 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:57:44,072 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 71 treesize of output 71 [2021-12-15 13:57:44,074 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 54 treesize of output 46 [2021-12-15 13:57:44,077 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2021-12-15 13:57:44,468 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2021-12-15 13:57:44,468 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591358627] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:57:44,468 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:57:44,468 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20, 20] total 51 [2021-12-15 13:57:44,468 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743322818] [2021-12-15 13:57:44,468 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:57:44,469 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2021-12-15 13:57:44,469 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:57:44,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2021-12-15 13:57:44,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1524, Unknown=10, NotChecked=870, Total=2550 [2021-12-15 13:57:44,470 INFO L87 Difference]: Start difference. First operand 155 states and 173 transitions. Second operand has 51 states, 51 states have (on average 1.9215686274509804) internal successors, (98), 51 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:44,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:57:44,874 INFO L93 Difference]: Finished difference Result 227 states and 248 transitions. [2021-12-15 13:57:44,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-15 13:57:44,874 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 1.9215686274509804) internal successors, (98), 51 states have internal predecessors, (98), 0 states have call successors, (0), 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 44 [2021-12-15 13:57:44,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:57:44,875 INFO L225 Difference]: With dead ends: 227 [2021-12-15 13:57:44,875 INFO L226 Difference]: Without dead ends: 227 [2021-12-15 13:57:44,876 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 57 SyntacticMatches, 9 SemanticMatches, 57 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 478 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=209, Invalid=2171, Unknown=12, NotChecked=1030, Total=3422 [2021-12-15 13:57:44,876 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 66 mSDsluCounter, 896 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 938 SdHoareTripleChecker+Invalid, 1699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1241 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 13:57:44,876 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 938 Invalid, 1699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 443 Invalid, 0 Unknown, 1241 Unchecked, 0.2s Time] [2021-12-15 13:57:44,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2021-12-15 13:57:44,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 185. [2021-12-15 13:57:44,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 182 states have (on average 1.1318681318681318) internal successors, (206), 184 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:44,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 206 transitions. [2021-12-15 13:57:44,879 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 206 transitions. Word has length 44 [2021-12-15 13:57:44,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:57:44,879 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 206 transitions. [2021-12-15 13:57:44,880 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 1.9215686274509804) internal successors, (98), 51 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:44,880 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 206 transitions. [2021-12-15 13:57:44,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-12-15 13:57:44,880 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:57:44,880 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:57:44,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-15 13:57:45,095 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,SelfDestructingSolverStorable28 [2021-12-15 13:57:45,096 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-15 13:57:45,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:57:45,096 INFO L85 PathProgramCache]: Analyzing trace with hash 682791063, now seen corresponding path program 5 times [2021-12-15 13:57:45,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:57:45,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016850440] [2021-12-15 13:57:45,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:57:45,097 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:57:45,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:45,265 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 1 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:45,265 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:57:45,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016850440] [2021-12-15 13:57:45,265 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016850440] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:57:45,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401388434] [2021-12-15 13:57:45,265 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-15 13:57:45,265 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:57:45,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:57:45,280 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 13:57:45,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-15 13:57:45,604 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2021-12-15 13:57:45,604 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 13:57:45,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 54 conjunts are in the unsatisfiable core [2021-12-15 13:57:45,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:57:45,629 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-15 13:57:45,629 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2021-12-15 13:57:45,638 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-15 13:57:45,639 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2021-12-15 13:57:45,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 13:57:45,822 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2021-12-15 13:57:45,826 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-15 13:57:45,827 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-15 13:57:46,089 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:46,089 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:57:46,574 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 15 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:46,574 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401388434] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:57:46,574 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:57:46,575 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 13] total 40 [2021-12-15 13:57:46,575 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792727061] [2021-12-15 13:57:46,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:57:46,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2021-12-15 13:57:46,575 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:57:46,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-12-15 13:57:46,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1473, Unknown=0, NotChecked=0, Total=1640 [2021-12-15 13:57:46,576 INFO L87 Difference]: Start difference. First operand 185 states and 206 transitions. Second operand has 41 states, 40 states have (on average 3.4) internal successors, (136), 41 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:47,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:57:47,496 INFO L93 Difference]: Finished difference Result 376 states and 396 transitions. [2021-12-15 13:57:47,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-15 13:57:47,497 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 3.4) internal successors, (136), 41 states have internal predecessors, (136), 0 states have call successors, (0), 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 48 [2021-12-15 13:57:47,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:57:47,498 INFO L225 Difference]: With dead ends: 376 [2021-12-15 13:57:47,498 INFO L226 Difference]: Without dead ends: 376 [2021-12-15 13:57:47,498 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 573 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=515, Invalid=2565, Unknown=0, NotChecked=0, Total=3080 [2021-12-15 13:57:47,499 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 574 mSDsluCounter, 894 mSDsCounter, 0 mSdLazyCounter, 1318 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 574 SdHoareTripleChecker+Valid, 961 SdHoareTripleChecker+Invalid, 1460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-15 13:57:47,499 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [574 Valid, 961 Invalid, 1460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1318 Invalid, 0 Unknown, 95 Unchecked, 0.5s Time] [2021-12-15 13:57:47,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2021-12-15 13:57:47,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 185. [2021-12-15 13:57:47,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 182 states have (on average 1.1263736263736264) internal successors, (205), 184 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:47,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 205 transitions. [2021-12-15 13:57:47,505 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 205 transitions. Word has length 48 [2021-12-15 13:57:47,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:57:47,505 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 205 transitions. [2021-12-15 13:57:47,505 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 3.4) internal successors, (136), 41 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:47,505 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 205 transitions. [2021-12-15 13:57:47,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-12-15 13:57:47,506 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:57:47,506 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:57:47,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-12-15 13:57:47,723 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:57:47,723 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-15 13:57:47,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:57:47,724 INFO L85 PathProgramCache]: Analyzing trace with hash 337884900, now seen corresponding path program 2 times [2021-12-15 13:57:47,724 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:57:47,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245389335] [2021-12-15 13:57:47,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:57:47,724 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:57:47,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:48,118 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-15 13:57:48,118 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:57:48,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245389335] [2021-12-15 13:57:48,118 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245389335] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:57:48,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1978809239] [2021-12-15 13:57:48,119 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 13:57:48,119 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:57:48,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:57:48,136 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 13:57:48,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-15 13:57:48,382 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 13:57:48,383 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 13:57:48,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 98 conjunts are in the unsatisfiable core [2021-12-15 13:57:48,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:57:48,404 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-15 13:57:48,405 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2021-12-15 13:57:48,416 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 13:57:48,416 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2021-12-15 13:57:48,595 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-12-15 13:57:48,595 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2021-12-15 13:57:48,603 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2021-12-15 13:57:48,640 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 13:57:48,644 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 13:57:48,775 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 42 treesize of output 22 [2021-12-15 13:57:48,778 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-15 13:57:49,325 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 13:57:49,442 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-15 13:57:49,442 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:57:50,621 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-15 13:57:50,621 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1978809239] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:57:50,622 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:57:50,622 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18, 18] total 55 [2021-12-15 13:57:50,622 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299791815] [2021-12-15 13:57:50,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:57:50,622 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2021-12-15 13:57:50,622 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:57:50,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2021-12-15 13:57:50,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=2829, Unknown=0, NotChecked=0, Total=3080 [2021-12-15 13:57:50,623 INFO L87 Difference]: Start difference. First operand 185 states and 205 transitions. Second operand has 56 states, 55 states have (on average 2.3636363636363638) internal successors, (130), 56 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:51,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:57:51,568 INFO L93 Difference]: Finished difference Result 208 states and 225 transitions. [2021-12-15 13:57:51,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-12-15 13:57:51,569 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 2.3636363636363638) internal successors, (130), 56 states have internal predecessors, (130), 0 states have call successors, (0), 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:57:51,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:57:51,570 INFO L225 Difference]: With dead ends: 208 [2021-12-15 13:57:51,570 INFO L226 Difference]: Without dead ends: 178 [2021-12-15 13:57:51,570 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1351 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=469, Invalid=5081, Unknown=0, NotChecked=0, Total=5550 [2021-12-15 13:57:51,571 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 97 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 138 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 13:57:51,571 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 545 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 317 Invalid, 0 Unknown, 138 Unchecked, 0.2s Time] [2021-12-15 13:57:51,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2021-12-15 13:57:51,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 171. [2021-12-15 13:57:51,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 168 states have (on average 1.0952380952380953) internal successors, (184), 170 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:51,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 184 transitions. [2021-12-15 13:57:51,579 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 184 transitions. Word has length 54 [2021-12-15 13:57:51,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:57:51,579 INFO L470 AbstractCegarLoop]: Abstraction has 171 states and 184 transitions. [2021-12-15 13:57:51,581 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 2.3636363636363638) internal successors, (130), 56 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:51,581 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 184 transitions. [2021-12-15 13:57:51,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-12-15 13:57:51,582 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:57:51,582 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:57:51,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-12-15 13:57:51,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:57:51,807 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-15 13:57:51,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:57:51,808 INFO L85 PathProgramCache]: Analyzing trace with hash 358907032, now seen corresponding path program 6 times [2021-12-15 13:57:51,808 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:57:51,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464720291] [2021-12-15 13:57:51,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:57:51,808 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:57:51,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:52,324 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 14 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:52,325 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:57:52,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464720291] [2021-12-15 13:57:52,325 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464720291] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:57:52,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1443355413] [2021-12-15 13:57:52,325 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-15 13:57:52,325 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:57:52,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:57:52,327 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 13:57:52,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-15 13:57:52,673 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2021-12-15 13:57:52,673 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 13:57:52,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 127 conjunts are in the unsatisfiable core [2021-12-15 13:57:52,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:57:52,692 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-12-15 13:57:52,919 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2021-12-15 13:57:52,963 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-15 13:57:52,963 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-15 13:57:53,002 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-15 13:57:53,007 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 13:57:53,012 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 11 treesize of output 7 [2021-12-15 13:57:53,099 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 8 [2021-12-15 13:57:53,100 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2021-12-15 13:57:53,185 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-15 13:57:53,288 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-15 13:57:53,429 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-15 13:57:53,586 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-15 13:57:53,712 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 13:57:53,713 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:57:53,714 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:57:53,722 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 14 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:53,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:57:53,760 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1790 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_1790) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |c_ULTIMATE.start_cstpncpy_~s~0#1.offset|) 0)) is different from false [2021-12-15 13:57:53,769 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1790 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_1790) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2021-12-15 13:57:53,779 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1789 (Array Int Int)) (v_ArrVal_1790 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_1789) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_1790) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2021-12-15 13:57:53,786 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1790 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_1790) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 2)) 0)) is different from false [2021-12-15 13:57:53,797 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1788 (Array Int Int)) (v_ArrVal_1790 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_1788) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_1790) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 2)) 0)) is different from false [2021-12-15 13:57:53,803 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1790 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_1790) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 3)) 0)) is different from false [2021-12-15 13:57:53,809 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1787 (Array Int Int)) (v_ArrVal_1790 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_1787) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_1790) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 3)) 0)) is different from false [2021-12-15 13:57:53,816 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1787 (Array Int Int)) (v_ArrVal_1790 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_1787) |c_ULTIMATE.start_cstpncpy_#t~mem2#1.base| v_ArrVal_1790) |c_ULTIMATE.start_cstpncpy_~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~src#1.offset| 3)) 0)) is different from false [2021-12-15 13:57:53,820 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1787 (Array Int Int)) (v_ArrVal_1790 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_1787) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_cstpncpy_~#dst#1.base|) |c_ULTIMATE.start_cstpncpy_~#dst#1.offset|) v_ArrVal_1790) |c_ULTIMATE.start_cstpncpy_~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~src#1.offset| 3)) 0)) is different from false [2021-12-15 13:57:53,826 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1787 (Array Int Int)) (v_ArrVal_1790 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_1787) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_cstpncpy_~#dst#1.base|) |c_ULTIMATE.start_cstpncpy_~#dst#1.offset|) v_ArrVal_1790) |c_ULTIMATE.start_cstpncpy_#in~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_#in~src#1.offset| 3)) 0)) is different from false [2021-12-15 13:57:53,831 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1787 (Array Int Int)) (v_ArrVal_1790 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_1787) |c_ULTIMATE.start_cstpncpy_#in~dst#1.base| v_ArrVal_1790) |c_ULTIMATE.start_cstpncpy_#in~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_#in~src#1.offset| 3)) 0)) is different from false [2021-12-15 13:57:53,908 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:57:53,908 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 26 treesize of output 27 [2021-12-15 13:57:53,913 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 13:57:53,917 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:57:53,917 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2021-12-15 13:57:53,920 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 13:57:53,926 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-15 13:57:53,926 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2021-12-15 13:57:54,232 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 14 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 29 not checked. [2021-12-15 13:57:54,232 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1443355413] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:57:54,232 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:57:54,232 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 23, 23] total 65 [2021-12-15 13:57:54,232 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443284137] [2021-12-15 13:57:54,232 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:57:54,233 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2021-12-15 13:57:54,233 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:57:54,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2021-12-15 13:57:54,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=2710, Unknown=11, NotChecked=1254, Total=4160 [2021-12-15 13:57:54,235 INFO L87 Difference]: Start difference. First operand 171 states and 184 transitions. Second operand has 65 states, 65 states have (on average 2.1076923076923078) internal successors, (137), 65 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:55,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:57:55,598 INFO L93 Difference]: Finished difference Result 327 states and 343 transitions. [2021-12-15 13:57:55,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-12-15 13:57:55,599 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 2.1076923076923078) internal successors, (137), 65 states have internal predecessors, (137), 0 states have call successors, (0), 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:57:55,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:57:55,600 INFO L225 Difference]: With dead ends: 327 [2021-12-15 13:57:55,600 INFO L226 Difference]: Without dead ends: 321 [2021-12-15 13:57:55,600 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 69 SyntacticMatches, 5 SemanticMatches, 82 ConstructedPredicates, 11 IntricatePredicates, 6 DeprecatedPredicates, 1153 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=336, Invalid=4953, Unknown=11, NotChecked=1672, Total=6972 [2021-12-15 13:57:55,601 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 217 mSDsluCounter, 1607 mSDsCounter, 0 mSdLazyCounter, 941 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 1668 SdHoareTripleChecker+Invalid, 2568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 941 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1606 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-15 13:57:55,601 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [217 Valid, 1668 Invalid, 2568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 941 Invalid, 0 Unknown, 1606 Unchecked, 0.4s Time] [2021-12-15 13:57:55,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2021-12-15 13:57:55,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 175. [2021-12-15 13:57:55,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 172 states have (on average 1.0988372093023255) internal successors, (189), 174 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:55,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 189 transitions. [2021-12-15 13:57:55,604 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 189 transitions. Word has length 54 [2021-12-15 13:57:55,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:57:55,605 INFO L470 AbstractCegarLoop]: Abstraction has 175 states and 189 transitions. [2021-12-15 13:57:55,605 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 2.1076923076923078) internal successors, (137), 65 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:55,605 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 189 transitions. [2021-12-15 13:57:55,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-12-15 13:57:55,605 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:57:55,605 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:57:55,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-12-15 13:57:55,815 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,SelfDestructingSolverStorable31 [2021-12-15 13:57:55,815 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-15 13:57:55,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:57:55,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1742365772, now seen corresponding path program 3 times [2021-12-15 13:57:55,816 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:57:55,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850394327] [2021-12-15 13:57:55,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:57:55,816 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:57:55,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:56,433 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 78 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:56,434 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:57:56,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850394327] [2021-12-15 13:57:56,434 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850394327] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:57:56,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229605693] [2021-12-15 13:57:56,434 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-15 13:57:56,434 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:57:56,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:57:56,435 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 13:57:56,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-15 13:57:57,671 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2021-12-15 13:57:57,671 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 13:57:57,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 145 conjunts are in the unsatisfiable core [2021-12-15 13:57:57,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:57:57,694 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 13:57:57,694 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2021-12-15 13:57:57,699 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-12-15 13:57:57,787 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-12-15 13:57:57,787 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-12-15 13:57:57,791 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2021-12-15 13:57:57,822 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 13:57:57,825 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 11 treesize of output 7 [2021-12-15 13:57:57,895 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 25 treesize of output 13 [2021-12-15 13:57:57,898 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2021-12-15 13:57:58,583 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:58,583 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:58:00,104 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:58:00,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229605693] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:58:00,104 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:58:00,104 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 28, 28] total 84 [2021-12-15 13:58:00,105 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227195683] [2021-12-15 13:58:00,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:58:00,106 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2021-12-15 13:58:00,106 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:58:00,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2021-12-15 13:58:00,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=657, Invalid=6483, Unknown=0, NotChecked=0, Total=7140 [2021-12-15 13:58:00,108 INFO L87 Difference]: Start difference. First operand 175 states and 189 transitions. Second operand has 85 states, 84 states have (on average 1.9047619047619047) internal successors, (160), 85 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:58:03,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:58:03,009 INFO L93 Difference]: Finished difference Result 213 states and 225 transitions. [2021-12-15 13:58:03,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2021-12-15 13:58:03,010 INFO L78 Accepts]: Start accepts. Automaton has has 85 states, 84 states have (on average 1.9047619047619047) internal successors, (160), 85 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 56 [2021-12-15 13:58:03,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:58:03,010 INFO L225 Difference]: With dead ends: 213 [2021-12-15 13:58:03,010 INFO L226 Difference]: Without dead ends: 101 [2021-12-15 13:58:03,030 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6168 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1995, Invalid=19175, Unknown=0, NotChecked=0, Total=21170 [2021-12-15 13:58:03,032 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 484 mSDsluCounter, 1211 mSDsCounter, 0 mSdLazyCounter, 2564 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 1250 SdHoareTripleChecker+Invalid, 2919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 2564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 100 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-15 13:58:03,032 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [484 Valid, 1250 Invalid, 2919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 2564 Invalid, 0 Unknown, 100 Unchecked, 1.0s Time] [2021-12-15 13:58:03,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-12-15 13:58:03,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 73. [2021-12-15 13:58:03,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 71 states have (on average 1.0704225352112675) internal successors, (76), 72 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:58:03,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2021-12-15 13:58:03,034 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 56 [2021-12-15 13:58:03,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:58:03,034 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2021-12-15 13:58:03,034 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 85 states, 84 states have (on average 1.9047619047619047) internal successors, (160), 85 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:58:03,034 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2021-12-15 13:58:03,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-15 13:58:03,036 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:58:03,036 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:58:03,055 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:58:03,236 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:58:03,237 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-15 13:58:03,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:58:03,237 INFO L85 PathProgramCache]: Analyzing trace with hash 2070188021, now seen corresponding path program 7 times [2021-12-15 13:58:03,237 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:58:03,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261161944] [2021-12-15 13:58:03,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:58:03,237 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:58:03,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:58:03,447 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 6 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:58:03,447 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:58:03,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261161944] [2021-12-15 13:58:03,447 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261161944] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:58:03,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1831393653] [2021-12-15 13:58:03,447 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-12-15 13:58:03,447 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:58:03,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:58:03,448 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:58:03,450 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:58:03,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:58:03,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 59 conjunts are in the unsatisfiable core [2021-12-15 13:58:03,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:58:03,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 13:58:03,786 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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:58:03,791 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-15 13:58:03,791 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-15 13:58:03,991 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 15 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:58:03,991 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:58:04,211 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 27 treesize of output 23 [2021-12-15 13:58:04,502 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-15 13:58:04,503 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2021-12-15 13:58:04,507 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 10 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:58:04,507 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1831393653] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:58:04,507 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:58:04,507 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 44 [2021-12-15 13:58:04,507 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004220684] [2021-12-15 13:58:04,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:58:04,508 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2021-12-15 13:58:04,508 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:58:04,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-12-15 13:58:04,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1793, Unknown=0, NotChecked=0, Total=1980 [2021-12-15 13:58:04,508 INFO L87 Difference]: Start difference. First operand 73 states and 76 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:58:04,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:58:04,921 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2021-12-15 13:58:04,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-15 13:58:04,923 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 58 [2021-12-15 13:58:04,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:58:04,923 INFO L225 Difference]: With dead ends: 73 [2021-12-15 13:58:04,923 INFO L226 Difference]: Without dead ends: 73 [2021-12-15 13:58:04,927 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=562, Invalid=2978, Unknown=0, NotChecked=0, Total=3540 [2021-12-15 13:58:04,927 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 283 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 99 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 13:58:04,927 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [283 Valid, 324 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 549 Invalid, 0 Unknown, 99 Unchecked, 0.2s Time] [2021-12-15 13:58:04,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-12-15 13:58:04,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2021-12-15 13:58:04,942 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:58:04,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2021-12-15 13:58:04,943 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 58 [2021-12-15 13:58:04,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:58:04,943 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2021-12-15 13:58:04,944 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:58:04,944 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2021-12-15 13:58:04,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-12-15 13:58:04,946 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:58:04,946 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:58:04,966 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:58:05,151 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:58:05,151 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-15 13:58:05,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:58:05,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1595605642, now seen corresponding path program 8 times [2021-12-15 13:58:05,152 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:58:05,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426752181] [2021-12-15 13:58:05,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:58:05,152 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:58:05,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:58:05,993 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 18 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:58:05,993 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:58:05,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426752181] [2021-12-15 13:58:05,993 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426752181] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:58:05,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356938037] [2021-12-15 13:58:05,993 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 13:58:05,993 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:58:05,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:58:05,995 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:58:05,996 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:58:06,185 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 13:58:06,186 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 13:58:06,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 107 conjunts are in the unsatisfiable core [2021-12-15 13:58:06,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:58:06,200 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-12-15 13:58:06,484 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2021-12-15 13:58:06,553 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-15 13:58:06,553 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-15 13:58:06,604 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2021-12-15 13:58:06,621 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 13:58:06,763 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 8 [2021-12-15 13:58:06,925 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2021-12-15 13:58:07,200 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2021-12-15 13:58:07,395 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2021-12-15 13:58:07,584 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2021-12-15 13:58:07,780 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2021-12-15 13:58:07,969 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 13:58:07,971 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:58:07,971 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 10 [2021-12-15 13:58:07,979 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 18 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:58:07,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:58:08,014 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2287 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_2287) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |c_ULTIMATE.start_cstpncpy_~s~0#1.offset|) 0)) is different from false [2021-12-15 13:58:08,019 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2287 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2287) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2021-12-15 13:58:08,027 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2287 (Array Int Int)) (v_ArrVal_2286 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_2286) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2287) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2021-12-15 13:58:08,033 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2287 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2287) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 2)) 0)) is different from false [2021-12-15 13:58:08,042 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2287 (Array Int Int)) (v_ArrVal_2285 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_2285) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2287) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 2)) 0)) is different from false [2021-12-15 13:58:08,049 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2287 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2287) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 3)) 0)) is different from false [2021-12-15 13:58:08,058 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2287 (Array Int Int)) (v_ArrVal_2284 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_2284) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2287) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 3)) 0)) is different from false [2021-12-15 13:58:08,114 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2287 (Array Int Int)) (|v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_102| Int)) (or (< |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_102| 0) (< |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_102|) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2287) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_102| 4)) 0))) is different from false [2021-12-15 13:58:08,130 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2287 (Array Int Int)) (|v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_102| Int) (v_ArrVal_2283 (Array Int Int))) (or (< |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_102| 0) (< |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_102|) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_2283) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2287) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_102| 4)) 0))) is different from false [2021-12-15 13:58:08,154 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2287 (Array Int Int)) (|v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_102| Int) (v_ArrVal_2283 (Array Int Int))) (or (< |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_102| 0) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_2283) |c_ULTIMATE.start_cstpncpy_#t~mem2#1.base| v_ArrVal_2287) |c_ULTIMATE.start_cstpncpy_~src#1.base|) (+ |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_102| 4)) 0) (< |c_ULTIMATE.start_cstpncpy_~src#1.offset| |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_102|))) is different from false [2021-12-15 13:58:08,167 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2287 (Array Int Int)) (|v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_102| Int) (v_ArrVal_2283 (Array Int Int))) (or (< |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_102| 0) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_2283) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_cstpncpy_~#dst#1.base|) |c_ULTIMATE.start_cstpncpy_~#dst#1.offset|) v_ArrVal_2287) |c_ULTIMATE.start_cstpncpy_~src#1.base|) (+ |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_102| 4)) 0) (< |c_ULTIMATE.start_cstpncpy_~src#1.offset| |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_102|))) is different from false [2021-12-15 13:58:08,207 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2287 (Array Int Int)) (|v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_102| Int) (v_ArrVal_2283 (Array Int Int))) (or (< |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_102| 0) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_2283) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_cstpncpy_~#dst#1.base|) |c_ULTIMATE.start_cstpncpy_~#dst#1.offset|) v_ArrVal_2287) |c_ULTIMATE.start_cstpncpy_#in~src#1.base|) (+ |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_102| 4)) 0) (< |c_ULTIMATE.start_cstpncpy_#in~src#1.offset| |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_102|))) is different from false [2021-12-15 13:58:08,218 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2287 (Array Int Int)) (|v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_102| Int) (v_ArrVal_2283 (Array Int Int))) (or (< |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_102| 0) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_2283) |c_ULTIMATE.start_cstpncpy_#in~dst#1.base| v_ArrVal_2287) |c_ULTIMATE.start_cstpncpy_#in~src#1.base|) (+ |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_102| 4)) 0) (< |c_ULTIMATE.start_cstpncpy_#in~src#1.offset| |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_102|))) is different from false [2021-12-15 13:58:08,308 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:58:08,309 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 26 treesize of output 27 [2021-12-15 13:58:08,310 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 13:58:08,314 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:58:08,315 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2021-12-15 13:58:08,317 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 13:58:08,324 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-15 13:58:08,324 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2021-12-15 13:58:08,764 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 50 not checked. [2021-12-15 13:58:08,764 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [356938037] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:58:08,765 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:58:08,765 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 27, 27] total 77 [2021-12-15 13:58:08,765 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879119555] [2021-12-15 13:58:08,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:58:08,765 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2021-12-15 13:58:08,765 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:58:08,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2021-12-15 13:58:08,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=3868, Unknown=13, NotChecked=1768, Total=5852 [2021-12-15 13:58:08,766 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand has 77 states, 77 states have (on average 2.168831168831169) internal successors, (167), 77 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:58:10,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:58:10,054 INFO L93 Difference]: Finished difference Result 118 states and 120 transitions. [2021-12-15 13:58:10,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-12-15 13:58:10,055 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 77 states have (on average 2.168831168831169) internal successors, (167), 77 states have internal predecessors, (167), 0 states have call successors, (0), 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 64 [2021-12-15 13:58:10,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:58:10,055 INFO L225 Difference]: With dead ends: 118 [2021-12-15 13:58:10,055 INFO L226 Difference]: Without dead ends: 80 [2021-12-15 13:58:10,056 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 81 SyntacticMatches, 4 SemanticMatches, 100 ConstructedPredicates, 13 IntricatePredicates, 3 DeprecatedPredicates, 1448 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=379, Invalid=7491, Unknown=14, NotChecked=2418, Total=10302 [2021-12-15 13:58:10,056 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 44 mSDsluCounter, 1285 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 1310 SdHoareTripleChecker+Invalid, 1601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 991 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 13:58:10,056 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 1310 Invalid, 1601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 600 Invalid, 0 Unknown, 991 Unchecked, 0.2s Time] [2021-12-15 13:58:10,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-12-15 13:58:10,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2021-12-15 13:58:10,058 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:58:10,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 79 transitions. [2021-12-15 13:58:10,058 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 79 transitions. Word has length 64 [2021-12-15 13:58:10,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:58:10,058 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 79 transitions. [2021-12-15 13:58:10,058 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 77 states have (on average 2.168831168831169) internal successors, (167), 77 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:58:10,058 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 79 transitions. [2021-12-15 13:58:10,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-12-15 13:58:10,059 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:58:10,059 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:58:10,077 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:58:10,277 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2021-12-15 13:58:10,277 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-15 13:58:10,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:58:10,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1757527917, now seen corresponding path program 9 times [2021-12-15 13:58:10,278 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:58:10,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856414275] [2021-12-15 13:58:10,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:58:10,278 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:58:10,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:58:10,582 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 15 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:58:10,582 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:58:10,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856414275] [2021-12-15 13:58:10,582 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856414275] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:58:10,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899402736] [2021-12-15 13:58:10,582 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-15 13:58:10,582 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:58:10,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:58:10,583 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:58:10,584 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:58:11,516 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2021-12-15 13:58:11,516 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 13:58:11,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 63 conjunts are in the unsatisfiable core [2021-12-15 13:58:11,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:58:11,540 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-15 13:58:11,540 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:58:11,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 13:58:11,787 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2021-12-15 13:58:11,791 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-15 13:58:11,791 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-15 13:58:12,145 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 28 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:58:12,145 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:58:12,624 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-15 13:58:12,624 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2021-12-15 13:58:13,002 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 45 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:58:13,003 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899402736] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:58:13,003 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:58:13,003 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 18] total 54 [2021-12-15 13:58:13,003 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238663947] [2021-12-15 13:58:13,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:58:13,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2021-12-15 13:58:13,004 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:58:13,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2021-12-15 13:58:13,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=2700, Unknown=0, NotChecked=0, Total=2970 [2021-12-15 13:58:13,005 INFO L87 Difference]: Start difference. First operand 77 states and 79 transitions. Second operand has 55 states, 54 states have (on average 3.6296296296296298) internal successors, (196), 55 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:58:13,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:58:13,832 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2021-12-15 13:58:13,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-15 13:58:13,833 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 3.6296296296296298) internal successors, (196), 55 states have internal predecessors, (196), 0 states have call successors, (0), 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 68 [2021-12-15 13:58:13,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:58:13,833 INFO L225 Difference]: With dead ends: 78 [2021-12-15 13:58:13,833 INFO L226 Difference]: Without dead ends: 78 [2021-12-15 13:58:13,834 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 930 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=997, Invalid=4703, Unknown=0, NotChecked=0, Total=5700 [2021-12-15 13:58:13,834 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 556 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 13:58:13,835 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [556 Valid, 410 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 732 Invalid, 0 Unknown, 44 Unchecked, 0.2s Time] [2021-12-15 13:58:13,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-12-15 13:58:13,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2021-12-15 13:58:13,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 75 states have (on average 1.04) internal successors, (78), 76 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:58:13,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2021-12-15 13:58:13,837 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 68 [2021-12-15 13:58:13,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:58:13,837 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2021-12-15 13:58:13,845 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 3.6296296296296298) internal successors, (196), 55 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:58:13,846 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2021-12-15 13:58:13,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-12-15 13:58:13,846 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:58:13,846 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:58:13,868 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:58:14,060 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:58:14,060 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-15 13:58:14,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:58:14,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1529659500, now seen corresponding path program 10 times [2021-12-15 13:58:14,060 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:58:14,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063296973] [2021-12-15 13:58:14,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:58:14,060 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:58:14,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:58:15,217 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 22 proven. 125 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:58:15,218 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:58:15,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063296973] [2021-12-15 13:58:15,218 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063296973] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:58:15,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49083325] [2021-12-15 13:58:15,218 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-15 13:58:15,218 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:58:15,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:58:15,219 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:58:15,221 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:58:16,072 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-15 13:58:16,072 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 13:58:16,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 125 conjunts are in the unsatisfiable core [2021-12-15 13:58:16,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:58:16,088 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-12-15 13:58:16,484 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2021-12-15 13:58:16,543 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-15 13:58:16,543 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-15 13:58:16,622 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2021-12-15 13:58:16,629 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 13:58:16,750 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 8 [2021-12-15 13:58:16,899 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2021-12-15 13:58:17,068 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2021-12-15 13:58:17,235 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2021-12-15 13:58:17,395 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2021-12-15 13:58:17,554 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2021-12-15 13:58:17,712 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2021-12-15 13:58:17,767 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-15 13:58:17,776 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 22 proven. 125 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:58:17,776 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:58:17,810 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2655 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_2655) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |c_ULTIMATE.start_cstpncpy_~s~0#1.offset|) 0)) is different from false [2021-12-15 13:58:17,815 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2655 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2655) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2021-12-15 13:58:17,823 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2654 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_2654) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2655) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2021-12-15 13:58:17,828 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2655 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2655) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 2)) 0)) is different from false [2021-12-15 13:58:17,850 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2653 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_2653) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2655) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 2)) 0)) is different from false [2021-12-15 13:58:17,869 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2655 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2655) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 3)) 0)) is different from false [2021-12-15 13:58:17,877 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_2652) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2655) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 3)) 0)) is different from false [2021-12-15 13:58:17,883 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2655 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2655) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 4)) 0)) is different from false [2021-12-15 13:58:17,891 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2651 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_2651) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2655) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 4)) 0)) is different from false [2021-12-15 13:58:17,896 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2655 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2655) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 5)) 0)) is different from false [2021-12-15 13:58:17,901 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2650 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_2650) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2655) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 5)) 0)) is different from false [2021-12-15 13:58:17,905 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2650 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_2650) |c_ULTIMATE.start_cstpncpy_#t~mem2#1.base| v_ArrVal_2655) |c_ULTIMATE.start_cstpncpy_~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~src#1.offset| 5)) 0)) is different from false [2021-12-15 13:58:17,908 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2650 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_2650) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_cstpncpy_~#dst#1.base|) |c_ULTIMATE.start_cstpncpy_~#dst#1.offset|) v_ArrVal_2655) |c_ULTIMATE.start_cstpncpy_~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~src#1.offset| 5)) 0)) is different from false [2021-12-15 13:58:17,912 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2650 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_2650) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_cstpncpy_~#dst#1.base|) |c_ULTIMATE.start_cstpncpy_~#dst#1.offset|) v_ArrVal_2655) |c_ULTIMATE.start_cstpncpy_#in~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_#in~src#1.offset| 5)) 0)) is different from false [2021-12-15 13:58:17,915 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2650 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_2650) |c_ULTIMATE.start_cstpncpy_#in~dst#1.base| v_ArrVal_2655) |c_ULTIMATE.start_cstpncpy_#in~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_#in~src#1.offset| 5)) 0)) is different from false [2021-12-15 13:58:17,920 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2650 (Array Int Int)) (|v_ULTIMATE.start_cstpncpy_~#dst#1.base_39| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_cstpncpy_~#dst#1.base_39|))) (= (select (select (store (store |c_#memory_int| |v_ULTIMATE.start_cstpncpy_~#dst#1.base_39| v_ArrVal_2650) |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_2655) |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:58:17,924 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:58:17,924 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 26 treesize of output 27 [2021-12-15 13:58:17,932 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:58:17,932 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 71 treesize of output 71 [2021-12-15 13:58:17,935 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 28 treesize of output 24 [2021-12-15 13:58:17,937 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 50 treesize of output 42 [2021-12-15 13:58:18,554 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-15 13:58:18,554 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2021-12-15 13:58:18,578 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 22 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 79 not checked. [2021-12-15 13:58:18,578 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49083325] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:58:18,579 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:58:18,579 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 30, 30] total 84 [2021-12-15 13:58:18,579 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576389366] [2021-12-15 13:58:18,579 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:58:18,580 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2021-12-15 13:58:18,580 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:58:18,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2021-12-15 13:58:18,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=4384, Unknown=16, NotChecked=2352, Total=6972 [2021-12-15 13:58:18,582 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand has 84 states, 84 states have (on average 2.261904761904762) internal successors, (190), 84 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)