./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext-properties/test-0504_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c3fed411 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/list-ext-properties/test-0504_1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ad4b9fd301578a7ddb25530c70896459a49284f596306d3b6d0c853e43916174 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-16 05:54:39,805 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-16 05:54:39,807 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-16 05:54:39,833 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-16 05:54:39,836 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-16 05:54:39,839 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-16 05:54:39,841 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-16 05:54:39,844 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-16 05:54:39,845 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-16 05:54:39,849 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-16 05:54:39,850 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-16 05:54:39,851 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-16 05:54:39,851 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-16 05:54:39,853 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-16 05:54:39,855 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-16 05:54:39,857 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-16 05:54:39,857 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-16 05:54:39,858 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-16 05:54:39,859 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-16 05:54:39,860 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-16 05:54:39,861 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-16 05:54:39,862 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-16 05:54:39,862 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-16 05:54:39,863 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-16 05:54:39,865 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-16 05:54:39,868 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-16 05:54:39,868 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-16 05:54:39,869 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-16 05:54:39,870 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-16 05:54:39,871 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-16 05:54:39,871 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-16 05:54:39,872 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-16 05:54:39,873 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-16 05:54:39,873 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-16 05:54:39,874 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-16 05:54:39,875 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-16 05:54:39,876 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-16 05:54:39,876 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-16 05:54:39,876 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-16 05:54:39,877 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-16 05:54:39,877 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-16 05:54:39,878 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-16 05:54:39,900 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-16 05:54:39,901 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-16 05:54:39,901 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-16 05:54:39,901 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-16 05:54:39,902 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-16 05:54:39,902 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-16 05:54:39,903 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-16 05:54:39,903 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-16 05:54:39,903 INFO L138 SettingsManager]: * Use SBE=true [2021-12-16 05:54:39,903 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-16 05:54:39,904 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-16 05:54:39,904 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-16 05:54:39,904 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-16 05:54:39,904 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-16 05:54:39,905 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-16 05:54:39,905 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-16 05:54:39,905 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-16 05:54:39,905 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-16 05:54:39,905 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-16 05:54:39,905 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-16 05:54:39,906 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-16 05:54:39,906 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-16 05:54:39,906 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-16 05:54:39,906 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-16 05:54:39,906 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-16 05:54:39,906 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 05:54:39,906 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-16 05:54:39,907 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-16 05:54:39,908 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-16 05:54:39,908 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-16 05:54:39,908 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-16 05:54:39,908 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 -> ad4b9fd301578a7ddb25530c70896459a49284f596306d3b6d0c853e43916174 [2021-12-16 05:54:40,127 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 05:54:40,148 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 05:54:40,152 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 05:54:40,152 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 05:54:40,153 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 05:54:40,154 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/test-0504_1.i [2021-12-16 05:54:40,204 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/362fc1703/6801db37704d40dc8554b974e8a9ea1d/FLAG7e01c7daa [2021-12-16 05:54:40,573 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 05:54:40,573 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0504_1.i [2021-12-16 05:54:40,582 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/362fc1703/6801db37704d40dc8554b974e8a9ea1d/FLAG7e01c7daa [2021-12-16 05:54:40,947 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/362fc1703/6801db37704d40dc8554b974e8a9ea1d [2021-12-16 05:54:40,949 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 05:54:40,951 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 05:54:40,953 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 05:54:40,953 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 05:54:40,955 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 05:54:40,955 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 05:54:40" (1/1) ... [2021-12-16 05:54:40,957 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@874ada6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:54:40, skipping insertion in model container [2021-12-16 05:54:40,957 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 05:54:40" (1/1) ... [2021-12-16 05:54:40,962 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 05:54:40,998 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 05:54:41,351 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 05:54:41,356 INFO L203 MainTranslator]: Completed pre-run [2021-12-16 05:54:41,449 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 05:54:41,471 INFO L208 MainTranslator]: Completed translation [2021-12-16 05:54:41,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:54:41 WrapperNode [2021-12-16 05:54:41,475 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 05:54:41,475 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-16 05:54:41,476 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-16 05:54:41,477 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-16 05:54:41,491 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:54:41" (1/1) ... [2021-12-16 05:54:41,504 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:54:41" (1/1) ... [2021-12-16 05:54:41,529 INFO L137 Inliner]: procedures = 123, calls = 28, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 112 [2021-12-16 05:54:41,536 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-16 05:54:41,538 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-16 05:54:41,541 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-16 05:54:41,541 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-16 05:54:41,547 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:54:41" (1/1) ... [2021-12-16 05:54:41,547 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:54:41" (1/1) ... [2021-12-16 05:54:41,571 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:54:41" (1/1) ... [2021-12-16 05:54:41,573 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:54:41" (1/1) ... [2021-12-16 05:54:41,588 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:54:41" (1/1) ... [2021-12-16 05:54:41,591 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:54:41" (1/1) ... [2021-12-16 05:54:41,604 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:54:41" (1/1) ... [2021-12-16 05:54:41,605 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-16 05:54:41,606 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-16 05:54:41,606 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-16 05:54:41,606 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-16 05:54:41,607 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:54:41" (1/1) ... [2021-12-16 05:54:41,643 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 05:54:41,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 05:54:41,662 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-16 05:54:41,668 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-16 05:54:41,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-16 05:54:41,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-16 05:54:41,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-16 05:54:41,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-16 05:54:41,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-16 05:54:41,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-16 05:54:41,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-16 05:54:41,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-16 05:54:41,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-16 05:54:41,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-16 05:54:41,755 INFO L236 CfgBuilder]: Building ICFG [2021-12-16 05:54:41,756 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-16 05:54:41,939 INFO L277 CfgBuilder]: Performing block encoding [2021-12-16 05:54:41,943 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-16 05:54:41,944 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-12-16 05:54:41,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 05:54:41 BoogieIcfgContainer [2021-12-16 05:54:41,945 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-16 05:54:41,946 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-16 05:54:41,946 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-16 05:54:41,951 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-16 05:54:41,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 05:54:40" (1/3) ... [2021-12-16 05:54:41,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@725b69a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 05:54:41, skipping insertion in model container [2021-12-16 05:54:41,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:54:41" (2/3) ... [2021-12-16 05:54:41,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@725b69a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 05:54:41, skipping insertion in model container [2021-12-16 05:54:41,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 05:54:41" (3/3) ... [2021-12-16 05:54:41,953 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0504_1.i [2021-12-16 05:54:41,957 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-16 05:54:41,957 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 43 error locations. [2021-12-16 05:54:41,985 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-16 05:54:41,990 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-16 05:54:41,991 INFO L340 AbstractCegarLoop]: Starting to check reachability of 43 error locations. [2021-12-16 05:54:42,001 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 50 states have (on average 2.14) internal successors, (107), 93 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:42,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-16 05:54:42,011 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:54:42,012 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-16 05:54:42,012 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 39 more)] === [2021-12-16 05:54:42,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:54:42,019 INFO L85 PathProgramCache]: Analyzing trace with hash 28793288, now seen corresponding path program 1 times [2021-12-16 05:54:42,025 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:54:42,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587977760] [2021-12-16 05:54:42,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:54:42,027 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:54:42,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:54:42,148 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-16 05:54:42,149 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:54:42,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587977760] [2021-12-16 05:54:42,149 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587977760] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:54:42,150 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:54:42,150 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 05:54:42,151 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610808237] [2021-12-16 05:54:42,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:54:42,154 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-16 05:54:42,155 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:54:42,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-16 05:54:42,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-16 05:54:42,178 INFO L87 Difference]: Start difference. First operand has 94 states, 50 states have (on average 2.14) internal successors, (107), 93 states have internal predecessors, (107), 0 states have call successors, (0), 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-16 05:54:42,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:54:42,195 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2021-12-16 05:54:42,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-16 05:54:42,197 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-16 05:54:42,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:54:42,205 INFO L225 Difference]: With dead ends: 94 [2021-12-16 05:54:42,206 INFO L226 Difference]: Without dead ends: 92 [2021-12-16 05:54:42,208 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-16 05:54:42,210 INFO L933 BasicCegarLoop]: 101 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, 101 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-16 05:54:42,211 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 05:54:42,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-12-16 05:54:42,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2021-12-16 05:54:42,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 49 states have (on average 2.020408163265306) internal successors, (99), 91 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:42,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 99 transitions. [2021-12-16 05:54:42,242 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 99 transitions. Word has length 5 [2021-12-16 05:54:42,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:54:42,242 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 99 transitions. [2021-12-16 05:54:42,243 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-16 05:54:42,243 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 99 transitions. [2021-12-16 05:54:42,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-16 05:54:42,244 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:54:42,244 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:54:42,244 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-16 05:54:42,245 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 39 more)] === [2021-12-16 05:54:42,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:54:42,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1806850220, now seen corresponding path program 1 times [2021-12-16 05:54:42,247 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:54:42,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099457817] [2021-12-16 05:54:42,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:54:42,248 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:54:42,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:54:42,328 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-16 05:54:42,328 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:54:42,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099457817] [2021-12-16 05:54:42,329 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099457817] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:54:42,329 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:54:42,329 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 05:54:42,329 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832175116] [2021-12-16 05:54:42,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:54:42,330 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 05:54:42,331 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:54:42,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 05:54:42,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 05:54:42,332 INFO L87 Difference]: Start difference. First operand 92 states and 99 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:42,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:54:42,356 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2021-12-16 05:54:42,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 05:54:42,357 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-12-16 05:54:42,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:54:42,358 INFO L225 Difference]: With dead ends: 99 [2021-12-16 05:54:42,359 INFO L226 Difference]: Without dead ends: 99 [2021-12-16 05:54:42,359 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-16 05:54:42,360 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 4 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 05:54:42,361 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 188 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 05:54:42,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-12-16 05:54:42,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2021-12-16 05:54:42,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 53 states have (on average 1.9811320754716981) internal successors, (105), 95 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:42,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2021-12-16 05:54:42,370 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 7 [2021-12-16 05:54:42,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:54:42,370 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2021-12-16 05:54:42,371 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:42,371 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2021-12-16 05:54:42,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-16 05:54:42,372 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:54:42,372 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:54:42,373 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-16 05:54:42,373 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 39 more)] === [2021-12-16 05:54:42,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:54:42,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1806849231, now seen corresponding path program 1 times [2021-12-16 05:54:42,374 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:54:42,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168244916] [2021-12-16 05:54:42,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:54:42,376 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:54:42,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:54:42,424 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-16 05:54:42,424 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:54:42,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168244916] [2021-12-16 05:54:42,425 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168244916] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:54:42,425 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:54:42,425 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 05:54:42,425 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285816803] [2021-12-16 05:54:42,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:54:42,426 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 05:54:42,426 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:54:42,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 05:54:42,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 05:54:42,427 INFO L87 Difference]: Start difference. First operand 96 states and 105 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:42,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:54:42,510 INFO L93 Difference]: Finished difference Result 121 states and 132 transitions. [2021-12-16 05:54:42,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 05:54:42,510 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-12-16 05:54:42,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:54:42,512 INFO L225 Difference]: With dead ends: 121 [2021-12-16 05:54:42,512 INFO L226 Difference]: Without dead ends: 121 [2021-12-16 05:54:42,512 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-16 05:54:42,513 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 84 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:54:42,514 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 79 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:54:42,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-12-16 05:54:42,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 88. [2021-12-16 05:54:42,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 53 states have (on average 1.830188679245283) internal successors, (97), 87 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:42,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2021-12-16 05:54:42,519 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 7 [2021-12-16 05:54:42,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:54:42,520 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2021-12-16 05:54:42,520 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:42,520 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2021-12-16 05:54:42,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-16 05:54:42,520 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:54:42,521 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:54:42,521 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-16 05:54:42,521 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 39 more)] === [2021-12-16 05:54:42,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:54:42,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1806849232, now seen corresponding path program 1 times [2021-12-16 05:54:42,522 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:54:42,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966477679] [2021-12-16 05:54:42,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:54:42,522 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:54:42,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:54:42,548 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-16 05:54:42,548 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:54:42,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966477679] [2021-12-16 05:54:42,549 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966477679] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:54:42,549 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:54:42,549 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 05:54:42,549 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420331283] [2021-12-16 05:54:42,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:54:42,550 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 05:54:42,550 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:54:42,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 05:54:42,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 05:54:42,550 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:42,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:54:42,609 INFO L93 Difference]: Finished difference Result 129 states and 145 transitions. [2021-12-16 05:54:42,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 05:54:42,610 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-12-16 05:54:42,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:54:42,610 INFO L225 Difference]: With dead ends: 129 [2021-12-16 05:54:42,610 INFO L226 Difference]: Without dead ends: 129 [2021-12-16 05:54:42,611 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-16 05:54:42,612 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 57 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:54:42,612 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 120 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:54:42,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2021-12-16 05:54:42,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 90. [2021-12-16 05:54:42,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 60 states have (on average 1.7333333333333334) internal successors, (104), 89 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:42,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 104 transitions. [2021-12-16 05:54:42,616 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 104 transitions. Word has length 7 [2021-12-16 05:54:42,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:54:42,617 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 104 transitions. [2021-12-16 05:54:42,617 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:42,617 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 104 transitions. [2021-12-16 05:54:42,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-16 05:54:42,617 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:54:42,618 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:54:42,618 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-16 05:54:42,618 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 39 more)] === [2021-12-16 05:54:42,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:54:42,618 INFO L85 PathProgramCache]: Analyzing trace with hash 177781672, now seen corresponding path program 1 times [2021-12-16 05:54:42,619 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:54:42,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360199803] [2021-12-16 05:54:42,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:54:42,619 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:54:42,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:54:42,633 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-16 05:54:42,634 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:54:42,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360199803] [2021-12-16 05:54:42,634 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360199803] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:54:42,634 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:54:42,634 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 05:54:42,634 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175479614] [2021-12-16 05:54:42,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:54:42,635 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 05:54:42,635 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:54:42,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 05:54:42,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 05:54:42,636 INFO L87 Difference]: Start difference. First operand 90 states and 104 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-16 05:54:42,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:54:42,671 INFO L93 Difference]: Finished difference Result 92 states and 105 transitions. [2021-12-16 05:54:42,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 05:54:42,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-16 05:54:42,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:54:42,673 INFO L225 Difference]: With dead ends: 92 [2021-12-16 05:54:42,673 INFO L226 Difference]: Without dead ends: 89 [2021-12-16 05:54:42,674 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-16 05:54:42,683 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 1 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 05:54:42,687 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 134 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 05:54:42,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-12-16 05:54:42,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2021-12-16 05:54:42,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 59 states have (on average 1.728813559322034) internal successors, (102), 88 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:42,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 102 transitions. [2021-12-16 05:54:42,695 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 102 transitions. Word has length 8 [2021-12-16 05:54:42,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:54:42,695 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 102 transitions. [2021-12-16 05:54:42,696 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-16 05:54:42,696 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 102 transitions. [2021-12-16 05:54:42,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-16 05:54:42,696 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:54:42,696 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:54:42,698 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-16 05:54:42,698 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 39 more)] === [2021-12-16 05:54:42,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:54:42,699 INFO L85 PathProgramCache]: Analyzing trace with hash 875833349, now seen corresponding path program 1 times [2021-12-16 05:54:42,699 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:54:42,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770668136] [2021-12-16 05:54:42,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:54:42,700 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:54:42,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:54:42,827 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-16 05:54:42,828 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:54:42,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770668136] [2021-12-16 05:54:42,828 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770668136] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:54:42,828 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:54:42,828 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 05:54:42,828 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545759689] [2021-12-16 05:54:42,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:54:42,829 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 05:54:42,829 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:54:42,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 05:54:42,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-16 05:54:42,830 INFO L87 Difference]: Start difference. First operand 89 states and 102 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 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-16 05:54:42,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:54:42,947 INFO L93 Difference]: Finished difference Result 119 states and 134 transitions. [2021-12-16 05:54:42,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 05:54:42,947 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 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-16 05:54:42,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:54:42,948 INFO L225 Difference]: With dead ends: 119 [2021-12-16 05:54:42,948 INFO L226 Difference]: Without dead ends: 119 [2021-12-16 05:54:42,949 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-12-16 05:54:42,951 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 180 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:54:42,953 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [180 Valid, 90 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:54:42,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-12-16 05:54:42,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 79. [2021-12-16 05:54:42,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 52 states have (on average 1.6730769230769231) internal successors, (87), 78 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:42,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2021-12-16 05:54:42,968 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 17 [2021-12-16 05:54:42,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:54:42,968 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2021-12-16 05:54:42,974 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 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-16 05:54:42,975 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2021-12-16 05:54:42,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-16 05:54:42,975 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:54:42,975 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-16 05:54:42,976 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-16 05:54:42,976 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 39 more)] === [2021-12-16 05:54:42,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:54:42,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1380999357, now seen corresponding path program 1 times [2021-12-16 05:54:42,976 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:54:42,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417775440] [2021-12-16 05:54:42,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:54:42,982 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:54:42,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:54:43,024 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-16 05:54:43,025 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:54:43,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417775440] [2021-12-16 05:54:43,025 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417775440] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:54:43,025 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:54:43,025 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 05:54:43,026 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876514685] [2021-12-16 05:54:43,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:54:43,026 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 05:54:43,026 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:54:43,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 05:54:43,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 05:54:43,027 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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-16 05:54:43,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:54:43,034 INFO L93 Difference]: Finished difference Result 112 states and 122 transitions. [2021-12-16 05:54:43,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 05:54:43,034 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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-16 05:54:43,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:54:43,035 INFO L225 Difference]: With dead ends: 112 [2021-12-16 05:54:43,035 INFO L226 Difference]: Without dead ends: 112 [2021-12-16 05:54:43,035 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-16 05:54:43,036 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 24 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 05:54:43,036 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 157 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 05:54:43,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2021-12-16 05:54:43,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 102. [2021-12-16 05:54:43,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 75 states have (on average 1.6266666666666667) internal successors, (122), 101 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:43,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 122 transitions. [2021-12-16 05:54:43,039 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 122 transitions. Word has length 18 [2021-12-16 05:54:43,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:54:43,039 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 122 transitions. [2021-12-16 05:54:43,039 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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-16 05:54:43,039 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 122 transitions. [2021-12-16 05:54:43,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-16 05:54:43,040 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:54:43,040 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-16 05:54:43,040 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-16 05:54:43,040 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 39 more)] === [2021-12-16 05:54:43,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:54:43,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1381030048, now seen corresponding path program 1 times [2021-12-16 05:54:43,041 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:54:43,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959704919] [2021-12-16 05:54:43,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:54:43,041 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:54:43,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:54:43,066 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-16 05:54:43,066 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:54:43,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959704919] [2021-12-16 05:54:43,066 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959704919] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:54:43,066 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:54:43,067 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 05:54:43,067 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779536820] [2021-12-16 05:54:43,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:54:43,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 05:54:43,067 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:54:43,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 05:54:43,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 05:54:43,068 INFO L87 Difference]: Start difference. First operand 102 states and 122 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 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-16 05:54:43,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:54:43,114 INFO L93 Difference]: Finished difference Result 98 states and 114 transitions. [2021-12-16 05:54:43,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 05:54:43,114 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 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-16 05:54:43,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:54:43,115 INFO L225 Difference]: With dead ends: 98 [2021-12-16 05:54:43,115 INFO L226 Difference]: Without dead ends: 98 [2021-12-16 05:54:43,115 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-16 05:54:43,116 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 14 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 05:54:43,116 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 102 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 05:54:43,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-12-16 05:54:43,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2021-12-16 05:54:43,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 75 states have (on average 1.52) internal successors, (114), 97 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:43,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 114 transitions. [2021-12-16 05:54:43,119 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 114 transitions. Word has length 18 [2021-12-16 05:54:43,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:54:43,119 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 114 transitions. [2021-12-16 05:54:43,119 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 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-16 05:54:43,119 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 114 transitions. [2021-12-16 05:54:43,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-16 05:54:43,120 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:54:43,120 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-16 05:54:43,120 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-16 05:54:43,120 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 39 more)] === [2021-12-16 05:54:43,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:54:43,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1381030049, now seen corresponding path program 1 times [2021-12-16 05:54:43,121 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:54:43,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298746055] [2021-12-16 05:54:43,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:54:43,121 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:54:43,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:54:43,154 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-16 05:54:43,154 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:54:43,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298746055] [2021-12-16 05:54:43,154 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298746055] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:54:43,154 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:54:43,155 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 05:54:43,155 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502690999] [2021-12-16 05:54:43,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:54:43,155 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 05:54:43,155 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:54:43,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 05:54:43,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 05:54:43,156 INFO L87 Difference]: Start difference. First operand 98 states and 114 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 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-16 05:54:43,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:54:43,185 INFO L93 Difference]: Finished difference Result 94 states and 106 transitions. [2021-12-16 05:54:43,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 05:54:43,186 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 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-16 05:54:43,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:54:43,187 INFO L225 Difference]: With dead ends: 94 [2021-12-16 05:54:43,187 INFO L226 Difference]: Without dead ends: 94 [2021-12-16 05:54:43,187 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-16 05:54:43,187 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 10 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 05:54:43,188 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 107 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 05:54:43,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-12-16 05:54:43,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2021-12-16 05:54:43,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 75 states have (on average 1.4133333333333333) internal successors, (106), 93 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:43,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 106 transitions. [2021-12-16 05:54:43,190 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 106 transitions. Word has length 18 [2021-12-16 05:54:43,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:54:43,190 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 106 transitions. [2021-12-16 05:54:43,190 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 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-16 05:54:43,191 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 106 transitions. [2021-12-16 05:54:43,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-16 05:54:43,191 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:54:43,191 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-16 05:54:43,191 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-16 05:54:43,191 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 39 more)] === [2021-12-16 05:54:43,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:54:43,192 INFO L85 PathProgramCache]: Analyzing trace with hash 774470346, now seen corresponding path program 1 times [2021-12-16 05:54:43,192 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:54:43,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138217044] [2021-12-16 05:54:43,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:54:43,192 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:54:43,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:54:43,243 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-16 05:54:43,243 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:54:43,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138217044] [2021-12-16 05:54:43,243 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138217044] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:54:43,243 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:54:43,243 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-16 05:54:43,244 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145472250] [2021-12-16 05:54:43,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:54:43,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 05:54:43,244 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:54:43,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 05:54:43,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 05:54:43,245 INFO L87 Difference]: Start difference. First operand 94 states and 106 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 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-16 05:54:43,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:54:43,352 INFO L93 Difference]: Finished difference Result 168 states and 190 transitions. [2021-12-16 05:54:43,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-16 05:54:43,352 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 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-16 05:54:43,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:54:43,353 INFO L225 Difference]: With dead ends: 168 [2021-12-16 05:54:43,353 INFO L226 Difference]: Without dead ends: 168 [2021-12-16 05:54:43,353 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-16 05:54:43,354 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 52 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:54:43,354 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 235 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:54:43,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2021-12-16 05:54:43,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 112. [2021-12-16 05:54:43,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 93 states have (on average 1.3978494623655915) internal successors, (130), 111 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:43,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 130 transitions. [2021-12-16 05:54:43,357 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 130 transitions. Word has length 21 [2021-12-16 05:54:43,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:54:43,357 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 130 transitions. [2021-12-16 05:54:43,357 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 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-16 05:54:43,357 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 130 transitions. [2021-12-16 05:54:43,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-16 05:54:43,358 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:54:43,358 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-16 05:54:43,358 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-16 05:54:43,358 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 39 more)] === [2021-12-16 05:54:43,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:54:43,358 INFO L85 PathProgramCache]: Analyzing trace with hash 774470347, now seen corresponding path program 1 times [2021-12-16 05:54:43,359 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:54:43,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516741979] [2021-12-16 05:54:43,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:54:43,359 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:54:43,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:54:43,513 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-16 05:54:43,514 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:54:43,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516741979] [2021-12-16 05:54:43,514 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516741979] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:54:43,514 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:54:43,514 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-16 05:54:43,514 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540094065] [2021-12-16 05:54:43,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:54:43,514 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-16 05:54:43,514 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:54:43,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-16 05:54:43,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-16 05:54:43,515 INFO L87 Difference]: Start difference. First operand 112 states and 130 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 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-16 05:54:43,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:54:43,796 INFO L93 Difference]: Finished difference Result 198 states and 221 transitions. [2021-12-16 05:54:43,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-16 05:54:43,797 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 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-16 05:54:43,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:54:43,797 INFO L225 Difference]: With dead ends: 198 [2021-12-16 05:54:43,797 INFO L226 Difference]: Without dead ends: 198 [2021-12-16 05:54:43,798 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2021-12-16 05:54:43,798 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 292 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 05:54:43,799 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [292 Valid, 246 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 05:54:43,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-12-16 05:54:43,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 112. [2021-12-16 05:54:43,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 93 states have (on average 1.3763440860215055) internal successors, (128), 111 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:43,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 128 transitions. [2021-12-16 05:54:43,801 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 128 transitions. Word has length 21 [2021-12-16 05:54:43,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:54:43,801 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 128 transitions. [2021-12-16 05:54:43,801 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 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-16 05:54:43,801 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 128 transitions. [2021-12-16 05:54:43,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-16 05:54:43,802 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:54:43,802 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:54:43,802 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-16 05:54:43,802 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 39 more)] === [2021-12-16 05:54:43,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:54:43,803 INFO L85 PathProgramCache]: Analyzing trace with hash -181494867, now seen corresponding path program 1 times [2021-12-16 05:54:43,803 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:54:43,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829205631] [2021-12-16 05:54:43,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:54:43,803 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:54:43,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:54:43,834 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:54:43,835 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:54:43,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829205631] [2021-12-16 05:54:43,835 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829205631] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:54:43,835 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:54:43,835 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 05:54:43,835 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660467026] [2021-12-16 05:54:43,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:54:43,836 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 05:54:43,836 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:54:43,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 05:54:43,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 05:54:43,836 INFO L87 Difference]: Start difference. First operand 112 states and 128 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:43,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:54:43,910 INFO L93 Difference]: Finished difference Result 146 states and 162 transitions. [2021-12-16 05:54:43,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 05:54:43,910 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-12-16 05:54:43,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:54:43,911 INFO L225 Difference]: With dead ends: 146 [2021-12-16 05:54:43,911 INFO L226 Difference]: Without dead ends: 146 [2021-12-16 05:54:43,911 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-16 05:54:43,912 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 95 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:54:43,912 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 112 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:54:43,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-12-16 05:54:43,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 114. [2021-12-16 05:54:43,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 95 states have (on average 1.3894736842105264) internal successors, (132), 113 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:43,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 132 transitions. [2021-12-16 05:54:43,914 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 132 transitions. Word has length 22 [2021-12-16 05:54:43,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:54:43,915 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 132 transitions. [2021-12-16 05:54:43,915 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:43,915 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 132 transitions. [2021-12-16 05:54:43,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-16 05:54:43,915 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:54:43,915 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:54:43,916 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-16 05:54:43,916 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 39 more)] === [2021-12-16 05:54:43,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:54:43,916 INFO L85 PathProgramCache]: Analyzing trace with hash -181494866, now seen corresponding path program 1 times [2021-12-16 05:54:43,916 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:54:43,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138482152] [2021-12-16 05:54:43,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:54:43,917 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:54:43,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:54:43,950 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:54:43,950 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:54:43,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138482152] [2021-12-16 05:54:43,950 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138482152] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:54:43,950 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:54:43,950 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 05:54:43,951 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405210196] [2021-12-16 05:54:43,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:54:43,951 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 05:54:43,951 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:54:43,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 05:54:43,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 05:54:43,952 INFO L87 Difference]: Start difference. First operand 114 states and 132 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:44,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:54:44,029 INFO L93 Difference]: Finished difference Result 187 states and 217 transitions. [2021-12-16 05:54:44,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 05:54:44,029 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-12-16 05:54:44,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:54:44,030 INFO L225 Difference]: With dead ends: 187 [2021-12-16 05:54:44,030 INFO L226 Difference]: Without dead ends: 187 [2021-12-16 05:54:44,030 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-16 05:54:44,031 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 86 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:54:44,031 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 151 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:54:44,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2021-12-16 05:54:44,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 138. [2021-12-16 05:54:44,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 119 states have (on average 1.3865546218487395) internal successors, (165), 137 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:44,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 165 transitions. [2021-12-16 05:54:44,033 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 165 transitions. Word has length 22 [2021-12-16 05:54:44,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:54:44,034 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 165 transitions. [2021-12-16 05:54:44,034 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:44,034 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 165 transitions. [2021-12-16 05:54:44,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-16 05:54:44,034 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:54:44,035 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:54:44,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-16 05:54:44,035 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 39 more)] === [2021-12-16 05:54:44,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:54:44,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1331373881, now seen corresponding path program 1 times [2021-12-16 05:54:44,035 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:54:44,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640519444] [2021-12-16 05:54:44,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:54:44,036 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:54:44,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:54:44,059 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:54:44,059 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:54:44,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640519444] [2021-12-16 05:54:44,060 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640519444] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 05:54:44,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178275242] [2021-12-16 05:54:44,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:54:44,060 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 05:54:44,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 05:54:44,076 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-16 05:54:44,114 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-16 05:54:44,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:54:44,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-16 05:54:44,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:54:44,218 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:54:44,218 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 05:54:44,219 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [178275242] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:54:44,219 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 05:54:44,219 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2021-12-16 05:54:44,219 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467902362] [2021-12-16 05:54:44,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:54:44,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 05:54:44,220 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:54:44,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 05:54:44,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-16 05:54:44,220 INFO L87 Difference]: Start difference. First operand 138 states and 165 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 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-16 05:54:44,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:54:44,231 INFO L93 Difference]: Finished difference Result 138 states and 163 transitions. [2021-12-16 05:54:44,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 05:54:44,231 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 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-16 05:54:44,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:54:44,232 INFO L225 Difference]: With dead ends: 138 [2021-12-16 05:54:44,232 INFO L226 Difference]: Without dead ends: 138 [2021-12-16 05:54:44,232 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 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-16 05:54:44,233 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 70 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 05:54:44,233 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 108 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 05:54:44,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2021-12-16 05:54:44,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2021-12-16 05:54:44,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 119 states have (on average 1.3697478991596639) internal successors, (163), 137 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:44,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 163 transitions. [2021-12-16 05:54:44,235 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 163 transitions. Word has length 23 [2021-12-16 05:54:44,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:54:44,235 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 163 transitions. [2021-12-16 05:54:44,235 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 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-16 05:54:44,236 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 163 transitions. [2021-12-16 05:54:44,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-16 05:54:44,236 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:54:44,236 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:54:44,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-16 05:54:44,453 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,SelfDestructingSolverStorable13 [2021-12-16 05:54:44,454 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 39 more)] === [2021-12-16 05:54:44,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:54:44,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1677094766, now seen corresponding path program 1 times [2021-12-16 05:54:44,454 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:54:44,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733353927] [2021-12-16 05:54:44,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:54:44,455 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:54:44,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:54:44,503 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:54:44,504 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:54:44,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733353927] [2021-12-16 05:54:44,504 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733353927] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:54:44,504 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:54:44,504 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 05:54:44,506 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923692898] [2021-12-16 05:54:44,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:54:44,506 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 05:54:44,506 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:54:44,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 05:54:44,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 05:54:44,507 INFO L87 Difference]: Start difference. First operand 138 states and 163 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:44,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:54:44,621 INFO L93 Difference]: Finished difference Result 185 states and 211 transitions. [2021-12-16 05:54:44,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-16 05:54:44,622 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-12-16 05:54:44,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:54:44,623 INFO L225 Difference]: With dead ends: 185 [2021-12-16 05:54:44,624 INFO L226 Difference]: Without dead ends: 185 [2021-12-16 05:54:44,624 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-16 05:54:44,626 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 133 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:54:44,627 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 162 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:54:44,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-12-16 05:54:44,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 148. [2021-12-16 05:54:44,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 129 states have (on average 1.4108527131782946) internal successors, (182), 147 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:44,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 182 transitions. [2021-12-16 05:54:44,629 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 182 transitions. Word has length 24 [2021-12-16 05:54:44,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:54:44,630 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 182 transitions. [2021-12-16 05:54:44,630 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:44,630 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 182 transitions. [2021-12-16 05:54:44,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-16 05:54:44,633 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:54:44,633 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:54:44,634 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-16 05:54:44,634 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 39 more)] === [2021-12-16 05:54:44,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:54:44,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1677094767, now seen corresponding path program 1 times [2021-12-16 05:54:44,634 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:54:44,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073390554] [2021-12-16 05:54:44,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:54:44,635 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:54:44,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:54:44,683 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:54:44,684 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:54:44,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073390554] [2021-12-16 05:54:44,684 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073390554] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:54:44,684 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:54:44,684 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 05:54:44,684 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658842598] [2021-12-16 05:54:44,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:54:44,685 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 05:54:44,685 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:54:44,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 05:54:44,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 05:54:44,686 INFO L87 Difference]: Start difference. First operand 148 states and 182 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:44,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:54:44,799 INFO L93 Difference]: Finished difference Result 238 states and 293 transitions. [2021-12-16 05:54:44,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 05:54:44,800 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-12-16 05:54:44,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:54:44,800 INFO L225 Difference]: With dead ends: 238 [2021-12-16 05:54:44,800 INFO L226 Difference]: Without dead ends: 238 [2021-12-16 05:54:44,801 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-16 05:54:44,801 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 136 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:54:44,801 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 180 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:54:44,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2021-12-16 05:54:44,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 166. [2021-12-16 05:54:44,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 147 states have (on average 1.4625850340136055) internal successors, (215), 165 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:44,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 215 transitions. [2021-12-16 05:54:44,803 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 215 transitions. Word has length 24 [2021-12-16 05:54:44,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:54:44,804 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 215 transitions. [2021-12-16 05:54:44,804 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:44,804 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 215 transitions. [2021-12-16 05:54:44,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-16 05:54:44,804 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:54:44,804 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:54:44,804 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-16 05:54:44,804 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 39 more)] === [2021-12-16 05:54:44,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:54:44,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1024288817, now seen corresponding path program 1 times [2021-12-16 05:54:44,805 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:54:44,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856681153] [2021-12-16 05:54:44,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:54:44,805 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:54:44,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:54:44,896 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:54:44,896 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:54:44,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856681153] [2021-12-16 05:54:44,897 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856681153] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:54:44,897 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:54:44,897 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 05:54:44,897 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939068707] [2021-12-16 05:54:44,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:54:44,898 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 05:54:44,898 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:54:44,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 05:54:44,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-16 05:54:44,898 INFO L87 Difference]: Start difference. First operand 166 states and 215 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 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-16 05:54:45,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:54:45,088 INFO L93 Difference]: Finished difference Result 238 states and 303 transitions. [2021-12-16 05:54:45,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-16 05:54:45,088 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 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-16 05:54:45,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:54:45,089 INFO L225 Difference]: With dead ends: 238 [2021-12-16 05:54:45,089 INFO L226 Difference]: Without dead ends: 238 [2021-12-16 05:54:45,089 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2021-12-16 05:54:45,089 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 106 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:54:45,090 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 310 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:54:45,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2021-12-16 05:54:45,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 175. [2021-12-16 05:54:45,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 156 states have (on average 1.4487179487179487) internal successors, (226), 174 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:45,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 226 transitions. [2021-12-16 05:54:45,092 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 226 transitions. Word has length 27 [2021-12-16 05:54:45,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:54:45,092 INFO L470 AbstractCegarLoop]: Abstraction has 175 states and 226 transitions. [2021-12-16 05:54:45,092 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 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-16 05:54:45,092 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 226 transitions. [2021-12-16 05:54:45,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-16 05:54:45,093 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:54:45,093 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:54:45,093 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-16 05:54:45,093 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 39 more)] === [2021-12-16 05:54:45,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:54:45,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1688183339, now seen corresponding path program 1 times [2021-12-16 05:54:45,093 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:54:45,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687194960] [2021-12-16 05:54:45,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:54:45,093 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:54:45,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:54:45,133 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:54:45,133 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:54:45,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687194960] [2021-12-16 05:54:45,134 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687194960] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:54:45,134 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:54:45,134 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 05:54:45,134 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82711293] [2021-12-16 05:54:45,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:54:45,134 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 05:54:45,135 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:54:45,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 05:54:45,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 05:54:45,135 INFO L87 Difference]: Start difference. First operand 175 states and 226 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-16 05:54:45,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:54:45,200 INFO L93 Difference]: Finished difference Result 205 states and 261 transitions. [2021-12-16 05:54:45,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 05:54:45,200 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-16 05:54:45,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:54:45,201 INFO L225 Difference]: With dead ends: 205 [2021-12-16 05:54:45,201 INFO L226 Difference]: Without dead ends: 205 [2021-12-16 05:54:45,201 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-16 05:54:45,201 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 130 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 05:54:45,202 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 203 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 05:54:45,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2021-12-16 05:54:45,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 193. [2021-12-16 05:54:45,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 174 states have (on average 1.5) internal successors, (261), 192 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:45,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 261 transitions. [2021-12-16 05:54:45,204 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 261 transitions. Word has length 28 [2021-12-16 05:54:45,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:54:45,204 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 261 transitions. [2021-12-16 05:54:45,204 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-16 05:54:45,204 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 261 transitions. [2021-12-16 05:54:45,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-16 05:54:45,205 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:54:45,205 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:54:45,205 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-16 05:54:45,205 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 39 more)] === [2021-12-16 05:54:45,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:54:45,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1397370251, now seen corresponding path program 1 times [2021-12-16 05:54:45,205 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:54:45,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352021236] [2021-12-16 05:54:45,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:54:45,205 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:54:45,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:54:45,236 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:54:45,236 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:54:45,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352021236] [2021-12-16 05:54:45,237 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352021236] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 05:54:45,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753786242] [2021-12-16 05:54:45,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:54:45,237 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 05:54:45,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 05:54:45,250 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 05:54:45,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-16 05:54:45,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:54:45,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-16 05:54:45,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:54:45,393 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:54:45,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 05:54:45,460 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:54:45,460 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [753786242] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 05:54:45,460 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 05:54:45,461 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2021-12-16 05:54:45,461 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634330406] [2021-12-16 05:54:45,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 05:54:45,461 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 05:54:45,461 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:54:45,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 05:54:45,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-12-16 05:54:45,461 INFO L87 Difference]: Start difference. First operand 193 states and 261 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 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-16 05:54:45,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:54:45,478 INFO L93 Difference]: Finished difference Result 247 states and 325 transitions. [2021-12-16 05:54:45,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 05:54:45,478 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 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 31 [2021-12-16 05:54:45,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:54:45,479 INFO L225 Difference]: With dead ends: 247 [2021-12-16 05:54:45,479 INFO L226 Difference]: Without dead ends: 247 [2021-12-16 05:54:45,479 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-12-16 05:54:45,479 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 50 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 05:54:45,480 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 269 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 05:54:45,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2021-12-16 05:54:45,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 231. [2021-12-16 05:54:45,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 212 states have (on average 1.5235849056603774) internal successors, (323), 230 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:45,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 323 transitions. [2021-12-16 05:54:45,483 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 323 transitions. Word has length 31 [2021-12-16 05:54:45,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:54:45,483 INFO L470 AbstractCegarLoop]: Abstraction has 231 states and 323 transitions. [2021-12-16 05:54:45,483 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 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-16 05:54:45,483 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 323 transitions. [2021-12-16 05:54:45,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-16 05:54:45,483 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:54:45,483 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:54:45,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-16 05:54:45,691 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 05:54:45,691 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 39 more)] === [2021-12-16 05:54:45,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:54:45,692 INFO L85 PathProgramCache]: Analyzing trace with hash 368804521, now seen corresponding path program 1 times [2021-12-16 05:54:45,692 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:54:45,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695974257] [2021-12-16 05:54:45,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:54:45,692 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:54:45,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:54:45,769 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:54:45,769 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:54:45,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695974257] [2021-12-16 05:54:45,769 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695974257] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 05:54:45,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888170662] [2021-12-16 05:54:45,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:54:45,770 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 05:54:45,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 05:54:45,791 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 05:54:45,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-16 05:54:45,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:54:45,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-16 05:54:45,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:54:46,020 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 15 treesize of output 5 [2021-12-16 05:54:46,042 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:54:46,042 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 05:54:46,233 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:54:46,233 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [888170662] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 05:54:46,233 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 05:54:46,234 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 7 [2021-12-16 05:54:46,235 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129083351] [2021-12-16 05:54:46,235 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 05:54:46,235 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 05:54:46,235 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:54:46,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 05:54:46,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-16 05:54:46,236 INFO L87 Difference]: Start difference. First operand 231 states and 323 transitions. Second operand has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 8 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:46,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:54:46,372 INFO L93 Difference]: Finished difference Result 236 states and 327 transitions. [2021-12-16 05:54:46,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-16 05:54:46,372 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 8 states have internal predecessors, (40), 0 states have call successors, (0), 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 32 [2021-12-16 05:54:46,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:54:46,373 INFO L225 Difference]: With dead ends: 236 [2021-12-16 05:54:46,373 INFO L226 Difference]: Without dead ends: 224 [2021-12-16 05:54:46,373 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 58 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-12-16 05:54:46,374 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 25 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 77 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:54:46,374 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 250 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 136 Invalid, 0 Unknown, 77 Unchecked, 0.1s Time] [2021-12-16 05:54:46,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2021-12-16 05:54:46,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2021-12-16 05:54:46,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 205 states have (on average 1.5365853658536586) internal successors, (315), 223 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:46,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 315 transitions. [2021-12-16 05:54:46,377 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 315 transitions. Word has length 32 [2021-12-16 05:54:46,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:54:46,377 INFO L470 AbstractCegarLoop]: Abstraction has 224 states and 315 transitions. [2021-12-16 05:54:46,377 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 8 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:46,377 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 315 transitions. [2021-12-16 05:54:46,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-16 05:54:46,377 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:54:46,377 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2021-12-16 05:54:46,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-16 05:54:46,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 05:54:46,587 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 39 more)] === [2021-12-16 05:54:46,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:54:46,588 INFO L85 PathProgramCache]: Analyzing trace with hash -917642468, now seen corresponding path program 1 times [2021-12-16 05:54:46,588 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:54:46,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527409833] [2021-12-16 05:54:46,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:54:46,588 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:54:46,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:54:46,643 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:54:46,644 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:54:46,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527409833] [2021-12-16 05:54:46,644 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527409833] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 05:54:46,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113606817] [2021-12-16 05:54:46,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:54:46,644 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 05:54:46,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 05:54:46,650 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 05:54:46,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-16 05:54:46,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:54:46,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-16 05:54:46,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:54:46,754 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 05:54:46,793 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-16 05:54:46,793 INFO L388 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 21 [2021-12-16 05:54:46,814 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:54:46,814 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 05:54:46,967 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:54:46,967 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1113606817] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 05:54:46,967 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 05:54:46,967 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2021-12-16 05:54:46,967 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450813955] [2021-12-16 05:54:46,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 05:54:46,968 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 05:54:46,968 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:54:46,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 05:54:46,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-16 05:54:46,968 INFO L87 Difference]: Start difference. First operand 224 states and 315 transitions. Second operand has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:47,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:54:47,020 INFO L93 Difference]: Finished difference Result 305 states and 406 transitions. [2021-12-16 05:54:47,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 05:54:47,021 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-12-16 05:54:47,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:54:47,022 INFO L225 Difference]: With dead ends: 305 [2021-12-16 05:54:47,022 INFO L226 Difference]: Without dead ends: 305 [2021-12-16 05:54:47,022 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-12-16 05:54:47,022 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 163 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 58 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 05:54:47,023 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 192 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 58 Unchecked, 0.0s Time] [2021-12-16 05:54:47,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2021-12-16 05:54:47,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 253. [2021-12-16 05:54:47,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 234 states have (on average 1.5128205128205128) internal successors, (354), 252 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:47,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 354 transitions. [2021-12-16 05:54:47,026 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 354 transitions. Word has length 33 [2021-12-16 05:54:47,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:54:47,027 INFO L470 AbstractCegarLoop]: Abstraction has 253 states and 354 transitions. [2021-12-16 05:54:47,027 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:47,027 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 354 transitions. [2021-12-16 05:54:47,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-16 05:54:47,027 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:54:47,027 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2021-12-16 05:54:47,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-16 05:54:47,252 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 05:54:47,252 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 39 more)] === [2021-12-16 05:54:47,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:54:47,253 INFO L85 PathProgramCache]: Analyzing trace with hash -917642467, now seen corresponding path program 1 times [2021-12-16 05:54:47,253 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:54:47,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284866001] [2021-12-16 05:54:47,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:54:47,253 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:54:47,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:54:47,357 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:54:47,357 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:54:47,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284866001] [2021-12-16 05:54:47,358 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284866001] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 05:54:47,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [881824576] [2021-12-16 05:54:47,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:54:47,358 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 05:54:47,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 05:54:47,359 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 05:54:47,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-16 05:54:47,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:54:47,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-16 05:54:47,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:54:47,471 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 05:54:47,474 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 05:54:47,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:54:47,565 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-16 05:54:47,570 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-16 05:54:47,570 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-16 05:54:47,613 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:54:47,614 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 05:54:47,915 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:54:47,916 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [881824576] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 05:54:47,916 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 05:54:47,916 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2021-12-16 05:54:47,916 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848548558] [2021-12-16 05:54:47,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 05:54:47,917 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-16 05:54:47,917 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:54:47,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-16 05:54:47,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-16 05:54:47,917 INFO L87 Difference]: Start difference. First operand 253 states and 354 transitions. Second operand has 9 states, 8 states have (on average 8.125) internal successors, (65), 9 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:48,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:54:48,035 INFO L93 Difference]: Finished difference Result 273 states and 367 transitions. [2021-12-16 05:54:48,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 05:54:48,036 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.125) internal successors, (65), 9 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-12-16 05:54:48,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:54:48,037 INFO L225 Difference]: With dead ends: 273 [2021-12-16 05:54:48,037 INFO L226 Difference]: Without dead ends: 273 [2021-12-16 05:54:48,038 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-12-16 05:54:48,038 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 267 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:54:48,038 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [267 Valid, 160 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 108 Invalid, 0 Unknown, 55 Unchecked, 0.1s Time] [2021-12-16 05:54:48,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2021-12-16 05:54:48,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 222. [2021-12-16 05:54:48,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 205 states have (on average 1.5170731707317073) internal successors, (311), 221 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:48,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 311 transitions. [2021-12-16 05:54:48,041 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 311 transitions. Word has length 33 [2021-12-16 05:54:48,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:54:48,041 INFO L470 AbstractCegarLoop]: Abstraction has 222 states and 311 transitions. [2021-12-16 05:54:48,042 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.125) internal successors, (65), 9 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:48,042 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 311 transitions. [2021-12-16 05:54:48,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-16 05:54:48,042 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:54:48,042 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:54:48,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-16 05:54:48,242 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-12-16 05:54:48,242 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 39 more)] === [2021-12-16 05:54:48,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:54:48,243 INFO L85 PathProgramCache]: Analyzing trace with hash -499896363, now seen corresponding path program 1 times [2021-12-16 05:54:48,243 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:54:48,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701551638] [2021-12-16 05:54:48,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:54:48,243 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:54:48,269 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-16 05:54:48,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1384074456] [2021-12-16 05:54:48,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:54:48,269 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 05:54:48,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 05:54:48,276 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 05:54:48,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-16 05:54:48,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:54:48,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 21 conjunts are in the unsatisfiable core [2021-12-16 05:54:48,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:54:48,402 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 05:54:48,428 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-16 05:54:48,464 INFO L354 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2021-12-16 05:54:48,464 INFO L388 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 21 treesize of output 29 [2021-12-16 05:54:48,502 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-16 05:54:48,503 INFO L388 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 33 treesize of output 24 [2021-12-16 05:54:48,521 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-16 05:54:48,526 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:54:48,526 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 05:54:48,656 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:54:48,656 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:54:48,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701551638] [2021-12-16 05:54:48,656 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-16 05:54:48,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384074456] [2021-12-16 05:54:48,657 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1384074456] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 05:54:48,657 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 05:54:48,657 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-12-16 05:54:48,657 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133066949] [2021-12-16 05:54:48,657 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 05:54:48,657 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-16 05:54:48,658 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:54:48,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-16 05:54:48,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-12-16 05:54:48,658 INFO L87 Difference]: Start difference. First operand 222 states and 311 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:48,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:54:48,803 INFO L93 Difference]: Finished difference Result 241 states and 328 transitions. [2021-12-16 05:54:48,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-16 05:54:48,803 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-12-16 05:54:48,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:54:48,804 INFO L225 Difference]: With dead ends: 241 [2021-12-16 05:54:48,804 INFO L226 Difference]: Without dead ends: 241 [2021-12-16 05:54:48,805 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2021-12-16 05:54:48,805 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 45 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 110 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:54:48,805 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 391 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 194 Invalid, 0 Unknown, 110 Unchecked, 0.1s Time] [2021-12-16 05:54:48,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2021-12-16 05:54:48,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 221. [2021-12-16 05:54:48,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 205 states have (on average 1.5073170731707317) internal successors, (309), 220 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:48,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 309 transitions. [2021-12-16 05:54:48,808 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 309 transitions. Word has length 35 [2021-12-16 05:54:48,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:54:48,808 INFO L470 AbstractCegarLoop]: Abstraction has 221 states and 309 transitions. [2021-12-16 05:54:48,809 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:48,809 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 309 transitions. [2021-12-16 05:54:48,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-16 05:54:48,809 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:54:48,809 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:54:48,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-16 05:54:49,030 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 05:54:49,030 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 39 more)] === [2021-12-16 05:54:49,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:54:49,031 INFO L85 PathProgramCache]: Analyzing trace with hash -499896362, now seen corresponding path program 1 times [2021-12-16 05:54:49,031 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:54:49,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442761273] [2021-12-16 05:54:49,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:54:49,031 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:54:49,043 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-16 05:54:49,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1392180020] [2021-12-16 05:54:49,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:54:49,043 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 05:54:49,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 05:54:49,080 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 05:54:49,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-16 05:54:49,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:54:49,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 37 conjunts are in the unsatisfiable core [2021-12-16 05:54:49,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:54:49,220 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 05:54:49,224 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 05:54:49,285 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-16 05:54:49,290 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-16 05:54:49,335 INFO L354 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2021-12-16 05:54:49,336 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 26 [2021-12-16 05:54:49,353 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-12-16 05:54:49,353 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2021-12-16 05:54:49,425 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-16 05:54:49,425 INFO L388 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 33 treesize of output 24 [2021-12-16 05:54:49,436 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-16 05:54:49,436 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2021-12-16 05:54:49,478 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-16 05:54:49,478 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 16 [2021-12-16 05:54:49,482 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-16 05:54:49,483 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2021-12-16 05:54:49,493 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:54:49,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 05:54:49,819 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:54:49,819 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:54:49,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442761273] [2021-12-16 05:54:49,819 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-16 05:54:49,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1392180020] [2021-12-16 05:54:49,819 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1392180020] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 05:54:49,820 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 05:54:49,820 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2021-12-16 05:54:49,820 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270495006] [2021-12-16 05:54:49,820 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 05:54:49,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-16 05:54:49,820 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:54:49,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-16 05:54:49,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2021-12-16 05:54:49,821 INFO L87 Difference]: Start difference. First operand 221 states and 309 transitions. Second operand has 14 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 14 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:50,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:54:50,053 INFO L93 Difference]: Finished difference Result 304 states and 418 transitions. [2021-12-16 05:54:50,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-16 05:54:50,054 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 14 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-12-16 05:54:50,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:54:50,055 INFO L225 Difference]: With dead ends: 304 [2021-12-16 05:54:50,055 INFO L226 Difference]: Without dead ends: 304 [2021-12-16 05:54:50,055 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2021-12-16 05:54:50,055 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 111 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 175 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:54:50,056 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 530 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 289 Invalid, 0 Unknown, 175 Unchecked, 0.1s Time] [2021-12-16 05:54:50,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2021-12-16 05:54:50,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 208. [2021-12-16 05:54:50,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 193 states have (on average 1.528497409326425) internal successors, (295), 207 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:50,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 295 transitions. [2021-12-16 05:54:50,059 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 295 transitions. Word has length 35 [2021-12-16 05:54:50,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:54:50,059 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 295 transitions. [2021-12-16 05:54:50,059 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 14 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:50,059 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 295 transitions. [2021-12-16 05:54:50,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-16 05:54:50,059 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:54:50,059 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:54:50,093 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-12-16 05:54:50,267 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 05:54:50,267 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 39 more)] === [2021-12-16 05:54:50,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:54:50,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1032157181, now seen corresponding path program 1 times [2021-12-16 05:54:50,268 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:54:50,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515300548] [2021-12-16 05:54:50,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:54:50,268 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:54:50,281 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-16 05:54:50,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1106342806] [2021-12-16 05:54:50,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:54:50,282 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 05:54:50,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 05:54:50,305 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 05:54:50,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-16 05:54:50,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:54:50,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-16 05:54:50,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:54:50,423 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 05:54:50,426 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 05:54:50,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:54:50,491 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-16 05:54:50,497 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-16 05:54:50,497 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-16 05:54:50,585 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:54:50,585 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 05:54:50,845 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:54:50,846 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:54:50,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515300548] [2021-12-16 05:54:50,846 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-16 05:54:50,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106342806] [2021-12-16 05:54:50,846 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1106342806] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 05:54:50,846 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 05:54:50,846 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2021-12-16 05:54:50,847 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375686995] [2021-12-16 05:54:50,847 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 05:54:50,847 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 05:54:50,847 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:54:50,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 05:54:50,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-12-16 05:54:50,848 INFO L87 Difference]: Start difference. First operand 208 states and 295 transitions. Second operand has 8 states, 7 states have (on average 9.714285714285714) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:50,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:54:50,950 INFO L93 Difference]: Finished difference Result 285 states and 390 transitions. [2021-12-16 05:54:50,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-16 05:54:50,950 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.714285714285714) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-12-16 05:54:50,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:54:50,951 INFO L225 Difference]: With dead ends: 285 [2021-12-16 05:54:50,951 INFO L226 Difference]: Without dead ends: 285 [2021-12-16 05:54:50,951 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-12-16 05:54:50,952 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 108 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 38 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:54:50,952 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 173 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 89 Invalid, 0 Unknown, 38 Unchecked, 0.1s Time] [2021-12-16 05:54:50,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2021-12-16 05:54:50,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 265. [2021-12-16 05:54:50,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 250 states have (on average 1.456) internal successors, (364), 264 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:50,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 364 transitions. [2021-12-16 05:54:50,957 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 364 transitions. Word has length 36 [2021-12-16 05:54:50,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:54:50,958 INFO L470 AbstractCegarLoop]: Abstraction has 265 states and 364 transitions. [2021-12-16 05:54:50,958 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.714285714285714) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:50,958 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 364 transitions. [2021-12-16 05:54:50,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-16 05:54:50,958 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:54:50,958 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:54:50,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-12-16 05:54:51,175 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-12-16 05:54:51,176 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 39 more)] === [2021-12-16 05:54:51,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:54:51,176 INFO L85 PathProgramCache]: Analyzing trace with hash 234396292, now seen corresponding path program 1 times [2021-12-16 05:54:51,176 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:54:51,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357521175] [2021-12-16 05:54:51,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:54:51,177 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:54:51,213 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-16 05:54:51,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [347992534] [2021-12-16 05:54:51,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:54:51,214 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 05:54:51,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 05:54:51,227 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 05:54:51,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-16 05:54:51,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:54:51,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-16 05:54:51,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:54:51,460 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-16 05:54:51,460 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 05:54:51,460 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:54:51,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357521175] [2021-12-16 05:54:51,460 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-16 05:54:51,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347992534] [2021-12-16 05:54:51,461 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [347992534] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:54:51,461 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:54:51,461 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-16 05:54:51,461 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057287549] [2021-12-16 05:54:51,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:54:51,461 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 05:54:51,461 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:54:51,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 05:54:51,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-16 05:54:51,462 INFO L87 Difference]: Start difference. First operand 265 states and 364 transitions. Second operand has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:51,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:54:51,539 INFO L93 Difference]: Finished difference Result 281 states and 369 transitions. [2021-12-16 05:54:51,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-16 05:54:51,539 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-12-16 05:54:51,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:54:51,540 INFO L225 Difference]: With dead ends: 281 [2021-12-16 05:54:51,540 INFO L226 Difference]: Without dead ends: 281 [2021-12-16 05:54:51,541 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-16 05:54:51,541 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 137 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:54:51,541 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 130 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:54:51,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2021-12-16 05:54:51,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 265. [2021-12-16 05:54:51,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 250 states have (on average 1.448) internal successors, (362), 264 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:51,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 362 transitions. [2021-12-16 05:54:51,545 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 362 transitions. Word has length 38 [2021-12-16 05:54:51,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:54:51,545 INFO L470 AbstractCegarLoop]: Abstraction has 265 states and 362 transitions. [2021-12-16 05:54:51,545 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:51,545 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 362 transitions. [2021-12-16 05:54:51,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-16 05:54:51,546 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:54:51,546 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:54:51,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-16 05:54:51,763 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-12-16 05:54:51,763 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 39 more)] === [2021-12-16 05:54:51,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:54:51,763 INFO L85 PathProgramCache]: Analyzing trace with hash -716826511, now seen corresponding path program 1 times [2021-12-16 05:54:51,763 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:54:51,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192579992] [2021-12-16 05:54:51,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:54:51,763 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:54:51,792 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-16 05:54:51,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1210943521] [2021-12-16 05:54:51,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:54:51,792 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 05:54:51,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 05:54:51,793 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 05:54:51,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-16 05:54:51,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:54:51,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-16 05:54:51,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:54:52,003 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-16 05:54:52,003 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 05:54:52,004 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:54:52,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192579992] [2021-12-16 05:54:52,005 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-16 05:54:52,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210943521] [2021-12-16 05:54:52,005 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210943521] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:54:52,005 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:54:52,005 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 05:54:52,005 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065849775] [2021-12-16 05:54:52,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:54:52,006 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 05:54:52,006 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:54:52,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 05:54:52,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 05:54:52,006 INFO L87 Difference]: Start difference. First operand 265 states and 362 transitions. Second operand has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:52,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:54:52,053 INFO L93 Difference]: Finished difference Result 273 states and 358 transitions. [2021-12-16 05:54:52,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 05:54:52,053 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-12-16 05:54:52,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:54:52,054 INFO L225 Difference]: With dead ends: 273 [2021-12-16 05:54:52,054 INFO L226 Difference]: Without dead ends: 273 [2021-12-16 05:54:52,054 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 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-16 05:54:52,055 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 125 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 05:54:52,055 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 134 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 05:54:52,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2021-12-16 05:54:52,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 227. [2021-12-16 05:54:52,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 212 states have (on average 1.4150943396226414) internal successors, (300), 226 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-16 05:54:52,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 300 transitions. [2021-12-16 05:54:52,058 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 300 transitions. Word has length 41 [2021-12-16 05:54:52,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:54:52,059 INFO L470 AbstractCegarLoop]: Abstraction has 227 states and 300 transitions. [2021-12-16 05:54:52,059 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:52,059 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 300 transitions. [2021-12-16 05:54:52,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-16 05:54:52,059 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:54:52,059 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:54:52,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-16 05:54:52,275 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-12-16 05:54:52,275 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 39 more)] === [2021-12-16 05:54:52,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:54:52,276 INFO L85 PathProgramCache]: Analyzing trace with hash -716826470, now seen corresponding path program 1 times [2021-12-16 05:54:52,276 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:54:52,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74782370] [2021-12-16 05:54:52,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:54:52,276 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:54:52,288 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-16 05:54:52,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1645434286] [2021-12-16 05:54:52,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:54:52,288 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 05:54:52,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 05:54:52,308 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 05:54:52,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-16 05:54:52,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:54:52,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 26 conjunts are in the unsatisfiable core [2021-12-16 05:54:52,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:54:52,463 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 05:54:52,524 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-16 05:54:52,600 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-12-16 05:54:52,614 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:54:52,614 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 05:54:52,614 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:54:52,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74782370] [2021-12-16 05:54:52,615 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-16 05:54:52,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645434286] [2021-12-16 05:54:52,615 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1645434286] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:54:52,615 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:54:52,615 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-16 05:54:52,615 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889570677] [2021-12-16 05:54:52,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:54:52,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-16 05:54:52,616 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:54:52,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-16 05:54:52,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-16 05:54:52,616 INFO L87 Difference]: Start difference. First operand 227 states and 300 transitions. Second operand has 9 states, 8 states have (on average 5.125) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:52,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:54:52,921 INFO L93 Difference]: Finished difference Result 314 states and 400 transitions. [2021-12-16 05:54:52,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-16 05:54:52,922 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-12-16 05:54:52,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:54:52,923 INFO L225 Difference]: With dead ends: 314 [2021-12-16 05:54:52,923 INFO L226 Difference]: Without dead ends: 314 [2021-12-16 05:54:52,923 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2021-12-16 05:54:52,923 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 153 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 05:54:52,923 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 245 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 05:54:52,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2021-12-16 05:54:52,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 244. [2021-12-16 05:54:52,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 229 states have (on average 1.4235807860262009) internal successors, (326), 243 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:52,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 326 transitions. [2021-12-16 05:54:52,927 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 326 transitions. Word has length 41 [2021-12-16 05:54:52,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:54:52,928 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 326 transitions. [2021-12-16 05:54:52,928 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:52,928 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 326 transitions. [2021-12-16 05:54:52,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-16 05:54:52,928 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:54:52,928 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:54:52,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-12-16 05:54:53,129 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-12-16 05:54:53,129 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 39 more)] === [2021-12-16 05:54:53,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:54:53,129 INFO L85 PathProgramCache]: Analyzing trace with hash -716826469, now seen corresponding path program 1 times [2021-12-16 05:54:53,129 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:54:53,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129800747] [2021-12-16 05:54:53,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:54:53,129 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:54:53,141 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-16 05:54:53,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1719881991] [2021-12-16 05:54:53,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:54:53,141 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 05:54:53,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 05:54:53,142 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 05:54:53,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-16 05:54:53,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:54:53,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 34 conjunts are in the unsatisfiable core [2021-12-16 05:54:53,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:54:53,301 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 05:54:53,365 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-16 05:54:53,368 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-16 05:54:53,476 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-12-16 05:54:53,478 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-16 05:54:53,509 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:54:53,515 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 05:54:53,516 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:54:53,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129800747] [2021-12-16 05:54:53,516 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-16 05:54:53,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719881991] [2021-12-16 05:54:53,516 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1719881991] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:54:53,516 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:54:53,516 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-16 05:54:53,516 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545216425] [2021-12-16 05:54:53,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:54:53,517 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-16 05:54:53,517 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:54:53,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-16 05:54:53,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-16 05:54:53,518 INFO L87 Difference]: Start difference. First operand 244 states and 326 transitions. Second operand has 9 states, 8 states have (on average 5.125) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:53,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:54:53,878 INFO L93 Difference]: Finished difference Result 347 states and 444 transitions. [2021-12-16 05:54:53,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-16 05:54:53,879 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-12-16 05:54:53,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:54:53,880 INFO L225 Difference]: With dead ends: 347 [2021-12-16 05:54:53,880 INFO L226 Difference]: Without dead ends: 347 [2021-12-16 05:54:53,880 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2021-12-16 05:54:53,880 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 210 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 05:54:53,880 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [210 Valid, 363 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 05:54:53,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2021-12-16 05:54:53,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 244. [2021-12-16 05:54:53,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 229 states have (on average 1.4148471615720524) internal successors, (324), 243 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:53,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 324 transitions. [2021-12-16 05:54:53,884 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 324 transitions. Word has length 41 [2021-12-16 05:54:53,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:54:53,884 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 324 transitions. [2021-12-16 05:54:53,884 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:53,884 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 324 transitions. [2021-12-16 05:54:53,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-16 05:54:53,884 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:54:53,884 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:54:53,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-12-16 05:54:54,109 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-12-16 05:54:54,110 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 39 more)] === [2021-12-16 05:54:54,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:54:54,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1675466949, now seen corresponding path program 1 times [2021-12-16 05:54:54,110 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:54:54,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465471047] [2021-12-16 05:54:54,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:54:54,110 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:54:54,141 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-16 05:54:54,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1987218658] [2021-12-16 05:54:54,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:54:54,153 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 05:54:54,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 05:54:54,154 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 05:54:54,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-16 05:54:54,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:54:54,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-16 05:54:54,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:54:54,372 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-16 05:54:54,372 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 05:54:54,372 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:54:54,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465471047] [2021-12-16 05:54:54,373 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-16 05:54:54,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987218658] [2021-12-16 05:54:54,373 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987218658] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:54:54,373 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:54:54,373 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 05:54:54,373 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735285512] [2021-12-16 05:54:54,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:54:54,373 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 05:54:54,374 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:54:54,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 05:54:54,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 05:54:54,374 INFO L87 Difference]: Start difference. First operand 244 states and 324 transitions. Second operand has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:54,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:54:54,416 INFO L93 Difference]: Finished difference Result 266 states and 347 transitions. [2021-12-16 05:54:54,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 05:54:54,416 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2021-12-16 05:54:54,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:54:54,417 INFO L225 Difference]: With dead ends: 266 [2021-12-16 05:54:54,417 INFO L226 Difference]: Without dead ends: 266 [2021-12-16 05:54:54,417 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 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-16 05:54:54,418 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 17 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 05:54:54,418 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 157 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 05:54:54,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2021-12-16 05:54:54,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 242. [2021-12-16 05:54:54,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 229 states have (on average 1.3755458515283843) internal successors, (315), 241 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:54,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 315 transitions. [2021-12-16 05:54:54,421 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 315 transitions. Word has length 43 [2021-12-16 05:54:54,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:54:54,422 INFO L470 AbstractCegarLoop]: Abstraction has 242 states and 315 transitions. [2021-12-16 05:54:54,422 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:54,422 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 315 transitions. [2021-12-16 05:54:54,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-16 05:54:54,422 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:54:54,422 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:54:54,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-12-16 05:54:54,635 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 05:54:54,635 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 39 more)] === [2021-12-16 05:54:54,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:54:54,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1675466948, now seen corresponding path program 1 times [2021-12-16 05:54:54,636 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:54:54,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299964374] [2021-12-16 05:54:54,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:54:54,636 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:54:54,647 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-16 05:54:54,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [475937631] [2021-12-16 05:54:54,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:54:54,648 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 05:54:54,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 05:54:54,649 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 05:54:54,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-16 05:54:54,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:54:54,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 36 conjunts are in the unsatisfiable core [2021-12-16 05:54:54,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:54:54,831 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 05:54:54,894 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-16 05:54:54,897 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-16 05:54:55,010 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-12-16 05:54:55,013 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-16 05:54:55,079 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:54:55,079 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 05:54:55,079 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:54:55,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299964374] [2021-12-16 05:54:55,080 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-16 05:54:55,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475937631] [2021-12-16 05:54:55,080 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [475937631] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:54:55,080 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:54:55,080 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-16 05:54:55,081 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773557314] [2021-12-16 05:54:55,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:54:55,081 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-16 05:54:55,081 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:54:55,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-16 05:54:55,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-12-16 05:54:55,082 INFO L87 Difference]: Start difference. First operand 242 states and 315 transitions. Second operand has 11 states, 10 states have (on average 4.3) internal successors, (43), 11 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:55,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:54:55,728 INFO L93 Difference]: Finished difference Result 400 states and 497 transitions. [2021-12-16 05:54:55,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-16 05:54:55,728 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.3) internal successors, (43), 11 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2021-12-16 05:54:55,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:54:55,729 INFO L225 Difference]: With dead ends: 400 [2021-12-16 05:54:55,729 INFO L226 Difference]: Without dead ends: 400 [2021-12-16 05:54:55,730 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=473, Unknown=0, NotChecked=0, Total=600 [2021-12-16 05:54:55,730 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 299 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-16 05:54:55,730 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [299 Valid, 485 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-16 05:54:55,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2021-12-16 05:54:55,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 250. [2021-12-16 05:54:55,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 237 states have (on average 1.371308016877637) internal successors, (325), 249 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:55,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 325 transitions. [2021-12-16 05:54:55,741 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 325 transitions. Word has length 43 [2021-12-16 05:54:55,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:54:55,758 INFO L470 AbstractCegarLoop]: Abstraction has 250 states and 325 transitions. [2021-12-16 05:54:55,758 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.3) internal successors, (43), 11 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:55,758 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 325 transitions. [2021-12-16 05:54:55,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-16 05:54:55,759 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:54:55,759 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:54:55,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-12-16 05:54:55,976 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 05:54:55,976 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 39 more)] === [2021-12-16 05:54:55,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:54:55,976 INFO L85 PathProgramCache]: Analyzing trace with hash 829486443, now seen corresponding path program 1 times [2021-12-16 05:54:55,976 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:54:55,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228747079] [2021-12-16 05:54:55,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:54:55,977 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:54:56,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:54:56,317 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:54:56,317 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:54:56,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228747079] [2021-12-16 05:54:56,317 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228747079] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 05:54:56,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049400856] [2021-12-16 05:54:56,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:54:56,317 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 05:54:56,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 05:54:56,332 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 05:54:56,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-12-16 05:54:56,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:54:56,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 59 conjunts are in the unsatisfiable core [2021-12-16 05:54:56,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:54:56,511 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 05:54:56,532 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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-16 05:54:56,537 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-16 05:54:56,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:54:56,560 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-16 05:54:56,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:54:56,568 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-16 05:54:56,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:54:56,581 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-16 05:54:56,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:54:56,586 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-16 05:54:56,700 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-16 05:54:56,700 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-16 05:54:56,747 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-16 05:54:56,752 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-16 05:54:56,769 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-16 05:54:56,775 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-16 05:54:56,792 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-16 05:54:56,798 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-16 05:54:56,811 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-16 05:54:56,817 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-16 05:54:56,832 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-16 05:54:56,837 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-16 05:54:56,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:54:56,926 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-16 05:54:56,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:54:56,930 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-16 05:54:56,956 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-16 05:54:56,958 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-16 05:54:57,064 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 05:54:57,064 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2021-12-16 05:54:57,070 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 05:54:57,070 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2021-12-16 05:54:57,114 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:54:57,115 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 05:54:57,224 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2275 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2275) |c_ULTIMATE.start_main_~first~0#1.base|) |c_ULTIMATE.start_main_~first~0#1.offset|) |c_ULTIMATE.start_main_~first~0#1.offset|)) (forall ((v_ArrVal_2276 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2276) |c_ULTIMATE.start_main_~first~0#1.base|) |c_ULTIMATE.start_main_~first~0#1.offset|) |c_ULTIMATE.start_main_~first~0#1.base|))) is different from false [2021-12-16 05:54:57,233 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2274 Int) (v_ArrVal_2276 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~last~0#1.base|) (+ |c_ULTIMATE.start_main_~last~0#1.offset| 12) v_ArrVal_2274)) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2276) |c_ULTIMATE.start_main_~first~0#1.base|) |c_ULTIMATE.start_main_~first~0#1.offset|) |c_ULTIMATE.start_main_~first~0#1.base|)) (forall ((v_ArrVal_2273 Int) (v_ArrVal_2275 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~last~0#1.base|) (+ |c_ULTIMATE.start_main_~last~0#1.offset| 12) v_ArrVal_2273)) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2275) |c_ULTIMATE.start_main_~first~0#1.base|) |c_ULTIMATE.start_main_~first~0#1.offset|) |c_ULTIMATE.start_main_~first~0#1.offset|))) is different from false [2021-12-16 05:54:57,293 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2270 (Array Int Int)) (v_ArrVal_2274 Int) (v_ArrVal_2276 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2270))) (store .cse0 |c_ULTIMATE.start_main_~last~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~last~0#1.base|) (+ |c_ULTIMATE.start_main_~last~0#1.offset| 12) v_ArrVal_2274))) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2276) |c_ULTIMATE.start_main_~first~0#1.base|) |c_ULTIMATE.start_main_~first~0#1.offset|) |c_ULTIMATE.start_main_~first~0#1.base|)) (forall ((v_ArrVal_2273 Int) (v_ArrVal_2269 (Array Int Int)) (v_ArrVal_2275 (Array Int Int))) (= (select (select (store (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2269))) (store .cse1 |c_ULTIMATE.start_main_~last~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~last~0#1.base|) (+ |c_ULTIMATE.start_main_~last~0#1.offset| 12) v_ArrVal_2273))) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2275) |c_ULTIMATE.start_main_~first~0#1.base|) |c_ULTIMATE.start_main_~first~0#1.offset|) |c_ULTIMATE.start_main_~first~0#1.offset|))) is different from false [2021-12-16 05:54:57,348 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.base_42| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_42|))) (and (forall ((v_ArrVal_2273 Int) (v_ArrVal_2269 (Array Int Int)) (v_ArrVal_2275 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_42| v_ArrVal_2269))) (store .cse0 |c_ULTIMATE.start_main_~last~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~last~0#1.base|) (+ |c_ULTIMATE.start_main_~last~0#1.offset| 12) v_ArrVal_2273))) |v_ULTIMATE.start_main_~x~0#1.base_42| v_ArrVal_2275) |c_ULTIMATE.start_main_~first~0#1.base|) |c_ULTIMATE.start_main_~first~0#1.offset|) |c_ULTIMATE.start_main_~first~0#1.offset|)) (forall ((v_ArrVal_2270 (Array Int Int)) (v_ArrVal_2274 Int) (v_ArrVal_2276 (Array Int Int))) (= (select (select (store (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_42| v_ArrVal_2270))) (store .cse1 |c_ULTIMATE.start_main_~last~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~last~0#1.base|) (+ |c_ULTIMATE.start_main_~last~0#1.offset| 12) v_ArrVal_2274))) |v_ULTIMATE.start_main_~x~0#1.base_42| v_ArrVal_2276) |c_ULTIMATE.start_main_~first~0#1.base|) |c_ULTIMATE.start_main_~first~0#1.offset|) |c_ULTIMATE.start_main_~first~0#1.base|))))) is different from false [2021-12-16 05:54:58,366 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 05:54:58,367 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 05:54:58,367 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 05:54:58,373 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 05:54:58,373 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 125 treesize of output 118 [2021-12-16 05:54:58,376 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 05:54:58,377 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 05:54:58,377 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 05:54:58,382 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 05:54:58,383 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 118 treesize of output 110 [2021-12-16 05:54:58,387 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 138 [2021-12-16 05:54:58,390 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 05:54:58,391 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 05:54:58,392 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 05:54:58,392 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 05:54:58,392 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 121 [2021-12-16 05:54:58,396 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 149 [2021-12-16 05:54:58,399 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 05:54:58,400 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 05:54:58,401 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 05:54:58,401 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 05:54:58,401 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 132 [2021-12-16 05:54:58,413 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2021-12-16 05:54:58,414 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2021-12-16 05:54:58,451 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2021-12-16 05:54:58,451 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049400856] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 05:54:58,452 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 05:54:58,452 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 14] total 34 [2021-12-16 05:54:58,452 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097403769] [2021-12-16 05:54:58,452 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 05:54:58,452 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-12-16 05:54:58,452 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:54:58,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-12-16 05:54:58,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=772, Unknown=13, NotChecked=236, Total=1122 [2021-12-16 05:54:58,453 INFO L87 Difference]: Start difference. First operand 250 states and 325 transitions. Second operand has 34 states, 34 states have (on average 3.676470588235294) internal successors, (125), 34 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:58,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-16 05:54:58,891 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=179, Invalid=1010, Unknown=17, NotChecked=276, Total=1482 [2021-12-16 05:54:58,892 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 133 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 273 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:54:58,892 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 346 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 269 Invalid, 0 Unknown, 273 Unchecked, 0.1s Time] [2021-12-16 05:54:58,909 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2021-12-16 05:54:59,093 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 05:54:59,093 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: at most one deprecated predicate at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:980) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:388) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:868) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:784) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:462) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) 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-16 05:54:59,097 INFO L158 Benchmark]: Toolchain (without parser) took 18145.39ms. Allocated memory was 132.1MB in the beginning and 262.1MB in the end (delta: 130.0MB). Free memory was 104.2MB in the beginning and 110.0MB in the end (delta: -5.8MB). Peak memory consumption was 123.4MB. Max. memory is 16.1GB. [2021-12-16 05:54:59,097 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 132.1MB. Free memory is still 89.1MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-16 05:54:59,097 INFO L158 Benchmark]: CACSL2BoogieTranslator took 522.10ms. Allocated memory is still 132.1MB. Free memory was 103.8MB in the beginning and 96.5MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-16 05:54:59,097 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.08ms. Allocated memory is still 132.1MB. Free memory was 96.5MB in the beginning and 94.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-16 05:54:59,097 INFO L158 Benchmark]: Boogie Preprocessor took 67.09ms. Allocated memory is still 132.1MB. Free memory was 94.5MB in the beginning and 92.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-16 05:54:59,097 INFO L158 Benchmark]: RCFGBuilder took 339.61ms. Allocated memory is still 132.1MB. Free memory was 92.7MB in the beginning and 75.6MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2021-12-16 05:54:59,097 INFO L158 Benchmark]: TraceAbstraction took 17149.87ms. Allocated memory was 132.1MB in the beginning and 262.1MB in the end (delta: 130.0MB). Free memory was 75.2MB in the beginning and 110.0MB in the end (delta: -34.8MB). Peak memory consumption was 97.5MB. Max. memory is 16.1GB. [2021-12-16 05:54:59,098 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 132.1MB. Free memory is still 89.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 522.10ms. Allocated memory is still 132.1MB. Free memory was 103.8MB in the beginning and 96.5MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.08ms. Allocated memory is still 132.1MB. Free memory was 96.5MB in the beginning and 94.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.09ms. Allocated memory is still 132.1MB. Free memory was 94.5MB in the beginning and 92.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 339.61ms. Allocated memory is still 132.1MB. Free memory was 92.7MB in the beginning and 75.6MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 17149.87ms. Allocated memory was 132.1MB in the beginning and 262.1MB in the end (delta: 130.0MB). Free memory was 75.2MB in the beginning and 110.0MB in the end (delta: -34.8MB). Peak memory consumption was 97.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: at most one deprecated predicate de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: at most one deprecated predicate: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:980) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-12-16 05:54:59,129 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/list-ext-properties/test-0504_1.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 ad4b9fd301578a7ddb25530c70896459a49284f596306d3b6d0c853e43916174 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-16 05:55:00,705 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-16 05:55:00,707 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-16 05:55:00,738 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-16 05:55:00,739 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-16 05:55:00,741 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-16 05:55:00,742 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-16 05:55:00,746 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-16 05:55:00,747 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-16 05:55:00,751 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-16 05:55:00,752 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-16 05:55:00,753 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-16 05:55:00,753 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-16 05:55:00,754 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-16 05:55:00,754 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-16 05:55:00,755 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-16 05:55:00,755 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-16 05:55:00,756 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-16 05:55:00,757 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-16 05:55:00,758 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-16 05:55:00,759 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-16 05:55:00,771 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-16 05:55:00,775 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-16 05:55:00,777 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-16 05:55:00,786 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-16 05:55:00,787 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-16 05:55:00,787 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-16 05:55:00,788 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-16 05:55:00,788 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-16 05:55:00,789 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-16 05:55:00,789 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-16 05:55:00,790 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-16 05:55:00,791 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-16 05:55:00,791 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-16 05:55:00,792 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-16 05:55:00,792 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-16 05:55:00,793 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-16 05:55:00,793 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-16 05:55:00,793 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-16 05:55:00,794 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-16 05:55:00,795 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-16 05:55:00,796 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-12-16 05:55:00,827 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-16 05:55:00,830 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-16 05:55:00,831 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-16 05:55:00,831 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-16 05:55:00,831 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-16 05:55:00,832 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-16 05:55:00,832 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-16 05:55:00,833 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-16 05:55:00,833 INFO L138 SettingsManager]: * Use SBE=true [2021-12-16 05:55:00,833 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-16 05:55:00,834 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-16 05:55:00,834 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-16 05:55:00,834 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-16 05:55:00,834 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-16 05:55:00,834 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-16 05:55:00,835 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-16 05:55:00,835 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-16 05:55:00,835 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-16 05:55:00,835 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-16 05:55:00,835 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-16 05:55:00,836 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-16 05:55:00,836 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-16 05:55:00,836 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-16 05:55:00,836 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-16 05:55:00,836 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-16 05:55:00,836 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-16 05:55:00,837 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-16 05:55:00,837 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 05:55:00,837 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-16 05:55:00,837 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-16 05:55:00,837 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-16 05:55:00,837 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-16 05:55:00,838 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-16 05:55:00,838 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-16 05:55:00,838 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 -> ad4b9fd301578a7ddb25530c70896459a49284f596306d3b6d0c853e43916174 [2021-12-16 05:55:01,098 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 05:55:01,110 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 05:55:01,112 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 05:55:01,113 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 05:55:01,113 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 05:55:01,114 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/test-0504_1.i [2021-12-16 05:55:01,206 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96ca0bbd7/205b435a7cef4adf8dfda2cc6442fa69/FLAG0aad5309d [2021-12-16 05:55:01,585 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 05:55:01,592 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0504_1.i [2021-12-16 05:55:01,614 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96ca0bbd7/205b435a7cef4adf8dfda2cc6442fa69/FLAG0aad5309d [2021-12-16 05:55:01,625 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96ca0bbd7/205b435a7cef4adf8dfda2cc6442fa69 [2021-12-16 05:55:01,627 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 05:55:01,628 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 05:55:01,630 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 05:55:01,630 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 05:55:01,633 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 05:55:01,633 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 05:55:01" (1/1) ... [2021-12-16 05:55:01,634 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@466258b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:55:01, skipping insertion in model container [2021-12-16 05:55:01,634 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 05:55:01" (1/1) ... [2021-12-16 05:55:01,639 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 05:55:01,672 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 05:55:01,952 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 05:55:01,963 INFO L203 MainTranslator]: Completed pre-run [2021-12-16 05:55:01,992 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 05:55:02,016 INFO L208 MainTranslator]: Completed translation [2021-12-16 05:55:02,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:55:02 WrapperNode [2021-12-16 05:55:02,018 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 05:55:02,018 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-16 05:55:02,019 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-16 05:55:02,019 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-16 05:55:02,023 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:55:02" (1/1) ... [2021-12-16 05:55:02,049 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:55:02" (1/1) ... [2021-12-16 05:55:02,072 INFO L137 Inliner]: procedures = 126, calls = 28, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 101 [2021-12-16 05:55:02,072 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-16 05:55:02,073 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-16 05:55:02,073 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-16 05:55:02,073 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-16 05:55:02,078 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:55:02" (1/1) ... [2021-12-16 05:55:02,078 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:55:02" (1/1) ... [2021-12-16 05:55:02,084 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:55:02" (1/1) ... [2021-12-16 05:55:02,085 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:55:02" (1/1) ... [2021-12-16 05:55:02,101 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:55:02" (1/1) ... [2021-12-16 05:55:02,104 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:55:02" (1/1) ... [2021-12-16 05:55:02,105 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:55:02" (1/1) ... [2021-12-16 05:55:02,107 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-16 05:55:02,107 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-16 05:55:02,107 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-16 05:55:02,108 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-16 05:55:02,108 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:55:02" (1/1) ... [2021-12-16 05:55:02,117 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 05:55:02,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 05:55:02,135 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-16 05:55:02,153 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-16 05:55:02,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-16 05:55:02,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-16 05:55:02,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-16 05:55:02,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-16 05:55:02,164 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-16 05:55:02,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-16 05:55:02,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-16 05:55:02,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-16 05:55:02,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-16 05:55:02,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-16 05:55:02,235 INFO L236 CfgBuilder]: Building ICFG [2021-12-16 05:55:02,237 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-16 05:55:02,582 INFO L277 CfgBuilder]: Performing block encoding [2021-12-16 05:55:02,586 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-16 05:55:02,586 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-12-16 05:55:02,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 05:55:02 BoogieIcfgContainer [2021-12-16 05:55:02,588 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-16 05:55:02,589 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-16 05:55:02,589 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-16 05:55:02,590 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-16 05:55:02,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 05:55:01" (1/3) ... [2021-12-16 05:55:02,591 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f762c71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 05:55:02, skipping insertion in model container [2021-12-16 05:55:02,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:55:02" (2/3) ... [2021-12-16 05:55:02,592 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f762c71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 05:55:02, skipping insertion in model container [2021-12-16 05:55:02,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 05:55:02" (3/3) ... [2021-12-16 05:55:02,592 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0504_1.i [2021-12-16 05:55:02,595 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-16 05:55:02,596 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 43 error locations. [2021-12-16 05:55:02,629 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-16 05:55:02,635 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-16 05:55:02,636 INFO L340 AbstractCegarLoop]: Starting to check reachability of 43 error locations. [2021-12-16 05:55:02,645 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 46 states have (on average 2.1956521739130435) internal successors, (101), 89 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:55:02,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-16 05:55:02,649 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:55:02,649 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-16 05:55:02,650 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 39 more)] === [2021-12-16 05:55:02,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:55:02,655 INFO L85 PathProgramCache]: Analyzing trace with hash 28700584, now seen corresponding path program 1 times [2021-12-16 05:55:02,662 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 05:55:02,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [969153827] [2021-12-16 05:55:02,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:55:02,664 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 05:55:02,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 05:55:02,681 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-16 05:55:02,682 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-16 05:55:02,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:55:02,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-16 05:55:02,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:55:02,792 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-16 05:55:02,792 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 05:55:02,792 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 05:55:02,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [969153827] [2021-12-16 05:55:02,793 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [969153827] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:55:02,793 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:55:02,793 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 05:55:02,794 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067229044] [2021-12-16 05:55:02,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:55:02,798 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 05:55:02,799 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 05:55:02,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 05:55:02,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 05:55:02,823 INFO L87 Difference]: Start difference. First operand has 90 states, 46 states have (on average 2.1956521739130435) internal successors, (101), 89 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.6666666666666667) 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-16 05:55:02,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:55:02,874 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2021-12-16 05:55:02,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 05:55:02,879 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) 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-16 05:55:02,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:55:02,885 INFO L225 Difference]: With dead ends: 97 [2021-12-16 05:55:02,888 INFO L226 Difference]: Without dead ends: 93 [2021-12-16 05:55:02,889 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-16 05:55:02,892 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 5 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 05:55:02,893 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 180 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 05:55:02,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-12-16 05:55:02,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 90. [2021-12-16 05:55:02,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 47 states have (on average 2.0425531914893615) internal successors, (96), 89 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:55:02,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 96 transitions. [2021-12-16 05:55:02,915 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 96 transitions. Word has length 5 [2021-12-16 05:55:02,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:55:02,916 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 96 transitions. [2021-12-16 05:55:02,916 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) 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-16 05:55:02,916 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions. [2021-12-16 05:55:02,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-16 05:55:02,916 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:55:02,916 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-16 05:55:02,932 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-12-16 05:55:03,123 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-16 05:55:03,123 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 39 more)] === [2021-12-16 05:55:03,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:55:03,124 INFO L85 PathProgramCache]: Analyzing trace with hash 28699819, now seen corresponding path program 1 times [2021-12-16 05:55:03,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 05:55:03,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [463939161] [2021-12-16 05:55:03,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:55:03,125 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 05:55:03,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 05:55:03,126 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-16 05:55:03,146 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-16 05:55:03,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:55:03,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-16 05:55:03,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:55:03,213 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 05:55:03,223 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-16 05:55:03,223 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 05:55:03,223 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 05:55:03,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [463939161] [2021-12-16 05:55:03,223 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [463939161] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:55:03,224 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:55:03,224 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 05:55:03,224 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065973087] [2021-12-16 05:55:03,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:55:03,225 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 05:55:03,225 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 05:55:03,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 05:55:03,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 05:55:03,226 INFO L87 Difference]: Start difference. First operand 90 states and 96 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-16 05:55:03,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:55:03,375 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2021-12-16 05:55:03,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 05:55:03,376 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-16 05:55:03,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:55:03,378 INFO L225 Difference]: With dead ends: 115 [2021-12-16 05:55:03,378 INFO L226 Difference]: Without dead ends: 115 [2021-12-16 05:55:03,379 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-16 05:55:03,379 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 78 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:55:03,380 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 67 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:55:03,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-12-16 05:55:03,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 82. [2021-12-16 05:55:03,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 47 states have (on average 1.872340425531915) internal successors, (88), 81 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:55:03,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2021-12-16 05:55:03,387 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 5 [2021-12-16 05:55:03,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:55:03,387 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2021-12-16 05:55:03,387 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-16 05:55:03,387 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2021-12-16 05:55:03,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-16 05:55:03,387 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:55:03,388 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-16 05:55:03,393 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-12-16 05:55:03,588 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-16 05:55:03,589 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 39 more)] === [2021-12-16 05:55:03,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:55:03,589 INFO L85 PathProgramCache]: Analyzing trace with hash 28699820, now seen corresponding path program 1 times [2021-12-16 05:55:03,590 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 05:55:03,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [761128274] [2021-12-16 05:55:03,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:55:03,590 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 05:55:03,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 05:55:03,593 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-16 05:55:03,595 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-16 05:55:03,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:55:03,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-16 05:55:03,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:55:03,699 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-16 05:55:03,717 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-16 05:55:03,717 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 05:55:03,717 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 05:55:03,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [761128274] [2021-12-16 05:55:03,717 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [761128274] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:55:03,718 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:55:03,718 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 05:55:03,718 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273125072] [2021-12-16 05:55:03,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:55:03,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 05:55:03,718 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 05:55:03,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 05:55:03,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 05:55:03,719 INFO L87 Difference]: Start difference. First operand 82 states and 88 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-16 05:55:03,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:55:03,896 INFO L93 Difference]: Finished difference Result 119 states and 130 transitions. [2021-12-16 05:55:03,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 05:55:03,897 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-16 05:55:03,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:55:03,898 INFO L225 Difference]: With dead ends: 119 [2021-12-16 05:55:03,898 INFO L226 Difference]: Without dead ends: 119 [2021-12-16 05:55:03,898 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-16 05:55:03,899 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 51 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 05:55:03,899 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 105 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 05:55:03,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-12-16 05:55:03,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 82. [2021-12-16 05:55:03,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 52 states have (on average 1.7692307692307692) internal successors, (92), 81 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:55:03,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2021-12-16 05:55:03,904 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 5 [2021-12-16 05:55:03,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:55:03,905 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2021-12-16 05:55:03,905 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-16 05:55:03,905 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2021-12-16 05:55:03,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-16 05:55:03,905 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:55:03,905 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-16 05:55:03,914 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-16 05:55:04,111 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-16 05:55:04,112 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 39 more)] === [2021-12-16 05:55:04,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:55:04,112 INFO L85 PathProgramCache]: Analyzing trace with hash 889717790, now seen corresponding path program 1 times [2021-12-16 05:55:04,113 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 05:55:04,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1276191707] [2021-12-16 05:55:04,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:55:04,113 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 05:55:04,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 05:55:04,115 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-16 05:55:04,116 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-16 05:55:04,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:55:04,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-16 05:55:04,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:55:04,185 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-16 05:55:04,185 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 05:55:04,185 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 05:55:04,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1276191707] [2021-12-16 05:55:04,186 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1276191707] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:55:04,186 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:55:04,186 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 05:55:04,186 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215421979] [2021-12-16 05:55:04,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:55:04,186 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 05:55:04,187 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 05:55:04,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 05:55:04,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 05:55:04,187 INFO L87 Difference]: Start difference. First operand 82 states and 92 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-16 05:55:04,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:55:04,282 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2021-12-16 05:55:04,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 05:55:04,282 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-16 05:55:04,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:55:04,283 INFO L225 Difference]: With dead ends: 84 [2021-12-16 05:55:04,283 INFO L226 Difference]: Without dead ends: 81 [2021-12-16 05:55:04,283 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-16 05:55:04,284 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:55:04,284 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 122 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:55:04,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-12-16 05:55:04,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2021-12-16 05:55:04,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 51 states have (on average 1.7647058823529411) internal successors, (90), 80 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:55:04,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2021-12-16 05:55:04,288 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 6 [2021-12-16 05:55:04,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:55:04,288 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2021-12-16 05:55:04,288 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-16 05:55:04,289 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2021-12-16 05:55:04,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-16 05:55:04,289 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:55:04,289 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:55:04,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2021-12-16 05:55:04,515 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-16 05:55:04,516 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 39 more)] === [2021-12-16 05:55:04,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:55:04,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1286398787, now seen corresponding path program 1 times [2021-12-16 05:55:04,516 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 05:55:04,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [4908437] [2021-12-16 05:55:04,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:55:04,517 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 05:55:04,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 05:55:04,518 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-16 05:55:04,580 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-16 05:55:04,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:55:04,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-16 05:55:04,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:55:04,663 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 05:55:04,670 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 05:55:04,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:55:04,775 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-16 05:55:04,790 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-16 05:55:04,791 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2021-12-16 05:55:04,808 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-16 05:55:04,808 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 05:55:04,809 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 05:55:04,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [4908437] [2021-12-16 05:55:04,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [4908437] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:55:04,809 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:55:04,809 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 05:55:04,809 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877495167] [2021-12-16 05:55:04,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:55:04,810 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 05:55:04,810 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 05:55:04,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 05:55:04,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-16 05:55:04,811 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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-16 05:55:04,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:55:04,963 INFO L93 Difference]: Finished difference Result 111 states and 122 transitions. [2021-12-16 05:55:04,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 05:55:04,963 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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-16 05:55:04,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:55:04,964 INFO L225 Difference]: With dead ends: 111 [2021-12-16 05:55:04,964 INFO L226 Difference]: Without dead ends: 111 [2021-12-16 05:55:04,964 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-16 05:55:04,965 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 106 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:55:04,965 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 48 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:55:04,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-12-16 05:55:04,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 73. [2021-12-16 05:55:04,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 46 states have (on average 1.6956521739130435) internal successors, (78), 72 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:55:04,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2021-12-16 05:55:04,969 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 13 [2021-12-16 05:55:04,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:55:04,969 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2021-12-16 05:55:04,969 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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-16 05:55:04,969 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2021-12-16 05:55:04,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-16 05:55:04,969 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:55:04,969 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:55:04,993 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2021-12-16 05:55:05,193 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-16 05:55:05,194 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 39 more)] === [2021-12-16 05:55:05,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:55:05,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1223687433, now seen corresponding path program 1 times [2021-12-16 05:55:05,195 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 05:55:05,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [945054506] [2021-12-16 05:55:05,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:55:05,195 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 05:55:05,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 05:55:05,196 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-16 05:55:05,198 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-16 05:55:05,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:55:05,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-16 05:55:05,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:55:05,335 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-16 05:55:05,335 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 05:55:05,336 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 05:55:05,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [945054506] [2021-12-16 05:55:05,336 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [945054506] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:55:05,336 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:55:05,336 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 05:55:05,336 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143341627] [2021-12-16 05:55:05,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:55:05,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 05:55:05,337 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 05:55:05,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 05:55:05,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 05:55:05,338 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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-16 05:55:05,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:55:05,349 INFO L93 Difference]: Finished difference Result 104 states and 110 transitions. [2021-12-16 05:55:05,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 05:55:05,351 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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-16 05:55:05,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:55:05,351 INFO L225 Difference]: With dead ends: 104 [2021-12-16 05:55:05,352 INFO L226 Difference]: Without dead ends: 104 [2021-12-16 05:55:05,352 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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-16 05:55:05,352 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 22 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 05:55:05,353 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 145 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 05:55:05,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-12-16 05:55:05,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 94. [2021-12-16 05:55:05,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 67 states have (on average 1.6417910447761195) internal successors, (110), 93 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:55:05,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 110 transitions. [2021-12-16 05:55:05,356 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 110 transitions. Word has length 14 [2021-12-16 05:55:05,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:55:05,357 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 110 transitions. [2021-12-16 05:55:05,357 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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-16 05:55:05,357 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 110 transitions. [2021-12-16 05:55:05,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-16 05:55:05,357 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:55:05,357 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:55:05,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-12-16 05:55:05,564 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-16 05:55:05,564 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 39 more)] === [2021-12-16 05:55:05,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:55:05,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1223656742, now seen corresponding path program 1 times [2021-12-16 05:55:05,565 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 05:55:05,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [692217689] [2021-12-16 05:55:05,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:55:05,566 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 05:55:05,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 05:55:05,570 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-16 05:55:05,571 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-16 05:55:05,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:55:05,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-16 05:55:05,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:55:05,673 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 05:55:05,681 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-16 05:55:05,681 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 05:55:05,681 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 05:55:05,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [692217689] [2021-12-16 05:55:05,682 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [692217689] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:55:05,682 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:55:05,682 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 05:55:05,682 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524854543] [2021-12-16 05:55:05,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:55:05,682 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 05:55:05,683 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 05:55:05,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 05:55:05,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 05:55:05,684 INFO L87 Difference]: Start difference. First operand 94 states and 110 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 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-16 05:55:05,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:55:05,793 INFO L93 Difference]: Finished difference Result 90 states and 102 transitions. [2021-12-16 05:55:05,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 05:55:05,794 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 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-16 05:55:05,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:55:05,795 INFO L225 Difference]: With dead ends: 90 [2021-12-16 05:55:05,795 INFO L226 Difference]: Without dead ends: 90 [2021-12-16 05:55:05,795 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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-16 05:55:05,796 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 14 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:55:05,796 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 90 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:55:05,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2021-12-16 05:55:05,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2021-12-16 05:55:05,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 67 states have (on average 1.5223880597014925) internal successors, (102), 89 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:55:05,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 102 transitions. [2021-12-16 05:55:05,799 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 102 transitions. Word has length 14 [2021-12-16 05:55:05,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:55:05,800 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 102 transitions. [2021-12-16 05:55:05,800 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 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-16 05:55:05,800 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 102 transitions. [2021-12-16 05:55:05,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-16 05:55:05,800 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:55:05,801 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:55:05,821 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-16 05:55:06,008 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-16 05:55:06,008 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 39 more)] === [2021-12-16 05:55:06,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:55:06,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1223656741, now seen corresponding path program 1 times [2021-12-16 05:55:06,009 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 05:55:06,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [680704366] [2021-12-16 05:55:06,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:55:06,009 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 05:55:06,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 05:55:06,011 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-16 05:55:06,013 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-16 05:55:06,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:55:06,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-16 05:55:06,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:55:06,109 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 05:55:06,127 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-16 05:55:06,128 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 05:55:06,128 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 05:55:06,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [680704366] [2021-12-16 05:55:06,128 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [680704366] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:55:06,128 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:55:06,128 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 05:55:06,129 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571816609] [2021-12-16 05:55:06,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:55:06,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 05:55:06,129 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 05:55:06,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 05:55:06,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 05:55:06,130 INFO L87 Difference]: Start difference. First operand 90 states and 102 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 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-16 05:55:06,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:55:06,253 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2021-12-16 05:55:06,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 05:55:06,254 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 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-16 05:55:06,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:55:06,255 INFO L225 Difference]: With dead ends: 86 [2021-12-16 05:55:06,255 INFO L226 Difference]: Without dead ends: 86 [2021-12-16 05:55:06,255 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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-16 05:55:06,256 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 10 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:55:06,256 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 95 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:55:06,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-12-16 05:55:06,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2021-12-16 05:55:06,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 67 states have (on average 1.4029850746268657) internal successors, (94), 85 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:55:06,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2021-12-16 05:55:06,260 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 14 [2021-12-16 05:55:06,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:55:06,260 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2021-12-16 05:55:06,260 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 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-16 05:55:06,261 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2021-12-16 05:55:06,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-16 05:55:06,261 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:55:06,261 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:55:06,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2021-12-16 05:55:06,470 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-16 05:55:06,470 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 39 more)] === [2021-12-16 05:55:06,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:55:06,471 INFO L85 PathProgramCache]: Analyzing trace with hash 857288497, now seen corresponding path program 1 times [2021-12-16 05:55:06,471 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 05:55:06,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [756650043] [2021-12-16 05:55:06,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:55:06,472 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 05:55:06,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 05:55:06,473 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-16 05:55:06,475 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-16 05:55:06,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:55:06,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-16 05:55:06,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:55:06,554 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 05:55:06,587 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-16 05:55:06,587 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 05:55:06,587 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 05:55:06,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [756650043] [2021-12-16 05:55:06,588 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [756650043] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:55:06,594 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:55:06,594 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 05:55:06,594 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784910617] [2021-12-16 05:55:06,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:55:06,594 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 05:55:06,594 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 05:55:06,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 05:55:06,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 05:55:06,595 INFO L87 Difference]: Start difference. First operand 86 states and 94 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 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-16 05:55:06,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:55:06,818 INFO L93 Difference]: Finished difference Result 120 states and 128 transitions. [2021-12-16 05:55:06,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 05:55:06,819 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 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-16 05:55:06,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:55:06,819 INFO L225 Difference]: With dead ends: 120 [2021-12-16 05:55:06,819 INFO L226 Difference]: Without dead ends: 120 [2021-12-16 05:55:06,820 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 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-16 05:55:06,820 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 86 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 05:55:06,820 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 91 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 05:55:06,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-12-16 05:55:06,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 88. [2021-12-16 05:55:06,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 69 states have (on average 1.4202898550724639) internal successors, (98), 87 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:55:06,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 98 transitions. [2021-12-16 05:55:06,823 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 98 transitions. Word has length 16 [2021-12-16 05:55:06,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:55:06,823 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 98 transitions. [2021-12-16 05:55:06,823 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 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-16 05:55:06,823 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 98 transitions. [2021-12-16 05:55:06,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-16 05:55:06,823 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:55:06,823 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:55:06,832 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-16 05:55:07,030 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-16 05:55:07,030 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 39 more)] === [2021-12-16 05:55:07,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:55:07,031 INFO L85 PathProgramCache]: Analyzing trace with hash 857288498, now seen corresponding path program 1 times [2021-12-16 05:55:07,031 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 05:55:07,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [816767742] [2021-12-16 05:55:07,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:55:07,031 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 05:55:07,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 05:55:07,032 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-16 05:55:07,063 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-16 05:55:07,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:55:07,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-16 05:55:07,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:55:07,103 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 05:55:07,176 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-16 05:55:07,176 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 05:55:07,176 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 05:55:07,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [816767742] [2021-12-16 05:55:07,177 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [816767742] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:55:07,177 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:55:07,177 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 05:55:07,177 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613270878] [2021-12-16 05:55:07,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:55:07,177 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 05:55:07,177 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 05:55:07,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 05:55:07,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 05:55:07,178 INFO L87 Difference]: Start difference. First operand 88 states and 98 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 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-16 05:55:07,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:55:07,388 INFO L93 Difference]: Finished difference Result 157 states and 178 transitions. [2021-12-16 05:55:07,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 05:55:07,389 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 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-16 05:55:07,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:55:07,389 INFO L225 Difference]: With dead ends: 157 [2021-12-16 05:55:07,389 INFO L226 Difference]: Without dead ends: 157 [2021-12-16 05:55:07,389 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 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-16 05:55:07,390 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 75 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 05:55:07,390 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 124 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 05:55:07,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-12-16 05:55:07,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 110. [2021-12-16 05:55:07,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 109 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:55:07,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 129 transitions. [2021-12-16 05:55:07,393 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 129 transitions. Word has length 16 [2021-12-16 05:55:07,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:55:07,393 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 129 transitions. [2021-12-16 05:55:07,393 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 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-16 05:55:07,393 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 129 transitions. [2021-12-16 05:55:07,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-16 05:55:07,393 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:55:07,394 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:55:07,429 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-16 05:55:07,599 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-16 05:55:07,599 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 39 more)] === [2021-12-16 05:55:07,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:55:07,600 INFO L85 PathProgramCache]: Analyzing trace with hash 806139317, now seen corresponding path program 1 times [2021-12-16 05:55:07,600 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 05:55:07,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [991900503] [2021-12-16 05:55:07,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:55:07,600 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 05:55:07,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 05:55:07,601 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-16 05:55:07,601 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-16 05:55:07,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:55:07,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-16 05:55:07,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:55:07,694 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-16 05:55:07,694 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 05:55:07,737 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-16 05:55:07,737 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 05:55:07,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [991900503] [2021-12-16 05:55:07,737 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [991900503] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 05:55:07,737 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 05:55:07,738 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-12-16 05:55:07,738 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146833281] [2021-12-16 05:55:07,738 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 05:55:07,738 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 05:55:07,738 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 05:55:07,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 05:55:07,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-16 05:55:07,739 INFO L87 Difference]: Start difference. First operand 110 states and 129 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 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-16 05:55:07,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:55:07,797 INFO L93 Difference]: Finished difference Result 146 states and 165 transitions. [2021-12-16 05:55:07,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 05:55:07,798 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 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 17 [2021-12-16 05:55:07,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:55:07,798 INFO L225 Difference]: With dead ends: 146 [2021-12-16 05:55:07,798 INFO L226 Difference]: Without dead ends: 146 [2021-12-16 05:55:07,798 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 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-16 05:55:07,799 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 202 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 05:55:07,799 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [202 Valid, 185 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 05:55:07,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-12-16 05:55:07,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 131. [2021-12-16 05:55:07,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 112 states have (on average 1.4732142857142858) internal successors, (165), 130 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:55:07,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 165 transitions. [2021-12-16 05:55:07,801 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 165 transitions. Word has length 17 [2021-12-16 05:55:07,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:55:07,802 INFO L470 AbstractCegarLoop]: Abstraction has 131 states and 165 transitions. [2021-12-16 05:55:07,802 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 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-16 05:55:07,802 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 165 transitions. [2021-12-16 05:55:07,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-16 05:55:07,802 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:55:07,802 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:55:07,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-12-16 05:55:08,011 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-16 05:55:08,011 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 39 more)] === [2021-12-16 05:55:08,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:55:08,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1724432386, now seen corresponding path program 1 times [2021-12-16 05:55:08,012 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 05:55:08,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [291856260] [2021-12-16 05:55:08,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:55:08,012 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 05:55:08,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 05:55:08,013 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-16 05:55:08,019 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-16 05:55:08,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:55:08,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-16 05:55:08,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:55:08,124 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-16 05:55:08,142 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-16 05:55:08,142 INFO L388 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-16 05:55:08,164 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-16 05:55:08,164 INFO L388 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-16 05:55:08,221 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-16 05:55:08,222 INFO L388 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 18 [2021-12-16 05:55:08,262 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-16 05:55:08,263 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 17 [2021-12-16 05:55:08,271 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-16 05:55:08,271 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 05:55:08,271 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 05:55:08,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [291856260] [2021-12-16 05:55:08,271 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [291856260] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:55:08,271 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:55:08,271 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-16 05:55:08,271 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531244760] [2021-12-16 05:55:08,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:55:08,271 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 05:55:08,271 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 05:55:08,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 05:55:08,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 05:55:08,272 INFO L87 Difference]: Start difference. First operand 131 states and 165 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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-16 05:55:08,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:55:08,459 INFO L93 Difference]: Finished difference Result 200 states and 253 transitions. [2021-12-16 05:55:08,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 05:55:08,460 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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-16 05:55:08,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:55:08,468 INFO L225 Difference]: With dead ends: 200 [2021-12-16 05:55:08,468 INFO L226 Difference]: Without dead ends: 200 [2021-12-16 05:55:08,468 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-16 05:55:08,468 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 46 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 05:55:08,469 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 199 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 76 Unchecked, 0.2s Time] [2021-12-16 05:55:08,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2021-12-16 05:55:08,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 143. [2021-12-16 05:55:08,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 124 states have (on average 1.4435483870967742) internal successors, (179), 142 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:55:08,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 179 transitions. [2021-12-16 05:55:08,471 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 179 transitions. Word has length 17 [2021-12-16 05:55:08,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:55:08,471 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 179 transitions. [2021-12-16 05:55:08,471 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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-16 05:55:08,472 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 179 transitions. [2021-12-16 05:55:08,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-16 05:55:08,472 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:55:08,472 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:55:08,480 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-16 05:55:08,672 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-16 05:55:08,672 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 39 more)] === [2021-12-16 05:55:08,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:55:08,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1724432387, now seen corresponding path program 1 times [2021-12-16 05:55:08,673 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 05:55:08,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2133035032] [2021-12-16 05:55:08,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:55:08,673 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 05:55:08,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 05:55:08,674 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-16 05:55:08,712 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-16 05:55:08,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:55:08,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 32 conjunts are in the unsatisfiable core [2021-12-16 05:55:08,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:55:08,824 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 05:55:08,829 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 05:55:08,870 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-16 05:55:08,874 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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-16 05:55:08,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:55:08,913 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-16 05:55:08,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:55:08,919 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-16 05:55:08,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:55:08,946 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-16 05:55:08,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:55:08,954 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-16 05:55:08,992 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-16 05:55:08,992 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2021-12-16 05:55:09,004 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-16 05:55:09,005 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2021-12-16 05:55:09,103 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2021-12-16 05:55:09,107 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2021-12-16 05:55:09,158 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-16 05:55:09,158 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 26 [2021-12-16 05:55:09,164 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-12-16 05:55:09,179 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-16 05:55:09,180 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 05:55:09,180 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 05:55:09,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2133035032] [2021-12-16 05:55:09,180 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2133035032] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:55:09,180 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:55:09,180 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 05:55:09,180 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357171074] [2021-12-16 05:55:09,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:55:09,180 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 05:55:09,180 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 05:55:09,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 05:55:09,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-16 05:55:09,181 INFO L87 Difference]: Start difference. First operand 143 states and 179 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 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-16 05:55:09,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:55:09,549 INFO L93 Difference]: Finished difference Result 194 states and 245 transitions. [2021-12-16 05:55:09,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-16 05:55:09,550 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 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-16 05:55:09,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:55:09,550 INFO L225 Difference]: With dead ends: 194 [2021-12-16 05:55:09,551 INFO L226 Difference]: Without dead ends: 194 [2021-12-16 05:55:09,551 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-12-16 05:55:09,551 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 82 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 45 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 05:55:09,551 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 170 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 201 Invalid, 0 Unknown, 45 Unchecked, 0.3s Time] [2021-12-16 05:55:09,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-12-16 05:55:09,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 143. [2021-12-16 05:55:09,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 124 states have (on average 1.4274193548387097) internal successors, (177), 142 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:55:09,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 177 transitions. [2021-12-16 05:55:09,554 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 177 transitions. Word has length 17 [2021-12-16 05:55:09,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:55:09,554 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 177 transitions. [2021-12-16 05:55:09,554 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 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-16 05:55:09,554 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 177 transitions. [2021-12-16 05:55:09,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-16 05:55:09,554 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:55:09,554 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-16 05:55:09,565 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-16 05:55:09,755 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-16 05:55:09,755 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 39 more)] === [2021-12-16 05:55:09,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:55:09,755 INFO L85 PathProgramCache]: Analyzing trace with hash -779472846, now seen corresponding path program 1 times [2021-12-16 05:55:09,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 05:55:09,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1037628364] [2021-12-16 05:55:09,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:55:09,756 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 05:55:09,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 05:55:09,769 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-16 05:55:09,772 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-16 05:55:09,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:55:09,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-16 05:55:09,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:55:09,854 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 05:55:09,886 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-16 05:55:09,886 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 05:55:09,886 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 05:55:09,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1037628364] [2021-12-16 05:55:09,886 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1037628364] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:55:09,886 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:55:09,886 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 05:55:09,886 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530111594] [2021-12-16 05:55:09,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:55:09,887 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 05:55:09,887 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 05:55:09,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 05:55:09,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 05:55:09,887 INFO L87 Difference]: Start difference. First operand 143 states and 177 transitions. Second operand has 5 states, 4 states have (on average 4.5) 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-16 05:55:10,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:55:10,242 INFO L93 Difference]: Finished difference Result 201 states and 246 transitions. [2021-12-16 05:55:10,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-16 05:55:10,243 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) 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-16 05:55:10,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:55:10,243 INFO L225 Difference]: With dead ends: 201 [2021-12-16 05:55:10,243 INFO L226 Difference]: Without dead ends: 201 [2021-12-16 05:55:10,244 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-16 05:55:10,244 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 124 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 05:55:10,244 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 128 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 05:55:10,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2021-12-16 05:55:10,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 161. [2021-12-16 05:55:10,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 142 states have (on average 1.4859154929577465) internal successors, (211), 160 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:55:10,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 211 transitions. [2021-12-16 05:55:10,247 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 211 transitions. Word has length 18 [2021-12-16 05:55:10,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:55:10,247 INFO L470 AbstractCegarLoop]: Abstraction has 161 states and 211 transitions. [2021-12-16 05:55:10,247 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) 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-16 05:55:10,247 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 211 transitions. [2021-12-16 05:55:10,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-16 05:55:10,247 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:55:10,247 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-16 05:55:10,269 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-16 05:55:10,454 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-16 05:55:10,454 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 39 more)] === [2021-12-16 05:55:10,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:55:10,455 INFO L85 PathProgramCache]: Analyzing trace with hash -779472845, now seen corresponding path program 1 times [2021-12-16 05:55:10,455 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 05:55:10,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1306395874] [2021-12-16 05:55:10,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:55:10,455 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 05:55:10,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 05:55:10,457 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-16 05:55:10,458 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-16 05:55:10,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:55:10,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-16 05:55:10,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:55:10,547 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 05:55:10,603 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-16 05:55:10,603 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 05:55:10,603 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 05:55:10,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1306395874] [2021-12-16 05:55:10,603 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1306395874] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:55:10,603 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:55:10,603 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 05:55:10,603 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409748129] [2021-12-16 05:55:10,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:55:10,603 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 05:55:10,603 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 05:55:10,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 05:55:10,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 05:55:10,604 INFO L87 Difference]: Start difference. First operand 161 states and 211 transitions. Second operand has 5 states, 4 states have (on average 4.5) 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-16 05:55:10,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:55:10,943 INFO L93 Difference]: Finished difference Result 272 states and 360 transitions. [2021-12-16 05:55:10,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 05:55:10,943 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) 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-16 05:55:10,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:55:10,944 INFO L225 Difference]: With dead ends: 272 [2021-12-16 05:55:10,944 INFO L226 Difference]: Without dead ends: 272 [2021-12-16 05:55:10,944 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-16 05:55:10,945 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 125 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 05:55:10,945 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 161 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 05:55:10,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2021-12-16 05:55:10,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 197. [2021-12-16 05:55:10,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 178 states have (on average 1.5561797752808988) internal successors, (277), 196 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:55:10,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 277 transitions. [2021-12-16 05:55:10,948 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 277 transitions. Word has length 18 [2021-12-16 05:55:10,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:55:10,948 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 277 transitions. [2021-12-16 05:55:10,948 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) 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-16 05:55:10,948 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 277 transitions. [2021-12-16 05:55:10,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-16 05:55:10,949 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:55:10,949 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-16 05:55:10,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Ended with exit code 0 [2021-12-16 05:55:11,149 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-16 05:55:11,149 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 39 more)] === [2021-12-16 05:55:11,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:55:11,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1612692029, now seen corresponding path program 1 times [2021-12-16 05:55:11,150 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 05:55:11,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [578124317] [2021-12-16 05:55:11,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:55:11,150 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 05:55:11,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 05:55:11,152 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-16 05:55:11,152 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-16 05:55:11,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:55:11,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-16 05:55:11,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:55:11,282 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 05:55:11,295 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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-16 05:55:11,316 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-16 05:55:11,317 INFO L388 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-16 05:55:11,334 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-16 05:55:11,335 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-16 05:55:11,386 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-16 05:55:11,403 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-16 05:55:11,403 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 05:55:11,403 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 05:55:11,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [578124317] [2021-12-16 05:55:11,404 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [578124317] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:55:11,404 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:55:11,404 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 05:55:11,404 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739291528] [2021-12-16 05:55:11,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:55:11,404 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 05:55:11,404 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 05:55:11,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 05:55:11,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-16 05:55:11,405 INFO L87 Difference]: Start difference. First operand 197 states and 277 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 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-16 05:55:12,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:55:12,001 INFO L93 Difference]: Finished difference Result 296 states and 395 transitions. [2021-12-16 05:55:12,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-16 05:55:12,001 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 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-16 05:55:12,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:55:12,002 INFO L225 Difference]: With dead ends: 296 [2021-12-16 05:55:12,002 INFO L226 Difference]: Without dead ends: 296 [2021-12-16 05:55:12,003 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2021-12-16 05:55:12,003 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 150 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-16 05:55:12,003 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 238 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-16 05:55:12,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2021-12-16 05:55:12,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 207. [2021-12-16 05:55:12,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 188 states have (on average 1.553191489361702) internal successors, (292), 206 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:55:12,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 292 transitions. [2021-12-16 05:55:12,007 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 292 transitions. Word has length 21 [2021-12-16 05:55:12,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:55:12,007 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 292 transitions. [2021-12-16 05:55:12,007 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 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-16 05:55:12,007 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 292 transitions. [2021-12-16 05:55:12,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-16 05:55:12,009 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:55:12,009 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-16 05:55:12,018 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-16 05:55:12,215 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-16 05:55:12,215 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 39 more)] === [2021-12-16 05:55:12,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:55:12,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1612692030, now seen corresponding path program 1 times [2021-12-16 05:55:12,217 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 05:55:12,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1207770721] [2021-12-16 05:55:12,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:55:12,217 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 05:55:12,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 05:55:12,218 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-16 05:55:12,219 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-16 05:55:12,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:55:12,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-16 05:55:12,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:55:12,330 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-16 05:55:12,336 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-16 05:55:12,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:55:12,351 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-16 05:55:12,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:55:12,358 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-16 05:55:12,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:55:12,369 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-16 05:55:12,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:55:12,374 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-16 05:55:12,461 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 05:55:12,462 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2021-12-16 05:55:12,466 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 05:55:12,466 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2021-12-16 05:55:12,507 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-16 05:55:12,508 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 05:55:12,508 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 05:55:12,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1207770721] [2021-12-16 05:55:12,508 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1207770721] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:55:12,508 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:55:12,508 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-16 05:55:12,508 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806738853] [2021-12-16 05:55:12,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:55:12,509 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 05:55:12,509 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 05:55:12,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 05:55:12,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-16 05:55:12,509 INFO L87 Difference]: Start difference. First operand 207 states and 292 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 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-16 05:55:13,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:55:13,089 INFO L93 Difference]: Finished difference Result 269 states and 351 transitions. [2021-12-16 05:55:13,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-16 05:55:13,089 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 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-16 05:55:13,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:55:13,090 INFO L225 Difference]: With dead ends: 269 [2021-12-16 05:55:13,090 INFO L226 Difference]: Without dead ends: 269 [2021-12-16 05:55:13,091 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2021-12-16 05:55:13,091 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 153 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-16 05:55:13,091 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 356 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-16 05:55:13,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2021-12-16 05:55:13,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 191. [2021-12-16 05:55:13,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 172 states have (on average 1.494186046511628) internal successors, (257), 190 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:55:13,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 257 transitions. [2021-12-16 05:55:13,094 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 257 transitions. Word has length 21 [2021-12-16 05:55:13,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:55:13,094 INFO L470 AbstractCegarLoop]: Abstraction has 191 states and 257 transitions. [2021-12-16 05:55:13,094 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 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-16 05:55:13,094 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 257 transitions. [2021-12-16 05:55:13,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-16 05:55:13,095 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:55:13,095 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] [2021-12-16 05:55:13,112 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-16 05:55:13,295 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-16 05:55:13,295 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 39 more)] === [2021-12-16 05:55:13,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:55:13,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1546155751, now seen corresponding path program 1 times [2021-12-16 05:55:13,296 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 05:55:13,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1993483714] [2021-12-16 05:55:13,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:55:13,296 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 05:55:13,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 05:55:13,298 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-16 05:55:13,300 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-16 05:55:13,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:55:13,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-16 05:55:13,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:55:13,503 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-16 05:55:13,503 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 05:55:13,503 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 05:55:13,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1993483714] [2021-12-16 05:55:13,503 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1993483714] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:55:13,503 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:55:13,504 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 05:55:13,504 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471829192] [2021-12-16 05:55:13,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:55:13,504 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 05:55:13,504 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 05:55:13,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 05:55:13,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-16 05:55:13,504 INFO L87 Difference]: Start difference. First operand 191 states and 257 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:55:13,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:55:13,852 INFO L93 Difference]: Finished difference Result 221 states and 286 transitions. [2021-12-16 05:55:13,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 05:55:13,852 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-12-16 05:55:13,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:55:13,853 INFO L225 Difference]: With dead ends: 221 [2021-12-16 05:55:13,853 INFO L226 Difference]: Without dead ends: 221 [2021-12-16 05:55:13,853 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2021-12-16 05:55:13,854 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 157 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 05:55:13,854 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 139 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 05:55:13,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2021-12-16 05:55:13,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 200. [2021-12-16 05:55:13,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 181 states have (on average 1.5303867403314917) internal successors, (277), 199 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:55:13,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 277 transitions. [2021-12-16 05:55:13,857 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 277 transitions. Word has length 22 [2021-12-16 05:55:13,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:55:13,857 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 277 transitions. [2021-12-16 05:55:13,857 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:55:13,857 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 277 transitions. [2021-12-16 05:55:13,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-16 05:55:13,857 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:55:13,857 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2021-12-16 05:55:13,881 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-16 05:55:14,058 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-16 05:55:14,058 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 39 more)] === [2021-12-16 05:55:14,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:55:14,058 INFO L85 PathProgramCache]: Analyzing trace with hash 858860942, now seen corresponding path program 1 times [2021-12-16 05:55:14,058 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 05:55:14,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1518397895] [2021-12-16 05:55:14,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:55:14,059 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 05:55:14,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 05:55:14,060 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-16 05:55:14,082 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-16 05:55:14,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:55:14,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-16 05:55:14,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:55:14,217 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 05:55:14,261 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-16 05:55:14,262 INFO L388 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 20 treesize of output 27 [2021-12-16 05:55:14,288 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:55:14,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 05:55:14,347 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:55:14,348 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 05:55:14,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1518397895] [2021-12-16 05:55:14,348 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1518397895] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 05:55:14,348 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 05:55:14,348 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2021-12-16 05:55:14,348 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034358650] [2021-12-16 05:55:14,348 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 05:55:14,348 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 05:55:14,348 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 05:55:14,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 05:55:14,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 05:55:14,349 INFO L87 Difference]: Start difference. First operand 200 states and 277 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 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-16 05:55:14,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:55:14,567 INFO L93 Difference]: Finished difference Result 221 states and 294 transitions. [2021-12-16 05:55:14,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 05:55:14,567 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 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-16 05:55:14,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:55:14,568 INFO L225 Difference]: With dead ends: 221 [2021-12-16 05:55:14,568 INFO L226 Difference]: Without dead ends: 221 [2021-12-16 05:55:14,568 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-16 05:55:14,569 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 88 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 05:55:14,573 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 99 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 05:55:14,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2021-12-16 05:55:14,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 199. [2021-12-16 05:55:14,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 181 states have (on average 1.5193370165745856) internal successors, (275), 198 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:55:14,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 275 transitions. [2021-12-16 05:55:14,576 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 275 transitions. Word has length 25 [2021-12-16 05:55:14,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:55:14,577 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 275 transitions. [2021-12-16 05:55:14,577 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 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-16 05:55:14,577 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 275 transitions. [2021-12-16 05:55:14,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-16 05:55:14,577 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:55:14,577 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2021-12-16 05:55:14,585 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-16 05:55:14,777 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-16 05:55:14,778 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 39 more)] === [2021-12-16 05:55:14,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:55:14,778 INFO L85 PathProgramCache]: Analyzing trace with hash 858860943, now seen corresponding path program 1 times [2021-12-16 05:55:14,778 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 05:55:14,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1757590937] [2021-12-16 05:55:14,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:55:14,778 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 05:55:14,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 05:55:14,780 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-16 05:55:14,782 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-16 05:55:14,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:55:14,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-16 05:55:14,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:55:14,922 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 05:55:14,925 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 05:55:15,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:55:15,011 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-16 05:55:15,017 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-16 05:55:15,017 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2021-12-16 05:55:15,064 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:55:15,064 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 05:55:15,502 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:55:15,502 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 05:55:15,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1757590937] [2021-12-16 05:55:15,502 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1757590937] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 05:55:15,502 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 05:55:15,503 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2021-12-16 05:55:15,503 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87315805] [2021-12-16 05:55:15,503 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 05:55:15,503 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 05:55:15,503 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 05:55:15,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 05:55:15,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-12-16 05:55:15,504 INFO L87 Difference]: Start difference. First operand 199 states and 275 transitions. Second operand has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:55:15,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:55:15,796 INFO L93 Difference]: Finished difference Result 285 states and 391 transitions. [2021-12-16 05:55:15,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-16 05:55:15,797 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-12-16 05:55:15,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:55:15,798 INFO L225 Difference]: With dead ends: 285 [2021-12-16 05:55:15,798 INFO L226 Difference]: Without dead ends: 285 [2021-12-16 05:55:15,798 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-12-16 05:55:15,798 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 147 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 122 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 05:55:15,799 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 197 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 67 Invalid, 0 Unknown, 122 Unchecked, 0.2s Time] [2021-12-16 05:55:15,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2021-12-16 05:55:15,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 216. [2021-12-16 05:55:15,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 198 states have (on average 1.4848484848484849) internal successors, (294), 215 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:55:15,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 294 transitions. [2021-12-16 05:55:15,812 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 294 transitions. Word has length 25 [2021-12-16 05:55:15,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:55:15,812 INFO L470 AbstractCegarLoop]: Abstraction has 216 states and 294 transitions. [2021-12-16 05:55:15,812 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:55:15,813 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 294 transitions. [2021-12-16 05:55:15,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-16 05:55:15,813 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:55:15,813 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-16 05:55:15,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2021-12-16 05:55:16,013 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-16 05:55:16,014 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 39 more)] === [2021-12-16 05:55:16,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:55:16,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1822218349, now seen corresponding path program 1 times [2021-12-16 05:55:16,014 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 05:55:16,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [446619209] [2021-12-16 05:55:16,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:55:16,014 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 05:55:16,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 05:55:16,036 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-16 05:55:16,039 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-16 05:55:16,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:55:16,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-16 05:55:16,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:55:16,308 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-16 05:55:16,309 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 05:55:16,493 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-16 05:55:16,493 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 05:55:16,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [446619209] [2021-12-16 05:55:16,494 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [446619209] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 05:55:16,494 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 05:55:16,494 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2021-12-16 05:55:16,494 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844266409] [2021-12-16 05:55:16,494 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 05:55:16,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-16 05:55:16,494 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 05:55:16,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-16 05:55:16,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-12-16 05:55:16,495 INFO L87 Difference]: Start difference. First operand 216 states and 294 transitions. Second operand has 11 states, 10 states have (on average 5.1) internal successors, (51), 11 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:55:16,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:55:16,562 INFO L93 Difference]: Finished difference Result 221 states and 298 transitions. [2021-12-16 05:55:16,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 05:55:16,563 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.1) internal successors, (51), 11 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-16 05:55:16,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:55:16,563 INFO L225 Difference]: With dead ends: 221 [2021-12-16 05:55:16,564 INFO L226 Difference]: Without dead ends: 209 [2021-12-16 05:55:16,564 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-12-16 05:55:16,564 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 2 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 118 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:55:16,564 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 201 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 118 Unchecked, 0.1s Time] [2021-12-16 05:55:16,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-12-16 05:55:16,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2021-12-16 05:55:16,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 191 states have (on average 1.4973821989528795) internal successors, (286), 208 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:55:16,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 286 transitions. [2021-12-16 05:55:16,567 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 286 transitions. Word has length 26 [2021-12-16 05:55:16,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:55:16,567 INFO L470 AbstractCegarLoop]: Abstraction has 209 states and 286 transitions. [2021-12-16 05:55:16,567 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.1) internal successors, (51), 11 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:55:16,567 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 286 transitions. [2021-12-16 05:55:16,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-16 05:55:16,567 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:55:16,568 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-16 05:55:16,587 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-16 05:55:16,768 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-16 05:55:16,768 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 39 more)] === [2021-12-16 05:55:16,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:55:16,769 INFO L85 PathProgramCache]: Analyzing trace with hash -535670236, now seen corresponding path program 1 times [2021-12-16 05:55:16,769 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 05:55:16,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [746392519] [2021-12-16 05:55:16,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:55:16,769 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 05:55:16,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 05:55:16,770 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-16 05:55:16,806 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-16 05:55:16,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:55:16,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-16 05:55:16,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:55:16,938 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 05:55:16,942 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 05:55:17,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:55:17,001 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-16 05:55:17,008 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-16 05:55:17,008 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2021-12-16 05:55:17,087 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:55:17,087 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 05:55:19,559 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:55:19,559 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 05:55:19,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [746392519] [2021-12-16 05:55:19,560 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [746392519] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 05:55:19,560 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 05:55:19,560 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2021-12-16 05:55:19,560 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924361702] [2021-12-16 05:55:19,560 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 05:55:19,560 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 05:55:19,560 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 05:55:19,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 05:55:19,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=37, Unknown=1, NotChecked=0, Total=56 [2021-12-16 05:55:19,561 INFO L87 Difference]: Start difference. First operand 209 states and 286 transitions. Second operand has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:55:20,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:55:20,157 INFO L93 Difference]: Finished difference Result 366 states and 493 transitions. [2021-12-16 05:55:20,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-16 05:55:20,158 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 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-16 05:55:20,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:55:20,159 INFO L225 Difference]: With dead ends: 366 [2021-12-16 05:55:20,159 INFO L226 Difference]: Without dead ends: 366 [2021-12-16 05:55:20,159 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=49, Invalid=82, Unknown=1, NotChecked=0, Total=132 [2021-12-16 05:55:20,159 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 209 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-16 05:55:20,160 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [209 Valid, 213 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 209 Invalid, 0 Unknown, 51 Unchecked, 0.5s Time] [2021-12-16 05:55:20,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2021-12-16 05:55:20,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 247. [2021-12-16 05:55:20,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 229 states have (on average 1.4410480349344978) internal successors, (330), 246 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:55:20,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 330 transitions. [2021-12-16 05:55:20,163 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 330 transitions. Word has length 28 [2021-12-16 05:55:20,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:55:20,163 INFO L470 AbstractCegarLoop]: Abstraction has 247 states and 330 transitions. [2021-12-16 05:55:20,163 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:55:20,164 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 330 transitions. [2021-12-16 05:55:20,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-16 05:55:20,164 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:55:20,164 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:55:20,187 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Ended with exit code 0 [2021-12-16 05:55:20,372 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-16 05:55:20,372 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 39 more)] === [2021-12-16 05:55:20,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:55:20,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1492384592, now seen corresponding path program 1 times [2021-12-16 05:55:20,373 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 05:55:20,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [647438438] [2021-12-16 05:55:20,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:55:20,374 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 05:55:20,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 05:55:20,375 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-16 05:55:20,376 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-16 05:55:20,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:55:20,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-16 05:55:20,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:55:20,568 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 05:55:20,590 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-16 05:55:20,612 INFO L354 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2021-12-16 05:55:20,612 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 24 [2021-12-16 05:55:20,668 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-16 05:55:20,669 INFO L388 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 29 treesize of output 24 [2021-12-16 05:55:20,704 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-16 05:55:20,705 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 16 [2021-12-16 05:55:20,724 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:55:20,724 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 05:55:20,804 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:55:20,804 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 05:55:20,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [647438438] [2021-12-16 05:55:20,804 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [647438438] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 05:55:20,804 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 05:55:20,804 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2021-12-16 05:55:20,804 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818934356] [2021-12-16 05:55:20,804 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 05:55:20,805 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-16 05:55:20,805 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 05:55:20,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-16 05:55:20,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-12-16 05:55:20,805 INFO L87 Difference]: Start difference. First operand 247 states and 330 transitions. Second operand has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 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-16 05:55:21,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:55:21,125 INFO L93 Difference]: Finished difference Result 266 states and 347 transitions. [2021-12-16 05:55:21,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-16 05:55:21,126 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 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 29 [2021-12-16 05:55:21,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:55:21,127 INFO L225 Difference]: With dead ends: 266 [2021-12-16 05:55:21,127 INFO L226 Difference]: Without dead ends: 266 [2021-12-16 05:55:21,127 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-12-16 05:55:21,127 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 38 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 05:55:21,127 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 248 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 187 Invalid, 0 Unknown, 37 Unchecked, 0.3s Time] [2021-12-16 05:55:21,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2021-12-16 05:55:21,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 246. [2021-12-16 05:55:21,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 229 states have (on average 1.4323144104803494) internal successors, (328), 245 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:55:21,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 328 transitions. [2021-12-16 05:55:21,130 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 328 transitions. Word has length 29 [2021-12-16 05:55:21,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:55:21,131 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 328 transitions. [2021-12-16 05:55:21,131 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 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-16 05:55:21,131 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 328 transitions. [2021-12-16 05:55:21,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-16 05:55:21,131 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:55:21,131 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:55:21,155 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-16 05:55:21,331 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-16 05:55:21,332 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 39 more)] === [2021-12-16 05:55:21,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:55:21,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1492384593, now seen corresponding path program 1 times [2021-12-16 05:55:21,332 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 05:55:21,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1845184402] [2021-12-16 05:55:21,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:55:21,333 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 05:55:21,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 05:55:21,334 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-16 05:55:21,335 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-16 05:55:21,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:55:21,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 22 conjunts are in the unsatisfiable core [2021-12-16 05:55:21,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:55:21,534 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 05:55:21,579 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-16 05:55:21,585 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-16 05:55:21,611 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-12-16 05:55:21,611 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2021-12-16 05:55:21,691 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-16 05:55:21,691 INFO L388 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 25 treesize of output 20 [2021-12-16 05:55:21,710 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-16 05:55:21,710 INFO L388 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 18 [2021-12-16 05:55:21,766 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-16 05:55:21,766 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2021-12-16 05:55:21,771 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-16 05:55:21,771 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2021-12-16 05:55:21,794 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:55:21,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 05:55:22,321 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:55:22,322 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 05:55:22,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1845184402] [2021-12-16 05:55:22,322 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1845184402] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 05:55:22,322 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 05:55:22,322 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2021-12-16 05:55:22,322 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587590969] [2021-12-16 05:55:22,322 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 05:55:22,322 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-16 05:55:22,322 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 05:55:22,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-16 05:55:22,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-12-16 05:55:22,323 INFO L87 Difference]: Start difference. First operand 246 states and 328 transitions. Second operand has 14 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 14 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:55:23,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:55:23,048 INFO L93 Difference]: Finished difference Result 261 states and 329 transitions. [2021-12-16 05:55:23,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-16 05:55:23,049 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 14 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-16 05:55:23,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:55:23,050 INFO L225 Difference]: With dead ends: 261 [2021-12-16 05:55:23,050 INFO L226 Difference]: Without dead ends: 261 [2021-12-16 05:55:23,050 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2021-12-16 05:55:23,050 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 45 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 75 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-16 05:55:23,051 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 354 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 212 Invalid, 0 Unknown, 75 Unchecked, 0.6s Time] [2021-12-16 05:55:23,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2021-12-16 05:55:23,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 239. [2021-12-16 05:55:23,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 223 states have (on average 1.4349775784753362) internal successors, (320), 238 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-16 05:55:23,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 320 transitions. [2021-12-16 05:55:23,054 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 320 transitions. Word has length 29 [2021-12-16 05:55:23,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:55:23,054 INFO L470 AbstractCegarLoop]: Abstraction has 239 states and 320 transitions. [2021-12-16 05:55:23,054 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 14 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:55:23,054 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 320 transitions. [2021-12-16 05:55:23,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-16 05:55:23,054 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:55:23,054 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] [2021-12-16 05:55:23,081 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-16 05:55:23,264 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-16 05:55:23,264 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 39 more)] === [2021-12-16 05:55:23,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:55:23,265 INFO L85 PathProgramCache]: Analyzing trace with hash 616980133, now seen corresponding path program 1 times [2021-12-16 05:55:23,265 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 05:55:23,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [189492049] [2021-12-16 05:55:23,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:55:23,265 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 05:55:23,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 05:55:23,266 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-16 05:55:23,323 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-16 05:55:23,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:55:23,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-16 05:55:23,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:55:23,530 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-16 05:55:23,530 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 05:55:23,530 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 05:55:23,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [189492049] [2021-12-16 05:55:23,530 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [189492049] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:55:23,530 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:55:23,531 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-16 05:55:23,531 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503493143] [2021-12-16 05:55:23,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:55:23,531 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 05:55:23,531 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 05:55:23,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 05:55:23,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-16 05:55:23,532 INFO L87 Difference]: Start difference. First operand 239 states and 320 transitions. Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 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-16 05:55:23,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:55:23,887 INFO L93 Difference]: Finished difference Result 254 states and 321 transitions. [2021-12-16 05:55:23,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-16 05:55:23,887 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 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 30 [2021-12-16 05:55:23,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:55:23,888 INFO L225 Difference]: With dead ends: 254 [2021-12-16 05:55:23,888 INFO L226 Difference]: Without dead ends: 254 [2021-12-16 05:55:23,888 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-16 05:55:23,888 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 127 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 05:55:23,889 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 120 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 05:55:23,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2021-12-16 05:55:23,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 205. [2021-12-16 05:55:23,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 189 states have (on average 1.3915343915343916) internal successors, (263), 204 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-16 05:55:23,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 263 transitions. [2021-12-16 05:55:23,891 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 263 transitions. Word has length 30 [2021-12-16 05:55:23,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:55:23,892 INFO L470 AbstractCegarLoop]: Abstraction has 205 states and 263 transitions. [2021-12-16 05:55:23,892 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 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-16 05:55:23,892 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 263 transitions. [2021-12-16 05:55:23,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-16 05:55:23,892 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:55:23,892 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, 1] [2021-12-16 05:55:23,903 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-16 05:55:24,092 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-16 05:55:24,093 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 39 more)] === [2021-12-16 05:55:24,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:55:24,093 INFO L85 PathProgramCache]: Analyzing trace with hash -2004836725, now seen corresponding path program 1 times [2021-12-16 05:55:24,093 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 05:55:24,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [325466842] [2021-12-16 05:55:24,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:55:24,093 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 05:55:24,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 05:55:24,107 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-16 05:55:24,109 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-16 05:55:24,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:55:24,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-16 05:55:24,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:55:24,262 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-16 05:55:24,288 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-16 05:55:24,329 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2021-12-16 05:55:24,351 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-16 05:55:24,351 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 05:55:24,351 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 05:55:24,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [325466842] [2021-12-16 05:55:24,352 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [325466842] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:55:24,352 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:55:24,352 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 05:55:24,352 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217318509] [2021-12-16 05:55:24,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:55:24,352 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 05:55:24,352 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 05:55:24,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 05:55:24,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-16 05:55:24,353 INFO L87 Difference]: Start difference. First operand 205 states and 263 transitions. Second operand has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:55:24,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:55:24,895 INFO L93 Difference]: Finished difference Result 238 states and 287 transitions. [2021-12-16 05:55:24,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-16 05:55:24,896 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-12-16 05:55:24,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:55:24,897 INFO L225 Difference]: With dead ends: 238 [2021-12-16 05:55:24,897 INFO L226 Difference]: Without dead ends: 238 [2021-12-16 05:55:24,897 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2021-12-16 05:55:24,897 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 91 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-16 05:55:24,897 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 183 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-16 05:55:24,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2021-12-16 05:55:24,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 207. [2021-12-16 05:55:24,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 191 states have (on average 1.3979057591623036) internal successors, (267), 206 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:55:24,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 267 transitions. [2021-12-16 05:55:24,900 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 267 transitions. Word has length 33 [2021-12-16 05:55:24,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:55:24,900 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 267 transitions. [2021-12-16 05:55:24,901 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:55:24,901 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 267 transitions. [2021-12-16 05:55:24,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-16 05:55:24,901 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:55:24,901 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, 1] [2021-12-16 05:55:24,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2021-12-16 05:55:25,107 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-16 05:55:25,108 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 39 more)] === [2021-12-16 05:55:25,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:55:25,108 INFO L85 PathProgramCache]: Analyzing trace with hash -2004836724, now seen corresponding path program 1 times [2021-12-16 05:55:25,108 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 05:55:25,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1674011921] [2021-12-16 05:55:25,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:55:25,108 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 05:55:25,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 05:55:25,116 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-16 05:55:25,151 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-16 05:55:25,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:55:25,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-16 05:55:25,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:55:25,276 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 05:55:25,334 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-16 05:55:25,339 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-16 05:55:25,441 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-12-16 05:55:25,444 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-16 05:55:25,489 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-16 05:55:25,489 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 05:55:25,489 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 05:55:25,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1674011921] [2021-12-16 05:55:25,490 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1674011921] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:55:25,490 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:55:25,490 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 05:55:25,490 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279591810] [2021-12-16 05:55:25,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:55:25,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 05:55:25,490 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 05:55:25,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 05:55:25,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-16 05:55:25,491 INFO L87 Difference]: Start difference. First operand 207 states and 267 transitions. Second operand has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:55:26,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:55:26,380 INFO L93 Difference]: Finished difference Result 231 states and 278 transitions. [2021-12-16 05:55:26,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-16 05:55:26,380 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-12-16 05:55:26,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:55:26,381 INFO L225 Difference]: With dead ends: 231 [2021-12-16 05:55:26,381 INFO L226 Difference]: Without dead ends: 231 [2021-12-16 05:55:26,381 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2021-12-16 05:55:26,382 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 93 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-16 05:55:26,382 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 243 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-16 05:55:26,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2021-12-16 05:55:26,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 207. [2021-12-16 05:55:26,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 191 states have (on average 1.3926701570680629) internal successors, (266), 206 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-16 05:55:26,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 266 transitions. [2021-12-16 05:55:26,384 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 266 transitions. Word has length 33 [2021-12-16 05:55:26,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:55:26,385 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 266 transitions. [2021-12-16 05:55:26,385 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:55:26,385 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 266 transitions. [2021-12-16 05:55:26,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-16 05:55:26,385 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:55:26,385 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:55:26,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2021-12-16 05:55:26,585 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 05:55:26,586 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 39 more)] === [2021-12-16 05:55:26,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:55:26,586 INFO L85 PathProgramCache]: Analyzing trace with hash -161860525, now seen corresponding path program 1 times [2021-12-16 05:55:26,586 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 05:55:26,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1519016043] [2021-12-16 05:55:26,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:55:26,587 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 05:55:26,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 05:55:26,587 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 05:55:26,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2021-12-16 05:55:26,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:55:26,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 30 conjunts are in the unsatisfiable core [2021-12-16 05:55:26,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:55:26,802 INFO L354 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2021-12-16 05:55:26,802 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 21 [2021-12-16 05:55:26,846 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-16 05:55:26,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:55:26,874 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-16 05:55:26,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:55:26,890 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-16 05:55:26,992 INFO L354 Elim1Store]: treesize reduction 9, result has 64.0 percent of original size [2021-12-16 05:55:26,992 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 33 [2021-12-16 05:55:27,041 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-16 05:55:27,056 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-16 05:55:27,091 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-16 05:55:27,113 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-16 05:55:27,127 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-16 05:55:27,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:55:27,223 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-16 05:55:27,260 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-16 05:55:27,368 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-16 05:55:27,414 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:55:27,414 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 05:55:27,516 INFO L354 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2021-12-16 05:55:27,516 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2021-12-16 05:55:27,542 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1215 (_ BitVec 32)) (v_ArrVal_1217 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~last~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~last~0#1.base|) (bvadd |c_ULTIMATE.start_main_~last~0#1.offset| (_ bv12 32)) v_ArrVal_1215)) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1217) |c_ULTIMATE.start_main_~first~0#1.base|) |c_ULTIMATE.start_main_~first~0#1.offset|))) is different from false [2021-12-16 05:55:27,585 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1215 (_ BitVec 32)) (v_ArrVal_1214 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1217 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~last~0#1.base| (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1214))) (store .cse0 |c_ULTIMATE.start_main_~last~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~last~0#1.base|) (bvadd |c_ULTIMATE.start_main_~last~0#1.offset| (_ bv12 32)) v_ArrVal_1215))) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1217) |c_ULTIMATE.start_main_~first~0#1.base|) |c_ULTIMATE.start_main_~first~0#1.offset|))) is different from false [2021-12-16 05:55:27,709 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1215 (_ BitVec 32)) (v_ArrVal_1214 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~x~0#1.base_42| (_ BitVec 32)) (v_ArrVal_1217 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_42|))) (= |c_ULTIMATE.start_main_~x~0#1.base| (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_42| v_ArrVal_1214))) (store .cse0 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd |c_ULTIMATE.start_main_~x~0#1.offset| (_ bv12 32)) v_ArrVal_1215))) |v_ULTIMATE.start_main_~x~0#1.base_42| v_ArrVal_1217) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)))) is different from false [2021-12-16 05:55:27,755 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1215 (_ BitVec 32)) (v_ArrVal_1214 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1209 (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1.base_42| (_ BitVec 32)) (v_ArrVal_1217 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_42|))) (= |c_ULTIMATE.start_main_~x~0#1.base| (select (select (store (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd |c_ULTIMATE.start_main_~x~0#1.offset| (_ bv8 32)) v_ArrVal_1209)) |v_ULTIMATE.start_main_~x~0#1.base_42| v_ArrVal_1214))) (store .cse0 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd |c_ULTIMATE.start_main_~x~0#1.offset| (_ bv12 32)) v_ArrVal_1215))) |v_ULTIMATE.start_main_~x~0#1.base_42| v_ArrVal_1217) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)))) is different from false [2021-12-16 05:55:27,780 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1215 (_ BitVec 32)) (v_ArrVal_1206 (_ BitVec 32)) (v_ArrVal_1214 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1209 (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1.base_42| (_ BitVec 32)) (v_ArrVal_1217 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_42|))) (= |c_ULTIMATE.start_main_~x~0#1.base| (select (select (store (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd |c_ULTIMATE.start_main_~x~0#1.offset| (_ bv4 32)) v_ArrVal_1206) (bvadd |c_ULTIMATE.start_main_~x~0#1.offset| (_ bv8 32)) v_ArrVal_1209)) |v_ULTIMATE.start_main_~x~0#1.base_42| v_ArrVal_1214))) (store .cse0 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd |c_ULTIMATE.start_main_~x~0#1.offset| (_ bv12 32)) v_ArrVal_1215))) |v_ULTIMATE.start_main_~x~0#1.base_42| v_ArrVal_1217) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)))) is different from false [2021-12-16 05:55:27,817 INFO L354 Elim1Store]: treesize reduction 74, result has 28.2 percent of original size [2021-12-16 05:55:27,817 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 55 [2021-12-16 05:55:27,823 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 66 [2021-12-16 05:55:27,825 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 05:55:27,826 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2021-12-16 05:55:27,829 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-12-16 05:55:27,852 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2021-12-16 05:55:27,853 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 05:55:27,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1519016043] [2021-12-16 05:55:27,853 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1519016043] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 05:55:27,853 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 05:55:27,853 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 21 [2021-12-16 05:55:27,853 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613481486] [2021-12-16 05:55:27,853 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 05:55:27,853 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-12-16 05:55:27,853 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 05:55:27,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-12-16 05:55:27,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=226, Unknown=14, NotChecked=170, Total=462 [2021-12-16 05:55:27,854 INFO L87 Difference]: Start difference. First operand 207 states and 266 transitions. Second operand has 22 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 22 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:55:28,043 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#valid| (_ bv0 32)))) (and (= (_ bv0 1) .cse0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (= (_ bv0 32) |c_ULTIMATE.start_main_~x~0#1.offset|) (forall ((v_ArrVal_1215 (_ BitVec 32)) (v_ArrVal_1214 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~x~0#1.base_42| (_ BitVec 32)) (v_ArrVal_1217 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_42|))) (= |c_ULTIMATE.start_main_~x~0#1.base| (select (select (store (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_42| v_ArrVal_1214))) (store .cse1 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd |c_ULTIMATE.start_main_~x~0#1.offset| (_ bv12 32)) v_ArrVal_1215))) |v_ULTIMATE.start_main_~x~0#1.base_42| v_ArrVal_1217) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base|)) (_ bv1 1))) (or (= (_ bv0 32) |c_ULTIMATE.start_main_~x~0#1.base|) (= (_ bv0 1) (bvneg .cse0))))) is different from false [2021-12-16 05:55:28,303 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~first~0#1.base| |c_ULTIMATE.start_main_~last~0#1.base|) (forall ((v_ArrVal_1215 (_ BitVec 32)) (v_ArrVal_1206 (_ BitVec 32)) (v_ArrVal_1214 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1209 (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1.base_42| (_ BitVec 32)) (v_ArrVal_1217 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_42|))) (= |c_ULTIMATE.start_main_~x~0#1.base| (select (select (store (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd |c_ULTIMATE.start_main_~x~0#1.offset| (_ bv4 32)) v_ArrVal_1206) (bvadd |c_ULTIMATE.start_main_~x~0#1.offset| (_ bv8 32)) v_ArrVal_1209)) |v_ULTIMATE.start_main_~x~0#1.base_42| v_ArrVal_1214))) (store .cse0 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd |c_ULTIMATE.start_main_~x~0#1.offset| (_ bv12 32)) v_ArrVal_1215))) |v_ULTIMATE.start_main_~x~0#1.base_42| v_ArrVal_1217) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= |c_ULTIMATE.start_main_~first~0#1.offset| |c_ULTIMATE.start_main_~last~0#1.offset|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~last~0#1.base|) |c_ULTIMATE.start_main_~last~0#1.offset|) |c_ULTIMATE.start_main_~last~0#1.base|) (forall ((v_ArrVal_1215 (_ BitVec 32)) (v_ArrVal_1214 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1217 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~last~0#1.base| (select (select (store (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1214))) (store .cse1 |c_ULTIMATE.start_main_~last~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~last~0#1.base|) (bvadd |c_ULTIMATE.start_main_~last~0#1.offset| (_ bv12 32)) v_ArrVal_1215))) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1217) |c_ULTIMATE.start_main_~first~0#1.base|) |c_ULTIMATE.start_main_~first~0#1.offset|))) (= (_ bv0 32) |c_ULTIMATE.start_main_~last~0#1.offset|) (not (= |c_ULTIMATE.start_main_~last~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|))) is different from false [2021-12-16 05:55:28,307 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~first~0#1.base| |c_ULTIMATE.start_main_~last~0#1.base|) (forall ((v_ArrVal_1215 (_ BitVec 32)) (v_ArrVal_1214 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1209 (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1.base_42| (_ BitVec 32)) (v_ArrVal_1217 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_42|))) (= |c_ULTIMATE.start_main_~x~0#1.base| (select (select (store (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd |c_ULTIMATE.start_main_~x~0#1.offset| (_ bv8 32)) v_ArrVal_1209)) |v_ULTIMATE.start_main_~x~0#1.base_42| v_ArrVal_1214))) (store .cse0 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd |c_ULTIMATE.start_main_~x~0#1.offset| (_ bv12 32)) v_ArrVal_1215))) |v_ULTIMATE.start_main_~x~0#1.base_42| v_ArrVal_1217) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= |c_ULTIMATE.start_main_~first~0#1.offset| |c_ULTIMATE.start_main_~last~0#1.offset|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~last~0#1.base|) |c_ULTIMATE.start_main_~last~0#1.offset|) |c_ULTIMATE.start_main_~last~0#1.base|) (forall ((v_ArrVal_1215 (_ BitVec 32)) (v_ArrVal_1214 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1217 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~last~0#1.base| (select (select (store (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1214))) (store .cse1 |c_ULTIMATE.start_main_~last~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~last~0#1.base|) (bvadd |c_ULTIMATE.start_main_~last~0#1.offset| (_ bv12 32)) v_ArrVal_1215))) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1217) |c_ULTIMATE.start_main_~first~0#1.base|) |c_ULTIMATE.start_main_~first~0#1.offset|))) (= (_ bv0 32) |c_ULTIMATE.start_main_~last~0#1.offset|) (not (= |c_ULTIMATE.start_main_~last~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|))) is different from false [2021-12-16 05:55:28,339 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~first~0#1.base| |c_ULTIMATE.start_main_~last~0#1.base|) (= |c_ULTIMATE.start_main_~first~0#1.offset| |c_ULTIMATE.start_main_~last~0#1.offset|) (forall ((v_ArrVal_1215 (_ BitVec 32)) (v_ArrVal_1217 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~last~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~last~0#1.base|) (bvadd |c_ULTIMATE.start_main_~last~0#1.offset| (_ bv12 32)) v_ArrVal_1215)) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1217) |c_ULTIMATE.start_main_~first~0#1.base|) |c_ULTIMATE.start_main_~first~0#1.offset|))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~last~0#1.base|) |c_ULTIMATE.start_main_~last~0#1.offset|) |c_ULTIMATE.start_main_~last~0#1.base|) (= (_ bv0 32) |c_ULTIMATE.start_main_~last~0#1.offset|) (not (= |c_ULTIMATE.start_main_~last~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (forall ((v_ArrVal_1215 (_ BitVec 32)) (v_ArrVal_1214 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~x~0#1.base_42| (_ BitVec 32)) (v_ArrVal_1217 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_42|))) (= |c_ULTIMATE.start_main_~x~0#1.base| (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_42| v_ArrVal_1214))) (store .cse0 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd |c_ULTIMATE.start_main_~x~0#1.offset| (_ bv12 32)) v_ArrVal_1215))) |v_ULTIMATE.start_main_~x~0#1.base_42| v_ArrVal_1217) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))))) is different from false [2021-12-16 05:55:29,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:55:29,102 INFO L93 Difference]: Finished difference Result 274 states and 327 transitions. [2021-12-16 05:55:29,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-12-16 05:55:29,103 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 22 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-12-16 05:55:29,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:55:29,104 INFO L225 Difference]: With dead ends: 274 [2021-12-16 05:55:29,104 INFO L226 Difference]: Without dead ends: 274 [2021-12-16 05:55:29,104 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=173, Invalid=830, Unknown=25, NotChecked=612, Total=1640 [2021-12-16 05:55:29,105 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 213 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 1222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 658 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-16 05:55:29,105 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [213 Valid, 493 Invalid, 1222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 529 Invalid, 0 Unknown, 658 Unchecked, 0.7s Time] [2021-12-16 05:55:29,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2021-12-16 05:55:29,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 228. [2021-12-16 05:55:29,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 212 states have (on average 1.3726415094339623) internal successors, (291), 227 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:55:29,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 291 transitions. [2021-12-16 05:55:29,108 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 291 transitions. Word has length 35 [2021-12-16 05:55:29,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:55:29,108 INFO L470 AbstractCegarLoop]: Abstraction has 228 states and 291 transitions. [2021-12-16 05:55:29,108 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 22 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:55:29,108 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 291 transitions. [2021-12-16 05:55:29,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-16 05:55:29,108 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:55:29,108 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:55:29,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2021-12-16 05:55:29,308 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 05:55:29,309 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 39 more)] === [2021-12-16 05:55:29,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:55:29,309 INFO L85 PathProgramCache]: Analyzing trace with hash -161860524, now seen corresponding path program 1 times [2021-12-16 05:55:29,309 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 05:55:29,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [79280852] [2021-12-16 05:55:29,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:55:29,310 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 05:55:29,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 05:55:29,310 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 05:55:29,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2021-12-16 05:55:29,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:55:29,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 45 conjunts are in the unsatisfiable core [2021-12-16 05:55:29,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:55:29,550 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 05:55:29,581 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-16 05:55:29,588 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-16 05:55:29,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:55:29,612 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-16 05:55:29,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:55:29,620 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-16 05:55:29,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:55:29,630 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-16 05:55:29,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:55:29,639 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-16 05:55:29,714 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-16 05:55:29,715 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2021-12-16 05:55:29,770 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-16 05:55:29,779 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-16 05:55:29,793 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-16 05:55:29,805 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-16 05:55:29,820 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-16 05:55:29,830 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-16 05:55:29,849 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-16 05:55:29,859 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-16 05:55:29,872 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-16 05:55:29,884 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-16 05:55:29,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:55:29,964 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-16 05:55:29,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:55:29,972 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-16 05:55:30,002 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-16 05:55:30,006 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-16 05:55:30,079 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 05:55:30,079 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2021-12-16 05:55:30,085 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 05:55:30,085 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2021-12-16 05:55:30,131 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:55:30,131 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 05:55:30,248 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1321 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1321) |c_ULTIMATE.start_main_~first~0#1.base|) |c_ULTIMATE.start_main_~first~0#1.offset|) |c_ULTIMATE.start_main_~first~0#1.offset|)) (forall ((v_ArrVal_1322 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1322) |c_ULTIMATE.start_main_~first~0#1.base|) |c_ULTIMATE.start_main_~first~0#1.offset|) |c_ULTIMATE.start_main_~first~0#1.base|))) is different from false [2021-12-16 05:55:30,263 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1321 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1320 (_ BitVec 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~last~0#1.base|) (bvadd |c_ULTIMATE.start_main_~last~0#1.offset| (_ bv12 32)) v_ArrVal_1320)) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1321) |c_ULTIMATE.start_main_~first~0#1.base|) |c_ULTIMATE.start_main_~first~0#1.offset|) |c_ULTIMATE.start_main_~first~0#1.offset|)) (forall ((v_ArrVal_1319 (_ BitVec 32)) (v_ArrVal_1322 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~last~0#1.base|) (bvadd |c_ULTIMATE.start_main_~last~0#1.offset| (_ bv12 32)) v_ArrVal_1319)) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1322) |c_ULTIMATE.start_main_~first~0#1.base|) |c_ULTIMATE.start_main_~first~0#1.offset|) |c_ULTIMATE.start_main_~first~0#1.base|))) is different from false [2021-12-16 05:55:30,316 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1319 (_ BitVec 32)) (v_ArrVal_1322 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1316 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1316))) (store .cse0 |c_ULTIMATE.start_main_~last~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~last~0#1.base|) (bvadd |c_ULTIMATE.start_main_~last~0#1.offset| (_ bv12 32)) v_ArrVal_1319))) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1322) |c_ULTIMATE.start_main_~first~0#1.base|) |c_ULTIMATE.start_main_~first~0#1.offset|) |c_ULTIMATE.start_main_~first~0#1.base|)) (forall ((v_ArrVal_1321 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1315 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1320 (_ BitVec 32))) (= (select (select (store (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1315))) (store .cse1 |c_ULTIMATE.start_main_~last~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~last~0#1.base|) (bvadd |c_ULTIMATE.start_main_~last~0#1.offset| (_ bv12 32)) v_ArrVal_1320))) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1321) |c_ULTIMATE.start_main_~first~0#1.base|) |c_ULTIMATE.start_main_~first~0#1.offset|) |c_ULTIMATE.start_main_~first~0#1.offset|))) is different from false [2021-12-16 05:55:32,895 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.base_44| (_ BitVec 32))) (or (and (forall ((v_ArrVal_1300 (_ BitVec 32)) (v_ArrVal_1319 (_ BitVec 32)) (v_ArrVal_1322 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1316 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd |c_ULTIMATE.start_main_~x~0#1.offset| (_ bv4 32)) v_ArrVal_1300)) |v_ULTIMATE.start_main_~x~0#1.base_44| v_ArrVal_1316))) (store .cse0 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd |c_ULTIMATE.start_main_~x~0#1.offset| (_ bv12 32)) v_ArrVal_1319))) |v_ULTIMATE.start_main_~x~0#1.base_44| v_ArrVal_1322) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|)) (forall ((v_ArrVal_1301 (_ BitVec 32)) (v_ArrVal_1321 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1315 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1320 (_ BitVec 32))) (= (select (select (store (let ((.cse1 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd |c_ULTIMATE.start_main_~x~0#1.offset| (_ bv4 32)) v_ArrVal_1301)) |v_ULTIMATE.start_main_~x~0#1.base_44| v_ArrVal_1315))) (store .cse1 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd |c_ULTIMATE.start_main_~x~0#1.offset| (_ bv12 32)) v_ArrVal_1320))) |v_ULTIMATE.start_main_~x~0#1.base_44| v_ArrVal_1321) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_44|))))) is different from false [2021-12-16 05:55:32,931 INFO L354 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2021-12-16 05:55:32,931 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 105 treesize of output 98 [2021-12-16 05:55:32,954 INFO L354 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2021-12-16 05:55:32,954 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 98 treesize of output 90 [2021-12-16 05:55:32,957 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 120 [2021-12-16 05:55:32,968 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 150 [2021-12-16 05:55:32,976 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-16 05:55:32,976 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 162 treesize of output 154 [2021-12-16 05:55:32,998 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-16 05:55:32,998 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 166 treesize of output 158 [2021-12-16 05:55:33,005 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 109 [2021-12-16 05:55:33,009 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2021-12-16 05:55:33,011 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2021-12-16 05:55:33,089 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2021-12-16 05:55:33,089 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 05:55:33,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [79280852] [2021-12-16 05:55:33,089 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [79280852] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 05:55:33,090 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 05:55:33,090 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 22 [2021-12-16 05:55:33,090 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724054127] [2021-12-16 05:55:33,090 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 05:55:33,090 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-12-16 05:55:33,090 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 05:55:33,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-12-16 05:55:33,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=256, Unknown=9, NotChecked=140, Total=462 [2021-12-16 05:55:33,091 INFO L87 Difference]: Start difference. First operand 228 states and 291 transitions. Second operand has 22 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 22 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:55:33,315 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~x~0#1.base_44| (_ BitVec 32))) (or (and (forall ((v_ArrVal_1300 (_ BitVec 32)) (v_ArrVal_1319 (_ BitVec 32)) (v_ArrVal_1322 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1316 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd |c_ULTIMATE.start_main_~x~0#1.offset| (_ bv4 32)) v_ArrVal_1300)) |v_ULTIMATE.start_main_~x~0#1.base_44| v_ArrVal_1316))) (store .cse0 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd |c_ULTIMATE.start_main_~x~0#1.offset| (_ bv12 32)) v_ArrVal_1319))) |v_ULTIMATE.start_main_~x~0#1.base_44| v_ArrVal_1322) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|)) (forall ((v_ArrVal_1301 (_ BitVec 32)) (v_ArrVal_1321 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1315 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1320 (_ BitVec 32))) (= (select (select (store (let ((.cse1 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd |c_ULTIMATE.start_main_~x~0#1.offset| (_ bv4 32)) v_ArrVal_1301)) |v_ULTIMATE.start_main_~x~0#1.base_44| v_ArrVal_1315))) (store .cse1 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd |c_ULTIMATE.start_main_~x~0#1.offset| (_ bv12 32)) v_ArrVal_1320))) |v_ULTIMATE.start_main_~x~0#1.base_44| v_ArrVal_1321) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_44|))))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.offset|) (= (_ bv0 32) |c_ULTIMATE.start_main_~x~0#1.offset|) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base|)) (_ bv1 1)))) is different from false [2021-12-16 05:55:36,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:55:36,863 INFO L93 Difference]: Finished difference Result 258 states and 309 transitions. [2021-12-16 05:55:36,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-16 05:55:36,864 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 22 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-12-16 05:55:36,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:55:36,864 INFO L225 Difference]: With dead ends: 258 [2021-12-16 05:55:36,864 INFO L226 Difference]: Without dead ends: 258 [2021-12-16 05:55:36,865 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 47 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=204, Invalid=996, Unknown=10, NotChecked=350, Total=1560 [2021-12-16 05:55:36,865 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 127 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 1128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 627 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-12-16 05:55:36,865 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 479 Invalid, 1128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 472 Invalid, 0 Unknown, 627 Unchecked, 0.9s Time] [2021-12-16 05:55:36,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2021-12-16 05:55:36,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 227. [2021-12-16 05:55:36,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 211 states have (on average 1.3649289099526067) internal successors, (288), 226 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:55:36,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 288 transitions. [2021-12-16 05:55:36,868 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 288 transitions. Word has length 35 [2021-12-16 05:55:36,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:55:36,868 INFO L470 AbstractCegarLoop]: Abstraction has 227 states and 288 transitions. [2021-12-16 05:55:36,868 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 22 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:55:36,869 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 288 transitions. [2021-12-16 05:55:36,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-16 05:55:36,869 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:55:36,869 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, 1, 1, 1] [2021-12-16 05:55:36,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2021-12-16 05:55:37,077 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 05:55:37,077 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 39 more)] === [2021-12-16 05:55:37,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:55:37,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1792226092, now seen corresponding path program 1 times [2021-12-16 05:55:37,078 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 05:55:37,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [463252105] [2021-12-16 05:55:37,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:55:37,078 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 05:55:37,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 05:55:37,085 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 05:55:37,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2021-12-16 05:55:37,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:55:37,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-16 05:55:37,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:55:37,260 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 05:55:37,286 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-16 05:55:37,323 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2021-12-16 05:55:37,353 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-16 05:55:37,353 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 05:55:37,353 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 05:55:37,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [463252105] [2021-12-16 05:55:37,353 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [463252105] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:55:37,353 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:55:37,353 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-16 05:55:37,353 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119087771] [2021-12-16 05:55:37,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:55:37,354 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-16 05:55:37,354 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 05:55:37,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-16 05:55:37,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-16 05:55:37,354 INFO L87 Difference]: Start difference. First operand 227 states and 288 transitions. Second operand has 9 states, 8 states have (on average 4.375) internal successors, (35), 9 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-16 05:55:38,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:55:38,069 INFO L93 Difference]: Finished difference Result 277 states and 334 transitions. [2021-12-16 05:55:38,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-16 05:55:38,070 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.375) internal successors, (35), 9 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-16 05:55:38,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:55:38,071 INFO L225 Difference]: With dead ends: 277 [2021-12-16 05:55:38,071 INFO L226 Difference]: Without dead ends: 277 [2021-12-16 05:55:38,071 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2021-12-16 05:55:38,072 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 117 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-16 05:55:38,072 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 211 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-16 05:55:38,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2021-12-16 05:55:38,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 228. [2021-12-16 05:55:38,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 213 states have (on average 1.352112676056338) internal successors, (288), 227 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:55:38,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 288 transitions. [2021-12-16 05:55:38,075 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 288 transitions. Word has length 35 [2021-12-16 05:55:38,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:55:38,075 INFO L470 AbstractCegarLoop]: Abstraction has 228 states and 288 transitions. [2021-12-16 05:55:38,075 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.375) internal successors, (35), 9 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-16 05:55:38,075 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 288 transitions. [2021-12-16 05:55:38,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-16 05:55:38,075 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:55:38,075 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, 1, 1, 1] [2021-12-16 05:55:38,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2021-12-16 05:55:38,283 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 05:55:38,284 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 39 more)] === [2021-12-16 05:55:38,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:55:38,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1792226093, now seen corresponding path program 1 times [2021-12-16 05:55:38,284 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 05:55:38,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [979727558] [2021-12-16 05:55:38,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:55:38,285 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 05:55:38,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 05:55:38,286 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 05:55:38,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2021-12-16 05:55:38,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:55:38,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-16 05:55:38,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:55:38,468 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 05:55:38,517 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-16 05:55:38,521 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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-16 05:55:38,597 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-12-16 05:55:38,599 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-16 05:55:38,651 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-16 05:55:38,652 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 05:55:38,652 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 05:55:38,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [979727558] [2021-12-16 05:55:38,652 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [979727558] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:55:38,652 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:55:38,652 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-16 05:55:38,652 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585551885] [2021-12-16 05:55:38,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:55:38,652 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-16 05:55:38,652 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 05:55:38,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-16 05:55:38,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-16 05:55:38,653 INFO L87 Difference]: Start difference. First operand 228 states and 288 transitions. Second operand has 9 states, 8 states have (on average 4.375) internal successors, (35), 9 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-16 05:55:39,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:55:39,556 INFO L93 Difference]: Finished difference Result 268 states and 318 transitions. [2021-12-16 05:55:39,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-16 05:55:39,558 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.375) internal successors, (35), 9 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-16 05:55:39,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:55:39,563 INFO L225 Difference]: With dead ends: 268 [2021-12-16 05:55:39,563 INFO L226 Difference]: Without dead ends: 268 [2021-12-16 05:55:39,563 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2021-12-16 05:55:39,563 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 137 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-16 05:55:39,563 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 249 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-16 05:55:39,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2021-12-16 05:55:39,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 230. [2021-12-16 05:55:39,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 215 states have (on average 1.3488372093023255) internal successors, (290), 229 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:55:39,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 290 transitions. [2021-12-16 05:55:39,566 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 290 transitions. Word has length 35 [2021-12-16 05:55:39,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:55:39,566 INFO L470 AbstractCegarLoop]: Abstraction has 230 states and 290 transitions. [2021-12-16 05:55:39,566 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.375) internal successors, (35), 9 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-16 05:55:39,567 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 290 transitions. [2021-12-16 05:55:39,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-16 05:55:39,567 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:55:39,567 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:55:39,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2021-12-16 05:55:39,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 05:55:39,775 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 39 more)] === [2021-12-16 05:55:39,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:55:39,776 INFO L85 PathProgramCache]: Analyzing trace with hash -629917055, now seen corresponding path program 1 times [2021-12-16 05:55:39,776 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 05:55:39,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [136744828] [2021-12-16 05:55:39,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:55:39,776 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 05:55:39,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 05:55:39,777 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 05:55:39,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2021-12-16 05:55:40,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:55:40,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-16 05:55:40,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:55:40,089 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 05:55:40,097 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 05:55:40,205 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-16 05:55:40,206 INFO L388 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 20 treesize of output 27 [2021-12-16 05:55:40,214 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-16 05:55:40,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:55:40,295 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-16 05:55:40,302 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-16 05:55:40,302 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2021-12-16 05:55:40,375 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:55:40,375 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 05:55:47,973 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:55:47,974 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 05:55:47,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [136744828] [2021-12-16 05:55:47,974 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [136744828] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 05:55:47,974 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 05:55:47,974 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2021-12-16 05:55:47,974 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483876370] [2021-12-16 05:55:47,974 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 05:55:47,974 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-16 05:55:47,975 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 05:55:47,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-16 05:55:47,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=58, Unknown=3, NotChecked=0, Total=90 [2021-12-16 05:55:47,975 INFO L87 Difference]: Start difference. First operand 230 states and 290 transitions. Second operand has 10 states, 9 states have (on average 8.0) internal successors, (72), 10 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:55:48,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:55:48,324 INFO L93 Difference]: Finished difference Result 243 states and 298 transitions. [2021-12-16 05:55:48,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 05:55:48,325 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.0) internal successors, (72), 10 states have internal predecessors, (72), 0 states have call successors, (0), 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 37 [2021-12-16 05:55:48,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:55:48,326 INFO L225 Difference]: With dead ends: 243 [2021-12-16 05:55:48,326 INFO L226 Difference]: Without dead ends: 243 [2021-12-16 05:55:48,326 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=49, Invalid=80, Unknown=3, NotChecked=0, Total=132 [2021-12-16 05:55:48,326 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 168 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 05:55:48,326 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [168 Valid, 149 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 125 Invalid, 0 Unknown, 60 Unchecked, 0.3s Time] [2021-12-16 05:55:48,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2021-12-16 05:55:48,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 200. [2021-12-16 05:55:48,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 186 states have (on average 1.3655913978494623) internal successors, (254), 199 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:55:48,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 254 transitions. [2021-12-16 05:55:48,329 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 254 transitions. Word has length 37 [2021-12-16 05:55:48,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:55:48,329 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 254 transitions. [2021-12-16 05:55:48,329 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.0) internal successors, (72), 10 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:55:48,329 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 254 transitions. [2021-12-16 05:55:48,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-16 05:55:48,329 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:55:48,329 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, 1, 1, 1, 1, 1, 1] [2021-12-16 05:55:48,355 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2021-12-16 05:55:48,530 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 05:55:48,530 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 39 more)] === [2021-12-16 05:55:48,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:55:48,530 INFO L85 PathProgramCache]: Analyzing trace with hash 373585119, now seen corresponding path program 1 times [2021-12-16 05:55:48,531 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 05:55:48,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [602198684] [2021-12-16 05:55:48,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:55:48,531 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 05:55:48,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 05:55:48,532 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 05:55:48,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2021-12-16 05:55:48,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:55:48,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-16 05:55:48,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:55:48,786 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 05:55:48,814 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-16 05:55:48,815 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2021-12-16 05:55:48,843 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-16 05:55:48,887 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-12-16 05:55:48,913 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:55:48,913 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 05:55:48,989 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:55:48,990 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 05:55:48,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [602198684] [2021-12-16 05:55:48,990 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [602198684] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 05:55:48,990 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 05:55:48,990 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2021-12-16 05:55:48,990 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339323820] [2021-12-16 05:55:48,990 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 05:55:48,990 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-16 05:55:48,990 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 05:55:48,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-16 05:55:48,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-16 05:55:48,995 INFO L87 Difference]: Start difference. First operand 200 states and 254 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:55:49,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:55:49,708 INFO L93 Difference]: Finished difference Result 249 states and 285 transitions. [2021-12-16 05:55:49,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-16 05:55:49,708 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-12-16 05:55:49,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:55:49,709 INFO L225 Difference]: With dead ends: 249 [2021-12-16 05:55:49,709 INFO L226 Difference]: Without dead ends: 249 [2021-12-16 05:55:49,709 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 64 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2021-12-16 05:55:49,709 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 173 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-16 05:55:49,710 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [173 Valid, 291 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-16 05:55:49,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2021-12-16 05:55:49,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 200. [2021-12-16 05:55:49,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 186 states have (on average 1.3602150537634408) internal successors, (253), 199 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:55:49,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 253 transitions. [2021-12-16 05:55:49,713 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 253 transitions. Word has length 38 [2021-12-16 05:55:49,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:55:49,713 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 253 transitions. [2021-12-16 05:55:49,713 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:55:49,713 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 253 transitions. [2021-12-16 05:55:49,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-16 05:55:49,714 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:55:49,714 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, 1, 1, 1] [2021-12-16 05:55:49,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Forceful destruction successful, exit code 0