./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0521.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version ae007674 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/memsafety/test-0521.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 aa94cb741c9c7eaa2ca9bb871f44dd4c619faf21975944b61e221a61ad9730d7 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-28 05:50:17,778 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-28 05:50:17,780 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-28 05:50:17,809 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-28 05:50:17,809 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-28 05:50:17,812 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-28 05:50:17,813 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-28 05:50:17,816 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-28 05:50:17,818 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-28 05:50:17,821 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-28 05:50:17,822 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-28 05:50:17,825 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-28 05:50:17,825 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-28 05:50:17,827 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-28 05:50:17,828 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-28 05:50:17,830 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-28 05:50:17,831 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-28 05:50:17,831 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-28 05:50:17,833 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-28 05:50:17,837 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-28 05:50:17,838 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-28 05:50:17,839 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-28 05:50:17,840 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-28 05:50:17,841 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-28 05:50:17,845 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-28 05:50:17,846 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-28 05:50:17,846 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-28 05:50:17,847 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-28 05:50:17,847 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-28 05:50:17,853 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-28 05:50:17,853 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-28 05:50:17,854 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-28 05:50:17,855 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-28 05:50:17,855 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-28 05:50:17,856 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-28 05:50:17,856 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-28 05:50:17,857 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-28 05:50:17,857 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-28 05:50:17,857 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-28 05:50:17,858 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-28 05:50:17,859 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-28 05:50:17,862 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-28 05:50:17,890 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-28 05:50:17,891 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-28 05:50:17,891 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-28 05:50:17,892 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-28 05:50:17,892 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-28 05:50:17,892 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-28 05:50:17,893 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-28 05:50:17,894 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-28 05:50:17,894 INFO L138 SettingsManager]: * Use SBE=true [2021-12-28 05:50:17,894 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-28 05:50:17,894 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-28 05:50:17,895 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-28 05:50:17,895 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-28 05:50:17,895 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-28 05:50:17,895 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-28 05:50:17,895 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-28 05:50:17,895 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-28 05:50:17,895 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-28 05:50:17,896 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-28 05:50:17,896 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-28 05:50:17,896 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-28 05:50:17,896 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-28 05:50:17,896 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-28 05:50:17,896 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-28 05:50:17,896 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-28 05:50:17,897 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 05:50:17,897 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-28 05:50:17,897 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-28 05:50:17,897 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-28 05:50:17,897 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-28 05:50:17,897 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 -> aa94cb741c9c7eaa2ca9bb871f44dd4c619faf21975944b61e221a61ad9730d7 [2021-12-28 05:50:18,145 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-28 05:50:18,160 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-28 05:50:18,161 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-28 05:50:18,162 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-28 05:50:18,163 INFO L275 PluginConnector]: CDTParser initialized [2021-12-28 05:50:18,164 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0521.i [2021-12-28 05:50:18,206 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1af2a41f/d9715d141dee4c519dca234613e96718/FLAG55f6d830d [2021-12-28 05:50:18,580 INFO L306 CDTParser]: Found 1 translation units. [2021-12-28 05:50:18,583 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0521.i [2021-12-28 05:50:18,595 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1af2a41f/d9715d141dee4c519dca234613e96718/FLAG55f6d830d [2021-12-28 05:50:18,933 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1af2a41f/d9715d141dee4c519dca234613e96718 [2021-12-28 05:50:18,935 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-28 05:50:18,936 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-28 05:50:18,937 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-28 05:50:18,937 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-28 05:50:18,940 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-28 05:50:18,942 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 05:50:18" (1/1) ... [2021-12-28 05:50:18,944 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cd51b88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:50:18, skipping insertion in model container [2021-12-28 05:50:18,944 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 05:50:18" (1/1) ... [2021-12-28 05:50:18,948 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-28 05:50:18,982 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-28 05:50:19,189 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 05:50:19,194 INFO L203 MainTranslator]: Completed pre-run [2021-12-28 05:50:19,246 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 05:50:19,270 INFO L208 MainTranslator]: Completed translation [2021-12-28 05:50:19,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:50:19 WrapperNode [2021-12-28 05:50:19,270 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-28 05:50:19,271 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-28 05:50:19,271 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-28 05:50:19,271 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-28 05:50:19,276 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:50:19" (1/1) ... [2021-12-28 05:50:19,303 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:50:19" (1/1) ... [2021-12-28 05:50:19,335 INFO L137 Inliner]: procedures = 125, calls = 95, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 305 [2021-12-28 05:50:19,339 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-28 05:50:19,339 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-28 05:50:19,340 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-28 05:50:19,340 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-28 05:50:19,345 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:50:19" (1/1) ... [2021-12-28 05:50:19,345 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:50:19" (1/1) ... [2021-12-28 05:50:19,357 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:50:19" (1/1) ... [2021-12-28 05:50:19,360 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:50:19" (1/1) ... [2021-12-28 05:50:19,369 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:50:19" (1/1) ... [2021-12-28 05:50:19,386 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:50:19" (1/1) ... [2021-12-28 05:50:19,387 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:50:19" (1/1) ... [2021-12-28 05:50:19,389 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-28 05:50:19,390 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-28 05:50:19,390 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-28 05:50:19,390 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-28 05:50:19,390 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:50:19" (1/1) ... [2021-12-28 05:50:19,400 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 05:50:19,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:50:19,420 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-28 05:50:19,422 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-28 05:50:19,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-28 05:50:19,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-28 05:50:19,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-28 05:50:19,459 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-28 05:50:19,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-28 05:50:19,459 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-28 05:50:19,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-28 05:50:19,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-28 05:50:19,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-28 05:50:19,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-28 05:50:19,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-28 05:50:19,567 INFO L234 CfgBuilder]: Building ICFG [2021-12-28 05:50:19,568 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-28 05:50:20,129 INFO L275 CfgBuilder]: Performing block encoding [2021-12-28 05:50:20,136 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-28 05:50:20,137 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2021-12-28 05:50:20,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 05:50:20 BoogieIcfgContainer [2021-12-28 05:50:20,140 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-28 05:50:20,141 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-28 05:50:20,141 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-28 05:50:20,143 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-28 05:50:20,143 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 05:50:18" (1/3) ... [2021-12-28 05:50:20,144 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60bba8e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 05:50:20, skipping insertion in model container [2021-12-28 05:50:20,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:50:19" (2/3) ... [2021-12-28 05:50:20,144 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60bba8e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 05:50:20, skipping insertion in model container [2021-12-28 05:50:20,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 05:50:20" (3/3) ... [2021-12-28 05:50:20,146 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0521.i [2021-12-28 05:50:20,149 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-28 05:50:20,149 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 152 error locations. [2021-12-28 05:50:20,184 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-28 05:50:20,191 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-28 05:50:20,191 INFO L340 AbstractCegarLoop]: Starting to check reachability of 152 error locations. [2021-12-28 05:50:20,209 INFO L276 IsEmpty]: Start isEmpty. Operand has 313 states, 160 states have (on average 2.1875) internal successors, (350), 312 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:20,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-28 05:50:20,213 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:50:20,213 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-28 05:50:20,213 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2021-12-28 05:50:20,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:50:20,216 INFO L85 PathProgramCache]: Analyzing trace with hash 28729512, now seen corresponding path program 1 times [2021-12-28 05:50:20,227 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:50:20,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812410018] [2021-12-28 05:50:20,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:50:20,229 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:50:20,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:50:20,326 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-28 05:50:20,327 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:50:20,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812410018] [2021-12-28 05:50:20,328 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812410018] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:50:20,328 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:50:20,328 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 05:50:20,329 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400114389] [2021-12-28 05:50:20,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:50:20,332 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-28 05:50:20,333 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:50:20,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-28 05:50:20,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-28 05:50:20,355 INFO L87 Difference]: Start difference. First operand has 313 states, 160 states have (on average 2.1875) internal successors, (350), 312 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:20,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:50:20,394 INFO L93 Difference]: Finished difference Result 313 states and 340 transitions. [2021-12-28 05:50:20,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-28 05:50:20,395 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2021-12-28 05:50:20,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:50:20,408 INFO L225 Difference]: With dead ends: 313 [2021-12-28 05:50:20,409 INFO L226 Difference]: Without dead ends: 311 [2021-12-28 05:50:20,410 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-28 05:50:20,414 INFO L933 BasicCegarLoop]: 340 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 05:50:20,415 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 05:50:20,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2021-12-28 05:50:20,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2021-12-28 05:50:20,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 159 states have (on average 2.1257861635220126) internal successors, (338), 310 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:20,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 338 transitions. [2021-12-28 05:50:20,466 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 338 transitions. Word has length 5 [2021-12-28 05:50:20,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:50:20,467 INFO L470 AbstractCegarLoop]: Abstraction has 311 states and 338 transitions. [2021-12-28 05:50:20,467 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:20,467 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 338 transitions. [2021-12-28 05:50:20,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-28 05:50:20,467 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:50:20,467 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-28 05:50:20,468 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-28 05:50:20,468 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2021-12-28 05:50:20,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:50:20,469 INFO L85 PathProgramCache]: Analyzing trace with hash 889570248, now seen corresponding path program 1 times [2021-12-28 05:50:20,469 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:50:20,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751468758] [2021-12-28 05:50:20,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:50:20,470 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:50:20,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:50:20,527 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-28 05:50:20,527 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:50:20,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751468758] [2021-12-28 05:50:20,528 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751468758] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:50:20,528 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:50:20,528 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 05:50:20,528 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672408527] [2021-12-28 05:50:20,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:50:20,529 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 05:50:20,529 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:50:20,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 05:50:20,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:50:20,530 INFO L87 Difference]: Start difference. First operand 311 states and 338 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:20,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:50:20,737 INFO L93 Difference]: Finished difference Result 295 states and 322 transitions. [2021-12-28 05:50:20,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:50:20,738 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-12-28 05:50:20,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:50:20,739 INFO L225 Difference]: With dead ends: 295 [2021-12-28 05:50:20,739 INFO L226 Difference]: Without dead ends: 295 [2021-12-28 05:50:20,740 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-28 05:50:20,743 INFO L933 BasicCegarLoop]: 275 mSDtfsCounter, 77 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:50:20,744 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 406 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 05:50:20,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2021-12-28 05:50:20,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2021-12-28 05:50:20,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 159 states have (on average 2.0251572327044025) internal successors, (322), 294 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:20,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 322 transitions. [2021-12-28 05:50:20,749 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 322 transitions. Word has length 6 [2021-12-28 05:50:20,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:50:20,750 INFO L470 AbstractCegarLoop]: Abstraction has 295 states and 322 transitions. [2021-12-28 05:50:20,750 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:20,750 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 322 transitions. [2021-12-28 05:50:20,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-28 05:50:20,750 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:50:20,751 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-28 05:50:20,751 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-28 05:50:20,751 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2021-12-28 05:50:20,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:50:20,751 INFO L85 PathProgramCache]: Analyzing trace with hash 889570249, now seen corresponding path program 1 times [2021-12-28 05:50:20,752 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:50:20,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816067303] [2021-12-28 05:50:20,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:50:20,752 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:50:20,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:50:20,788 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-28 05:50:20,788 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:50:20,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816067303] [2021-12-28 05:50:20,789 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816067303] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:50:20,789 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:50:20,789 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 05:50:20,789 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825319478] [2021-12-28 05:50:20,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:50:20,790 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 05:50:20,790 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:50:20,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 05:50:20,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:50:20,790 INFO L87 Difference]: Start difference. First operand 295 states and 322 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:20,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:50:20,931 INFO L93 Difference]: Finished difference Result 279 states and 306 transitions. [2021-12-28 05:50:20,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:50:20,932 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-12-28 05:50:20,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:50:20,933 INFO L225 Difference]: With dead ends: 279 [2021-12-28 05:50:20,933 INFO L226 Difference]: Without dead ends: 279 [2021-12-28 05:50:20,933 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-28 05:50:20,934 INFO L933 BasicCegarLoop]: 275 mSDtfsCounter, 61 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:50:20,934 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 415 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:50:20,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2021-12-28 05:50:20,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2021-12-28 05:50:20,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 159 states have (on average 1.9245283018867925) internal successors, (306), 278 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:20,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 306 transitions. [2021-12-28 05:50:20,938 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 306 transitions. Word has length 6 [2021-12-28 05:50:20,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:50:20,938 INFO L470 AbstractCegarLoop]: Abstraction has 279 states and 306 transitions. [2021-12-28 05:50:20,938 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:20,939 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 306 transitions. [2021-12-28 05:50:20,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-28 05:50:20,939 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:50:20,939 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-28 05:50:20,939 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-28 05:50:20,939 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2021-12-28 05:50:20,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:50:20,940 INFO L85 PathProgramCache]: Analyzing trace with hash 889571339, now seen corresponding path program 1 times [2021-12-28 05:50:20,940 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:50:20,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073750448] [2021-12-28 05:50:20,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:50:20,941 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:50:20,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:50:20,957 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-28 05:50:20,957 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:50:20,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073750448] [2021-12-28 05:50:20,957 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073750448] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:50:20,958 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:50:20,958 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 05:50:20,958 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434944612] [2021-12-28 05:50:20,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:50:20,958 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 05:50:20,958 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:50:20,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 05:50:20,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:50:20,959 INFO L87 Difference]: Start difference. First operand 279 states and 306 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:21,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:50:21,111 INFO L93 Difference]: Finished difference Result 334 states and 370 transitions. [2021-12-28 05:50:21,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:50:21,112 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-12-28 05:50:21,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:50:21,113 INFO L225 Difference]: With dead ends: 334 [2021-12-28 05:50:21,113 INFO L226 Difference]: Without dead ends: 334 [2021-12-28 05:50:21,113 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-28 05:50:21,114 INFO L933 BasicCegarLoop]: 327 mSDtfsCounter, 76 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:50:21,114 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 481 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:50:21,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2021-12-28 05:50:21,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 277. [2021-12-28 05:50:21,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 159 states have (on average 1.9119496855345912) internal successors, (304), 276 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:21,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 304 transitions. [2021-12-28 05:50:21,118 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 304 transitions. Word has length 6 [2021-12-28 05:50:21,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:50:21,118 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 304 transitions. [2021-12-28 05:50:21,118 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:21,118 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 304 transitions. [2021-12-28 05:50:21,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-28 05:50:21,119 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:50:21,119 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-28 05:50:21,119 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-28 05:50:21,119 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2021-12-28 05:50:21,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:50:21,120 INFO L85 PathProgramCache]: Analyzing trace with hash 889571340, now seen corresponding path program 1 times [2021-12-28 05:50:21,120 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:50:21,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28867223] [2021-12-28 05:50:21,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:50:21,120 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:50:21,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:50:21,146 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-28 05:50:21,146 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:50:21,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28867223] [2021-12-28 05:50:21,147 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28867223] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:50:21,147 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:50:21,147 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 05:50:21,147 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596862634] [2021-12-28 05:50:21,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:50:21,148 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 05:50:21,148 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:50:21,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 05:50:21,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:50:21,149 INFO L87 Difference]: Start difference. First operand 277 states and 304 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:21,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:50:21,339 INFO L93 Difference]: Finished difference Result 466 states and 515 transitions. [2021-12-28 05:50:21,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:50:21,340 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-12-28 05:50:21,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:50:21,341 INFO L225 Difference]: With dead ends: 466 [2021-12-28 05:50:21,341 INFO L226 Difference]: Without dead ends: 466 [2021-12-28 05:50:21,341 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-28 05:50:21,342 INFO L933 BasicCegarLoop]: 415 mSDtfsCounter, 220 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:50:21,342 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [220 Valid, 579 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 05:50:21,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2021-12-28 05:50:21,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 275. [2021-12-28 05:50:21,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 159 states have (on average 1.89937106918239) internal successors, (302), 274 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:21,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 302 transitions. [2021-12-28 05:50:21,346 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 302 transitions. Word has length 6 [2021-12-28 05:50:21,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:50:21,347 INFO L470 AbstractCegarLoop]: Abstraction has 275 states and 302 transitions. [2021-12-28 05:50:21,347 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:21,347 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 302 transitions. [2021-12-28 05:50:21,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-28 05:50:21,347 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:50:21,347 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:50:21,348 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-28 05:50:21,348 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2021-12-28 05:50:21,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:50:21,348 INFO L85 PathProgramCache]: Analyzing trace with hash 178517033, now seen corresponding path program 1 times [2021-12-28 05:50:21,348 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:50:21,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199129277] [2021-12-28 05:50:21,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:50:21,349 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:50:21,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:50:21,379 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-28 05:50:21,379 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:50:21,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199129277] [2021-12-28 05:50:21,379 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199129277] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:50:21,379 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:50:21,379 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 05:50:21,380 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539759506] [2021-12-28 05:50:21,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:50:21,380 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 05:50:21,380 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:50:21,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 05:50:21,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-28 05:50:21,381 INFO L87 Difference]: Start difference. First operand 275 states and 302 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:21,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:50:21,416 INFO L93 Difference]: Finished difference Result 678 states and 747 transitions. [2021-12-28 05:50:21,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 05:50:21,416 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2021-12-28 05:50:21,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:50:21,418 INFO L225 Difference]: With dead ends: 678 [2021-12-28 05:50:21,418 INFO L226 Difference]: Without dead ends: 678 [2021-12-28 05:50:21,418 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:50:21,419 INFO L933 BasicCegarLoop]: 297 mSDtfsCounter, 597 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 05:50:21,419 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [597 Valid, 870 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 05:50:21,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2021-12-28 05:50:21,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 280. [2021-12-28 05:50:21,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 164 states have (on average 1.8780487804878048) internal successors, (308), 279 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:21,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 308 transitions. [2021-12-28 05:50:21,424 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 308 transitions. Word has length 8 [2021-12-28 05:50:21,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:50:21,425 INFO L470 AbstractCegarLoop]: Abstraction has 280 states and 308 transitions. [2021-12-28 05:50:21,425 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:21,425 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 308 transitions. [2021-12-28 05:50:21,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-28 05:50:21,425 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:50:21,425 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:50:21,426 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-28 05:50:21,426 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2021-12-28 05:50:21,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:50:21,426 INFO L85 PathProgramCache]: Analyzing trace with hash -2119660206, now seen corresponding path program 1 times [2021-12-28 05:50:21,426 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:50:21,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63127018] [2021-12-28 05:50:21,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:50:21,427 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:50:21,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:50:21,455 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-28 05:50:21,455 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:50:21,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63127018] [2021-12-28 05:50:21,455 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63127018] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:50:21,456 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:50:21,456 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 05:50:21,456 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384461286] [2021-12-28 05:50:21,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:50:21,456 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 05:50:21,456 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:50:21,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 05:50:21,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:50:21,457 INFO L87 Difference]: Start difference. First operand 280 states and 308 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:21,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:50:21,599 INFO L93 Difference]: Finished difference Result 330 states and 365 transitions. [2021-12-28 05:50:21,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:50:21,599 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-28 05:50:21,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:50:21,600 INFO L225 Difference]: With dead ends: 330 [2021-12-28 05:50:21,600 INFO L226 Difference]: Without dead ends: 330 [2021-12-28 05:50:21,601 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-28 05:50:21,601 INFO L933 BasicCegarLoop]: 323 mSDtfsCounter, 72 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:50:21,601 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 476 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:50:21,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2021-12-28 05:50:21,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 278. [2021-12-28 05:50:21,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 164 states have (on average 1.8658536585365855) internal successors, (306), 277 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:21,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 306 transitions. [2021-12-28 05:50:21,604 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 306 transitions. Word has length 11 [2021-12-28 05:50:21,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:50:21,605 INFO L470 AbstractCegarLoop]: Abstraction has 278 states and 306 transitions. [2021-12-28 05:50:21,605 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:21,605 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 306 transitions. [2021-12-28 05:50:21,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-28 05:50:21,605 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:50:21,605 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:50:21,605 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-28 05:50:21,605 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2021-12-28 05:50:21,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:50:21,606 INFO L85 PathProgramCache]: Analyzing trace with hash -2119660205, now seen corresponding path program 1 times [2021-12-28 05:50:21,607 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:50:21,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267780910] [2021-12-28 05:50:21,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:50:21,607 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:50:21,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:50:21,646 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-28 05:50:21,646 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:50:21,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267780910] [2021-12-28 05:50:21,646 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267780910] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:50:21,646 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:50:21,646 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 05:50:21,646 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294289850] [2021-12-28 05:50:21,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:50:21,647 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 05:50:21,647 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:50:21,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 05:50:21,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:50:21,648 INFO L87 Difference]: Start difference. First operand 278 states and 306 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:21,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:50:21,831 INFO L93 Difference]: Finished difference Result 462 states and 510 transitions. [2021-12-28 05:50:21,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:50:21,832 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-28 05:50:21,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:50:21,833 INFO L225 Difference]: With dead ends: 462 [2021-12-28 05:50:21,833 INFO L226 Difference]: Without dead ends: 462 [2021-12-28 05:50:21,834 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-28 05:50:21,834 INFO L933 BasicCegarLoop]: 411 mSDtfsCounter, 216 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:50:21,834 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [216 Valid, 574 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 05:50:21,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2021-12-28 05:50:21,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 276. [2021-12-28 05:50:21,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 164 states have (on average 1.853658536585366) internal successors, (304), 275 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:21,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 304 transitions. [2021-12-28 05:50:21,839 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 304 transitions. Word has length 11 [2021-12-28 05:50:21,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:50:21,839 INFO L470 AbstractCegarLoop]: Abstraction has 276 states and 304 transitions. [2021-12-28 05:50:21,839 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:21,839 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 304 transitions. [2021-12-28 05:50:21,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-28 05:50:21,840 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:50:21,840 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:50:21,842 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-28 05:50:21,842 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2021-12-28 05:50:21,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:50:21,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1231388841, now seen corresponding path program 1 times [2021-12-28 05:50:21,843 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:50:21,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903026004] [2021-12-28 05:50:21,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:50:21,843 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:50:21,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:50:21,892 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-28 05:50:21,892 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:50:21,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903026004] [2021-12-28 05:50:21,893 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903026004] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:50:21,893 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:50:21,893 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:50:21,893 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356316743] [2021-12-28 05:50:21,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:50:21,893 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:50:21,893 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:50:21,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:50:21,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:50:21,894 INFO L87 Difference]: Start difference. First operand 276 states and 304 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:22,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:50:22,036 INFO L93 Difference]: Finished difference Result 666 states and 735 transitions. [2021-12-28 05:50:22,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:50:22,036 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-12-28 05:50:22,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:50:22,038 INFO L225 Difference]: With dead ends: 666 [2021-12-28 05:50:22,038 INFO L226 Difference]: Without dead ends: 666 [2021-12-28 05:50:22,038 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-28 05:50:22,039 INFO L933 BasicCegarLoop]: 284 mSDtfsCounter, 576 mSDsluCounter, 1079 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 1363 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:50:22,039 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [576 Valid, 1363 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:50:22,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2021-12-28 05:50:22,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 279. [2021-12-28 05:50:22,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 167 states have (on average 1.8383233532934131) internal successors, (307), 278 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:22,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 307 transitions. [2021-12-28 05:50:22,043 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 307 transitions. Word has length 13 [2021-12-28 05:50:22,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:50:22,044 INFO L470 AbstractCegarLoop]: Abstraction has 279 states and 307 transitions. [2021-12-28 05:50:22,044 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:22,044 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 307 transitions. [2021-12-28 05:50:22,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-28 05:50:22,044 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:50:22,044 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:50:22,045 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-28 05:50:22,045 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2021-12-28 05:50:22,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:50:22,045 INFO L85 PathProgramCache]: Analyzing trace with hash 2035528525, now seen corresponding path program 1 times [2021-12-28 05:50:22,045 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:50:22,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692456414] [2021-12-28 05:50:22,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:50:22,046 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:50:22,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:50:22,078 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-28 05:50:22,078 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:50:22,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692456414] [2021-12-28 05:50:22,079 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692456414] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:50:22,079 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:50:22,079 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 05:50:22,079 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957321428] [2021-12-28 05:50:22,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:50:22,079 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 05:50:22,080 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:50:22,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 05:50:22,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:50:22,080 INFO L87 Difference]: Start difference. First operand 279 states and 307 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-28 05:50:22,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:50:22,137 INFO L93 Difference]: Finished difference Result 408 states and 447 transitions. [2021-12-28 05:50:22,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:50:22,137 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-28 05:50:22,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:50:22,138 INFO L225 Difference]: With dead ends: 408 [2021-12-28 05:50:22,139 INFO L226 Difference]: Without dead ends: 408 [2021-12-28 05:50:22,139 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-28 05:50:22,139 INFO L933 BasicCegarLoop]: 290 mSDtfsCounter, 237 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 05:50:22,140 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [237 Valid, 1120 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 05:50:22,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2021-12-28 05:50:22,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 343. [2021-12-28 05:50:22,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 231 states have (on average 1.8831168831168832) internal successors, (435), 342 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:22,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 435 transitions. [2021-12-28 05:50:22,150 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 435 transitions. Word has length 15 [2021-12-28 05:50:22,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:50:22,150 INFO L470 AbstractCegarLoop]: Abstraction has 343 states and 435 transitions. [2021-12-28 05:50:22,150 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-28 05:50:22,151 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 435 transitions. [2021-12-28 05:50:22,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-28 05:50:22,151 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:50:22,151 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:50:22,151 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-28 05:50:22,151 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2021-12-28 05:50:22,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:50:22,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1316385230, now seen corresponding path program 1 times [2021-12-28 05:50:22,152 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:50:22,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848363803] [2021-12-28 05:50:22,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:50:22,152 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:50:22,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:50:22,171 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-28 05:50:22,171 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:50:22,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848363803] [2021-12-28 05:50:22,172 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848363803] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:50:22,172 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:50:22,172 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 05:50:22,172 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273775858] [2021-12-28 05:50:22,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:50:22,172 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 05:50:22,172 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:50:22,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 05:50:22,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:50:22,173 INFO L87 Difference]: Start difference. First operand 343 states and 435 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:22,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:50:22,182 INFO L93 Difference]: Finished difference Result 328 states and 410 transitions. [2021-12-28 05:50:22,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:50:22,182 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2021-12-28 05:50:22,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:50:22,183 INFO L225 Difference]: With dead ends: 328 [2021-12-28 05:50:22,183 INFO L226 Difference]: Without dead ends: 328 [2021-12-28 05:50:22,183 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-28 05:50:22,184 INFO L933 BasicCegarLoop]: 297 mSDtfsCounter, 223 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 05:50:22,184 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [223 Valid, 363 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 05:50:22,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2021-12-28 05:50:22,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2021-12-28 05:50:22,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 216 states have (on average 1.8981481481481481) internal successors, (410), 327 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:22,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 410 transitions. [2021-12-28 05:50:22,188 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 410 transitions. Word has length 16 [2021-12-28 05:50:22,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:50:22,188 INFO L470 AbstractCegarLoop]: Abstraction has 328 states and 410 transitions. [2021-12-28 05:50:22,188 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:22,188 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 410 transitions. [2021-12-28 05:50:22,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-28 05:50:22,189 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:50:22,189 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:50:22,189 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-28 05:50:22,189 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2021-12-28 05:50:22,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:50:22,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1932989585, now seen corresponding path program 1 times [2021-12-28 05:50:22,190 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:50:22,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304301384] [2021-12-28 05:50:22,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:50:22,190 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:50:22,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:50:22,204 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-28 05:50:22,204 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:50:22,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304301384] [2021-12-28 05:50:22,204 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304301384] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:50:22,204 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:50:22,205 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 05:50:22,205 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574168683] [2021-12-28 05:50:22,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:50:22,205 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 05:50:22,205 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:50:22,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 05:50:22,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:50:22,206 INFO L87 Difference]: Start difference. First operand 328 states and 410 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:22,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:50:22,314 INFO L93 Difference]: Finished difference Result 312 states and 378 transitions. [2021-12-28 05:50:22,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:50:22,314 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-12-28 05:50:22,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:50:22,315 INFO L225 Difference]: With dead ends: 312 [2021-12-28 05:50:22,316 INFO L226 Difference]: Without dead ends: 312 [2021-12-28 05:50:22,316 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-28 05:50:22,316 INFO L933 BasicCegarLoop]: 235 mSDtfsCounter, 77 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:50:22,316 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 346 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:50:22,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2021-12-28 05:50:22,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2021-12-28 05:50:22,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 216 states have (on average 1.75) internal successors, (378), 311 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:22,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 378 transitions. [2021-12-28 05:50:22,320 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 378 transitions. Word has length 17 [2021-12-28 05:50:22,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:50:22,320 INFO L470 AbstractCegarLoop]: Abstraction has 312 states and 378 transitions. [2021-12-28 05:50:22,320 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:22,321 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 378 transitions. [2021-12-28 05:50:22,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-28 05:50:22,321 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:50:22,321 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:50:22,321 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-28 05:50:22,321 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr94REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2021-12-28 05:50:22,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:50:22,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1932989586, now seen corresponding path program 1 times [2021-12-28 05:50:22,322 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:50:22,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486589362] [2021-12-28 05:50:22,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:50:22,322 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:50:22,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:50:22,340 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-28 05:50:22,341 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:50:22,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486589362] [2021-12-28 05:50:22,341 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486589362] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:50:22,341 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:50:22,341 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 05:50:22,341 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683934356] [2021-12-28 05:50:22,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:50:22,342 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 05:50:22,342 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:50:22,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 05:50:22,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:50:22,342 INFO L87 Difference]: Start difference. First operand 312 states and 378 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:22,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:50:22,448 INFO L93 Difference]: Finished difference Result 296 states and 346 transitions. [2021-12-28 05:50:22,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:50:22,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-12-28 05:50:22,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:50:22,449 INFO L225 Difference]: With dead ends: 296 [2021-12-28 05:50:22,449 INFO L226 Difference]: Without dead ends: 296 [2021-12-28 05:50:22,450 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-28 05:50:22,450 INFO L933 BasicCegarLoop]: 235 mSDtfsCounter, 61 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:50:22,450 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 355 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:50:22,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2021-12-28 05:50:22,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2021-12-28 05:50:22,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 216 states have (on average 1.6018518518518519) internal successors, (346), 295 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:22,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 346 transitions. [2021-12-28 05:50:22,454 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 346 transitions. Word has length 17 [2021-12-28 05:50:22,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:50:22,454 INFO L470 AbstractCegarLoop]: Abstraction has 296 states and 346 transitions. [2021-12-28 05:50:22,454 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:22,455 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 346 transitions. [2021-12-28 05:50:22,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-28 05:50:22,455 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:50:22,455 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-28 05:50:22,455 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-28 05:50:22,455 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2021-12-28 05:50:22,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:50:22,456 INFO L85 PathProgramCache]: Analyzing trace with hash -2117838446, now seen corresponding path program 1 times [2021-12-28 05:50:22,456 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:50:22,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318678355] [2021-12-28 05:50:22,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:50:22,456 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:50:22,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:50:22,492 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-28 05:50:22,492 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:50:22,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318678355] [2021-12-28 05:50:22,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318678355] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:50:22,493 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:50:22,493 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 05:50:22,493 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258649418] [2021-12-28 05:50:22,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:50:22,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 05:50:22,494 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:50:22,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 05:50:22,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:50:22,495 INFO L87 Difference]: Start difference. First operand 296 states and 346 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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-28 05:50:22,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:50:22,560 INFO L93 Difference]: Finished difference Result 394 states and 436 transitions. [2021-12-28 05:50:22,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-28 05:50:22,560 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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-28 05:50:22,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:50:22,561 INFO L225 Difference]: With dead ends: 394 [2021-12-28 05:50:22,561 INFO L226 Difference]: Without dead ends: 394 [2021-12-28 05:50:22,562 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-28 05:50:22,562 INFO L933 BasicCegarLoop]: 258 mSDtfsCounter, 277 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 994 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 05:50:22,562 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [277 Valid, 994 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 05:50:22,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2021-12-28 05:50:22,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 293. [2021-12-28 05:50:22,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 213 states have (on average 1.596244131455399) internal successors, (340), 292 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:22,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 340 transitions. [2021-12-28 05:50:22,568 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 340 transitions. Word has length 19 [2021-12-28 05:50:22,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:50:22,569 INFO L470 AbstractCegarLoop]: Abstraction has 293 states and 340 transitions. [2021-12-28 05:50:22,569 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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-28 05:50:22,569 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 340 transitions. [2021-12-28 05:50:22,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-28 05:50:22,570 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:50:22,570 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:50:22,570 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-28 05:50:22,571 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2021-12-28 05:50:22,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:50:22,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1413279430, now seen corresponding path program 1 times [2021-12-28 05:50:22,571 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:50:22,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950232038] [2021-12-28 05:50:22,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:50:22,571 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:50:22,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:50:22,630 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-28 05:50:22,630 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:50:22,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950232038] [2021-12-28 05:50:22,631 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950232038] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:50:22,631 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:50:22,631 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 05:50:22,631 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758781754] [2021-12-28 05:50:22,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:50:22,631 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:50:22,632 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:50:22,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:50:22,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:50:22,632 INFO L87 Difference]: Start difference. First operand 293 states and 340 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 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-28 05:50:22,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:50:22,832 INFO L93 Difference]: Finished difference Result 316 states and 364 transitions. [2021-12-28 05:50:22,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 05:50:22,832 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 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-28 05:50:22,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:50:22,833 INFO L225 Difference]: With dead ends: 316 [2021-12-28 05:50:22,833 INFO L226 Difference]: Without dead ends: 316 [2021-12-28 05:50:22,835 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-12-28 05:50:22,835 INFO L933 BasicCegarLoop]: 229 mSDtfsCounter, 271 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:50:22,836 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [271 Valid, 557 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 05:50:22,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2021-12-28 05:50:22,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 295. [2021-12-28 05:50:22,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 217 states have (on average 1.5898617511520738) internal successors, (345), 294 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:22,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 345 transitions. [2021-12-28 05:50:22,840 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 345 transitions. Word has length 19 [2021-12-28 05:50:22,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:50:22,841 INFO L470 AbstractCegarLoop]: Abstraction has 295 states and 345 transitions. [2021-12-28 05:50:22,841 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 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-28 05:50:22,841 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 345 transitions. [2021-12-28 05:50:22,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-28 05:50:22,842 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:50:22,842 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:50:22,842 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-28 05:50:22,842 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2021-12-28 05:50:22,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:50:22,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1413279429, now seen corresponding path program 1 times [2021-12-28 05:50:22,843 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:50:22,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972043805] [2021-12-28 05:50:22,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:50:22,843 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:50:22,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:50:22,899 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-28 05:50:22,899 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:50:22,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972043805] [2021-12-28 05:50:22,901 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972043805] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:50:22,901 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:50:22,901 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 05:50:22,901 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601429810] [2021-12-28 05:50:22,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:50:22,901 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 05:50:22,902 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:50:22,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 05:50:22,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:50:22,902 INFO L87 Difference]: Start difference. First operand 295 states and 345 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 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-28 05:50:23,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:50:23,156 INFO L93 Difference]: Finished difference Result 409 states and 475 transitions. [2021-12-28 05:50:23,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 05:50:23,156 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 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-28 05:50:23,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:50:23,157 INFO L225 Difference]: With dead ends: 409 [2021-12-28 05:50:23,157 INFO L226 Difference]: Without dead ends: 409 [2021-12-28 05:50:23,158 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-28 05:50:23,158 INFO L933 BasicCegarLoop]: 257 mSDtfsCounter, 437 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:50:23,158 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [437 Valid, 647 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 05:50:23,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2021-12-28 05:50:23,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 294. [2021-12-28 05:50:23,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 217 states have (on average 1.5852534562211982) internal successors, (344), 293 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:23,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 344 transitions. [2021-12-28 05:50:23,162 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 344 transitions. Word has length 19 [2021-12-28 05:50:23,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:50:23,163 INFO L470 AbstractCegarLoop]: Abstraction has 294 states and 344 transitions. [2021-12-28 05:50:23,163 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 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-28 05:50:23,163 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 344 transitions. [2021-12-28 05:50:23,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-28 05:50:23,165 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:50:23,165 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-28 05:50:23,165 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-28 05:50:23,165 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr103REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2021-12-28 05:50:23,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:50:23,166 INFO L85 PathProgramCache]: Analyzing trace with hash -805519643, now seen corresponding path program 1 times [2021-12-28 05:50:23,166 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:50:23,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405296260] [2021-12-28 05:50:23,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:50:23,166 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:50:23,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:50:23,225 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-28 05:50:23,225 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:50:23,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405296260] [2021-12-28 05:50:23,225 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405296260] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:50:23,225 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:50:23,225 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 05:50:23,226 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965745737] [2021-12-28 05:50:23,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:50:23,227 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 05:50:23,227 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:50:23,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 05:50:23,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-28 05:50:23,228 INFO L87 Difference]: Start difference. First operand 294 states and 344 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 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-28 05:50:23,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:50:23,411 INFO L93 Difference]: Finished difference Result 394 states and 442 transitions. [2021-12-28 05:50:23,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-28 05:50:23,412 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 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-28 05:50:23,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:50:23,415 INFO L225 Difference]: With dead ends: 394 [2021-12-28 05:50:23,415 INFO L226 Difference]: Without dead ends: 394 [2021-12-28 05:50:23,415 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-12-28 05:50:23,417 INFO L933 BasicCegarLoop]: 245 mSDtfsCounter, 251 mSDsluCounter, 1164 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 1409 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:50:23,417 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [251 Valid, 1409 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:50:23,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2021-12-28 05:50:23,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 280. [2021-12-28 05:50:23,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 203 states have (on average 1.5812807881773399) internal successors, (321), 279 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:23,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 321 transitions. [2021-12-28 05:50:23,421 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 321 transitions. Word has length 24 [2021-12-28 05:50:23,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:50:23,421 INFO L470 AbstractCegarLoop]: Abstraction has 280 states and 321 transitions. [2021-12-28 05:50:23,422 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 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-28 05:50:23,422 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 321 transitions. [2021-12-28 05:50:23,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-28 05:50:23,422 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:50:23,422 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-28 05:50:23,422 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-28 05:50:23,422 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2021-12-28 05:50:23,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:50:23,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1972902682, now seen corresponding path program 1 times [2021-12-28 05:50:23,423 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:50:23,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119930076] [2021-12-28 05:50:23,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:50:23,423 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:50:23,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:50:23,449 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-28 05:50:23,449 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:50:23,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119930076] [2021-12-28 05:50:23,449 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119930076] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:50:23,449 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:50:23,450 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 05:50:23,450 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015462694] [2021-12-28 05:50:23,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:50:23,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 05:50:23,450 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:50:23,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 05:50:23,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:50:23,451 INFO L87 Difference]: Start difference. First operand 280 states and 321 transitions. Second operand has 5 states, 5 states have (on average 4.8) 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-28 05:50:23,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:50:23,493 INFO L93 Difference]: Finished difference Result 298 states and 331 transitions. [2021-12-28 05:50:23,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 05:50:23,493 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) 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-28 05:50:23,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:50:23,494 INFO L225 Difference]: With dead ends: 298 [2021-12-28 05:50:23,494 INFO L226 Difference]: Without dead ends: 298 [2021-12-28 05:50:23,494 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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-28 05:50:23,495 INFO L933 BasicCegarLoop]: 309 mSDtfsCounter, 667 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 667 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 05:50:23,495 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [667 Valid, 560 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 05:50:23,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2021-12-28 05:50:23,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 280. [2021-12-28 05:50:23,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 203 states have (on average 1.5763546798029557) internal successors, (320), 279 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:23,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 320 transitions. [2021-12-28 05:50:23,498 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 320 transitions. Word has length 24 [2021-12-28 05:50:23,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:50:23,499 INFO L470 AbstractCegarLoop]: Abstraction has 280 states and 320 transitions. [2021-12-28 05:50:23,499 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) 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-28 05:50:23,499 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 320 transitions. [2021-12-28 05:50:23,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-28 05:50:23,499 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:50:23,499 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] [2021-12-28 05:50:23,500 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-28 05:50:23,500 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr151ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2021-12-28 05:50:23,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:50:23,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1021020451, now seen corresponding path program 1 times [2021-12-28 05:50:23,500 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:50:23,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555627195] [2021-12-28 05:50:23,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:50:23,501 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:50:23,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:50:23,529 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-28 05:50:23,530 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:50:23,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555627195] [2021-12-28 05:50:23,530 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555627195] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:50:23,530 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:50:23,530 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 05:50:23,530 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811801703] [2021-12-28 05:50:23,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:50:23,531 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 05:50:23,531 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:50:23,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 05:50:23,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:50:23,532 INFO L87 Difference]: Start difference. First operand 280 states and 320 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:23,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:50:23,724 INFO L93 Difference]: Finished difference Result 288 states and 321 transitions. [2021-12-28 05:50:23,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 05:50:23,725 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-28 05:50:23,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:50:23,726 INFO L225 Difference]: With dead ends: 288 [2021-12-28 05:50:23,726 INFO L226 Difference]: Without dead ends: 284 [2021-12-28 05:50:23,726 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:50:23,726 INFO L933 BasicCegarLoop]: 241 mSDtfsCounter, 26 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:50:23,726 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 663 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 05:50:23,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2021-12-28 05:50:23,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 278. [2021-12-28 05:50:23,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 201 states have (on average 1.5771144278606966) internal successors, (317), 277 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:23,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 317 transitions. [2021-12-28 05:50:23,738 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 317 transitions. Word has length 26 [2021-12-28 05:50:23,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:50:23,738 INFO L470 AbstractCegarLoop]: Abstraction has 278 states and 317 transitions. [2021-12-28 05:50:23,738 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:23,738 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 317 transitions. [2021-12-28 05:50:23,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-28 05:50:23,739 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:50:23,739 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-28 05:50:23,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-28 05:50:23,739 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr123REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2021-12-28 05:50:23,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:50:23,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1580222949, now seen corresponding path program 1 times [2021-12-28 05:50:23,739 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:50:23,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493038282] [2021-12-28 05:50:23,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:50:23,740 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:50:23,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:50:23,758 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-28 05:50:23,758 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:50:23,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493038282] [2021-12-28 05:50:23,759 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493038282] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:50:23,759 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:50:23,759 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 05:50:23,759 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381549438] [2021-12-28 05:50:23,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:50:23,760 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 05:50:23,760 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:50:23,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 05:50:23,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:50:23,760 INFO L87 Difference]: Start difference. First operand 278 states and 317 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 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-28 05:50:23,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:50:23,769 INFO L93 Difference]: Finished difference Result 263 states and 292 transitions. [2021-12-28 05:50:23,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:50:23,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 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-28 05:50:23,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:50:23,770 INFO L225 Difference]: With dead ends: 263 [2021-12-28 05:50:23,770 INFO L226 Difference]: Without dead ends: 245 [2021-12-28 05:50:23,770 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-28 05:50:23,771 INFO L933 BasicCegarLoop]: 262 mSDtfsCounter, 31 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 05:50:23,771 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 485 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 05:50:23,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2021-12-28 05:50:23,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2021-12-28 05:50:23,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 168 states have (on average 1.630952380952381) internal successors, (274), 244 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:23,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 274 transitions. [2021-12-28 05:50:23,774 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 274 transitions. Word has length 27 [2021-12-28 05:50:23,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:50:23,774 INFO L470 AbstractCegarLoop]: Abstraction has 245 states and 274 transitions. [2021-12-28 05:50:23,774 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 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-28 05:50:23,774 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 274 transitions. [2021-12-28 05:50:23,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-28 05:50:23,775 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:50:23,775 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] [2021-12-28 05:50:23,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-28 05:50:23,775 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2021-12-28 05:50:23,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:50:23,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1161321696, now seen corresponding path program 1 times [2021-12-28 05:50:23,776 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:50:23,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411742195] [2021-12-28 05:50:23,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:50:23,776 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:50:23,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:50:23,883 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-28 05:50:23,883 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:50:23,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411742195] [2021-12-28 05:50:23,883 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411742195] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:50:23,883 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:50:23,883 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-28 05:50:23,884 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123041842] [2021-12-28 05:50:23,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:50:23,884 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-28 05:50:23,884 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:50:23,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-28 05:50:23,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2021-12-28 05:50:23,885 INFO L87 Difference]: Start difference. First operand 245 states and 274 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-28 05:50:24,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:50:24,479 INFO L93 Difference]: Finished difference Result 251 states and 280 transitions. [2021-12-28 05:50:24,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-28 05:50:24,480 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-28 05:50:24,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:50:24,481 INFO L225 Difference]: With dead ends: 251 [2021-12-28 05:50:24,481 INFO L226 Difference]: Without dead ends: 251 [2021-12-28 05:50:24,481 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=355, Unknown=0, NotChecked=0, Total=462 [2021-12-28 05:50:24,482 INFO L933 BasicCegarLoop]: 221 mSDtfsCounter, 257 mSDsluCounter, 1093 mSDsCounter, 0 mSdLazyCounter, 1118 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 1314 SdHoareTripleChecker+Invalid, 1176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-28 05:50:24,482 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [257 Valid, 1314 Invalid, 1176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1118 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-28 05:50:24,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2021-12-28 05:50:24,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 244. [2021-12-28 05:50:24,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 168 states have (on average 1.625) internal successors, (273), 243 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:24,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 273 transitions. [2021-12-28 05:50:24,485 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 273 transitions. Word has length 27 [2021-12-28 05:50:24,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:50:24,485 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 273 transitions. [2021-12-28 05:50:24,485 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-28 05:50:24,485 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 273 transitions. [2021-12-28 05:50:24,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-28 05:50:24,485 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:50:24,485 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] [2021-12-28 05:50:24,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-28 05:50:24,485 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2021-12-28 05:50:24,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:50:24,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1161321697, now seen corresponding path program 1 times [2021-12-28 05:50:24,486 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:50:24,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171062995] [2021-12-28 05:50:24,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:50:24,486 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:50:24,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:50:24,680 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-28 05:50:24,680 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:50:24,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171062995] [2021-12-28 05:50:24,680 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171062995] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:50:24,680 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:50:24,680 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-28 05:50:24,681 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379080940] [2021-12-28 05:50:24,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:50:24,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-28 05:50:24,681 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:50:24,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-28 05:50:24,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2021-12-28 05:50:24,682 INFO L87 Difference]: Start difference. First operand 244 states and 273 transitions. Second operand has 13 states, 12 states have (on average 2.25) internal successors, (27), 13 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-28 05:50:25,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:50:25,764 INFO L93 Difference]: Finished difference Result 504 states and 573 transitions. [2021-12-28 05:50:25,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-28 05:50:25,764 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.25) internal successors, (27), 13 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-28 05:50:25,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:50:25,766 INFO L225 Difference]: With dead ends: 504 [2021-12-28 05:50:25,766 INFO L226 Difference]: Without dead ends: 504 [2021-12-28 05:50:25,766 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2021-12-28 05:50:25,766 INFO L933 BasicCegarLoop]: 242 mSDtfsCounter, 673 mSDsluCounter, 1622 mSDsCounter, 0 mSdLazyCounter, 1700 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 673 SdHoareTripleChecker+Valid, 1864 SdHoareTripleChecker+Invalid, 1783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-28 05:50:25,767 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [673 Valid, 1864 Invalid, 1783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1700 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-12-28 05:50:25,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2021-12-28 05:50:25,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 243. [2021-12-28 05:50:25,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 168 states have (on average 1.619047619047619) internal successors, (272), 242 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:25,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 272 transitions. [2021-12-28 05:50:25,770 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 272 transitions. Word has length 27 [2021-12-28 05:50:25,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:50:25,771 INFO L470 AbstractCegarLoop]: Abstraction has 243 states and 272 transitions. [2021-12-28 05:50:25,771 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.25) internal successors, (27), 13 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-28 05:50:25,771 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 272 transitions. [2021-12-28 05:50:25,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-28 05:50:25,771 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:50:25,771 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, 1] [2021-12-28 05:50:25,772 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-28 05:50:25,772 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2021-12-28 05:50:25,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:50:25,772 INFO L85 PathProgramCache]: Analyzing trace with hash -672116074, now seen corresponding path program 1 times [2021-12-28 05:50:25,772 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:50:25,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580068204] [2021-12-28 05:50:25,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:50:25,773 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:50:25,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:50:25,838 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-28 05:50:25,838 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:50:25,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580068204] [2021-12-28 05:50:25,838 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580068204] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:50:25,838 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:50:25,838 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-28 05:50:25,839 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97104695] [2021-12-28 05:50:25,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:50:25,839 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-28 05:50:25,839 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:50:25,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-28 05:50:25,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-28 05:50:25,840 INFO L87 Difference]: Start difference. First operand 243 states and 272 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:26,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:50:26,001 INFO L93 Difference]: Finished difference Result 265 states and 296 transitions. [2021-12-28 05:50:26,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 05:50:26,001 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-28 05:50:26,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:50:26,002 INFO L225 Difference]: With dead ends: 265 [2021-12-28 05:50:26,002 INFO L226 Difference]: Without dead ends: 265 [2021-12-28 05:50:26,003 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2021-12-28 05:50:26,003 INFO L933 BasicCegarLoop]: 241 mSDtfsCounter, 725 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:50:26,003 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [725 Valid, 934 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:50:26,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2021-12-28 05:50:26,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 243. [2021-12-28 05:50:26,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 168 states have (on average 1.6130952380952381) internal successors, (271), 242 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:26,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 271 transitions. [2021-12-28 05:50:26,007 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 271 transitions. Word has length 29 [2021-12-28 05:50:26,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:50:26,008 INFO L470 AbstractCegarLoop]: Abstraction has 243 states and 271 transitions. [2021-12-28 05:50:26,008 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:26,008 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 271 transitions. [2021-12-28 05:50:26,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-28 05:50:26,009 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:50:26,009 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, 1, 1, 1] [2021-12-28 05:50:26,009 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-28 05:50:26,010 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2021-12-28 05:50:26,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:50:26,010 INFO L85 PathProgramCache]: Analyzing trace with hash 102015914, now seen corresponding path program 1 times [2021-12-28 05:50:26,010 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:50:26,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644274518] [2021-12-28 05:50:26,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:50:26,011 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:50:26,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:50:26,074 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-28 05:50:26,074 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:50:26,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644274518] [2021-12-28 05:50:26,074 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644274518] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:50:26,074 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:50:26,074 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 05:50:26,075 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255710401] [2021-12-28 05:50:26,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:50:26,075 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 05:50:26,075 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:50:26,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 05:50:26,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:50:26,076 INFO L87 Difference]: Start difference. First operand 243 states and 271 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:26,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:50:26,249 INFO L93 Difference]: Finished difference Result 259 states and 290 transitions. [2021-12-28 05:50:26,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 05:50:26,250 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-12-28 05:50:26,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:50:26,250 INFO L225 Difference]: With dead ends: 259 [2021-12-28 05:50:26,251 INFO L226 Difference]: Without dead ends: 259 [2021-12-28 05:50:26,251 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-28 05:50:26,251 INFO L933 BasicCegarLoop]: 237 mSDtfsCounter, 51 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:50:26,251 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 673 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 05:50:26,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2021-12-28 05:50:26,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 242. [2021-12-28 05:50:26,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 168 states have (on average 1.6071428571428572) internal successors, (270), 241 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:26,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 270 transitions. [2021-12-28 05:50:26,254 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 270 transitions. Word has length 31 [2021-12-28 05:50:26,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:50:26,255 INFO L470 AbstractCegarLoop]: Abstraction has 242 states and 270 transitions. [2021-12-28 05:50:26,255 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:26,255 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 270 transitions. [2021-12-28 05:50:26,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-28 05:50:26,255 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:50:26,255 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, 1, 1, 1] [2021-12-28 05:50:26,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-28 05:50:26,255 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2021-12-28 05:50:26,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:50:26,256 INFO L85 PathProgramCache]: Analyzing trace with hash 102015915, now seen corresponding path program 1 times [2021-12-28 05:50:26,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:50:26,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912757181] [2021-12-28 05:50:26,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:50:26,256 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:50:26,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:50:26,385 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-28 05:50:26,385 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:50:26,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912757181] [2021-12-28 05:50:26,385 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912757181] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:50:26,385 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:50:26,386 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-28 05:50:26,386 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502418403] [2021-12-28 05:50:26,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:50:26,386 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-28 05:50:26,386 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:50:26,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-28 05:50:26,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-28 05:50:26,387 INFO L87 Difference]: Start difference. First operand 242 states and 270 transitions. Second operand has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:26,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:50:26,859 INFO L93 Difference]: Finished difference Result 374 states and 421 transitions. [2021-12-28 05:50:26,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 05:50:26,860 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-12-28 05:50:26,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:50:26,860 INFO L225 Difference]: With dead ends: 374 [2021-12-28 05:50:26,861 INFO L226 Difference]: Without dead ends: 374 [2021-12-28 05:50:26,861 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2021-12-28 05:50:26,861 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 542 mSDsluCounter, 769 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 542 SdHoareTripleChecker+Valid, 947 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-28 05:50:26,861 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [542 Valid, 947 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 814 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-28 05:50:26,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2021-12-28 05:50:26,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 241. [2021-12-28 05:50:26,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 168 states have (on average 1.6011904761904763) internal successors, (269), 240 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:26,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 269 transitions. [2021-12-28 05:50:26,864 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 269 transitions. Word has length 31 [2021-12-28 05:50:26,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:50:26,864 INFO L470 AbstractCegarLoop]: Abstraction has 241 states and 269 transitions. [2021-12-28 05:50:26,864 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:26,865 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 269 transitions. [2021-12-28 05:50:26,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-28 05:50:26,865 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:50:26,865 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, 1, 1, 1, 1, 1, 1] [2021-12-28 05:50:26,865 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-28 05:50:26,865 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2021-12-28 05:50:26,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:50:26,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1705778921, now seen corresponding path program 1 times [2021-12-28 05:50:26,865 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:50:26,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920524818] [2021-12-28 05:50:26,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:50:26,866 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:50:26,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:50:26,924 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-28 05:50:26,924 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:50:26,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920524818] [2021-12-28 05:50:26,925 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920524818] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:50:26,925 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:50:26,925 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:50:26,925 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019803774] [2021-12-28 05:50:26,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:50:26,925 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 05:50:26,925 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:50:26,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 05:50:26,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-28 05:50:26,926 INFO L87 Difference]: Start difference. First operand 241 states and 269 transitions. Second operand has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:27,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:50:27,351 INFO L93 Difference]: Finished difference Result 398 states and 443 transitions. [2021-12-28 05:50:27,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-28 05:50:27,351 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-12-28 05:50:27,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:50:27,352 INFO L225 Difference]: With dead ends: 398 [2021-12-28 05:50:27,352 INFO L226 Difference]: Without dead ends: 398 [2021-12-28 05:50:27,352 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-12-28 05:50:27,353 INFO L933 BasicCegarLoop]: 140 mSDtfsCounter, 580 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-28 05:50:27,353 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [580 Valid, 614 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-28 05:50:27,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2021-12-28 05:50:27,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 244. [2021-12-28 05:50:27,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 173 states have (on average 1.5953757225433527) internal successors, (276), 243 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:27,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 276 transitions. [2021-12-28 05:50:27,356 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 276 transitions. Word has length 34 [2021-12-28 05:50:27,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:50:27,356 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 276 transitions. [2021-12-28 05:50:27,356 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:27,356 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 276 transitions. [2021-12-28 05:50:27,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-28 05:50:27,356 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:50:27,357 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, 1, 1, 1, 1, 1, 1] [2021-12-28 05:50:27,357 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-12-28 05:50:27,357 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2021-12-28 05:50:27,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:50:27,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1705778920, now seen corresponding path program 1 times [2021-12-28 05:50:27,357 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:50:27,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880841552] [2021-12-28 05:50:27,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:50:27,357 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:50:27,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:50:27,457 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-28 05:50:27,457 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:50:27,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880841552] [2021-12-28 05:50:27,457 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880841552] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:50:27,457 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:50:27,457 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 05:50:27,458 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114237766] [2021-12-28 05:50:27,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:50:27,458 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-28 05:50:27,458 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:50:27,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-28 05:50:27,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-28 05:50:27,459 INFO L87 Difference]: Start difference. First operand 244 states and 276 transitions. Second operand has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:27,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:50:27,916 INFO L93 Difference]: Finished difference Result 496 states and 560 transitions. [2021-12-28 05:50:27,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-28 05:50:27,917 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-12-28 05:50:27,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:50:27,918 INFO L225 Difference]: With dead ends: 496 [2021-12-28 05:50:27,918 INFO L226 Difference]: Without dead ends: 496 [2021-12-28 05:50:27,918 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2021-12-28 05:50:27,919 INFO L933 BasicCegarLoop]: 162 mSDtfsCounter, 712 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-28 05:50:27,919 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [712 Valid, 715 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-28 05:50:27,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2021-12-28 05:50:27,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 308. [2021-12-28 05:50:27,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 237 states have (on average 1.5738396624472575) internal successors, (373), 307 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:27,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 373 transitions. [2021-12-28 05:50:27,923 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 373 transitions. Word has length 34 [2021-12-28 05:50:27,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:50:27,923 INFO L470 AbstractCegarLoop]: Abstraction has 308 states and 373 transitions. [2021-12-28 05:50:27,923 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:27,925 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 373 transitions. [2021-12-28 05:50:27,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-28 05:50:27,926 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:50:27,927 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, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:50:27,927 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-12-28 05:50:27,927 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2021-12-28 05:50:27,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:50:27,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1332799064, now seen corresponding path program 1 times [2021-12-28 05:50:27,928 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:50:27,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479194104] [2021-12-28 05:50:27,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:50:27,929 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:50:27,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:50:28,390 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-28 05:50:28,390 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:50:28,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479194104] [2021-12-28 05:50:28,390 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479194104] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:50:28,390 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:50:28,390 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-12-28 05:50:28,390 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050348672] [2021-12-28 05:50:28,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:50:28,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-28 05:50:28,391 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:50:28,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-28 05:50:28,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-12-28 05:50:28,391 INFO L87 Difference]: Start difference. First operand 308 states and 373 transitions. Second operand has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:29,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:50:29,255 INFO L93 Difference]: Finished difference Result 310 states and 374 transitions. [2021-12-28 05:50:29,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-28 05:50:29,256 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-12-28 05:50:29,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:50:29,257 INFO L225 Difference]: With dead ends: 310 [2021-12-28 05:50:29,257 INFO L226 Difference]: Without dead ends: 310 [2021-12-28 05:50:29,257 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=153, Invalid=659, Unknown=0, NotChecked=0, Total=812 [2021-12-28 05:50:29,258 INFO L933 BasicCegarLoop]: 210 mSDtfsCounter, 293 mSDsluCounter, 1655 mSDsCounter, 0 mSdLazyCounter, 1075 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 1865 SdHoareTripleChecker+Invalid, 1117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-28 05:50:29,258 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [293 Valid, 1865 Invalid, 1117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1075 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-28 05:50:29,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2021-12-28 05:50:29,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 308. [2021-12-28 05:50:29,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 237 states have (on average 1.5696202531645569) internal successors, (372), 307 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:29,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 372 transitions. [2021-12-28 05:50:29,263 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 372 transitions. Word has length 35 [2021-12-28 05:50:29,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:50:29,263 INFO L470 AbstractCegarLoop]: Abstraction has 308 states and 372 transitions. [2021-12-28 05:50:29,263 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:29,263 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 372 transitions. [2021-12-28 05:50:29,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-28 05:50:29,263 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:50:29,264 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, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:50:29,264 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-12-28 05:50:29,264 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2021-12-28 05:50:29,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:50:29,264 INFO L85 PathProgramCache]: Analyzing trace with hash -561839822, now seen corresponding path program 1 times [2021-12-28 05:50:29,264 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:50:29,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930649872] [2021-12-28 05:50:29,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:50:29,265 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:50:29,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:50:29,471 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-28 05:50:29,471 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:50:29,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930649872] [2021-12-28 05:50:29,471 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930649872] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 05:50:29,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9517717] [2021-12-28 05:50:29,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:50:29,471 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:50:29,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:50:29,473 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-28 05:50:29,474 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-28 05:50:29,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:50:29,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 54 conjunts are in the unsatisfiable core [2021-12-28 05:50:29,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:50:29,747 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-28 05:50:29,774 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-28 05:50:29,777 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-28 05:50:29,824 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-28 05:50:29,824 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-28 05:50:29,865 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-12-28 05:50:29,869 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-28 05:50:29,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:50:29,899 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2021-12-28 05:50:29,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:50:29,910 INFO L353 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2021-12-28 05:50:29,910 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 41 [2021-12-28 05:50:30,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:50:30,008 INFO L353 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2021-12-28 05:50:30,008 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 41 [2021-12-28 05:50:30,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:50:30,013 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2021-12-28 05:50:30,074 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 05:50:30,078 INFO L353 Elim1Store]: treesize reduction 31, result has 8.8 percent of original size [2021-12-28 05:50:30,078 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 37 [2021-12-28 05:50:30,083 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-28 05:50:30,083 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 18 [2021-12-28 05:50:30,091 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-28 05:50:30,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:50:31,292 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_767 Int) (v_ArrVal_765 Int)) (= 0 (let ((.cse1 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4))) (select (let ((.cse0 (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~list~0#1.base|) .cse1 v_ArrVal_767))) (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#iter~0#1.base| .cse0) (select .cse0 |ULTIMATE.start_main_~#iter~0#1.offset|))) (+ (select (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~list~0#1.offset|) .cse1 v_ArrVal_765) |ULTIMATE.start_main_~#iter~0#1.offset|) 4))))) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_767 Int) (v_ArrVal_765 Int)) (= (let ((.cse3 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4))) (let ((.cse2 (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~list~0#1.offset|) .cse3 v_ArrVal_765))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#iter~0#1.base| .cse2) (select (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#iter~0#1.base|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~list~0#1.base|) .cse3 v_ArrVal_767) |ULTIMATE.start_main_~#iter~0#1.offset|)) (+ (select .cse2 |ULTIMATE.start_main_~#iter~0#1.offset|) 4)))) 0))) is different from false [2021-12-28 05:50:33,484 INFO L353 Elim1Store]: treesize reduction 112, result has 22.2 percent of original size [2021-12-28 05:50:33,485 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 7765 treesize of output 6144 [2021-12-28 05:50:33,506 INFO L353 Elim1Store]: treesize reduction 76, result has 20.8 percent of original size [2021-12-28 05:50:33,506 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 7594 treesize of output 5982 [2021-12-28 05:50:33,540 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:50:33,541 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 5982 treesize of output 5672 [2021-12-28 05:50:33,566 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:50:33,566 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 5672 treesize of output 5362 [2021-12-28 05:50:33,649 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2021-12-28 05:50:33,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-28 05:50:33,886 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-12-28 05:50:33,886 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger out of long range at java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.computeDerApplicabilityScore(QuantifierPusher.java:685) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.selectBestEliminatee(QuantifierPusher.java:668) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.doit(QuantifierPusher.java:604) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:446) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-12-28 05:50:33,890 INFO L158 Benchmark]: Toolchain (without parser) took 14953.81ms. Allocated memory was 62.9MB in the beginning and 195.0MB in the end (delta: 132.1MB). Free memory was 42.6MB in the beginning and 106.6MB in the end (delta: -64.0MB). Peak memory consumption was 99.1MB. Max. memory is 16.1GB. [2021-12-28 05:50:33,890 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 62.9MB. Free memory was 44.1MB in the beginning and 44.1MB in the end (delta: 46.1kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-28 05:50:33,890 INFO L158 Benchmark]: CACSL2BoogieTranslator took 333.86ms. Allocated memory is still 62.9MB. Free memory was 42.3MB in the beginning and 38.1MB in the end (delta: 4.2MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. [2021-12-28 05:50:33,890 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.73ms. Allocated memory is still 62.9MB. Free memory was 37.9MB in the beginning and 35.0MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-28 05:50:33,890 INFO L158 Benchmark]: Boogie Preprocessor took 49.85ms. Allocated memory is still 62.9MB. Free memory was 35.0MB in the beginning and 32.1MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-28 05:50:33,891 INFO L158 Benchmark]: RCFGBuilder took 750.44ms. Allocated memory was 62.9MB in the beginning and 75.5MB in the end (delta: 12.6MB). Free memory was 32.1MB in the beginning and 40.7MB in the end (delta: -8.6MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. [2021-12-28 05:50:33,891 INFO L158 Benchmark]: TraceAbstraction took 13748.39ms. Allocated memory was 75.5MB in the beginning and 195.0MB in the end (delta: 119.5MB). Free memory was 40.4MB in the beginning and 106.6MB in the end (delta: -66.2MB). Peak memory consumption was 84.9MB. Max. memory is 16.1GB. [2021-12-28 05:50:33,892 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 62.9MB. Free memory was 44.1MB in the beginning and 44.1MB in the end (delta: 46.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 333.86ms. Allocated memory is still 62.9MB. Free memory was 42.3MB in the beginning and 38.1MB in the end (delta: 4.2MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.73ms. Allocated memory is still 62.9MB. Free memory was 37.9MB in the beginning and 35.0MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.85ms. Allocated memory is still 62.9MB. Free memory was 35.0MB in the beginning and 32.1MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 750.44ms. Allocated memory was 62.9MB in the beginning and 75.5MB in the end (delta: 12.6MB). Free memory was 32.1MB in the beginning and 40.7MB in the end (delta: -8.6MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. * TraceAbstraction took 13748.39ms. Allocated memory was 75.5MB in the beginning and 195.0MB in the end (delta: 119.5MB). Free memory was 40.4MB in the beginning and 106.6MB in the end (delta: -66.2MB). Peak memory consumption was 84.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger out of long range: java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-12-28 05:50:33,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/memsafety/test-0521.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 aa94cb741c9c7eaa2ca9bb871f44dd4c619faf21975944b61e221a61ad9730d7 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-28 05:50:35,638 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-28 05:50:35,639 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-28 05:50:35,657 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-28 05:50:35,658 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-28 05:50:35,658 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-28 05:50:35,659 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-28 05:50:35,661 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-28 05:50:35,662 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-28 05:50:35,662 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-28 05:50:35,663 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-28 05:50:35,664 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-28 05:50:35,664 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-28 05:50:35,665 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-28 05:50:35,666 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-28 05:50:35,666 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-28 05:50:35,667 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-28 05:50:35,668 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-28 05:50:35,669 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-28 05:50:35,670 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-28 05:50:35,671 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-28 05:50:35,672 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-28 05:50:35,672 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-28 05:50:35,673 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-28 05:50:35,675 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-28 05:50:35,675 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-28 05:50:35,675 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-28 05:50:35,676 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-28 05:50:35,676 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-28 05:50:35,677 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-28 05:50:35,677 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-28 05:50:35,677 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-28 05:50:35,678 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-28 05:50:35,678 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-28 05:50:35,679 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-28 05:50:35,679 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-28 05:50:35,680 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-28 05:50:35,680 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-28 05:50:35,680 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-28 05:50:35,681 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-28 05:50:35,681 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-28 05:50:35,682 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-12-28 05:50:35,702 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-28 05:50:35,702 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-28 05:50:35,702 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-28 05:50:35,703 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-28 05:50:35,703 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-28 05:50:35,703 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-28 05:50:35,704 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-28 05:50:35,704 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-28 05:50:35,704 INFO L138 SettingsManager]: * Use SBE=true [2021-12-28 05:50:35,704 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-28 05:50:35,704 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-28 05:50:35,704 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-28 05:50:35,705 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-28 05:50:35,705 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-28 05:50:35,705 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-28 05:50:35,705 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-28 05:50:35,705 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-28 05:50:35,705 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-28 05:50:35,705 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-28 05:50:35,706 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-28 05:50:35,706 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-28 05:50:35,706 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-28 05:50:35,706 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-28 05:50:35,706 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-28 05:50:35,706 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-28 05:50:35,706 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-28 05:50:35,706 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-28 05:50:35,707 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 05:50:35,707 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-28 05:50:35,707 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-28 05:50:35,707 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-28 05:50:35,707 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-28 05:50:35,707 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-28 05:50:35,707 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> aa94cb741c9c7eaa2ca9bb871f44dd4c619faf21975944b61e221a61ad9730d7 [2021-12-28 05:50:35,973 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-28 05:50:36,000 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-28 05:50:36,003 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-28 05:50:36,003 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-28 05:50:36,004 INFO L275 PluginConnector]: CDTParser initialized [2021-12-28 05:50:36,005 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0521.i [2021-12-28 05:50:36,044 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0eed3c9b2/ea7c97398aba43e9bef82c3800b769ae/FLAGcd5fd2729 [2021-12-28 05:50:36,502 INFO L306 CDTParser]: Found 1 translation units. [2021-12-28 05:50:36,502 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0521.i [2021-12-28 05:50:36,513 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0eed3c9b2/ea7c97398aba43e9bef82c3800b769ae/FLAGcd5fd2729 [2021-12-28 05:50:36,534 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0eed3c9b2/ea7c97398aba43e9bef82c3800b769ae [2021-12-28 05:50:36,536 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-28 05:50:36,538 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-28 05:50:36,539 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-28 05:50:36,539 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-28 05:50:36,541 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-28 05:50:36,542 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 05:50:36" (1/1) ... [2021-12-28 05:50:36,542 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78f78805 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:50:36, skipping insertion in model container [2021-12-28 05:50:36,543 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 05:50:36" (1/1) ... [2021-12-28 05:50:36,546 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-28 05:50:36,584 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-28 05:50:36,861 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 05:50:36,868 INFO L203 MainTranslator]: Completed pre-run [2021-12-28 05:50:36,923 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 05:50:36,948 INFO L208 MainTranslator]: Completed translation [2021-12-28 05:50:36,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:50:36 WrapperNode [2021-12-28 05:50:36,950 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-28 05:50:36,950 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-28 05:50:36,951 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-28 05:50:36,951 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-28 05:50:36,955 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:50:36" (1/1) ... [2021-12-28 05:50:36,981 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:50:36" (1/1) ... [2021-12-28 05:50:37,004 INFO L137 Inliner]: procedures = 128, calls = 95, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 298 [2021-12-28 05:50:37,004 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-28 05:50:37,005 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-28 05:50:37,005 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-28 05:50:37,005 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-28 05:50:37,010 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:50:36" (1/1) ... [2021-12-28 05:50:37,010 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:50:36" (1/1) ... [2021-12-28 05:50:37,013 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:50:36" (1/1) ... [2021-12-28 05:50:37,013 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:50:36" (1/1) ... [2021-12-28 05:50:37,022 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:50:36" (1/1) ... [2021-12-28 05:50:37,025 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:50:36" (1/1) ... [2021-12-28 05:50:37,027 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:50:36" (1/1) ... [2021-12-28 05:50:37,029 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-28 05:50:37,030 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-28 05:50:37,030 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-28 05:50:37,030 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-28 05:50:37,030 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:50:36" (1/1) ... [2021-12-28 05:50:37,042 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 05:50:37,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:50:37,080 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-28 05:50:37,090 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-28 05:50:37,107 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-28 05:50:37,107 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-28 05:50:37,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-28 05:50:37,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-28 05:50:37,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-28 05:50:37,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-28 05:50:37,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-28 05:50:37,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-28 05:50:37,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-28 05:50:37,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-28 05:50:37,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-28 05:50:37,213 INFO L234 CfgBuilder]: Building ICFG [2021-12-28 05:50:37,228 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-28 05:50:38,001 INFO L275 CfgBuilder]: Performing block encoding [2021-12-28 05:50:38,009 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-28 05:50:38,010 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2021-12-28 05:50:38,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 05:50:38 BoogieIcfgContainer [2021-12-28 05:50:38,012 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-28 05:50:38,014 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-28 05:50:38,014 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-28 05:50:38,016 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-28 05:50:38,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 05:50:36" (1/3) ... [2021-12-28 05:50:38,017 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@524e73d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 05:50:38, skipping insertion in model container [2021-12-28 05:50:38,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:50:36" (2/3) ... [2021-12-28 05:50:38,017 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@524e73d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 05:50:38, skipping insertion in model container [2021-12-28 05:50:38,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 05:50:38" (3/3) ... [2021-12-28 05:50:38,018 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0521.i [2021-12-28 05:50:38,022 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-28 05:50:38,022 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 152 error locations. [2021-12-28 05:50:38,053 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-28 05:50:38,059 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-28 05:50:38,059 INFO L340 AbstractCegarLoop]: Starting to check reachability of 152 error locations. [2021-12-28 05:50:38,077 INFO L276 IsEmpty]: Start isEmpty. Operand has 309 states, 156 states have (on average 2.2115384615384617) internal successors, (345), 308 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:38,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-28 05:50:38,080 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:50:38,081 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-28 05:50:38,081 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2021-12-28 05:50:38,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:50:38,085 INFO L85 PathProgramCache]: Analyzing trace with hash 28727526, now seen corresponding path program 1 times [2021-12-28 05:50:38,092 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:50:38,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2029814024] [2021-12-28 05:50:38,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:50:38,093 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:50:38,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:50:38,095 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:50:38,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-28 05:50:38,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:50:38,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 1 conjunts are in the unsatisfiable core [2021-12-28 05:50:38,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:50:38,194 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-28 05:50:38,194 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:50:38,195 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:50:38,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2029814024] [2021-12-28 05:50:38,195 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2029814024] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:50:38,195 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:50:38,196 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 05:50:38,197 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410614285] [2021-12-28 05:50:38,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:50:38,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-28 05:50:38,199 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:50:38,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-28 05:50:38,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-28 05:50:38,227 INFO L87 Difference]: Start difference. First operand has 309 states, 156 states have (on average 2.2115384615384617) internal successors, (345), 308 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:38,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:50:38,249 INFO L93 Difference]: Finished difference Result 309 states and 335 transitions. [2021-12-28 05:50:38,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-28 05:50:38,250 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2021-12-28 05:50:38,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:50:38,268 INFO L225 Difference]: With dead ends: 309 [2021-12-28 05:50:38,269 INFO L226 Difference]: Without dead ends: 307 [2021-12-28 05:50:38,270 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-28 05:50:38,272 INFO L933 BasicCegarLoop]: 335 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 05:50:38,272 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 05:50:38,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2021-12-28 05:50:38,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2021-12-28 05:50:38,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 155 states have (on average 2.1483870967741936) internal successors, (333), 306 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:38,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 333 transitions. [2021-12-28 05:50:38,317 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 333 transitions. Word has length 5 [2021-12-28 05:50:38,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:50:38,318 INFO L470 AbstractCegarLoop]: Abstraction has 307 states and 333 transitions. [2021-12-28 05:50:38,318 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:38,318 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 333 transitions. [2021-12-28 05:50:38,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-28 05:50:38,331 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:50:38,331 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-28 05:50:38,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-12-28 05:50:38,538 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:50:38,538 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2021-12-28 05:50:38,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:50:38,539 INFO L85 PathProgramCache]: Analyzing trace with hash 28698696, now seen corresponding path program 1 times [2021-12-28 05:50:38,539 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:50:38,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1957554801] [2021-12-28 05:50:38,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:50:38,539 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:50:38,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:50:38,541 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:50:38,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-28 05:50:38,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:50:38,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-28 05:50:38,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:50:38,623 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-28 05:50:38,628 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-28 05:50:38,628 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:50:38,628 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:50:38,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1957554801] [2021-12-28 05:50:38,629 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1957554801] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:50:38,629 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:50:38,629 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 05:50:38,629 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596100838] [2021-12-28 05:50:38,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:50:38,630 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 05:50:38,630 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:50:38,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 05:50:38,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:50:38,631 INFO L87 Difference]: Start difference. First operand 307 states and 333 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:38,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:50:38,988 INFO L93 Difference]: Finished difference Result 291 states and 317 transitions. [2021-12-28 05:50:38,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:50:38,989 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2021-12-28 05:50:38,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:50:38,991 INFO L225 Difference]: With dead ends: 291 [2021-12-28 05:50:38,991 INFO L226 Difference]: Without dead ends: 291 [2021-12-28 05:50:38,991 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-28 05:50:38,992 INFO L933 BasicCegarLoop]: 270 mSDtfsCounter, 77 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 05:50:38,992 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 396 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-28 05:50:38,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2021-12-28 05:50:39,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2021-12-28 05:50:39,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 155 states have (on average 2.0451612903225804) internal successors, (317), 290 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:39,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 317 transitions. [2021-12-28 05:50:39,011 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 317 transitions. Word has length 5 [2021-12-28 05:50:39,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:50:39,012 INFO L470 AbstractCegarLoop]: Abstraction has 291 states and 317 transitions. [2021-12-28 05:50:39,012 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:39,012 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 317 transitions. [2021-12-28 05:50:39,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-28 05:50:39,012 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:50:39,012 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-28 05:50:39,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-28 05:50:39,213 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:50:39,213 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2021-12-28 05:50:39,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:50:39,214 INFO L85 PathProgramCache]: Analyzing trace with hash 28698697, now seen corresponding path program 1 times [2021-12-28 05:50:39,214 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:50:39,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1405071686] [2021-12-28 05:50:39,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:50:39,215 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:50:39,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:50:39,216 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:50:39,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-28 05:50:39,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:50:39,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-28 05:50:39,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:50:39,271 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-28 05:50:39,276 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-28 05:50:39,276 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:50:39,277 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:50:39,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1405071686] [2021-12-28 05:50:39,280 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1405071686] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:50:39,280 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:50:39,280 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 05:50:39,280 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134257149] [2021-12-28 05:50:39,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:50:39,281 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 05:50:39,281 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:50:39,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 05:50:39,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:50:39,282 INFO L87 Difference]: Start difference. First operand 291 states and 317 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:39,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:50:39,813 INFO L93 Difference]: Finished difference Result 275 states and 301 transitions. [2021-12-28 05:50:39,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:50:39,813 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2021-12-28 05:50:39,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:50:39,814 INFO L225 Difference]: With dead ends: 275 [2021-12-28 05:50:39,814 INFO L226 Difference]: Without dead ends: 275 [2021-12-28 05:50:39,815 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-28 05:50:39,815 INFO L933 BasicCegarLoop]: 270 mSDtfsCounter, 61 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-28 05:50:39,816 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 405 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-28 05:50:39,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2021-12-28 05:50:39,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2021-12-28 05:50:39,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 155 states have (on average 1.9419354838709677) internal successors, (301), 274 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:39,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 301 transitions. [2021-12-28 05:50:39,824 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 301 transitions. Word has length 5 [2021-12-28 05:50:39,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:50:39,824 INFO L470 AbstractCegarLoop]: Abstraction has 275 states and 301 transitions. [2021-12-28 05:50:39,825 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:39,825 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 301 transitions. [2021-12-28 05:50:39,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-28 05:50:39,825 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:50:39,825 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-28 05:50:39,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-28 05:50:40,025 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:50:40,025 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2021-12-28 05:50:40,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:50:40,026 INFO L85 PathProgramCache]: Analyzing trace with hash 28699819, now seen corresponding path program 1 times [2021-12-28 05:50:40,026 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:50:40,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [655552548] [2021-12-28 05:50:40,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:50:40,026 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:50:40,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:50:40,029 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:50:40,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-28 05:50:40,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:50:40,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-28 05:50:40,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:50:40,117 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-28 05:50:40,137 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-28 05:50:40,138 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:50:40,138 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:50:40,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [655552548] [2021-12-28 05:50:40,142 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [655552548] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:50:40,142 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:50:40,142 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 05:50:40,142 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647705408] [2021-12-28 05:50:40,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:50:40,143 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 05:50:40,143 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:50:40,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 05:50:40,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:50:40,144 INFO L87 Difference]: Start difference. First operand 275 states and 301 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:40,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:50:40,661 INFO L93 Difference]: Finished difference Result 329 states and 364 transitions. [2021-12-28 05:50:40,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:50:40,661 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2021-12-28 05:50:40,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:50:40,662 INFO L225 Difference]: With dead ends: 329 [2021-12-28 05:50:40,662 INFO L226 Difference]: Without dead ends: 329 [2021-12-28 05:50:40,663 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-28 05:50:40,663 INFO L933 BasicCegarLoop]: 321 mSDtfsCounter, 74 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-28 05:50:40,663 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 471 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-28 05:50:40,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2021-12-28 05:50:40,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 273. [2021-12-28 05:50:40,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 155 states have (on average 1.929032258064516) internal successors, (299), 272 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:40,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 299 transitions. [2021-12-28 05:50:40,670 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 299 transitions. Word has length 5 [2021-12-28 05:50:40,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:50:40,671 INFO L470 AbstractCegarLoop]: Abstraction has 273 states and 299 transitions. [2021-12-28 05:50:40,671 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:40,671 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 299 transitions. [2021-12-28 05:50:40,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-28 05:50:40,674 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:50:40,674 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-28 05:50:40,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-28 05:50:40,880 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:50:40,880 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2021-12-28 05:50:40,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:50:40,882 INFO L85 PathProgramCache]: Analyzing trace with hash 28699820, now seen corresponding path program 1 times [2021-12-28 05:50:40,883 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:50:40,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [799779273] [2021-12-28 05:50:40,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:50:40,883 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:50:40,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:50:40,884 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:50:40,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-28 05:50:40,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:50:40,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-28 05:50:40,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:50:40,945 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-28 05:50:40,972 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-28 05:50:40,972 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:50:40,972 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:50:40,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [799779273] [2021-12-28 05:50:40,973 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [799779273] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:50:40,973 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:50:40,973 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 05:50:40,973 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881730353] [2021-12-28 05:50:40,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:50:40,974 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 05:50:40,974 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:50:40,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 05:50:40,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:50:40,975 INFO L87 Difference]: Start difference. First operand 273 states and 299 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:41,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:50:41,607 INFO L93 Difference]: Finished difference Result 461 states and 509 transitions. [2021-12-28 05:50:41,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:50:41,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2021-12-28 05:50:41,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:50:41,610 INFO L225 Difference]: With dead ends: 461 [2021-12-28 05:50:41,610 INFO L226 Difference]: Without dead ends: 461 [2021-12-28 05:50:41,610 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-28 05:50:41,610 INFO L933 BasicCegarLoop]: 409 mSDtfsCounter, 218 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-28 05:50:41,610 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [218 Valid, 569 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-28 05:50:41,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2021-12-28 05:50:41,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 271. [2021-12-28 05:50:41,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 155 states have (on average 1.9161290322580644) internal successors, (297), 270 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:41,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 297 transitions. [2021-12-28 05:50:41,617 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 297 transitions. Word has length 5 [2021-12-28 05:50:41,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:50:41,617 INFO L470 AbstractCegarLoop]: Abstraction has 271 states and 297 transitions. [2021-12-28 05:50:41,618 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:41,618 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 297 transitions. [2021-12-28 05:50:41,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-28 05:50:41,618 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:50:41,618 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:50:41,626 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2021-12-28 05:50:41,829 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:50:41,830 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2021-12-28 05:50:41,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:50:41,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1809643625, now seen corresponding path program 1 times [2021-12-28 05:50:41,831 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:50:41,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [478243533] [2021-12-28 05:50:41,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:50:41,831 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:50:41,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:50:41,832 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:50:41,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-28 05:50:41,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:50:41,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-28 05:50:41,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:50:41,909 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-28 05:50:41,909 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:50:41,910 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:50:41,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [478243533] [2021-12-28 05:50:41,910 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [478243533] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:50:41,910 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:50:41,910 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 05:50:41,910 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622558771] [2021-12-28 05:50:41,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:50:41,911 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 05:50:41,911 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:50:41,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 05:50:41,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-28 05:50:41,911 INFO L87 Difference]: Start difference. First operand 271 states and 297 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-28 05:50:41,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:50:41,973 INFO L93 Difference]: Finished difference Result 668 states and 734 transitions. [2021-12-28 05:50:41,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 05:50:41,974 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-28 05:50:41,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:50:41,975 INFO L225 Difference]: With dead ends: 668 [2021-12-28 05:50:41,975 INFO L226 Difference]: Without dead ends: 668 [2021-12-28 05:50:41,975 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-28 05:50:41,976 INFO L933 BasicCegarLoop]: 292 mSDtfsCounter, 587 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 587 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 05:50:41,976 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [587 Valid, 855 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 05:50:41,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2021-12-28 05:50:41,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 275. [2021-12-28 05:50:41,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 159 states have (on average 1.89937106918239) internal successors, (302), 274 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:41,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 302 transitions. [2021-12-28 05:50:41,982 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 302 transitions. Word has length 7 [2021-12-28 05:50:41,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:50:41,982 INFO L470 AbstractCegarLoop]: Abstraction has 275 states and 302 transitions. [2021-12-28 05:50:41,982 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-28 05:50:41,982 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 302 transitions. [2021-12-28 05:50:41,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-28 05:50:41,982 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:50:41,983 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:50:42,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2021-12-28 05:50:42,189 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:50:42,189 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2021-12-28 05:50:42,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:50:42,190 INFO L85 PathProgramCache]: Analyzing trace with hash 642085168, now seen corresponding path program 1 times [2021-12-28 05:50:42,190 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:50:42,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1852788016] [2021-12-28 05:50:42,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:50:42,190 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:50:42,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:50:42,192 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:50:42,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-28 05:50:42,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:50:42,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-28 05:50:42,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:50:42,256 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-28 05:50:42,261 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-28 05:50:42,261 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:50:42,261 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:50:42,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1852788016] [2021-12-28 05:50:42,261 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1852788016] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:50:42,261 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:50:42,261 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 05:50:42,262 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51909906] [2021-12-28 05:50:42,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:50:42,262 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 05:50:42,262 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:50:42,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 05:50:42,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:50:42,263 INFO L87 Difference]: Start difference. First operand 275 states and 302 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-28 05:50:42,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:50:42,554 INFO L93 Difference]: Finished difference Result 324 states and 358 transitions. [2021-12-28 05:50:42,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:50:42,555 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-28 05:50:42,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:50:42,556 INFO L225 Difference]: With dead ends: 324 [2021-12-28 05:50:42,556 INFO L226 Difference]: Without dead ends: 324 [2021-12-28 05:50:42,556 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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-28 05:50:42,557 INFO L933 BasicCegarLoop]: 316 mSDtfsCounter, 70 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 05:50:42,557 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 464 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-28 05:50:42,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2021-12-28 05:50:42,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 273. [2021-12-28 05:50:42,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 159 states have (on average 1.8867924528301887) internal successors, (300), 272 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:42,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 300 transitions. [2021-12-28 05:50:42,563 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 300 transitions. Word has length 9 [2021-12-28 05:50:42,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:50:42,563 INFO L470 AbstractCegarLoop]: Abstraction has 273 states and 300 transitions. [2021-12-28 05:50:42,563 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-28 05:50:42,564 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 300 transitions. [2021-12-28 05:50:42,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-28 05:50:42,564 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:50:42,564 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:50:42,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-12-28 05:50:42,770 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:50:42,771 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2021-12-28 05:50:42,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:50:42,772 INFO L85 PathProgramCache]: Analyzing trace with hash 642085169, now seen corresponding path program 1 times [2021-12-28 05:50:42,772 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:50:42,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [759849128] [2021-12-28 05:50:42,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:50:42,772 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:50:42,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:50:42,773 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:50:42,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-28 05:50:42,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:50:42,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-28 05:50:42,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:50:42,872 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-28 05:50:42,888 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-28 05:50:42,888 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:50:42,888 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:50:42,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [759849128] [2021-12-28 05:50:42,889 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [759849128] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:50:42,889 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:50:42,889 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 05:50:42,889 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042594952] [2021-12-28 05:50:42,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:50:42,889 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 05:50:42,889 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:50:42,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 05:50:42,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:50:42,889 INFO L87 Difference]: Start difference. First operand 273 states and 300 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-28 05:50:43,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:50:43,856 INFO L93 Difference]: Finished difference Result 456 states and 503 transitions. [2021-12-28 05:50:43,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:50:43,857 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-28 05:50:43,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:50:43,859 INFO L225 Difference]: With dead ends: 456 [2021-12-28 05:50:43,859 INFO L226 Difference]: Without dead ends: 456 [2021-12-28 05:50:43,859 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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-28 05:50:43,859 INFO L933 BasicCegarLoop]: 404 mSDtfsCounter, 214 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-28 05:50:43,860 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [214 Valid, 562 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-12-28 05:50:43,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2021-12-28 05:50:43,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 271. [2021-12-28 05:50:43,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 159 states have (on average 1.8742138364779874) internal successors, (298), 270 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:43,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 298 transitions. [2021-12-28 05:50:43,864 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 298 transitions. Word has length 9 [2021-12-28 05:50:43,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:50:43,864 INFO L470 AbstractCegarLoop]: Abstraction has 271 states and 298 transitions. [2021-12-28 05:50:43,864 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-28 05:50:43,864 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 298 transitions. [2021-12-28 05:50:43,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-28 05:50:43,864 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:50:43,864 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:50:43,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2021-12-28 05:50:44,071 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:50:44,071 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2021-12-28 05:50:44,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:50:44,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1904018325, now seen corresponding path program 1 times [2021-12-28 05:50:44,072 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:50:44,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [788859835] [2021-12-28 05:50:44,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:50:44,072 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:50:44,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:50:44,073 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:50:44,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-28 05:50:44,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:50:44,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-28 05:50:44,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:50:44,155 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-28 05:50:44,158 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-28 05:50:44,195 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-28 05:50:44,197 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-28 05:50:44,209 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-28 05:50:44,209 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:50:44,210 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:50:44,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [788859835] [2021-12-28 05:50:44,210 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [788859835] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:50:44,210 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:50:44,210 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:50:44,210 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136842021] [2021-12-28 05:50:44,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:50:44,210 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:50:44,211 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:50:44,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:50:44,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:50:44,211 INFO L87 Difference]: Start difference. First operand 271 states and 298 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:44,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:50:44,569 INFO L93 Difference]: Finished difference Result 656 states and 722 transitions. [2021-12-28 05:50:44,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:50:44,571 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2021-12-28 05:50:44,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:50:44,573 INFO L225 Difference]: With dead ends: 656 [2021-12-28 05:50:44,573 INFO L226 Difference]: Without dead ends: 656 [2021-12-28 05:50:44,573 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-28 05:50:44,574 INFO L933 BasicCegarLoop]: 279 mSDtfsCounter, 566 mSDsluCounter, 1059 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 1338 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 05:50:44,574 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [566 Valid, 1338 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-28 05:50:44,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2021-12-28 05:50:44,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 274. [2021-12-28 05:50:44,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 162 states have (on average 1.8580246913580247) internal successors, (301), 273 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:44,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 301 transitions. [2021-12-28 05:50:44,580 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 301 transitions. Word has length 12 [2021-12-28 05:50:44,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:50:44,580 INFO L470 AbstractCegarLoop]: Abstraction has 274 states and 301 transitions. [2021-12-28 05:50:44,581 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:44,581 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 301 transitions. [2021-12-28 05:50:44,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-28 05:50:44,581 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:50:44,581 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:50:44,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-12-28 05:50:44,790 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:50:44,791 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2021-12-28 05:50:44,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:50:44,791 INFO L85 PathProgramCache]: Analyzing trace with hash 94773195, now seen corresponding path program 1 times [2021-12-28 05:50:44,791 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:50:44,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1887609804] [2021-12-28 05:50:44,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:50:44,792 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:50:44,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:50:44,794 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:50:44,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-12-28 05:50:44,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:50:44,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-28 05:50:44,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:50:44,919 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-28 05:50:44,919 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:50:44,919 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:50:44,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1887609804] [2021-12-28 05:50:44,919 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1887609804] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:50:44,919 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:50:44,920 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 05:50:44,920 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21632840] [2021-12-28 05:50:44,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:50:44,920 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 05:50:44,920 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:50:44,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 05:50:44,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:50:44,921 INFO L87 Difference]: Start difference. First operand 274 states and 301 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:45,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:50:45,078 INFO L93 Difference]: Finished difference Result 402 states and 440 transitions. [2021-12-28 05:50:45,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:50:45,091 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-12-28 05:50:45,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:50:45,092 INFO L225 Difference]: With dead ends: 402 [2021-12-28 05:50:45,092 INFO L226 Difference]: Without dead ends: 402 [2021-12-28 05:50:45,093 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 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-28 05:50:45,093 INFO L933 BasicCegarLoop]: 285 mSDtfsCounter, 236 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 1100 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:50:45,093 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [236 Valid, 1100 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:50:45,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2021-12-28 05:50:45,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 338. [2021-12-28 05:50:45,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 226 states have (on average 1.8982300884955752) internal successors, (429), 337 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:45,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 429 transitions. [2021-12-28 05:50:45,099 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 429 transitions. Word has length 14 [2021-12-28 05:50:45,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:50:45,099 INFO L470 AbstractCegarLoop]: Abstraction has 338 states and 429 transitions. [2021-12-28 05:50:45,099 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:45,099 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 429 transitions. [2021-12-28 05:50:45,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-28 05:50:45,099 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:50:45,099 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:50:45,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-12-28 05:50:45,300 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:50:45,300 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2021-12-28 05:50:45,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:50:45,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1350258318, now seen corresponding path program 1 times [2021-12-28 05:50:45,300 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:50:45,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1897828323] [2021-12-28 05:50:45,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:50:45,300 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:50:45,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:50:45,301 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:50:45,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-12-28 05:50:45,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:50:45,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-28 05:50:45,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:50:45,397 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-28 05:50:45,397 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:50:45,397 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:50:45,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1897828323] [2021-12-28 05:50:45,397 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1897828323] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:50:45,397 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:50:45,397 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 05:50:45,397 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158144914] [2021-12-28 05:50:45,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:50:45,398 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 05:50:45,398 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:50:45,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 05:50:45,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:50:45,398 INFO L87 Difference]: Start difference. First operand 338 states and 429 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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-28 05:50:45,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:50:45,426 INFO L93 Difference]: Finished difference Result 323 states and 404 transitions. [2021-12-28 05:50:45,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:50:45,427 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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-28 05:50:45,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:50:45,428 INFO L225 Difference]: With dead ends: 323 [2021-12-28 05:50:45,428 INFO L226 Difference]: Without dead ends: 323 [2021-12-28 05:50:45,428 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 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-28 05:50:45,429 INFO L933 BasicCegarLoop]: 292 mSDtfsCounter, 220 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 05:50:45,429 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [220 Valid, 356 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 05:50:45,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2021-12-28 05:50:45,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2021-12-28 05:50:45,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 211 states have (on average 1.914691943127962) internal successors, (404), 322 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:45,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 404 transitions. [2021-12-28 05:50:45,433 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 404 transitions. Word has length 15 [2021-12-28 05:50:45,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:50:45,433 INFO L470 AbstractCegarLoop]: Abstraction has 323 states and 404 transitions. [2021-12-28 05:50:45,433 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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-28 05:50:45,433 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 404 transitions. [2021-12-28 05:50:45,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-28 05:50:45,434 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:50:45,434 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:50:45,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Ended with exit code 0 [2021-12-28 05:50:45,640 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:50:45,640 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2021-12-28 05:50:45,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:50:45,641 INFO L85 PathProgramCache]: Analyzing trace with hash 882923631, now seen corresponding path program 1 times [2021-12-28 05:50:45,641 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:50:45,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [899220536] [2021-12-28 05:50:45,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:50:45,641 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:50:45,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:50:45,642 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:50:45,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-12-28 05:50:45,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:50:45,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-28 05:50:45,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:50:45,725 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-28 05:50:45,728 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-28 05:50:45,729 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:50:45,729 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:50:45,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [899220536] [2021-12-28 05:50:45,729 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [899220536] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:50:45,729 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:50:45,729 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 05:50:45,729 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463773086] [2021-12-28 05:50:45,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:50:45,730 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 05:50:45,730 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:50:45,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 05:50:45,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:50:45,730 INFO L87 Difference]: Start difference. First operand 323 states and 404 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:46,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:50:46,181 INFO L93 Difference]: Finished difference Result 307 states and 372 transitions. [2021-12-28 05:50:46,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:50:46,182 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2021-12-28 05:50:46,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:50:46,183 INFO L225 Difference]: With dead ends: 307 [2021-12-28 05:50:46,183 INFO L226 Difference]: Without dead ends: 307 [2021-12-28 05:50:46,183 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 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-28 05:50:46,184 INFO L933 BasicCegarLoop]: 230 mSDtfsCounter, 77 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-28 05:50:46,184 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 336 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-28 05:50:46,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2021-12-28 05:50:46,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2021-12-28 05:50:46,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 211 states have (on average 1.7630331753554502) internal successors, (372), 306 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:46,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 372 transitions. [2021-12-28 05:50:46,188 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 372 transitions. Word has length 16 [2021-12-28 05:50:46,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:50:46,188 INFO L470 AbstractCegarLoop]: Abstraction has 307 states and 372 transitions. [2021-12-28 05:50:46,188 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:46,188 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 372 transitions. [2021-12-28 05:50:46,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-28 05:50:46,190 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:50:46,190 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:50:46,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-12-28 05:50:46,396 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:50:46,397 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr94REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2021-12-28 05:50:46,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:50:46,397 INFO L85 PathProgramCache]: Analyzing trace with hash 882923632, now seen corresponding path program 1 times [2021-12-28 05:50:46,397 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:50:46,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1055930566] [2021-12-28 05:50:46,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:50:46,398 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:50:46,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:50:46,412 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:50:46,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-12-28 05:50:46,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:50:46,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-28 05:50:46,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:50:46,554 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-28 05:50:46,560 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-28 05:50:46,560 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:50:46,560 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:50:46,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1055930566] [2021-12-28 05:50:46,560 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1055930566] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:50:46,560 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:50:46,560 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 05:50:46,560 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405050553] [2021-12-28 05:50:46,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:50:46,560 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 05:50:46,560 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:50:46,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 05:50:46,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:50:46,561 INFO L87 Difference]: Start difference. First operand 307 states and 372 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:46,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:50:46,927 INFO L93 Difference]: Finished difference Result 291 states and 340 transitions. [2021-12-28 05:50:46,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:50:46,928 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2021-12-28 05:50:46,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:50:46,929 INFO L225 Difference]: With dead ends: 291 [2021-12-28 05:50:46,929 INFO L226 Difference]: Without dead ends: 291 [2021-12-28 05:50:46,929 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 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-28 05:50:46,929 INFO L933 BasicCegarLoop]: 230 mSDtfsCounter, 61 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-28 05:50:46,930 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 345 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-28 05:50:46,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2021-12-28 05:50:46,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2021-12-28 05:50:46,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 211 states have (on average 1.6113744075829384) internal successors, (340), 290 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:46,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 340 transitions. [2021-12-28 05:50:46,933 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 340 transitions. Word has length 16 [2021-12-28 05:50:46,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:50:46,933 INFO L470 AbstractCegarLoop]: Abstraction has 291 states and 340 transitions. [2021-12-28 05:50:46,933 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:46,933 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 340 transitions. [2021-12-28 05:50:46,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-28 05:50:46,934 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:50:46,934 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:50:46,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-12-28 05:50:47,134 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:50:47,134 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2021-12-28 05:50:47,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:50:47,135 INFO L85 PathProgramCache]: Analyzing trace with hash -276171814, now seen corresponding path program 1 times [2021-12-28 05:50:47,135 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:50:47,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [652617209] [2021-12-28 05:50:47,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:50:47,135 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:50:47,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:50:47,136 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:50:47,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-12-28 05:50:47,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:50:47,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-28 05:50:47,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:50:47,232 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-28 05:50:47,268 INFO L353 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-28 05:50:47,268 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2021-12-28 05:50:47,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:50:47,281 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:50:47,281 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:50:47,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [652617209] [2021-12-28 05:50:47,282 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [652617209] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:50:47,282 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:50:47,282 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 05:50:47,282 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104169368] [2021-12-28 05:50:47,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:50:47,282 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 05:50:47,282 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:50:47,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 05:50:47,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:50:47,283 INFO L87 Difference]: Start difference. First operand 291 states and 340 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:47,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:50:47,751 INFO L93 Difference]: Finished difference Result 313 states and 363 transitions. [2021-12-28 05:50:47,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 05:50:47,752 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2021-12-28 05:50:47,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:50:47,752 INFO L225 Difference]: With dead ends: 313 [2021-12-28 05:50:47,753 INFO L226 Difference]: Without dead ends: 313 [2021-12-28 05:50:47,753 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 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-28 05:50:47,753 INFO L933 BasicCegarLoop]: 222 mSDtfsCounter, 208 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-28 05:50:47,753 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 533 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-28 05:50:47,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2021-12-28 05:50:47,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 293. [2021-12-28 05:50:47,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 215 states have (on average 1.6046511627906976) internal successors, (345), 292 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:47,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 345 transitions. [2021-12-28 05:50:47,757 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 345 transitions. Word has length 16 [2021-12-28 05:50:47,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:50:47,757 INFO L470 AbstractCegarLoop]: Abstraction has 293 states and 345 transitions. [2021-12-28 05:50:47,757 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:47,757 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 345 transitions. [2021-12-28 05:50:47,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-28 05:50:47,757 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:50:47,757 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:50:47,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-12-28 05:50:47,964 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:50:47,964 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2021-12-28 05:50:47,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:50:47,965 INFO L85 PathProgramCache]: Analyzing trace with hash -276171813, now seen corresponding path program 1 times [2021-12-28 05:50:47,965 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:50:47,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [373101441] [2021-12-28 05:50:47,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:50:47,965 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:50:47,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:50:47,966 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:50:48,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-12-28 05:50:48,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:50:48,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-28 05:50:48,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:50:48,077 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-28 05:50:48,082 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-28 05:50:48,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:50:48,164 INFO L387 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-28 05:50:48,171 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-28 05:50:48,171 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-28 05:50:48,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:50:48,189 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:50:48,189 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:50:48,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [373101441] [2021-12-28 05:50:48,189 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [373101441] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:50:48,189 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:50:48,190 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 05:50:48,190 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889568879] [2021-12-28 05:50:48,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:50:48,203 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 05:50:48,203 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:50:48,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 05:50:48,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:50:48,204 INFO L87 Difference]: Start difference. First operand 293 states and 345 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:49,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:50:49,275 INFO L93 Difference]: Finished difference Result 406 states and 474 transitions. [2021-12-28 05:50:49,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 05:50:49,276 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2021-12-28 05:50:49,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:50:49,277 INFO L225 Difference]: With dead ends: 406 [2021-12-28 05:50:49,277 INFO L226 Difference]: Without dead ends: 406 [2021-12-28 05:50:49,278 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 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-28 05:50:49,278 INFO L933 BasicCegarLoop]: 250 mSDtfsCounter, 298 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-28 05:50:49,278 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [298 Valid, 579 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-12-28 05:50:49,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2021-12-28 05:50:49,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 292. [2021-12-28 05:50:49,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 215 states have (on average 1.6) internal successors, (344), 291 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:49,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 344 transitions. [2021-12-28 05:50:49,283 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 344 transitions. Word has length 16 [2021-12-28 05:50:49,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:50:49,284 INFO L470 AbstractCegarLoop]: Abstraction has 292 states and 344 transitions. [2021-12-28 05:50:49,284 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:49,284 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 344 transitions. [2021-12-28 05:50:49,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-28 05:50:49,284 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:50:49,284 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-28 05:50:49,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-12-28 05:50:49,492 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:50:49,493 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2021-12-28 05:50:49,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:50:49,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1913905968, now seen corresponding path program 1 times [2021-12-28 05:50:49,493 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:50:49,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [608439284] [2021-12-28 05:50:49,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:50:49,493 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:50:49,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:50:49,494 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:50:49,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-12-28 05:50:49,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:50:49,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-28 05:50:49,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:50:49,641 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-28 05:50:49,642 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:50:49,642 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:50:49,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [608439284] [2021-12-28 05:50:49,642 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [608439284] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:50:49,642 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:50:49,642 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 05:50:49,642 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042433067] [2021-12-28 05:50:49,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:50:49,643 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 05:50:49,643 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:50:49,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 05:50:49,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:50:49,643 INFO L87 Difference]: Start difference. First operand 292 states and 344 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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-28 05:50:49,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:50:49,763 INFO L93 Difference]: Finished difference Result 392 states and 439 transitions. [2021-12-28 05:50:49,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-28 05:50:49,764 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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-28 05:50:49,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:50:49,765 INFO L225 Difference]: With dead ends: 392 [2021-12-28 05:50:49,765 INFO L226 Difference]: Without dead ends: 392 [2021-12-28 05:50:49,765 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 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-28 05:50:49,765 INFO L933 BasicCegarLoop]: 250 mSDtfsCounter, 275 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 963 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:50:49,766 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [275 Valid, 963 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:50:49,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2021-12-28 05:50:49,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 289. [2021-12-28 05:50:49,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 212 states have (on average 1.5943396226415094) internal successors, (338), 288 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:49,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 338 transitions. [2021-12-28 05:50:49,769 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 338 transitions. Word has length 18 [2021-12-28 05:50:49,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:50:49,770 INFO L470 AbstractCegarLoop]: Abstraction has 289 states and 338 transitions. [2021-12-28 05:50:49,770 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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-28 05:50:49,770 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 338 transitions. [2021-12-28 05:50:49,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-28 05:50:49,770 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:50:49,770 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] [2021-12-28 05:50:49,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-12-28 05:50:49,971 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:50:49,971 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2021-12-28 05:50:49,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:50:49,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1787332292, now seen corresponding path program 1 times [2021-12-28 05:50:49,971 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:50:49,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1571989303] [2021-12-28 05:50:49,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:50:49,972 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:50:49,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:50:49,973 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:50:49,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-12-28 05:50:50,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:50:50,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-28 05:50:50,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:50:50,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:50:50,105 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:50:50,105 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:50:50,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1571989303] [2021-12-28 05:50:50,105 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1571989303] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:50:50,105 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:50:50,105 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 05:50:50,105 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96632890] [2021-12-28 05:50:50,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:50:50,106 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 05:50:50,106 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:50:50,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 05:50:50,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:50:50,107 INFO L87 Difference]: Start difference. First operand 289 states and 338 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:50,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:50:50,189 INFO L93 Difference]: Finished difference Result 312 states and 347 transitions. [2021-12-28 05:50:50,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 05:50:50,189 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-28 05:50:50,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:50:50,190 INFO L225 Difference]: With dead ends: 312 [2021-12-28 05:50:50,190 INFO L226 Difference]: Without dead ends: 312 [2021-12-28 05:50:50,190 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 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-28 05:50:50,190 INFO L933 BasicCegarLoop]: 325 mSDtfsCounter, 655 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 655 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:50:50,191 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [655 Valid, 637 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:50:50,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2021-12-28 05:50:50,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 289. [2021-12-28 05:50:50,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 212 states have (on average 1.5896226415094339) internal successors, (337), 288 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:50,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 337 transitions. [2021-12-28 05:50:50,193 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 337 transitions. Word has length 21 [2021-12-28 05:50:50,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:50:50,194 INFO L470 AbstractCegarLoop]: Abstraction has 289 states and 337 transitions. [2021-12-28 05:50:50,194 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:50,194 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 337 transitions. [2021-12-28 05:50:50,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-28 05:50:50,194 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:50:50,194 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] [2021-12-28 05:50:50,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-12-28 05:50:50,401 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:50:50,402 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr103REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2021-12-28 05:50:50,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:50:50,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1853899934, now seen corresponding path program 1 times [2021-12-28 05:50:50,402 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:50:50,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1716144690] [2021-12-28 05:50:50,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:50:50,402 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:50:50,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:50:50,403 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:50:50,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-12-28 05:50:50,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:50:50,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-28 05:50:50,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:50:50,625 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-28 05:50:50,630 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-28 05:50:50,681 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-28 05:50:50,684 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-28 05:50:50,707 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-28 05:50:50,707 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:50:50,707 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:50:50,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1716144690] [2021-12-28 05:50:50,708 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1716144690] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:50:50,708 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:50:50,708 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 05:50:50,709 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888771211] [2021-12-28 05:50:50,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:50:50,710 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 05:50:50,710 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:50:50,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 05:50:50,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-28 05:50:50,710 INFO L87 Difference]: Start difference. First operand 289 states and 337 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:51,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:50:51,160 INFO L93 Difference]: Finished difference Result 388 states and 434 transitions. [2021-12-28 05:50:51,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-28 05:50:51,161 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-28 05:50:51,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:50:51,162 INFO L225 Difference]: With dead ends: 388 [2021-12-28 05:50:51,162 INFO L226 Difference]: Without dead ends: 388 [2021-12-28 05:50:51,162 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-12-28 05:50:51,162 INFO L933 BasicCegarLoop]: 240 mSDtfsCounter, 250 mSDsluCounter, 1138 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 1378 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-28 05:50:51,162 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [250 Valid, 1378 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-28 05:50:51,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2021-12-28 05:50:51,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 275. [2021-12-28 05:50:51,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 198 states have (on average 1.5858585858585859) internal successors, (314), 274 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:51,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 314 transitions. [2021-12-28 05:50:51,166 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 314 transitions. Word has length 23 [2021-12-28 05:50:51,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:50:51,166 INFO L470 AbstractCegarLoop]: Abstraction has 275 states and 314 transitions. [2021-12-28 05:50:51,166 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:50:51,166 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 314 transitions. [2021-12-28 05:50:51,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-28 05:50:51,166 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:50:51,166 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-28 05:50:51,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2021-12-28 05:50:51,366 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:50:51,367 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2021-12-28 05:50:51,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:50:51,367 INFO L85 PathProgramCache]: Analyzing trace with hash 984415872, now seen corresponding path program 1 times [2021-12-28 05:50:51,368 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:50:51,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2146705870] [2021-12-28 05:50:51,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:50:51,368 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:50:51,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:50:51,384 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:50:51,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-12-28 05:50:51,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:50:51,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 26 conjunts are in the unsatisfiable core [2021-12-28 05:50:51,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:50:51,572 INFO L353 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2021-12-28 05:50:51,572 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 21 [2021-12-28 05:50:51,634 INFO L353 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2021-12-28 05:50:51,634 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2021-12-28 05:50:51,725 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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-28 05:50:51,803 INFO L353 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-28 05:50:51,803 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 35 [2021-12-28 05:50:51,990 INFO L353 Elim1Store]: treesize reduction 77, result has 36.9 percent of original size [2021-12-28 05:50:51,991 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 40 treesize of output 71 [2021-12-28 05:50:52,176 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2021-12-28 05:50:53,291 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 40 [2021-12-28 05:50:56,841 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 62 treesize of output 30 [2021-12-28 05:50:57,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:50:57,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:50:57,623 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_310 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~#iter~0#1.base_53| (_ BitVec 32))) (or (= (select (store |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_53| (_ bv1 1)) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~#iter~0#1.base_53| v_ArrVal_310) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|)) (_ bv1 1)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_53|))))) is different from false [2021-12-28 05:50:57,668 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_310 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~#iter~0#1.base_53| (_ BitVec 32))) (or (= (select (store |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_53| (_ bv1 1)) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~#iter~0#1.base_53| v_ArrVal_310) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (_ bv1 1)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_53|))))) is different from false [2021-12-28 05:50:57,681 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_310 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_308 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#iter~0#1.base_53| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_53|))) (= (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_53| (_ bv1 1)) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) (bvadd |c_ULTIMATE.start_main_~item~0#1.offset| (_ bv4 32)) v_ArrVal_308)) |v_ULTIMATE.start_main_~#iter~0#1.base_53| v_ArrVal_310) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))))) is different from false [2021-12-28 05:50:57,702 INFO L353 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2021-12-28 05:50:57,702 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 34 [2021-12-28 05:50:57,705 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2021-12-28 05:50:57,708 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2021-12-28 05:51:06,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:51:06,892 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:51:06,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2146705870] [2021-12-28 05:51:06,893 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2146705870] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-28 05:51:06,893 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 05:51:06,893 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [10] total 22 [2021-12-28 05:51:06,893 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188854754] [2021-12-28 05:51:06,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:51:06,893 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-28 05:51:06,893 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:51:06,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-28 05:51:06,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=331, Unknown=8, NotChecked=114, Total=506 [2021-12-28 05:51:06,894 INFO L87 Difference]: Start difference. First operand 275 states and 314 transitions. Second operand has 13 states, 12 states have (on average 2.0) internal successors, (24), 13 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-28 05:51:07,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:51:07,786 INFO L93 Difference]: Finished difference Result 276 states and 315 transitions. [2021-12-28 05:51:07,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-28 05:51:07,787 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 13 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-28 05:51:07,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:51:07,788 INFO L225 Difference]: With dead ends: 276 [2021-12-28 05:51:07,788 INFO L226 Difference]: Without dead ends: 276 [2021-12-28 05:51:07,788 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=80, Invalid=524, Unknown=8, NotChecked=144, Total=756 [2021-12-28 05:51:07,788 INFO L933 BasicCegarLoop]: 222 mSDtfsCounter, 60 mSDsluCounter, 1330 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1552 SdHoareTripleChecker+Invalid, 1502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 883 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-28 05:51:07,788 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 1552 Invalid, 1502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 614 Invalid, 0 Unknown, 883 Unchecked, 0.7s Time] [2021-12-28 05:51:07,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2021-12-28 05:51:07,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 274. [2021-12-28 05:51:07,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 198 states have (on average 1.5808080808080809) internal successors, (313), 273 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:07,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 313 transitions. [2021-12-28 05:51:07,791 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 313 transitions. Word has length 24 [2021-12-28 05:51:07,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:51:07,791 INFO L470 AbstractCegarLoop]: Abstraction has 274 states and 313 transitions. [2021-12-28 05:51:07,791 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 13 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-28 05:51:07,791 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 313 transitions. [2021-12-28 05:51:07,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-28 05:51:07,794 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:51:07,794 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-28 05:51:07,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2021-12-28 05:51:08,001 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:51:08,002 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2021-12-28 05:51:08,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:51:08,002 INFO L85 PathProgramCache]: Analyzing trace with hash 984415873, now seen corresponding path program 1 times [2021-12-28 05:51:08,002 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:51:08,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1543467538] [2021-12-28 05:51:08,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:51:08,003 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:51:08,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:51:08,007 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:51:08,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2021-12-28 05:51:08,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:51:08,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 41 conjunts are in the unsatisfiable core [2021-12-28 05:51:08,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:51:08,175 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-28 05:51:08,178 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-28 05:51:08,225 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-28 05:51:08,225 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2021-12-28 05:51:08,244 INFO L353 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-28 05:51:08,244 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2021-12-28 05:51:08,289 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-28 05:51:08,296 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-28 05:51:08,335 INFO L353 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-28 05:51:08,335 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 43 treesize of output 34 [2021-12-28 05:51:08,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:51:08,346 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-28 05:51:08,413 INFO L353 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2021-12-28 05:51:08,413 INFO L387 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 26 treesize of output 28 [2021-12-28 05:51:08,423 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-28 05:51:08,463 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2021-12-28 05:51:08,478 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-28 05:51:08,572 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2021-12-28 05:51:08,578 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2021-12-28 05:51:08,786 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 10 [2021-12-28 05:51:08,790 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 54 treesize of output 20 [2021-12-28 05:51:08,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:51:08,855 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:51:08,855 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:51:08,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1543467538] [2021-12-28 05:51:08,855 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1543467538] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:51:08,855 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:51:08,855 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-28 05:51:08,855 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81442617] [2021-12-28 05:51:08,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:51:08,855 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-28 05:51:08,855 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:51:08,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-28 05:51:08,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-12-28 05:51:08,856 INFO L87 Difference]: Start difference. First operand 274 states and 313 transitions. Second operand has 11 states, 10 states have (on average 2.4) 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-28 05:51:10,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:51:10,031 INFO L93 Difference]: Finished difference Result 279 states and 318 transitions. [2021-12-28 05:51:10,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-28 05:51:10,031 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.4) 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-28 05:51:10,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:51:10,032 INFO L225 Difference]: With dead ends: 279 [2021-12-28 05:51:10,032 INFO L226 Difference]: Without dead ends: 279 [2021-12-28 05:51:10,032 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2021-12-28 05:51:10,033 INFO L933 BasicCegarLoop]: 246 mSDtfsCounter, 19 mSDsluCounter, 992 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 1238 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 507 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-12-28 05:51:10,033 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 1238 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 604 Invalid, 0 Unknown, 507 Unchecked, 0.9s Time] [2021-12-28 05:51:10,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2021-12-28 05:51:10,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 273. [2021-12-28 05:51:10,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 198 states have (on average 1.5757575757575757) internal successors, (312), 272 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:10,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 312 transitions. [2021-12-28 05:51:10,035 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 312 transitions. Word has length 24 [2021-12-28 05:51:10,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:51:10,036 INFO L470 AbstractCegarLoop]: Abstraction has 273 states and 312 transitions. [2021-12-28 05:51:10,036 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.4) 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-28 05:51:10,036 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 312 transitions. [2021-12-28 05:51:10,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-28 05:51:10,036 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:51:10,036 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] [2021-12-28 05:51:10,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Ended with exit code 0 [2021-12-28 05:51:10,243 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:51:10,244 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr151ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2021-12-28 05:51:10,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:51:10,244 INFO L85 PathProgramCache]: Analyzing trace with hash -824348362, now seen corresponding path program 1 times [2021-12-28 05:51:10,244 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:51:10,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1215297203] [2021-12-28 05:51:10,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:51:10,245 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:51:10,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:51:10,246 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:51:10,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2021-12-28 05:51:10,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:51:10,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-28 05:51:10,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:51:10,516 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-28 05:51:10,517 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:51:10,517 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:51:10,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1215297203] [2021-12-28 05:51:10,517 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1215297203] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:51:10,517 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:51:10,517 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 05:51:10,517 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903787967] [2021-12-28 05:51:10,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:51:10,517 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:51:10,517 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:51:10,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:51:10,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:51:10,518 INFO L87 Difference]: Start difference. First operand 273 states and 312 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:10,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:51:10,767 INFO L93 Difference]: Finished difference Result 279 states and 318 transitions. [2021-12-28 05:51:10,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 05:51:10,767 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-12-28 05:51:10,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:51:10,768 INFO L225 Difference]: With dead ends: 279 [2021-12-28 05:51:10,768 INFO L226 Difference]: Without dead ends: 275 [2021-12-28 05:51:10,768 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:51:10,768 INFO L933 BasicCegarLoop]: 246 mSDtfsCounter, 6 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 235 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:51:10,768 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 651 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 235 Unchecked, 0.2s Time] [2021-12-28 05:51:10,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2021-12-28 05:51:10,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 274. [2021-12-28 05:51:10,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 199 states have (on average 1.5728643216080402) internal successors, (313), 273 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:10,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 313 transitions. [2021-12-28 05:51:10,771 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 313 transitions. Word has length 25 [2021-12-28 05:51:10,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:51:10,771 INFO L470 AbstractCegarLoop]: Abstraction has 274 states and 313 transitions. [2021-12-28 05:51:10,771 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:10,771 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 313 transitions. [2021-12-28 05:51:10,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-28 05:51:10,772 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:51:10,772 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] [2021-12-28 05:51:10,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2021-12-28 05:51:10,973 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:51:10,973 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr123REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2021-12-28 05:51:10,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:51:10,973 INFO L85 PathProgramCache]: Analyzing trace with hash 221644505, now seen corresponding path program 1 times [2021-12-28 05:51:10,974 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:51:10,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1616706289] [2021-12-28 05:51:10,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:51:10,974 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:51:10,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:51:10,975 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:51:10,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2021-12-28 05:51:11,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:51:11,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-28 05:51:11,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:51:11,091 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-28 05:51:11,091 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:51:11,091 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:51:11,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1616706289] [2021-12-28 05:51:11,091 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1616706289] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:51:11,091 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:51:11,091 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 05:51:11,092 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869136240] [2021-12-28 05:51:11,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:51:11,092 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 05:51:11,092 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:51:11,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 05:51:11,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:51:11,093 INFO L87 Difference]: Start difference. First operand 274 states and 313 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:11,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:51:11,104 INFO L93 Difference]: Finished difference Result 256 states and 284 transitions. [2021-12-28 05:51:11,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:51:11,105 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-28 05:51:11,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:51:11,105 INFO L225 Difference]: With dead ends: 256 [2021-12-28 05:51:11,105 INFO L226 Difference]: Without dead ends: 238 [2021-12-28 05:51:11,106 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 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-28 05:51:11,106 INFO L933 BasicCegarLoop]: 255 mSDtfsCounter, 31 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 05:51:11,107 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 471 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 05:51:11,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2021-12-28 05:51:11,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2021-12-28 05:51:11,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 163 states have (on average 1.6319018404907975) internal successors, (266), 237 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:11,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 266 transitions. [2021-12-28 05:51:11,110 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 266 transitions. Word has length 26 [2021-12-28 05:51:11,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:51:11,110 INFO L470 AbstractCegarLoop]: Abstraction has 238 states and 266 transitions. [2021-12-28 05:51:11,110 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:11,110 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 266 transitions. [2021-12-28 05:51:11,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-28 05:51:11,110 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:51:11,110 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] [2021-12-28 05:51:11,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2021-12-28 05:51:11,316 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:51:11,317 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2021-12-28 05:51:11,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:51:11,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1120078838, now seen corresponding path program 1 times [2021-12-28 05:51:11,317 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:51:11,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [897462829] [2021-12-28 05:51:11,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:51:11,317 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:51:11,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:51:11,318 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:51:11,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2021-12-28 05:51:11,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:51:11,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-28 05:51:11,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:51:11,478 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-28 05:51:11,500 INFO L353 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-28 05:51:11,500 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 22 treesize of output 21 [2021-12-28 05:51:11,509 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-12-28 05:51:11,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:51:11,521 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:51:11,521 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:51:11,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [897462829] [2021-12-28 05:51:11,521 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [897462829] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:51:11,521 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:51:11,521 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 05:51:11,521 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36610726] [2021-12-28 05:51:11,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:51:11,521 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 05:51:11,521 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:51:11,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 05:51:11,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-28 05:51:11,522 INFO L87 Difference]: Start difference. First operand 238 states and 266 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:11,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:51:11,915 INFO L93 Difference]: Finished difference Result 263 states and 293 transitions. [2021-12-28 05:51:11,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-28 05:51:11,916 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-28 05:51:11,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:51:11,917 INFO L225 Difference]: With dead ends: 263 [2021-12-28 05:51:11,917 INFO L226 Difference]: Without dead ends: 263 [2021-12-28 05:51:11,917 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-12-28 05:51:11,918 INFO L933 BasicCegarLoop]: 234 mSDtfsCounter, 709 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 709 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 05:51:11,918 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [709 Valid, 739 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-28 05:51:11,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2021-12-28 05:51:11,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 238. [2021-12-28 05:51:11,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 163 states have (on average 1.6257668711656441) internal successors, (265), 237 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:11,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 265 transitions. [2021-12-28 05:51:11,920 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 265 transitions. Word has length 26 [2021-12-28 05:51:11,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:51:11,920 INFO L470 AbstractCegarLoop]: Abstraction has 238 states and 265 transitions. [2021-12-28 05:51:11,920 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:11,920 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 265 transitions. [2021-12-28 05:51:11,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-28 05:51:11,921 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:51:11,921 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:51:11,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2021-12-28 05:51:12,121 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:51:12,122 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2021-12-28 05:51:12,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:51:12,122 INFO L85 PathProgramCache]: Analyzing trace with hash 119440586, now seen corresponding path program 1 times [2021-12-28 05:51:12,122 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:51:12,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [420857470] [2021-12-28 05:51:12,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:51:12,122 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:51:12,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:51:12,123 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:51:12,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2021-12-28 05:51:12,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:51:12,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-28 05:51:12,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:51:12,277 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-28 05:51:12,301 INFO L353 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-28 05:51:12,301 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 23 treesize of output 22 [2021-12-28 05:51:12,327 INFO L353 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-28 05:51:12,328 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 23 treesize of output 22 [2021-12-28 05:51:12,334 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-12-28 05:51:12,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-28 05:51:12,340 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:51:12,340 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:51:12,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [420857470] [2021-12-28 05:51:12,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [420857470] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:51:12,340 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:51:12,340 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 05:51:12,341 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523358255] [2021-12-28 05:51:12,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:51:12,341 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 05:51:12,341 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:51:12,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 05:51:12,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:51:12,341 INFO L87 Difference]: Start difference. First operand 238 states and 265 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:12,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:51:12,891 INFO L93 Difference]: Finished difference Result 254 states and 284 transitions. [2021-12-28 05:51:12,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 05:51:12,891 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-12-28 05:51:12,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:51:12,892 INFO L225 Difference]: With dead ends: 254 [2021-12-28 05:51:12,892 INFO L226 Difference]: Without dead ends: 254 [2021-12-28 05:51:12,892 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 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-28 05:51:12,893 INFO L933 BasicCegarLoop]: 232 mSDtfsCounter, 51 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-28 05:51:12,893 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 653 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-28 05:51:12,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2021-12-28 05:51:12,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 237. [2021-12-28 05:51:12,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 163 states have (on average 1.6196319018404908) internal successors, (264), 236 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:12,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 264 transitions. [2021-12-28 05:51:12,895 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 264 transitions. Word has length 28 [2021-12-28 05:51:12,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:51:12,895 INFO L470 AbstractCegarLoop]: Abstraction has 237 states and 264 transitions. [2021-12-28 05:51:12,895 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:12,895 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 264 transitions. [2021-12-28 05:51:12,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-28 05:51:12,896 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:51:12,896 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:51:12,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2021-12-28 05:51:13,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:51:13,104 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2021-12-28 05:51:13,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:51:13,104 INFO L85 PathProgramCache]: Analyzing trace with hash 119440587, now seen corresponding path program 1 times [2021-12-28 05:51:13,104 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:51:13,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [340544500] [2021-12-28 05:51:13,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:51:13,104 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:51:13,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:51:13,105 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:51:13,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2021-12-28 05:51:13,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:51:13,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 28 conjunts are in the unsatisfiable core [2021-12-28 05:51:13,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:51:13,284 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-28 05:51:13,287 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-28 05:51:13,348 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-28 05:51:13,348 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2021-12-28 05:51:13,359 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-28 05:51:13,359 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-28 05:51:13,383 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-28 05:51:13,388 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-28 05:51:13,431 INFO L353 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-28 05:51:13,431 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 31 treesize of output 26 [2021-12-28 05:51:13,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:51:13,438 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-28 05:51:13,502 INFO L353 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-28 05:51:13,502 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 21 treesize of output 20 [2021-12-28 05:51:13,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:51:13,507 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2021-12-28 05:51:13,528 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-28 05:51:13,531 INFO L387 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-28 05:51:13,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:51:13,544 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:51:13,544 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:51:13,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [340544500] [2021-12-28 05:51:13,544 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [340544500] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:51:13,544 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:51:13,544 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:51:13,544 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45980515] [2021-12-28 05:51:13,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:51:13,545 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 05:51:13,545 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:51:13,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 05:51:13,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-28 05:51:13,545 INFO L87 Difference]: Start difference. First operand 237 states and 264 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:14,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:51:14,700 INFO L93 Difference]: Finished difference Result 261 states and 291 transitions. [2021-12-28 05:51:14,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-28 05:51:14,700 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-12-28 05:51:14,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:51:14,701 INFO L225 Difference]: With dead ends: 261 [2021-12-28 05:51:14,701 INFO L226 Difference]: Without dead ends: 261 [2021-12-28 05:51:14,701 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-12-28 05:51:14,702 INFO L933 BasicCegarLoop]: 215 mSDtfsCounter, 229 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-28 05:51:14,702 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [229 Valid, 731 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-12-28 05:51:14,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2021-12-28 05:51:14,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 236. [2021-12-28 05:51:14,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 163 states have (on average 1.6134969325153374) internal successors, (263), 235 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:14,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 263 transitions. [2021-12-28 05:51:14,704 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 263 transitions. Word has length 28 [2021-12-28 05:51:14,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:51:14,704 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 263 transitions. [2021-12-28 05:51:14,704 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:14,704 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 263 transitions. [2021-12-28 05:51:14,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-28 05:51:14,705 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:51:14,705 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:51:14,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2021-12-28 05:51:14,911 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:51:14,911 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2021-12-28 05:51:14,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:51:14,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1996547125, now seen corresponding path program 1 times [2021-12-28 05:51:14,912 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:51:14,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2123247708] [2021-12-28 05:51:14,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:51:14,913 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:51:14,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:51:14,913 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:51:14,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2021-12-28 05:51:15,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:51:15,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-28 05:51:15,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:51:15,100 INFO L387 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-28 05:51:15,113 INFO L387 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-28 05:51:15,137 INFO L387 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-28 05:51:15,177 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-28 05:51:15,177 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-28 05:51:15,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-28 05:51:15,208 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:51:15,208 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:51:15,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2123247708] [2021-12-28 05:51:15,208 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2123247708] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:51:15,208 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:51:15,208 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 05:51:15,208 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521092041] [2021-12-28 05:51:15,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:51:15,209 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 05:51:15,209 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:51:15,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 05:51:15,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:51:15,209 INFO L87 Difference]: Start difference. First operand 236 states and 263 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:15,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:51:15,723 INFO L93 Difference]: Finished difference Result 259 states and 289 transitions. [2021-12-28 05:51:15,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 05:51:15,723 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-12-28 05:51:15,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:51:15,724 INFO L225 Difference]: With dead ends: 259 [2021-12-28 05:51:15,724 INFO L226 Difference]: Without dead ends: 259 [2021-12-28 05:51:15,724 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 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-28 05:51:15,725 INFO L933 BasicCegarLoop]: 130 mSDtfsCounter, 513 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-28 05:51:15,725 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [513 Valid, 264 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-28 05:51:15,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2021-12-28 05:51:15,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 237. [2021-12-28 05:51:15,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 164 states have (on average 1.6097560975609757) internal successors, (264), 236 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:15,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 264 transitions. [2021-12-28 05:51:15,729 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 264 transitions. Word has length 31 [2021-12-28 05:51:15,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:51:15,729 INFO L470 AbstractCegarLoop]: Abstraction has 237 states and 264 transitions. [2021-12-28 05:51:15,729 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:15,729 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 264 transitions. [2021-12-28 05:51:15,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-28 05:51:15,729 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:51:15,729 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:51:15,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Ended with exit code 0 [2021-12-28 05:51:15,939 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:51:15,940 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 148 more)] === [2021-12-28 05:51:15,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:51:15,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1753849390, now seen corresponding path program 1 times [2021-12-28 05:51:15,940 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:51:15,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1540632187] [2021-12-28 05:51:15,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:51:15,940 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:51:15,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:51:15,941 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:51:15,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2021-12-28 05:51:16,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:51:16,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 36 conjunts are in the unsatisfiable core [2021-12-28 05:51:16,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:51:16,167 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-28 05:51:16,199 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-28 05:51:16,206 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-28 05:51:16,259 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-28 05:51:16,259 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-28 05:51:16,286 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-12-28 05:51:16,289 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-28 05:51:16,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:51:16,358 INFO L353 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2021-12-28 05:51:16,358 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 41 [2021-12-28 05:51:16,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:51:16,362 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2021-12-28 05:51:16,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:51:16,446 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2021-12-28 05:51:16,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:51:16,461 INFO L353 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2021-12-28 05:51:16,461 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 41 [2021-12-28 05:51:16,532 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 05:51:16,539 INFO L353 Elim1Store]: treesize reduction 31, result has 8.8 percent of original size [2021-12-28 05:51:16,539 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 37 [2021-12-28 05:51:16,547 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-28 05:51:16,547 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 18 [2021-12-28 05:51:16,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:51:16,571 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:51:26,887 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_55| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_55|) (_ bv0 1))) (and (forall ((v_ArrVal_699 (_ BitVec 32)) (|ULTIMATE.start_main_~#iter~0#1.offset| (_ BitVec 32)) (v_ArrVal_698 (_ BitVec 32))) (= (let ((.cse1 (bvadd (_ bv4 32) |ULTIMATE.start_main_~#iter~0#1.offset|))) (select (let ((.cse0 (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~#iter~0#1.base_55|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~data~0#1.base|) .cse1 v_ArrVal_698))) (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~#iter~0#1.base_55| .cse0) (select .cse0 |ULTIMATE.start_main_~#iter~0#1.offset|))) (bvadd (_ bv4 32) (select (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~#iter~0#1.base_55|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~data~0#1.offset|) .cse1 v_ArrVal_699) |ULTIMATE.start_main_~#iter~0#1.offset|)))) (_ bv0 32))) (forall ((v_ArrVal_699 (_ BitVec 32)) (|ULTIMATE.start_main_~#iter~0#1.offset| (_ BitVec 32)) (v_ArrVal_698 (_ BitVec 32))) (= (let ((.cse3 (bvadd (_ bv4 32) |ULTIMATE.start_main_~#iter~0#1.offset|))) (let ((.cse2 (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~#iter~0#1.base_55|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~data~0#1.offset|) .cse3 v_ArrVal_699))) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~#iter~0#1.base_55| .cse2) (select (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~#iter~0#1.base_55|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~data~0#1.base|) .cse3 v_ArrVal_698) |ULTIMATE.start_main_~#iter~0#1.offset|)) (bvadd (_ bv4 32) (select .cse2 |ULTIMATE.start_main_~#iter~0#1.offset|))))) (_ bv0 32)))))) is different from false