./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.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-simple/sll2c_update_all_reverse.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 4fecbd384f63aa34e01807a3a6735a322a2435f1312f0df3ed763fde7f43fe0a --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-18 22:08:35,836 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-18 22:08:35,863 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-18 22:08:35,890 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-18 22:08:35,891 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-18 22:08:35,892 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-18 22:08:35,893 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-18 22:08:35,894 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-18 22:08:35,895 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-18 22:08:35,895 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-18 22:08:35,896 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-18 22:08:35,897 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-18 22:08:35,897 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-18 22:08:35,898 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-18 22:08:35,898 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-18 22:08:35,899 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-18 22:08:35,900 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-18 22:08:35,900 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-18 22:08:35,902 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-18 22:08:35,903 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-18 22:08:35,904 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-18 22:08:35,905 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-18 22:08:35,906 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-18 22:08:35,906 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-18 22:08:35,908 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-18 22:08:35,909 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-18 22:08:35,909 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-18 22:08:35,910 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-18 22:08:35,910 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-18 22:08:35,911 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-18 22:08:35,911 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-18 22:08:35,911 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-18 22:08:35,912 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-18 22:08:35,913 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-18 22:08:35,913 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-18 22:08:35,913 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-18 22:08:35,914 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-18 22:08:35,914 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-18 22:08:35,914 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-18 22:08:35,915 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-18 22:08:35,916 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-18 22:08:35,916 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-18 22:08:35,929 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-18 22:08:35,930 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-18 22:08:35,930 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-18 22:08:35,930 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-18 22:08:35,931 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-18 22:08:35,931 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-18 22:08:35,931 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-18 22:08:35,932 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-18 22:08:35,932 INFO L138 SettingsManager]: * Use SBE=true [2021-12-18 22:08:35,932 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-18 22:08:35,932 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-18 22:08:35,932 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-18 22:08:35,933 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-18 22:08:35,933 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-18 22:08:35,933 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-18 22:08:35,933 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-18 22:08:35,933 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-18 22:08:35,933 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-18 22:08:35,934 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-18 22:08:35,934 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-18 22:08:35,934 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-18 22:08:35,934 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-18 22:08:35,934 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-18 22:08:35,934 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-18 22:08:35,935 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-18 22:08:35,935 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 22:08:35,935 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-18 22:08:35,935 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-18 22:08:35,935 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-18 22:08:35,935 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-18 22:08:35,936 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-18 22:08:35,936 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 -> 4fecbd384f63aa34e01807a3a6735a322a2435f1312f0df3ed763fde7f43fe0a [2021-12-18 22:08:36,110 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-18 22:08:36,127 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-18 22:08:36,130 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-18 22:08:36,131 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-18 22:08:36,132 INFO L275 PluginConnector]: CDTParser initialized [2021-12-18 22:08:36,132 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i [2021-12-18 22:08:36,185 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b086563dd/3aed1a63486d4a5cb329619fe71fbd17/FLAG2dcc25abe [2021-12-18 22:08:36,526 INFO L306 CDTParser]: Found 1 translation units. [2021-12-18 22:08:36,527 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i [2021-12-18 22:08:36,545 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b086563dd/3aed1a63486d4a5cb329619fe71fbd17/FLAG2dcc25abe [2021-12-18 22:08:36,920 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b086563dd/3aed1a63486d4a5cb329619fe71fbd17 [2021-12-18 22:08:36,923 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-18 22:08:36,925 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-18 22:08:36,927 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-18 22:08:36,927 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-18 22:08:36,929 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-18 22:08:36,930 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:08:36" (1/1) ... [2021-12-18 22:08:36,931 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f0a3e3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:36, skipping insertion in model container [2021-12-18 22:08:36,932 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:08:36" (1/1) ... [2021-12-18 22:08:36,936 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-18 22:08:36,968 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-18 22:08:37,196 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i[24436,24449] [2021-12-18 22:08:37,201 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 22:08:37,209 INFO L203 MainTranslator]: Completed pre-run [2021-12-18 22:08:37,235 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i[24436,24449] [2021-12-18 22:08:37,235 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 22:08:37,252 INFO L208 MainTranslator]: Completed translation [2021-12-18 22:08:37,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:37 WrapperNode [2021-12-18 22:08:37,252 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-18 22:08:37,253 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-18 22:08:37,253 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-18 22:08:37,254 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-18 22:08:37,258 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:37" (1/1) ... [2021-12-18 22:08:37,271 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:37" (1/1) ... [2021-12-18 22:08:37,292 INFO L137 Inliner]: procedures = 126, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 133 [2021-12-18 22:08:37,293 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-18 22:08:37,294 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-18 22:08:37,294 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-18 22:08:37,294 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-18 22:08:37,299 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:37" (1/1) ... [2021-12-18 22:08:37,299 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:37" (1/1) ... [2021-12-18 22:08:37,315 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:37" (1/1) ... [2021-12-18 22:08:37,316 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:37" (1/1) ... [2021-12-18 22:08:37,322 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:37" (1/1) ... [2021-12-18 22:08:37,325 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:37" (1/1) ... [2021-12-18 22:08:37,326 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:37" (1/1) ... [2021-12-18 22:08:37,328 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-18 22:08:37,328 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-18 22:08:37,328 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-18 22:08:37,328 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-18 22:08:37,329 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:37" (1/1) ... [2021-12-18 22:08:37,334 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 22:08:37,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 22:08:37,370 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-18 22:08:37,389 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-18 22:08:37,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-18 22:08:37,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-18 22:08:37,400 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-12-18 22:08:37,400 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-12-18 22:08:37,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-18 22:08:37,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-18 22:08:37,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-18 22:08:37,400 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-18 22:08:37,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-18 22:08:37,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-18 22:08:37,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-18 22:08:37,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-18 22:08:37,466 INFO L236 CfgBuilder]: Building ICFG [2021-12-18 22:08:37,467 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-18 22:08:37,681 INFO L277 CfgBuilder]: Performing block encoding [2021-12-18 22:08:37,688 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-18 22:08:37,688 INFO L301 CfgBuilder]: Removed 6 assume(true) statements. [2021-12-18 22:08:37,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:08:37 BoogieIcfgContainer [2021-12-18 22:08:37,690 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-18 22:08:37,691 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-18 22:08:37,691 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-18 22:08:37,693 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-18 22:08:37,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 10:08:36" (1/3) ... [2021-12-18 22:08:37,701 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6efca35a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:08:37, skipping insertion in model container [2021-12-18 22:08:37,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:37" (2/3) ... [2021-12-18 22:08:37,702 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6efca35a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:08:37, skipping insertion in model container [2021-12-18 22:08:37,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:08:37" (3/3) ... [2021-12-18 22:08:37,703 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_update_all_reverse.i [2021-12-18 22:08:37,707 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-18 22:08:37,707 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2021-12-18 22:08:37,736 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-18 22:08:37,741 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-18 22:08:37,741 INFO L340 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2021-12-18 22:08:37,752 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 51 states have (on average 1.8431372549019607) internal successors, (94), 79 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:08:37,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-18 22:08:37,757 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:08:37,757 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-18 22:08:37,757 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:08:37,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:08:37,761 INFO L85 PathProgramCache]: Analyzing trace with hash 894505749, now seen corresponding path program 1 times [2021-12-18 22:08:37,768 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:08:37,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179377447] [2021-12-18 22:08:37,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:08:37,769 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:08:37,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:37,931 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-18 22:08:37,932 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:08:37,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179377447] [2021-12-18 22:08:37,933 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179377447] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:08:37,933 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:08:37,933 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 22:08:37,934 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833249849] [2021-12-18 22:08:37,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:08:37,937 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 22:08:37,938 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:08:37,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 22:08:37,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 22:08:37,964 INFO L87 Difference]: Start difference. First operand has 83 states, 51 states have (on average 1.8431372549019607) internal successors, (94), 79 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:08:38,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:08:38,040 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2021-12-18 22:08:38,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 22:08:38,043 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-12-18 22:08:38,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:08:38,048 INFO L225 Difference]: With dead ends: 81 [2021-12-18 22:08:38,049 INFO L226 Difference]: Without dead ends: 78 [2021-12-18 22:08:38,050 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-18 22:08:38,053 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 8 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 22:08:38,054 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 135 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 22:08:38,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-12-18 22:08:38,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2021-12-18 22:08:38,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 49 states have (on average 1.653061224489796) internal successors, (81), 74 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:08:38,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2021-12-18 22:08:38,086 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 6 [2021-12-18 22:08:38,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:08:38,087 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2021-12-18 22:08:38,087 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:08:38,087 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2021-12-18 22:08:38,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-18 22:08:38,088 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:08:38,088 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-18 22:08:38,088 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-18 22:08:38,088 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:08:38,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:08:38,090 INFO L85 PathProgramCache]: Analyzing trace with hash 894505750, now seen corresponding path program 1 times [2021-12-18 22:08:38,091 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:08:38,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100276117] [2021-12-18 22:08:38,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:08:38,091 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:08:38,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:38,153 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-18 22:08:38,154 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:08:38,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100276117] [2021-12-18 22:08:38,154 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100276117] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:08:38,155 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:08:38,155 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 22:08:38,155 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605399683] [2021-12-18 22:08:38,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:08:38,156 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 22:08:38,157 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:08:38,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 22:08:38,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 22:08:38,158 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:08:38,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:08:38,214 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2021-12-18 22:08:38,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 22:08:38,215 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-12-18 22:08:38,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:08:38,217 INFO L225 Difference]: With dead ends: 76 [2021-12-18 22:08:38,217 INFO L226 Difference]: Without dead ends: 76 [2021-12-18 22:08:38,219 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-18 22:08:38,221 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 4 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 22:08:38,222 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 137 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 22:08:38,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-12-18 22:08:38,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2021-12-18 22:08:38,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 49 states have (on average 1.6122448979591837) internal successors, (79), 72 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:08:38,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2021-12-18 22:08:38,233 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 6 [2021-12-18 22:08:38,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:08:38,234 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2021-12-18 22:08:38,235 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:08:38,236 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2021-12-18 22:08:38,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-18 22:08:38,236 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:08:38,236 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:08:38,237 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-18 22:08:38,238 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:08:38,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:08:38,239 INFO L85 PathProgramCache]: Analyzing trace with hash -835957545, now seen corresponding path program 1 times [2021-12-18 22:08:38,240 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:08:38,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169910903] [2021-12-18 22:08:38,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:08:38,241 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:08:38,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:38,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 22:08:38,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:38,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 22:08:38,387 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:08:38,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169910903] [2021-12-18 22:08:38,388 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169910903] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:08:38,388 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:08:38,388 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 22:08:38,389 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393911196] [2021-12-18 22:08:38,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:08:38,389 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 22:08:38,389 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:08:38,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 22:08:38,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 22:08:38,391 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-18 22:08:38,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:08:38,451 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2021-12-18 22:08:38,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-18 22:08:38,452 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2021-12-18 22:08:38,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:08:38,455 INFO L225 Difference]: With dead ends: 83 [2021-12-18 22:08:38,455 INFO L226 Difference]: Without dead ends: 83 [2021-12-18 22:08:38,455 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 22:08:38,461 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 5 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 22:08:38,463 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 203 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 22:08:38,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-12-18 22:08:38,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 77. [2021-12-18 22:08:38,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 50 states have (on average 1.6) internal successors, (80), 73 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:08:38,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2021-12-18 22:08:38,469 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 13 [2021-12-18 22:08:38,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:08:38,469 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2021-12-18 22:08:38,469 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-18 22:08:38,470 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2021-12-18 22:08:38,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-18 22:08:38,470 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:08:38,470 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:08:38,470 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-18 22:08:38,471 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:08:38,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:08:38,471 INFO L85 PathProgramCache]: Analyzing trace with hash -125034980, now seen corresponding path program 1 times [2021-12-18 22:08:38,471 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:08:38,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708088079] [2021-12-18 22:08:38,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:08:38,472 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:08:38,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:38,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 22:08:38,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:38,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 22:08:38,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:38,584 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-18 22:08:38,585 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:08:38,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708088079] [2021-12-18 22:08:38,585 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708088079] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:08:38,585 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:08:38,585 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 22:08:38,585 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550477958] [2021-12-18 22:08:38,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:08:38,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-18 22:08:38,586 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:08:38,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-18 22:08:38,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-18 22:08:38,587 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:08:38,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:08:38,697 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2021-12-18 22:08:38,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 22:08:38,698 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2021-12-18 22:08:38,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:08:38,699 INFO L225 Difference]: With dead ends: 97 [2021-12-18 22:08:38,700 INFO L226 Difference]: Without dead ends: 97 [2021-12-18 22:08:38,700 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-18 22:08:38,701 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 69 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 22:08:38,701 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 268 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 22:08:38,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-12-18 22:08:38,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 76. [2021-12-18 22:08:38,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 50 states have (on average 1.58) internal successors, (79), 72 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:08:38,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2021-12-18 22:08:38,706 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 22 [2021-12-18 22:08:38,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:08:38,706 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2021-12-18 22:08:38,706 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:08:38,706 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2021-12-18 22:08:38,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-18 22:08:38,707 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:08:38,707 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:08:38,707 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-18 22:08:38,707 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:08:38,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:08:38,708 INFO L85 PathProgramCache]: Analyzing trace with hash -125034979, now seen corresponding path program 1 times [2021-12-18 22:08:38,708 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:08:38,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972175568] [2021-12-18 22:08:38,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:08:38,709 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:08:38,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:38,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 22:08:38,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:38,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 22:08:38,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:38,818 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 22:08:38,818 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:08:38,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972175568] [2021-12-18 22:08:38,819 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972175568] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:08:38,819 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:08:38,819 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 22:08:38,819 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367525946] [2021-12-18 22:08:38,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:08:38,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-18 22:08:38,820 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:08:38,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-18 22:08:38,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-18 22:08:38,821 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:08:38,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:08:38,922 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2021-12-18 22:08:38,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 22:08:38,922 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2021-12-18 22:08:38,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:08:38,923 INFO L225 Difference]: With dead ends: 76 [2021-12-18 22:08:38,923 INFO L226 Difference]: Without dead ends: 76 [2021-12-18 22:08:38,923 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-18 22:08:38,924 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 69 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 22:08:38,924 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 277 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 22:08:38,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-12-18 22:08:38,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2021-12-18 22:08:38,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 50 states have (on average 1.56) internal successors, (78), 71 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:08:38,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2021-12-18 22:08:38,928 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 22 [2021-12-18 22:08:38,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:08:38,928 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2021-12-18 22:08:38,929 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:08:38,929 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2021-12-18 22:08:38,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-18 22:08:38,929 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:08:38,929 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:08:38,929 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-18 22:08:38,930 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:08:38,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:08:38,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1180454715, now seen corresponding path program 1 times [2021-12-18 22:08:38,930 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:08:38,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727296304] [2021-12-18 22:08:38,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:08:38,931 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:08:38,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:38,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 22:08:38,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:39,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 22:08:39,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:39,047 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-18 22:08:39,047 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:08:39,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727296304] [2021-12-18 22:08:39,047 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727296304] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:08:39,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11025856] [2021-12-18 22:08:39,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:08:39,048 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:08:39,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 22:08:39,062 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-18 22:08:39,096 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-18 22:08:39,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:39,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-18 22:08:39,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:08:39,225 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-18 22:08:39,421 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-18 22:08:39,421 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-18 22:08:39,438 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 22:08:39,438 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:08:39,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11025856] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:08:39,493 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 22:08:39,493 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2021-12-18 22:08:39,494 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62690870] [2021-12-18 22:08:39,494 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 22:08:39,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-18 22:08:39,494 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:08:39,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-18 22:08:39,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-12-18 22:08:39,495 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-18 22:08:39,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:08:39,585 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2021-12-18 22:08:39,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 22:08:39,586 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2021-12-18 22:08:39,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:08:39,586 INFO L225 Difference]: With dead ends: 94 [2021-12-18 22:08:39,586 INFO L226 Difference]: Without dead ends: 94 [2021-12-18 22:08:39,587 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2021-12-18 22:08:39,587 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 67 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 34 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 22:08:39,588 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 355 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 160 Invalid, 0 Unknown, 34 Unchecked, 0.1s Time] [2021-12-18 22:08:39,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-12-18 22:08:39,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 74. [2021-12-18 22:08:39,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.54) internal successors, (77), 70 states have internal predecessors, (77), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:08:39,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2021-12-18 22:08:39,591 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 25 [2021-12-18 22:08:39,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:08:39,592 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2021-12-18 22:08:39,592 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-18 22:08:39,592 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2021-12-18 22:08:39,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-18 22:08:39,592 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:08:39,593 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:08:39,612 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-18 22:08:39,807 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,SelfDestructingSolverStorable5 [2021-12-18 22:08:39,808 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:08:39,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:08:39,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1180454714, now seen corresponding path program 1 times [2021-12-18 22:08:39,808 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:08:39,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099600832] [2021-12-18 22:08:39,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:08:39,808 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:08:39,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:39,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 22:08:39,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:39,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 22:08:39,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:39,950 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-18 22:08:39,950 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:08:39,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099600832] [2021-12-18 22:08:39,951 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099600832] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:08:39,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322969991] [2021-12-18 22:08:39,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:08:39,951 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:08:39,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 22:08:39,967 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-18 22:08:40,007 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-18 22:08:40,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:40,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 31 conjunts are in the unsatisfiable core [2021-12-18 22:08:40,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:08:40,074 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-18 22:08:40,078 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-18 22:08:40,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:08:40,259 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-18 22:08:40,265 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 22:08:40,265 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-18 22:08:40,295 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 22:08:40,295 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:08:40,391 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1322969991] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:08:40,392 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 22:08:40,392 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2021-12-18 22:08:40,392 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790478814] [2021-12-18 22:08:40,392 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 22:08:40,392 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-18 22:08:40,393 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:08:40,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-18 22:08:40,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2021-12-18 22:08:40,393 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand has 16 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 12 states have internal predecessors, (40), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-18 22:08:40,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:08:40,618 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2021-12-18 22:08:40,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-18 22:08:40,618 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 12 states have internal predecessors, (40), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 25 [2021-12-18 22:08:40,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:08:40,619 INFO L225 Difference]: With dead ends: 94 [2021-12-18 22:08:40,619 INFO L226 Difference]: Without dead ends: 94 [2021-12-18 22:08:40,619 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2021-12-18 22:08:40,620 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 139 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 22:08:40,620 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 460 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 282 Invalid, 0 Unknown, 47 Unchecked, 0.1s Time] [2021-12-18 22:08:40,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-12-18 22:08:40,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 73. [2021-12-18 22:08:40,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 50 states have (on average 1.52) internal successors, (76), 69 states have internal predecessors, (76), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:08:40,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2021-12-18 22:08:40,623 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 25 [2021-12-18 22:08:40,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:08:40,623 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2021-12-18 22:08:40,624 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 12 states have internal predecessors, (40), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-18 22:08:40,624 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2021-12-18 22:08:40,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-18 22:08:40,624 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:08:40,624 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, 1] [2021-12-18 22:08:40,661 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-18 22:08:40,841 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-12-18 22:08:40,842 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:08:40,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:08:40,842 INFO L85 PathProgramCache]: Analyzing trace with hash 2031866825, now seen corresponding path program 1 times [2021-12-18 22:08:40,842 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:08:40,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841294924] [2021-12-18 22:08:40,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:08:40,842 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:08:40,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:40,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 22:08:40,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:40,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 22:08:40,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:40,961 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-18 22:08:40,962 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:08:40,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841294924] [2021-12-18 22:08:40,962 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841294924] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:08:40,962 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:08:40,962 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-18 22:08:40,962 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594398032] [2021-12-18 22:08:40,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:08:40,963 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-18 22:08:40,963 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:08:40,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-18 22:08:40,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-12-18 22:08:40,964 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:08:41,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:08:41,178 INFO L93 Difference]: Finished difference Result 142 states and 155 transitions. [2021-12-18 22:08:41,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-18 22:08:41,178 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2021-12-18 22:08:41,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:08:41,179 INFO L225 Difference]: With dead ends: 142 [2021-12-18 22:08:41,179 INFO L226 Difference]: Without dead ends: 142 [2021-12-18 22:08:41,179 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2021-12-18 22:08:41,180 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 312 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 22:08:41,180 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [312 Valid, 479 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 22:08:41,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2021-12-18 22:08:41,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 76. [2021-12-18 22:08:41,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 53 states have (on average 1.5471698113207548) internal successors, (82), 72 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:08:41,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2021-12-18 22:08:41,184 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 30 [2021-12-18 22:08:41,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:08:41,184 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2021-12-18 22:08:41,184 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:08:41,184 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2021-12-18 22:08:41,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-18 22:08:41,185 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:08:41,185 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, 1] [2021-12-18 22:08:41,185 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-18 22:08:41,185 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:08:41,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:08:41,186 INFO L85 PathProgramCache]: Analyzing trace with hash 2031866826, now seen corresponding path program 1 times [2021-12-18 22:08:41,186 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:08:41,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925304009] [2021-12-18 22:08:41,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:08:41,186 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:08:41,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:41,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 22:08:41,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:41,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 22:08:41,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:41,246 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-18 22:08:41,246 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:08:41,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925304009] [2021-12-18 22:08:41,247 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925304009] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:08:41,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457708386] [2021-12-18 22:08:41,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:08:41,247 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:08:41,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 22:08:41,264 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-18 22:08:41,265 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-18 22:08:41,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:41,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-18 22:08:41,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:08:41,385 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-18 22:08:41,385 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 22:08:41,386 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1457708386] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:08:41,386 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-18 22:08:41,386 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2021-12-18 22:08:41,386 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633559818] [2021-12-18 22:08:41,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:08:41,386 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 22:08:41,387 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:08:41,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 22:08:41,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-18 22:08:41,387 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:08:41,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:08:41,420 INFO L93 Difference]: Finished difference Result 104 states and 117 transitions. [2021-12-18 22:08:41,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 22:08:41,421 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2021-12-18 22:08:41,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:08:41,421 INFO L225 Difference]: With dead ends: 104 [2021-12-18 22:08:41,421 INFO L226 Difference]: Without dead ends: 104 [2021-12-18 22:08:41,422 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-12-18 22:08:41,422 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 117 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 22:08:41,422 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 216 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 22:08:41,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-12-18 22:08:41,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 79. [2021-12-18 22:08:41,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 56 states have (on average 1.5178571428571428) internal successors, (85), 75 states have internal predecessors, (85), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:08:41,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2021-12-18 22:08:41,425 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 30 [2021-12-18 22:08:41,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:08:41,426 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2021-12-18 22:08:41,426 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:08:41,426 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2021-12-18 22:08:41,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-18 22:08:41,427 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:08:41,427 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, 1] [2021-12-18 22:08:41,445 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-18 22:08:41,642 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:08:41,643 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:08:41,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:08:41,643 INFO L85 PathProgramCache]: Analyzing trace with hash 2031866881, now seen corresponding path program 1 times [2021-12-18 22:08:41,643 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:08:41,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166942289] [2021-12-18 22:08:41,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:08:41,645 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:08:41,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:41,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 22:08:41,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:41,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 22:08:41,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:41,810 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 22:08:41,810 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:08:41,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166942289] [2021-12-18 22:08:41,810 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166942289] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:08:41,810 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:08:41,810 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-18 22:08:41,810 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111924708] [2021-12-18 22:08:41,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:08:41,811 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-18 22:08:41,811 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:08:41,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-18 22:08:41,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-12-18 22:08:41,819 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:08:42,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:08:42,025 INFO L93 Difference]: Finished difference Result 127 states and 140 transitions. [2021-12-18 22:08:42,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-18 22:08:42,026 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2021-12-18 22:08:42,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:08:42,026 INFO L225 Difference]: With dead ends: 127 [2021-12-18 22:08:42,027 INFO L226 Difference]: Without dead ends: 127 [2021-12-18 22:08:42,027 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2021-12-18 22:08:42,027 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 307 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 22:08:42,027 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [307 Valid, 500 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 22:08:42,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-12-18 22:08:42,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 79. [2021-12-18 22:08:42,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 75 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:08:42,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2021-12-18 22:08:42,030 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 30 [2021-12-18 22:08:42,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:08:42,030 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2021-12-18 22:08:42,030 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:08:42,031 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2021-12-18 22:08:42,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-18 22:08:42,031 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:08:42,031 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, 1, 1, 1, 1] [2021-12-18 22:08:42,032 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-18 22:08:42,032 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:08:42,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:08:42,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1922829059, now seen corresponding path program 1 times [2021-12-18 22:08:42,032 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:08:42,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736613759] [2021-12-18 22:08:42,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:08:42,033 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:08:42,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:42,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 22:08:42,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:42,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 22:08:42,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:42,229 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 22:08:42,229 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:08:42,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736613759] [2021-12-18 22:08:42,230 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736613759] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:08:42,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2088701905] [2021-12-18 22:08:42,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:08:42,230 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:08:42,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 22:08:42,236 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-18 22:08:42,275 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-18 22:08:42,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:42,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 53 conjunts are in the unsatisfiable core [2021-12-18 22:08:42,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:08:42,349 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-18 22:08:42,416 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 22:08:42,417 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-18 22:08:42,432 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-18 22:08:42,457 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 22:08:42,457 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2021-12-18 22:08:42,579 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-18 22:08:42,604 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 22:08:42,604 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:08:42,647 INFO L354 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2021-12-18 22:08:42,647 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 19 treesize of output 18 [2021-12-18 22:08:42,651 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_703 (Array Int Int))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_703) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) is different from false [2021-12-18 22:08:42,674 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_703 (Array Int Int))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_703) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) is different from false [2021-12-18 22:08:42,679 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:08:42,679 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2021-12-18 22:08:42,681 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 30 treesize of output 22 [2021-12-18 22:08:42,683 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 9 treesize of output 7 [2021-12-18 22:08:42,734 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2088701905] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:08:42,735 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 22:08:42,735 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 23 [2021-12-18 22:08:42,735 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634272663] [2021-12-18 22:08:42,735 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 22:08:42,736 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-12-18 22:08:42,736 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:08:42,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-12-18 22:08:42,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=549, Unknown=2, NotChecked=94, Total=702 [2021-12-18 22:08:42,737 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 20 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:08:43,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:08:43,246 INFO L93 Difference]: Finished difference Result 125 states and 138 transitions. [2021-12-18 22:08:43,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-18 22:08:43,247 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 20 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2021-12-18 22:08:43,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:08:43,248 INFO L225 Difference]: With dead ends: 125 [2021-12-18 22:08:43,248 INFO L226 Difference]: Without dead ends: 125 [2021-12-18 22:08:43,248 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 33 SyntacticMatches, 9 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=157, Invalid=1039, Unknown=2, NotChecked=134, Total=1332 [2021-12-18 22:08:43,249 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 180 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 22:08:43,249 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [180 Valid, 857 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 22:08:43,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-12-18 22:08:43,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 94. [2021-12-18 22:08:43,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 70 states have (on average 1.4428571428571428) internal successors, (101), 89 states have internal predecessors, (101), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-18 22:08:43,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 107 transitions. [2021-12-18 22:08:43,253 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 107 transitions. Word has length 33 [2021-12-18 22:08:43,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:08:43,253 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 107 transitions. [2021-12-18 22:08:43,253 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 20 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:08:43,253 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 107 transitions. [2021-12-18 22:08:43,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-18 22:08:43,254 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:08:43,254 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, 1, 1, 1, 1] [2021-12-18 22:08:43,271 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-18 22:08:43,454 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:08:43,454 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:08:43,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:08:43,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1922829058, now seen corresponding path program 1 times [2021-12-18 22:08:43,455 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:08:43,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243583705] [2021-12-18 22:08:43,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:08:43,455 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:08:43,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:43,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 22:08:43,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:43,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 22:08:43,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:43,855 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 22:08:43,855 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:08:43,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243583705] [2021-12-18 22:08:43,856 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243583705] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:08:43,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879324735] [2021-12-18 22:08:43,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:08:43,856 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:08:43,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 22:08:43,861 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-18 22:08:43,862 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-18 22:08:43,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:43,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 81 conjunts are in the unsatisfiable core [2021-12-18 22:08:43,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:08:43,968 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-18 22:08:43,973 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-18 22:08:44,160 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 22:08:44,160 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-18 22:08:44,163 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-18 22:08:44,216 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-18 22:08:44,219 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-18 22:08:44,279 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 22:08:44,279 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2021-12-18 22:08:44,289 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-18 22:08:44,392 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-18 22:08:44,394 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-18 22:08:44,401 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 22:08:44,401 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:08:44,551 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_820 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_820) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4))) (forall ((v_ArrVal_820 (Array Int Int)) (v_ArrVal_819 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_820) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_819) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) is different from false [2021-12-18 22:08:44,564 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_820 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_820) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 4))) (forall ((v_ArrVal_820 (Array Int Int)) (v_ArrVal_819 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_820) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_819) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))) is different from false [2021-12-18 22:08:44,572 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:08:44,572 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2021-12-18 22:08:44,573 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 34 treesize of output 26 [2021-12-18 22:08:44,578 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2021-12-18 22:08:44,585 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:08:44,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2021-12-18 22:08:44,588 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:08:44,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2021-12-18 22:08:44,589 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:08:44,590 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2021-12-18 22:08:44,592 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:08:44,593 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2021-12-18 22:08:44,705 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [879324735] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:08:44,705 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 22:08:44,705 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 31 [2021-12-18 22:08:44,705 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619112079] [2021-12-18 22:08:44,705 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 22:08:44,706 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-12-18 22:08:44,706 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:08:44,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-12-18 22:08:44,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1528, Unknown=2, NotChecked=158, Total=1806 [2021-12-18 22:08:44,707 INFO L87 Difference]: Start difference. First operand 94 states and 107 transitions. Second operand has 32 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 27 states have internal predecessors, (49), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-18 22:08:45,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:08:45,403 INFO L93 Difference]: Finished difference Result 205 states and 228 transitions. [2021-12-18 22:08:45,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-18 22:08:45,403 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 27 states have internal predecessors, (49), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2021-12-18 22:08:45,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:08:45,404 INFO L225 Difference]: With dead ends: 205 [2021-12-18 22:08:45,404 INFO L226 Difference]: Without dead ends: 205 [2021-12-18 22:08:45,405 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=266, Invalid=2290, Unknown=2, NotChecked=198, Total=2756 [2021-12-18 22:08:45,405 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 559 mSDsluCounter, 1527 mSDsCounter, 0 mSdLazyCounter, 912 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 559 SdHoareTripleChecker+Valid, 1621 SdHoareTripleChecker+Invalid, 1034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 86 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-18 22:08:45,406 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [559 Valid, 1621 Invalid, 1034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 912 Invalid, 0 Unknown, 86 Unchecked, 0.4s Time] [2021-12-18 22:08:45,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2021-12-18 22:08:45,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 102. [2021-12-18 22:08:45,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 78 states have (on average 1.435897435897436) internal successors, (112), 97 states have internal predecessors, (112), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-18 22:08:45,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 118 transitions. [2021-12-18 22:08:45,408 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 118 transitions. Word has length 33 [2021-12-18 22:08:45,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:08:45,408 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 118 transitions. [2021-12-18 22:08:45,409 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 27 states have internal predecessors, (49), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-18 22:08:45,409 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 118 transitions. [2021-12-18 22:08:45,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-18 22:08:45,409 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:08:45,409 INFO L514 BasicCegarLoop]: trace histogram [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, 1] [2021-12-18 22:08:45,427 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-12-18 22:08:45,609 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,SelfDestructingSolverStorable11 [2021-12-18 22:08:45,610 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:08:45,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:08:45,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1020012727, now seen corresponding path program 2 times [2021-12-18 22:08:45,611 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:08:45,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356325761] [2021-12-18 22:08:45,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:08:45,611 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:08:45,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:45,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 22:08:45,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:45,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 22:08:45,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:45,693 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-18 22:08:45,693 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:08:45,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356325761] [2021-12-18 22:08:45,694 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356325761] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:08:45,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811997100] [2021-12-18 22:08:45,694 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 22:08:45,694 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:08:45,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 22:08:45,708 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-18 22:08:45,799 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-18 22:08:45,878 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-18 22:08:45,878 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 22:08:45,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-18 22:08:45,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:08:45,932 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-18 22:08:45,932 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 22:08:45,932 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1811997100] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:08:45,932 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-18 22:08:45,932 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 8 [2021-12-18 22:08:45,933 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218208076] [2021-12-18 22:08:45,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:08:45,934 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 22:08:45,934 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:08:45,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 22:08:45,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-18 22:08:45,935 INFO L87 Difference]: Start difference. First operand 102 states and 118 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:08:45,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:08:45,976 INFO L93 Difference]: Finished difference Result 98 states and 110 transitions. [2021-12-18 22:08:45,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 22:08:45,977 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2021-12-18 22:08:45,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:08:45,979 INFO L225 Difference]: With dead ends: 98 [2021-12-18 22:08:45,979 INFO L226 Difference]: Without dead ends: 98 [2021-12-18 22:08:45,979 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-12-18 22:08:45,980 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 156 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 22:08:45,980 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 135 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 22:08:45,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-12-18 22:08:45,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2021-12-18 22:08:45,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 76 states have (on average 1.368421052631579) internal successors, (104), 93 states have internal predecessors, (104), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-18 22:08:45,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 110 transitions. [2021-12-18 22:08:45,983 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 110 transitions. Word has length 36 [2021-12-18 22:08:45,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:08:45,984 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 110 transitions. [2021-12-18 22:08:45,984 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:08:45,984 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 110 transitions. [2021-12-18 22:08:45,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-18 22:08:45,987 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:08:45,988 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:08:46,021 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-18 22:08:46,201 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:08:46,202 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:08:46,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:08:46,202 INFO L85 PathProgramCache]: Analyzing trace with hash 999795886, now seen corresponding path program 1 times [2021-12-18 22:08:46,202 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:08:46,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721194230] [2021-12-18 22:08:46,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:08:46,203 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:08:46,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:46,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 22:08:46,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:46,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 22:08:46,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:46,295 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-18 22:08:46,296 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:08:46,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721194230] [2021-12-18 22:08:46,296 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721194230] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:08:46,296 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:08:46,296 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-18 22:08:46,296 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577272206] [2021-12-18 22:08:46,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:08:46,297 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-18 22:08:46,297 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:08:46,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-18 22:08:46,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-12-18 22:08:46,297 INFO L87 Difference]: Start difference. First operand 98 states and 110 transitions. Second operand has 11 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:08:46,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:08:46,504 INFO L93 Difference]: Finished difference Result 123 states and 136 transitions. [2021-12-18 22:08:46,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-18 22:08:46,504 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 40 [2021-12-18 22:08:46,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:08:46,505 INFO L225 Difference]: With dead ends: 123 [2021-12-18 22:08:46,505 INFO L226 Difference]: Without dead ends: 123 [2021-12-18 22:08:46,505 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2021-12-18 22:08:46,506 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 280 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 22:08:46,506 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [280 Valid, 314 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 22:08:46,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-12-18 22:08:46,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 101. [2021-12-18 22:08:46,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 79 states have (on average 1.3924050632911393) internal successors, (110), 96 states have internal predecessors, (110), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-18 22:08:46,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 116 transitions. [2021-12-18 22:08:46,510 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 116 transitions. Word has length 40 [2021-12-18 22:08:46,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:08:46,510 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 116 transitions. [2021-12-18 22:08:46,510 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:08:46,511 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 116 transitions. [2021-12-18 22:08:46,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-18 22:08:46,513 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:08:46,513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:08:46,513 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-18 22:08:46,513 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:08:46,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:08:46,514 INFO L85 PathProgramCache]: Analyzing trace with hash 999795887, now seen corresponding path program 1 times [2021-12-18 22:08:46,514 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:08:46,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206672254] [2021-12-18 22:08:46,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:08:46,515 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:08:46,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:46,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 22:08:46,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:46,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 22:08:46,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:46,586 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-18 22:08:46,586 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:08:46,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206672254] [2021-12-18 22:08:46,586 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206672254] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:08:46,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129681478] [2021-12-18 22:08:46,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:08:46,587 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:08:46,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 22:08:46,594 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-18 22:08:46,596 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-18 22:08:46,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:46,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-18 22:08:46,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:08:46,771 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-18 22:08:46,771 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:08:46,825 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-18 22:08:46,826 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [129681478] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 22:08:46,826 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 22:08:46,826 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 7 [2021-12-18 22:08:46,826 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012248208] [2021-12-18 22:08:46,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 22:08:46,827 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-18 22:08:46,827 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:08:46,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-18 22:08:46,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-18 22:08:46,827 INFO L87 Difference]: Start difference. First operand 101 states and 116 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-18 22:08:46,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:08:46,879 INFO L93 Difference]: Finished difference Result 132 states and 151 transitions. [2021-12-18 22:08:46,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 22:08:46,880 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2021-12-18 22:08:46,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:08:46,880 INFO L225 Difference]: With dead ends: 132 [2021-12-18 22:08:46,880 INFO L226 Difference]: Without dead ends: 132 [2021-12-18 22:08:46,882 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-12-18 22:08:46,883 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 144 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 22:08:46,883 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [144 Valid, 240 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 22:08:46,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2021-12-18 22:08:46,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 124. [2021-12-18 22:08:46,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 102 states have (on average 1.411764705882353) internal successors, (144), 119 states have internal predecessors, (144), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-18 22:08:46,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 150 transitions. [2021-12-18 22:08:46,887 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 150 transitions. Word has length 40 [2021-12-18 22:08:46,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:08:46,887 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 150 transitions. [2021-12-18 22:08:46,887 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-18 22:08:46,888 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 150 transitions. [2021-12-18 22:08:46,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-18 22:08:46,889 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:08:46,889 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2021-12-18 22:08:46,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-18 22:08:47,107 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:08:47,107 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:08:47,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:08:47,108 INFO L85 PathProgramCache]: Analyzing trace with hash 968760597, now seen corresponding path program 1 times [2021-12-18 22:08:47,109 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:08:47,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738929909] [2021-12-18 22:08:47,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:08:47,109 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:08:47,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:47,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 22:08:47,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:47,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 22:08:47,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:47,191 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-18 22:08:47,192 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:08:47,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738929909] [2021-12-18 22:08:47,192 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738929909] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:08:47,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820996324] [2021-12-18 22:08:47,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:08:47,193 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:08:47,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 22:08:47,212 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-18 22:08:47,242 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-18 22:08:47,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:47,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-18 22:08:47,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:08:47,418 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-18 22:08:47,419 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:08:47,467 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-18 22:08:47,468 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [820996324] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 22:08:47,468 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 22:08:47,468 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 8 [2021-12-18 22:08:47,468 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36297234] [2021-12-18 22:08:47,468 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 22:08:47,469 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 22:08:47,469 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:08:47,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 22:08:47,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-18 22:08:47,469 INFO L87 Difference]: Start difference. First operand 124 states and 150 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-18 22:08:47,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:08:47,550 INFO L93 Difference]: Finished difference Result 122 states and 138 transitions. [2021-12-18 22:08:47,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-18 22:08:47,551 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2021-12-18 22:08:47,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:08:47,551 INFO L225 Difference]: With dead ends: 122 [2021-12-18 22:08:47,552 INFO L226 Difference]: Without dead ends: 122 [2021-12-18 22:08:47,552 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-12-18 22:08:47,552 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 195 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 22:08:47,552 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [195 Valid, 265 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 22:08:47,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2021-12-18 22:08:47,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 108. [2021-12-18 22:08:47,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 86 states have (on average 1.4186046511627908) internal successors, (122), 103 states have internal predecessors, (122), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-18 22:08:47,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 128 transitions. [2021-12-18 22:08:47,555 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 128 transitions. Word has length 41 [2021-12-18 22:08:47,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:08:47,555 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 128 transitions. [2021-12-18 22:08:47,555 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-18 22:08:47,555 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 128 transitions. [2021-12-18 22:08:47,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-18 22:08:47,556 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:08:47,556 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:08:47,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-18 22:08:47,773 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,SelfDestructingSolverStorable15 [2021-12-18 22:08:47,773 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:08:47,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:08:47,774 INFO L85 PathProgramCache]: Analyzing trace with hash -192932373, now seen corresponding path program 3 times [2021-12-18 22:08:47,774 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:08:47,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700586397] [2021-12-18 22:08:47,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:08:47,774 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:08:47,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:47,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 22:08:47,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:47,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 22:08:47,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:47,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-18 22:08:47,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:47,828 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-18 22:08:47,828 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:08:47,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700586397] [2021-12-18 22:08:47,829 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700586397] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:08:47,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1825197221] [2021-12-18 22:08:47,829 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-18 22:08:47,829 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:08:47,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 22:08:47,837 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-18 22:08:47,891 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-18 22:08:48,043 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-12-18 22:08:48,043 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 22:08:48,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-18 22:08:48,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:08:48,103 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-18 22:08:48,104 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 22:08:48,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1825197221] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:08:48,104 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-18 22:08:48,104 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2021-12-18 22:08:48,105 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569636547] [2021-12-18 22:08:48,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:08:48,106 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 22:08:48,106 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:08:48,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 22:08:48,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-18 22:08:48,106 INFO L87 Difference]: Start difference. First operand 108 states and 128 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-18 22:08:48,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:08:48,113 INFO L93 Difference]: Finished difference Result 92 states and 109 transitions. [2021-12-18 22:08:48,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-18 22:08:48,114 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 45 [2021-12-18 22:08:48,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:08:48,115 INFO L225 Difference]: With dead ends: 92 [2021-12-18 22:08:48,115 INFO L226 Difference]: Without dead ends: 92 [2021-12-18 22:08:48,115 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-18 22:08:48,116 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 58 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 22:08:48,116 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 93 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 22:08:48,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-12-18 22:08:48,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2021-12-18 22:08:48,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 73 states have (on average 1.4383561643835616) internal successors, (105), 88 states have internal predecessors, (105), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:08:48,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 109 transitions. [2021-12-18 22:08:48,118 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 109 transitions. Word has length 45 [2021-12-18 22:08:48,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:08:48,118 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 109 transitions. [2021-12-18 22:08:48,118 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-18 22:08:48,119 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 109 transitions. [2021-12-18 22:08:48,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-18 22:08:48,120 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:08:48,120 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:08:48,138 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-18 22:08:48,338 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,SelfDestructingSolverStorable16 [2021-12-18 22:08:48,338 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:08:48,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:08:48,339 INFO L85 PathProgramCache]: Analyzing trace with hash 884092027, now seen corresponding path program 2 times [2021-12-18 22:08:48,339 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:08:48,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680066774] [2021-12-18 22:08:48,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:08:48,339 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:08:48,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:48,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 22:08:48,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:48,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 22:08:48,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:48,465 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-18 22:08:48,465 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:08:48,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680066774] [2021-12-18 22:08:48,466 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680066774] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:08:48,466 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:08:48,466 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-18 22:08:48,466 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138965510] [2021-12-18 22:08:48,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:08:48,466 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-18 22:08:48,467 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:08:48,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-18 22:08:48,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-12-18 22:08:48,467 INFO L87 Difference]: Start difference. First operand 92 states and 109 transitions. Second operand has 11 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:08:48,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:08:48,676 INFO L93 Difference]: Finished difference Result 132 states and 148 transitions. [2021-12-18 22:08:48,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-18 22:08:48,677 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2021-12-18 22:08:48,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:08:48,677 INFO L225 Difference]: With dead ends: 132 [2021-12-18 22:08:48,677 INFO L226 Difference]: Without dead ends: 132 [2021-12-18 22:08:48,678 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2021-12-18 22:08:48,679 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 409 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 22:08:48,680 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [409 Valid, 294 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 22:08:48,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2021-12-18 22:08:48,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 92. [2021-12-18 22:08:48,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 73 states have (on average 1.3835616438356164) internal successors, (101), 88 states have internal predecessors, (101), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:08:48,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 105 transitions. [2021-12-18 22:08:48,686 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 105 transitions. Word has length 45 [2021-12-18 22:08:48,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:08:48,686 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 105 transitions. [2021-12-18 22:08:48,686 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:08:48,686 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 105 transitions. [2021-12-18 22:08:48,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-12-18 22:08:48,687 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:08:48,687 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:08:48,687 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-18 22:08:48,687 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:08:48,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:08:48,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1246140989, now seen corresponding path program 1 times [2021-12-18 22:08:48,688 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:08:48,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469936902] [2021-12-18 22:08:48,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:08:48,688 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:08:48,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:48,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 22:08:48,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:48,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 22:08:48,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:48,759 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-18 22:08:48,759 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:08:48,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469936902] [2021-12-18 22:08:48,760 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469936902] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:08:48,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304364029] [2021-12-18 22:08:48,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:08:48,760 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:08:48,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 22:08:48,776 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-18 22:08:48,779 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-18 22:08:48,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:48,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-18 22:08:48,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:08:48,973 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-12-18 22:08:48,974 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 22:08:48,974 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304364029] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:08:48,974 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-18 22:08:48,974 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 8 [2021-12-18 22:08:48,976 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366432507] [2021-12-18 22:08:48,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:08:48,976 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 22:08:48,977 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:08:48,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 22:08:48,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-18 22:08:48,977 INFO L87 Difference]: Start difference. First operand 92 states and 105 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:08:49,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:08:49,019 INFO L93 Difference]: Finished difference Result 88 states and 97 transitions. [2021-12-18 22:08:49,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 22:08:49,020 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 48 [2021-12-18 22:08:49,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:08:49,020 INFO L225 Difference]: With dead ends: 88 [2021-12-18 22:08:49,020 INFO L226 Difference]: Without dead ends: 88 [2021-12-18 22:08:49,020 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-12-18 22:08:49,021 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 124 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 22:08:49,021 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 143 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 22:08:49,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-12-18 22:08:49,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2021-12-18 22:08:49,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 84 states have internal predecessors, (93), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:08:49,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2021-12-18 22:08:49,023 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 48 [2021-12-18 22:08:49,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:08:49,024 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2021-12-18 22:08:49,024 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:08:49,024 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2021-12-18 22:08:49,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-12-18 22:08:49,024 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:08:49,024 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:08:49,054 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-18 22:08:49,237 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:08:49,238 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:08:49,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:08:49,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1246140934, now seen corresponding path program 1 times [2021-12-18 22:08:49,239 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:08:49,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698578643] [2021-12-18 22:08:49,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:08:49,239 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:08:49,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:49,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 22:08:49,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:49,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 22:08:49,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:49,750 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 22:08:49,751 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:08:49,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698578643] [2021-12-18 22:08:49,751 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698578643] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:08:49,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759530993] [2021-12-18 22:08:49,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:08:49,752 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:08:49,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 22:08:49,780 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-18 22:08:49,781 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-18 22:08:49,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:49,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 74 conjunts are in the unsatisfiable core [2021-12-18 22:08:49,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:08:49,927 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-18 22:08:50,037 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 22:08:50,037 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-18 22:08:50,087 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-18 22:08:50,176 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 22:08:50,176 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2021-12-18 22:08:50,419 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 22:08:50,420 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2021-12-18 22:08:50,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:08:50,492 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 26 [2021-12-18 22:08:50,556 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-18 22:08:50,573 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-18 22:08:50,574 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:08:53,048 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1756 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1756) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1)) is different from false [2021-12-18 22:08:53,053 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1756 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_1756) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1)) is different from false [2021-12-18 22:08:53,107 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1756 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_1756) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) 1)) is different from false [2021-12-18 22:08:53,171 INFO L354 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2021-12-18 22:08:53,171 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 29 treesize of output 28 [2021-12-18 22:08:53,174 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1756 (Array Int Int)) (v_ArrVal_1755 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1755))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1756)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from false [2021-12-18 22:08:53,181 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1756 (Array Int Int)) (v_ArrVal_1755 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1755))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_1756)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from false [2021-12-18 22:08:53,195 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:08:53,195 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 29 [2021-12-18 22:08:53,197 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 136 treesize of output 112 [2021-12-18 22:08:53,205 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 108 treesize of output 98 [2021-12-18 22:08:53,207 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 98 treesize of output 94 [2021-12-18 22:08:53,326 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759530993] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:08:53,326 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 22:08:53,327 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 39 [2021-12-18 22:08:53,327 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869525014] [2021-12-18 22:08:53,327 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 22:08:53,327 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-12-18 22:08:53,327 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:08:53,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-12-18 22:08:53,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1797, Unknown=54, NotChecked=450, Total=2450 [2021-12-18 22:08:53,328 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand has 40 states, 39 states have (on average 1.9487179487179487) internal successors, (76), 35 states have internal predecessors, (76), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-18 22:08:54,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:08:54,275 INFO L93 Difference]: Finished difference Result 145 states and 156 transitions. [2021-12-18 22:08:54,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-18 22:08:54,276 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.9487179487179487) internal successors, (76), 35 states have internal predecessors, (76), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 48 [2021-12-18 22:08:54,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:08:54,276 INFO L225 Difference]: With dead ends: 145 [2021-12-18 22:08:54,277 INFO L226 Difference]: Without dead ends: 145 [2021-12-18 22:08:54,277 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 49 SyntacticMatches, 6 SemanticMatches, 64 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=387, Invalid=3239, Unknown=54, NotChecked=610, Total=4290 [2021-12-18 22:08:54,278 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 471 mSDsluCounter, 1048 mSDsCounter, 0 mSdLazyCounter, 980 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 1092 SdHoareTripleChecker+Invalid, 1018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 22:08:54,278 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [471 Valid, 1092 Invalid, 1018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 980 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-18 22:08:54,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2021-12-18 22:08:54,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 87. [2021-12-18 22:08:54,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 83 states have internal predecessors, (91), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:08:54,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2021-12-18 22:08:54,281 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 48 [2021-12-18 22:08:54,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:08:54,281 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2021-12-18 22:08:54,281 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.9487179487179487) internal successors, (76), 35 states have internal predecessors, (76), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-18 22:08:54,281 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2021-12-18 22:08:54,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-12-18 22:08:54,282 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:08:54,282 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:08:54,302 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-18 22:08:54,495 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:08:54,495 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:08:54,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:08:54,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1246140935, now seen corresponding path program 1 times [2021-12-18 22:08:54,496 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:08:54,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109573872] [2021-12-18 22:08:54,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:08:54,496 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:08:54,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:54,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 22:08:54,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:55,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 22:08:55,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:55,099 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 22:08:55,100 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:08:55,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109573872] [2021-12-18 22:08:55,100 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109573872] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:08:55,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896614703] [2021-12-18 22:08:55,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:08:55,100 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:08:55,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 22:08:55,101 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-18 22:08:55,103 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-18 22:08:55,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:55,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 105 conjunts are in the unsatisfiable core [2021-12-18 22:08:55,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:08:55,266 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-18 22:08:55,270 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-18 22:08:55,512 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 22:08:55,512 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-18 22:08:55,528 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: line 246361 column 46: unknown constant v_#length_BEFORE_CALL_6 [2021-12-18 22:08:55,529 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-18 22:08:55,529 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2021-12-18 22:08:55,529 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824025335] [2021-12-18 22:08:55,529 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-18 22:08:55,530 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-18 22:08:55,530 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:08:55,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-18 22:08:55,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=742, Unknown=0, NotChecked=0, Total=812 [2021-12-18 22:08:55,531 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand has 26 states, 25 states have (on average 1.76) internal successors, (44), 23 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:08:55,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-18 22:08:55,531 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 14 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=70, Invalid=742, Unknown=0, NotChecked=0, Total=812 [2021-12-18 22:08:55,532 INFO L933 BasicCegarLoop]: 1 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, 1 SdHoareTripleChecker+Invalid, 1 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-18 22:08:55,532 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 22:08:55,555 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-18 22:08:55,750 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,SelfDestructingSolverStorable20 [2021-12-18 22:08:55,751 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@4ae5e050 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:360) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:206) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:131) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.checkInternal(ChainingHoareTripleChecker.java:455) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.checkInternal(ChainingHoareTripleChecker.java:103) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) 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-18 22:08:55,754 INFO L158 Benchmark]: Toolchain (without parser) took 18829.74ms. Allocated memory was 119.5MB in the beginning and 251.7MB in the end (delta: 132.1MB). Free memory was 84.7MB in the beginning and 85.4MB in the end (delta: -714.4kB). Peak memory consumption was 130.6MB. Max. memory is 16.1GB. [2021-12-18 22:08:55,755 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 79.7MB. Free memory was 39.9MB in the beginning and 39.9MB in the end (delta: 37.0kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-18 22:08:55,755 INFO L158 Benchmark]: CACSL2BoogieTranslator took 325.45ms. Allocated memory is still 119.5MB. Free memory was 84.5MB in the beginning and 87.1MB in the end (delta: -2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-18 22:08:55,755 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.10ms. Allocated memory is still 119.5MB. Free memory was 87.1MB in the beginning and 85.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-18 22:08:55,755 INFO L158 Benchmark]: Boogie Preprocessor took 33.99ms. Allocated memory is still 119.5MB. Free memory was 85.0MB in the beginning and 83.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-18 22:08:55,755 INFO L158 Benchmark]: RCFGBuilder took 361.52ms. Allocated memory is still 119.5MB. Free memory was 83.7MB in the beginning and 67.5MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2021-12-18 22:08:55,755 INFO L158 Benchmark]: TraceAbstraction took 18063.32ms. Allocated memory was 119.5MB in the beginning and 251.7MB in the end (delta: 132.1MB). Free memory was 66.9MB in the beginning and 85.4MB in the end (delta: -18.5MB). Peak memory consumption was 116.6MB. Max. memory is 16.1GB. [2021-12-18 22:08:55,756 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.13ms. Allocated memory is still 79.7MB. Free memory was 39.9MB in the beginning and 39.9MB in the end (delta: 37.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 325.45ms. Allocated memory is still 119.5MB. Free memory was 84.5MB in the beginning and 87.1MB in the end (delta: -2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.10ms. Allocated memory is still 119.5MB. Free memory was 87.1MB in the beginning and 85.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.99ms. Allocated memory is still 119.5MB. Free memory was 85.0MB in the beginning and 83.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 361.52ms. Allocated memory is still 119.5MB. Free memory was 83.7MB in the beginning and 67.5MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 18063.32ms. Allocated memory was 119.5MB in the beginning and 251.7MB in the end (delta: 132.1MB). Free memory was 66.9MB in the beginning and 85.4MB in the end (delta: -18.5MB). Peak memory consumption was 116.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@4ae5e050 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@4ae5e050: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-12-18 22:08:55,772 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 1 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-simple/sll2c_update_all_reverse.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 4fecbd384f63aa34e01807a3a6735a322a2435f1312f0df3ed763fde7f43fe0a --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-18 22:08:57,448 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-18 22:08:57,450 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-18 22:08:57,491 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-18 22:08:57,491 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-18 22:08:57,492 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-18 22:08:57,493 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-18 22:08:57,496 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-18 22:08:57,499 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-18 22:08:57,500 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-18 22:08:57,501 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-18 22:08:57,502 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-18 22:08:57,502 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-18 22:08:57,504 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-18 22:08:57,505 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-18 22:08:57,507 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-18 22:08:57,509 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-18 22:08:57,511 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-18 22:08:57,512 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-18 22:08:57,515 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-18 22:08:57,518 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-18 22:08:57,521 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-18 22:08:57,521 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-18 22:08:57,522 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-18 22:08:57,526 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-18 22:08:57,526 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-18 22:08:57,526 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-18 22:08:57,527 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-18 22:08:57,532 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-18 22:08:57,533 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-18 22:08:57,533 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-18 22:08:57,533 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-18 22:08:57,534 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-18 22:08:57,534 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-18 22:08:57,535 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-18 22:08:57,535 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-18 22:08:57,536 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-18 22:08:57,536 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-18 22:08:57,536 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-18 22:08:57,537 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-18 22:08:57,537 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-18 22:08:57,539 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-12-18 22:08:57,557 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-18 22:08:57,557 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-18 22:08:57,557 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-18 22:08:57,558 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-18 22:08:57,558 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-18 22:08:57,558 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-18 22:08:57,559 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-18 22:08:57,559 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-18 22:08:57,559 INFO L138 SettingsManager]: * Use SBE=true [2021-12-18 22:08:57,559 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-18 22:08:57,560 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-18 22:08:57,560 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-18 22:08:57,560 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-18 22:08:57,560 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-18 22:08:57,560 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-18 22:08:57,560 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-18 22:08:57,561 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-18 22:08:57,561 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-18 22:08:57,561 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-18 22:08:57,561 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-18 22:08:57,561 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-18 22:08:57,562 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-18 22:08:57,562 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-18 22:08:57,562 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-18 22:08:57,562 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-18 22:08:57,562 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-18 22:08:57,562 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-18 22:08:57,563 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 22:08:57,563 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-18 22:08:57,563 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-18 22:08:57,563 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-18 22:08:57,563 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-18 22:08:57,563 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-18 22:08:57,564 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-18 22:08:57,564 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 -> 4fecbd384f63aa34e01807a3a6735a322a2435f1312f0df3ed763fde7f43fe0a [2021-12-18 22:08:57,825 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-18 22:08:57,851 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-18 22:08:57,853 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-18 22:08:57,854 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-18 22:08:57,856 INFO L275 PluginConnector]: CDTParser initialized [2021-12-18 22:08:57,857 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i [2021-12-18 22:08:57,896 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4791115f6/8f8739c02f2748f3b452bc002db9195d/FLAG7d459c967 [2021-12-18 22:08:58,266 INFO L306 CDTParser]: Found 1 translation units. [2021-12-18 22:08:58,267 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i [2021-12-18 22:08:58,273 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4791115f6/8f8739c02f2748f3b452bc002db9195d/FLAG7d459c967 [2021-12-18 22:08:58,283 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4791115f6/8f8739c02f2748f3b452bc002db9195d [2021-12-18 22:08:58,284 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-18 22:08:58,285 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-18 22:08:58,286 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-18 22:08:58,286 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-18 22:08:58,288 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-18 22:08:58,288 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:08:58" (1/1) ... [2021-12-18 22:08:58,289 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64421a8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:58, skipping insertion in model container [2021-12-18 22:08:58,289 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:08:58" (1/1) ... [2021-12-18 22:08:58,293 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-18 22:08:58,314 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-18 22:08:58,524 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i[24436,24449] [2021-12-18 22:08:58,530 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 22:08:58,544 INFO L203 MainTranslator]: Completed pre-run [2021-12-18 22:08:58,570 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i[24436,24449] [2021-12-18 22:08:58,571 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 22:08:58,593 INFO L208 MainTranslator]: Completed translation [2021-12-18 22:08:58,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:58 WrapperNode [2021-12-18 22:08:58,594 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-18 22:08:58,595 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-18 22:08:58,596 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-18 22:08:58,596 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-18 22:08:58,600 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:58" (1/1) ... [2021-12-18 22:08:58,618 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:58" (1/1) ... [2021-12-18 22:08:58,635 INFO L137 Inliner]: procedures = 129, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 133 [2021-12-18 22:08:58,639 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-18 22:08:58,639 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-18 22:08:58,640 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-18 22:08:58,640 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-18 22:08:58,645 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:58" (1/1) ... [2021-12-18 22:08:58,646 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:58" (1/1) ... [2021-12-18 22:08:58,654 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:58" (1/1) ... [2021-12-18 22:08:58,655 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:58" (1/1) ... [2021-12-18 22:08:58,666 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:58" (1/1) ... [2021-12-18 22:08:58,676 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:58" (1/1) ... [2021-12-18 22:08:58,678 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:58" (1/1) ... [2021-12-18 22:08:58,680 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-18 22:08:58,681 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-18 22:08:58,681 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-18 22:08:58,681 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-18 22:08:58,682 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:58" (1/1) ... [2021-12-18 22:08:58,693 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 22:08:58,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 22:08:58,714 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-18 22:08:58,721 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-18 22:08:58,736 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-18 22:08:58,737 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-12-18 22:08:58,737 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-12-18 22:08:58,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-18 22:08:58,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-18 22:08:58,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-18 22:08:58,737 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-18 22:08:58,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-18 22:08:58,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-18 22:08:58,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-18 22:08:58,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-18 22:08:58,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-18 22:08:58,816 INFO L236 CfgBuilder]: Building ICFG [2021-12-18 22:08:58,817 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-18 22:08:59,125 INFO L277 CfgBuilder]: Performing block encoding [2021-12-18 22:08:59,129 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-18 22:08:59,130 INFO L301 CfgBuilder]: Removed 6 assume(true) statements. [2021-12-18 22:08:59,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:08:59 BoogieIcfgContainer [2021-12-18 22:08:59,131 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-18 22:08:59,132 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-18 22:08:59,132 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-18 22:08:59,134 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-18 22:08:59,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 10:08:58" (1/3) ... [2021-12-18 22:08:59,134 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6659c55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:08:59, skipping insertion in model container [2021-12-18 22:08:59,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:58" (2/3) ... [2021-12-18 22:08:59,135 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6659c55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:08:59, skipping insertion in model container [2021-12-18 22:08:59,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:08:59" (3/3) ... [2021-12-18 22:08:59,136 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_update_all_reverse.i [2021-12-18 22:08:59,139 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-18 22:08:59,139 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2021-12-18 22:08:59,172 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-18 22:08:59,179 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-18 22:08:59,180 INFO L340 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2021-12-18 22:08:59,198 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 51 states have (on average 1.8431372549019607) internal successors, (94), 79 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:08:59,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-18 22:08:59,208 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:08:59,209 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-18 22:08:59,209 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:08:59,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:08:59,213 INFO L85 PathProgramCache]: Analyzing trace with hash 894505749, now seen corresponding path program 1 times [2021-12-18 22:08:59,221 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:08:59,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2006477035] [2021-12-18 22:08:59,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:08:59,222 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:08:59,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:08:59,241 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-18 22:08:59,291 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-18 22:08:59,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:59,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-18 22:08:59,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:08:59,424 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-18 22:08:59,437 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-18 22:08:59,438 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 22:08:59,438 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:08:59,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2006477035] [2021-12-18 22:08:59,439 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2006477035] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:08:59,439 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:08:59,440 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 22:08:59,441 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484051612] [2021-12-18 22:08:59,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:08:59,445 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 22:08:59,445 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:08:59,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 22:08:59,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 22:08:59,469 INFO L87 Difference]: Start difference. First operand has 83 states, 51 states have (on average 1.8431372549019607) internal successors, (94), 79 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:08:59,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:08:59,575 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2021-12-18 22:08:59,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 22:08:59,578 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-12-18 22:08:59,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:08:59,583 INFO L225 Difference]: With dead ends: 81 [2021-12-18 22:08:59,583 INFO L226 Difference]: Without dead ends: 78 [2021-12-18 22:08:59,584 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-18 22:08:59,587 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 8 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 22:08:59,588 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 135 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 22:08:59,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-12-18 22:08:59,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2021-12-18 22:08:59,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 49 states have (on average 1.653061224489796) internal successors, (81), 74 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:08:59,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2021-12-18 22:08:59,616 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 6 [2021-12-18 22:08:59,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:08:59,617 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2021-12-18 22:08:59,617 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:08:59,617 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2021-12-18 22:08:59,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-18 22:08:59,617 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:08:59,617 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-18 22:08:59,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-18 22:08:59,823 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-18 22:08:59,824 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:08:59,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:08:59,825 INFO L85 PathProgramCache]: Analyzing trace with hash 894505750, now seen corresponding path program 1 times [2021-12-18 22:08:59,826 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:08:59,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [305073994] [2021-12-18 22:08:59,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:08:59,826 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:08:59,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:08:59,831 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-18 22:08:59,832 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-18 22:08:59,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:08:59,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-18 22:08:59,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:08:59,901 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-18 22:08:59,915 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-18 22:08:59,915 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 22:08:59,915 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:08:59,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [305073994] [2021-12-18 22:08:59,915 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [305073994] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:08:59,916 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:08:59,916 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 22:08:59,916 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154439858] [2021-12-18 22:08:59,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:08:59,917 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 22:08:59,917 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:08:59,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 22:08:59,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 22:08:59,922 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:09:00,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:09:00,000 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2021-12-18 22:09:00,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 22:09:00,001 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-12-18 22:09:00,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:09:00,001 INFO L225 Difference]: With dead ends: 76 [2021-12-18 22:09:00,001 INFO L226 Difference]: Without dead ends: 76 [2021-12-18 22:09:00,002 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-18 22:09:00,002 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 4 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 22:09:00,003 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 137 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 22:09:00,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-12-18 22:09:00,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2021-12-18 22:09:00,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 49 states have (on average 1.6122448979591837) internal successors, (79), 72 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:09:00,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2021-12-18 22:09:00,008 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 6 [2021-12-18 22:09:00,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:09:00,008 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2021-12-18 22:09:00,008 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:09:00,008 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2021-12-18 22:09:00,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-18 22:09:00,009 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:09:00,009 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:09:00,026 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-12-18 22:09:00,215 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-18 22:09:00,217 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:09:00,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:09:00,218 INFO L85 PathProgramCache]: Analyzing trace with hash -835957545, now seen corresponding path program 1 times [2021-12-18 22:09:00,218 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:09:00,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [948453806] [2021-12-18 22:09:00,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:09:00,219 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:09:00,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:09:00,220 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-18 22:09:00,221 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-18 22:09:00,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:09:00,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-18 22:09:00,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:09:00,298 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-18 22:09:00,298 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 22:09:00,299 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:09:00,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [948453806] [2021-12-18 22:09:00,299 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [948453806] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:09:00,299 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:09:00,299 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 22:09:00,299 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94593450] [2021-12-18 22:09:00,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:09:00,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 22:09:00,300 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:09:00,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 22:09:00,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 22:09:00,301 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-18 22:09:00,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:09:00,308 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2021-12-18 22:09:00,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 22:09:00,308 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2021-12-18 22:09:00,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:09:00,309 INFO L225 Difference]: With dead ends: 83 [2021-12-18 22:09:00,309 INFO L226 Difference]: Without dead ends: 83 [2021-12-18 22:09:00,309 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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-18 22:09:00,310 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 5 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 22:09:00,310 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 159 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 22:09:00,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-12-18 22:09:00,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 77. [2021-12-18 22:09:00,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 50 states have (on average 1.6) internal successors, (80), 73 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:09:00,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2021-12-18 22:09:00,315 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 13 [2021-12-18 22:09:00,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:09:00,316 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2021-12-18 22:09:00,316 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-18 22:09:00,316 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2021-12-18 22:09:00,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-18 22:09:00,317 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:09:00,317 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:09:00,347 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-18 22:09:00,525 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-18 22:09:00,525 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:09:00,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:09:00,526 INFO L85 PathProgramCache]: Analyzing trace with hash -125034980, now seen corresponding path program 1 times [2021-12-18 22:09:00,526 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:09:00,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1515711155] [2021-12-18 22:09:00,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:09:00,526 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:09:00,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:09:00,527 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-18 22:09:00,530 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-18 22:09:00,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:09:00,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-18 22:09:00,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:09:00,662 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-18 22:09:00,712 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 22:09:00,712 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 22:09:00,712 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:09:00,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1515711155] [2021-12-18 22:09:00,715 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1515711155] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:09:00,715 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:09:00,715 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 22:09:00,715 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038494593] [2021-12-18 22:09:00,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:09:00,716 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 22:09:00,716 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:09:00,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 22:09:00,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 22:09:00,717 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:09:00,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:09:00,883 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2021-12-18 22:09:00,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 22:09:00,883 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2021-12-18 22:09:00,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:09:00,885 INFO L225 Difference]: With dead ends: 97 [2021-12-18 22:09:00,885 INFO L226 Difference]: Without dead ends: 97 [2021-12-18 22:09:00,885 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 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-18 22:09:00,886 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 68 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 22:09:00,886 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 227 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 22:09:00,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-12-18 22:09:00,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 76. [2021-12-18 22:09:00,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 50 states have (on average 1.58) internal successors, (79), 72 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:09:00,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2021-12-18 22:09:00,890 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 22 [2021-12-18 22:09:00,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:09:00,890 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2021-12-18 22:09:00,890 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:09:00,891 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2021-12-18 22:09:00,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-18 22:09:00,891 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:09:00,891 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:09:00,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-18 22:09:01,098 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-18 22:09:01,098 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:09:01,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:09:01,098 INFO L85 PathProgramCache]: Analyzing trace with hash -125034979, now seen corresponding path program 1 times [2021-12-18 22:09:01,099 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:09:01,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1394413877] [2021-12-18 22:09:01,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:09:01,099 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:09:01,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:09:01,100 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-18 22:09:01,107 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-18 22:09:01,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:09:01,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-18 22:09:01,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:09:01,196 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-18 22:09:01,257 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 22:09:01,257 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 22:09:01,257 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:09:01,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1394413877] [2021-12-18 22:09:01,258 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1394413877] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:09:01,258 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:09:01,258 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 22:09:01,258 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952722608] [2021-12-18 22:09:01,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:09:01,258 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 22:09:01,258 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:09:01,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 22:09:01,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 22:09:01,259 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:09:01,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:09:01,403 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2021-12-18 22:09:01,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 22:09:01,403 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2021-12-18 22:09:01,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:09:01,404 INFO L225 Difference]: With dead ends: 76 [2021-12-18 22:09:01,404 INFO L226 Difference]: Without dead ends: 76 [2021-12-18 22:09:01,404 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 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-18 22:09:01,405 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 69 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 22:09:01,405 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 236 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 22:09:01,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-12-18 22:09:01,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2021-12-18 22:09:01,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 50 states have (on average 1.56) internal successors, (78), 71 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:09:01,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2021-12-18 22:09:01,408 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 22 [2021-12-18 22:09:01,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:09:01,408 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2021-12-18 22:09:01,408 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:09:01,408 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2021-12-18 22:09:01,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-18 22:09:01,409 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:09:01,409 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:09:01,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-12-18 22:09:01,615 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-18 22:09:01,616 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:09:01,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:09:01,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1180454715, now seen corresponding path program 1 times [2021-12-18 22:09:01,616 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:09:01,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [934236406] [2021-12-18 22:09:01,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:09:01,617 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:09:01,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:09:01,618 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-18 22:09:01,619 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-18 22:09:01,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:09:01,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-18 22:09:01,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:09:01,709 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-18 22:09:01,840 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-18 22:09:01,841 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-18 22:09:01,856 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 22:09:01,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:09:02,061 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 22:09:02,061 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:09:02,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [934236406] [2021-12-18 22:09:02,062 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [934236406] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 22:09:02,062 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 22:09:02,062 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2021-12-18 22:09:02,062 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315735846] [2021-12-18 22:09:02,062 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 22:09:02,063 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 22:09:02,063 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:09:02,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 22:09:02,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-18 22:09:02,063 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-18 22:09:02,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:09:02,226 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2021-12-18 22:09:02,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-18 22:09:02,227 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2021-12-18 22:09:02,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:09:02,227 INFO L225 Difference]: With dead ends: 101 [2021-12-18 22:09:02,227 INFO L226 Difference]: Without dead ends: 101 [2021-12-18 22:09:02,228 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-12-18 22:09:02,228 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 62 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 36 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 22:09:02,228 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 314 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 36 Unchecked, 0.1s Time] [2021-12-18 22:09:02,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-12-18 22:09:02,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 81. [2021-12-18 22:09:02,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 76 states have internal predecessors, (83), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:09:02,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2021-12-18 22:09:02,232 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 25 [2021-12-18 22:09:02,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:09:02,232 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2021-12-18 22:09:02,232 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-18 22:09:02,232 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2021-12-18 22:09:02,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-18 22:09:02,233 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:09:02,233 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:09:02,255 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-18 22:09:02,441 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-18 22:09:02,441 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:09:02,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:09:02,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1180454714, now seen corresponding path program 1 times [2021-12-18 22:09:02,442 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:09:02,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [291904609] [2021-12-18 22:09:02,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:09:02,442 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:09:02,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:09:02,443 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-18 22:09:02,445 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-18 22:09:02,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:09:02,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-18 22:09:02,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:09:02,579 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-18 22:09:02,584 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-18 22:09:02,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:09:02,769 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-18 22:09:02,775 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 22:09:02,775 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-18 22:09:02,809 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 22:09:02,809 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:09:02,983 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:09:02,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [291904609] [2021-12-18 22:09:02,984 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [291904609] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:09:02,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [3893219] [2021-12-18 22:09:02,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:09:02,984 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-18 22:09:02,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-18 22:09:02,985 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-18 22:09:02,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2021-12-18 22:09:03,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:09:03,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-18 22:09:03,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:09:03,125 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-18 22:09:03,129 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-18 22:09:03,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:09:03,262 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-18 22:09:03,269 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 22:09:03,269 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-18 22:09:03,290 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 22:09:03,290 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:09:05,445 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [3893219] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:09:05,445 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 22:09:05,445 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2021-12-18 22:09:05,445 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965200995] [2021-12-18 22:09:05,445 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 22:09:05,446 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 22:09:05,446 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:09:05,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 22:09:05,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-12-18 22:09:05,446 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:09:05,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:09:05,731 INFO L93 Difference]: Finished difference Result 163 states and 177 transitions. [2021-12-18 22:09:05,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-18 22:09:05,732 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2021-12-18 22:09:05,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:09:05,733 INFO L225 Difference]: With dead ends: 163 [2021-12-18 22:09:05,733 INFO L226 Difference]: Without dead ends: 163 [2021-12-18 22:09:05,733 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-12-18 22:09:05,733 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 139 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 22:09:05,734 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 331 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 177 Invalid, 0 Unknown, 47 Unchecked, 0.2s Time] [2021-12-18 22:09:05,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-12-18 22:09:05,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 87. [2021-12-18 22:09:05,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 61 states have (on average 1.459016393442623) internal successors, (89), 81 states have internal predecessors, (89), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-18 22:09:05,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2021-12-18 22:09:05,738 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 25 [2021-12-18 22:09:05,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:09:05,738 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2021-12-18 22:09:05,738 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:09:05,738 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2021-12-18 22:09:05,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-18 22:09:05,739 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:09:05,739 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, 1] [2021-12-18 22:09:05,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2021-12-18 22:09:05,946 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-18 22:09:06,142 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 22:09:06,142 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:09:06,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:09:06,142 INFO L85 PathProgramCache]: Analyzing trace with hash 2031866825, now seen corresponding path program 1 times [2021-12-18 22:09:06,142 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:09:06,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [713737672] [2021-12-18 22:09:06,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:09:06,143 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:09:06,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:09:06,144 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-18 22:09:06,145 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-18 22:09:06,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:09:06,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-18 22:09:06,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:09:06,290 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-18 22:09:06,291 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 22:09:06,291 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:09:06,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [713737672] [2021-12-18 22:09:06,291 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [713737672] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:09:06,291 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:09:06,291 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 22:09:06,291 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937807978] [2021-12-18 22:09:06,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:09:06,292 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 22:09:06,292 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:09:06,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 22:09:06,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 22:09:06,293 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:09:06,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:09:06,343 INFO L93 Difference]: Finished difference Result 118 states and 128 transitions. [2021-12-18 22:09:06,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 22:09:06,344 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2021-12-18 22:09:06,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:09:06,344 INFO L225 Difference]: With dead ends: 118 [2021-12-18 22:09:06,344 INFO L226 Difference]: Without dead ends: 118 [2021-12-18 22:09:06,345 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 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-18 22:09:06,345 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 124 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 22:09:06,345 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 223 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 22:09:06,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-12-18 22:09:06,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 90. [2021-12-18 22:09:06,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 64 states have (on average 1.4375) internal successors, (92), 84 states have internal predecessors, (92), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-18 22:09:06,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 98 transitions. [2021-12-18 22:09:06,349 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 98 transitions. Word has length 30 [2021-12-18 22:09:06,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:09:06,349 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 98 transitions. [2021-12-18 22:09:06,350 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:09:06,350 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 98 transitions. [2021-12-18 22:09:06,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-18 22:09:06,350 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:09:06,350 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, 1] [2021-12-18 22:09:06,365 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-18 22:09:06,558 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-18 22:09:06,558 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:09:06,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:09:06,559 INFO L85 PathProgramCache]: Analyzing trace with hash 2031866881, now seen corresponding path program 1 times [2021-12-18 22:09:06,559 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:09:06,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1371760934] [2021-12-18 22:09:06,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:09:06,559 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:09:06,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:09:06,560 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-18 22:09:06,562 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-18 22:09:06,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:09:06,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-18 22:09:06,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:09:06,666 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-18 22:09:06,842 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 22:09:06,842 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 22:09:06,843 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:09:06,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1371760934] [2021-12-18 22:09:06,843 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1371760934] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:09:06,843 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:09:06,843 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-18 22:09:06,843 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310361284] [2021-12-18 22:09:06,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:09:06,843 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-18 22:09:06,843 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:09:06,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-18 22:09:06,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-18 22:09:06,844 INFO L87 Difference]: Start difference. First operand 90 states and 98 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:09:07,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:09:07,348 INFO L93 Difference]: Finished difference Result 142 states and 155 transitions. [2021-12-18 22:09:07,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 22:09:07,349 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2021-12-18 22:09:07,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:09:07,350 INFO L225 Difference]: With dead ends: 142 [2021-12-18 22:09:07,350 INFO L226 Difference]: Without dead ends: 142 [2021-12-18 22:09:07,350 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2021-12-18 22:09:07,350 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 315 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-18 22:09:07,351 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [315 Valid, 430 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-18 22:09:07,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2021-12-18 22:09:07,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 93. [2021-12-18 22:09:07,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 67 states have (on average 1.462686567164179) internal successors, (98), 87 states have internal predecessors, (98), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-18 22:09:07,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 104 transitions. [2021-12-18 22:09:07,354 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 104 transitions. Word has length 30 [2021-12-18 22:09:07,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:09:07,354 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 104 transitions. [2021-12-18 22:09:07,354 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:09:07,354 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 104 transitions. [2021-12-18 22:09:07,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-18 22:09:07,354 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:09:07,355 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, 1] [2021-12-18 22:09:07,362 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-18 22:09:07,563 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-18 22:09:07,563 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:09:07,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:09:07,564 INFO L85 PathProgramCache]: Analyzing trace with hash 2031866880, now seen corresponding path program 1 times [2021-12-18 22:09:07,564 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:09:07,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [740540690] [2021-12-18 22:09:07,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:09:07,565 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:09:07,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:09:07,565 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-18 22:09:07,567 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-18 22:09:07,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:09:07,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-18 22:09:07,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:09:07,677 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-18 22:09:07,768 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 22:09:07,768 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 22:09:07,768 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:09:07,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [740540690] [2021-12-18 22:09:07,768 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [740540690] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:09:07,768 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:09:07,768 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-18 22:09:07,768 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92169671] [2021-12-18 22:09:07,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:09:07,768 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-18 22:09:07,768 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:09:07,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-18 22:09:07,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-18 22:09:07,769 INFO L87 Difference]: Start difference. First operand 93 states and 104 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:09:08,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:09:08,152 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2021-12-18 22:09:08,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 22:09:08,153 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2021-12-18 22:09:08,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:09:08,154 INFO L225 Difference]: With dead ends: 113 [2021-12-18 22:09:08,154 INFO L226 Difference]: Without dead ends: 113 [2021-12-18 22:09:08,154 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2021-12-18 22:09:08,154 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 294 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 22:09:08,154 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [294 Valid, 293 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-18 22:09:08,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-12-18 22:09:08,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 93. [2021-12-18 22:09:08,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 67 states have (on average 1.4328358208955223) internal successors, (96), 87 states have internal predecessors, (96), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-18 22:09:08,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2021-12-18 22:09:08,157 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 30 [2021-12-18 22:09:08,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:09:08,157 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2021-12-18 22:09:08,158 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:09:08,158 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2021-12-18 22:09:08,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-18 22:09:08,158 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:09:08,158 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, 1, 1, 1, 1] [2021-12-18 22:09:08,166 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-18 22:09:08,365 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-18 22:09:08,366 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:09:08,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:09:08,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1922829059, now seen corresponding path program 1 times [2021-12-18 22:09:08,366 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:09:08,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [991008775] [2021-12-18 22:09:08,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:09:08,366 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:09:08,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:09:08,367 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-18 22:09:08,370 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-18 22:09:08,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:09:08,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 31 conjunts are in the unsatisfiable core [2021-12-18 22:09:08,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:09:08,504 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-18 22:09:08,597 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 22:09:08,598 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-18 22:09:08,651 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-18 22:09:08,728 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 22:09:08,729 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2021-12-18 22:09:08,848 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 27 treesize of output 15 [2021-12-18 22:09:08,893 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 22:09:08,893 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:09:09,024 INFO L354 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2021-12-18 22:09:09,024 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 23 treesize of output 22 [2021-12-18 22:09:09,031 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_364) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) is different from false [2021-12-18 22:09:09,041 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_364) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) is different from false [2021-12-18 22:09:09,050 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:09:09,051 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2021-12-18 22:09:09,066 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 30 treesize of output 22 [2021-12-18 22:09:09,069 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 9 treesize of output 7 [2021-12-18 22:09:09,178 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:09:09,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [991008775] [2021-12-18 22:09:09,178 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [991008775] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:09:09,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1432817825] [2021-12-18 22:09:09,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:09:09,178 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-18 22:09:09,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-18 22:09:09,192 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-18 22:09:09,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2021-12-18 22:09:09,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:09:09,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 36 conjunts are in the unsatisfiable core [2021-12-18 22:09:09,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:09:09,366 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-18 22:09:09,595 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-18 22:09:09,595 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-18 22:09:09,709 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-18 22:09:09,835 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 22:09:09,836 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2021-12-18 22:09:10,050 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 29 treesize of output 17 [2021-12-18 22:09:10,179 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 22:09:10,180 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:09:10,207 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_409 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_409) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (_ bv1 1)))) is different from false [2021-12-18 22:09:10,218 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_409 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_409) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (_ bv1 1)))) is different from false [2021-12-18 22:09:10,227 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:09:10,227 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2021-12-18 22:09:10,229 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 38 treesize of output 30 [2021-12-18 22:09:10,233 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 13 treesize of output 11 [2021-12-18 22:09:14,550 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1432817825] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:09:14,550 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 22:09:14,550 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 30 [2021-12-18 22:09:14,550 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291588556] [2021-12-18 22:09:14,550 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 22:09:14,551 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-12-18 22:09:14,551 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:09:14,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-12-18 22:09:14,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1371, Unknown=5, NotChecked=308, Total=1806 [2021-12-18 22:09:14,552 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand has 31 states, 30 states have (on average 1.6) internal successors, (48), 27 states have internal predecessors, (48), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-18 22:09:15,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:09:15,765 INFO L93 Difference]: Finished difference Result 133 states and 145 transitions. [2021-12-18 22:09:15,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-18 22:09:15,766 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.6) internal successors, (48), 27 states have internal predecessors, (48), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2021-12-18 22:09:15,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:09:15,767 INFO L225 Difference]: With dead ends: 133 [2021-12-18 22:09:15,767 INFO L226 Difference]: Without dead ends: 133 [2021-12-18 22:09:15,768 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=254, Invalid=1827, Unknown=5, NotChecked=364, Total=2450 [2021-12-18 22:09:15,768 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 208 mSDsluCounter, 1006 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 168 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-18 22:09:15,768 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 1056 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 511 Invalid, 0 Unknown, 168 Unchecked, 0.5s Time] [2021-12-18 22:09:15,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-12-18 22:09:15,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 102. [2021-12-18 22:09:15,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 76 states have (on average 1.4210526315789473) internal successors, (108), 96 states have internal predecessors, (108), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-18 22:09:15,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 114 transitions. [2021-12-18 22:09:15,771 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 114 transitions. Word has length 33 [2021-12-18 22:09:15,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:09:15,771 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 114 transitions. [2021-12-18 22:09:15,771 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.6) internal successors, (48), 27 states have internal predecessors, (48), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-18 22:09:15,771 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 114 transitions. [2021-12-18 22:09:15,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-18 22:09:15,772 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:09:15,772 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, 1, 1, 1, 1] [2021-12-18 22:09:15,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Forceful destruction successful, exit code 0 [2021-12-18 22:09:15,985 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-18 22:09:16,177 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 22:09:16,177 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:09:16,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:09:16,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1922829058, now seen corresponding path program 1 times [2021-12-18 22:09:16,178 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:09:16,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1638544476] [2021-12-18 22:09:16,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:09:16,178 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:09:16,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:09:16,195 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-18 22:09:16,197 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-18 22:09:16,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:09:16,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 44 conjunts are in the unsatisfiable core [2021-12-18 22:09:16,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:09:16,340 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-18 22:09:16,345 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-18 22:09:16,554 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 22:09:16,555 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-18 22:09:16,570 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 22:09:16,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 14 treesize of output 14 [2021-12-18 22:09:16,646 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-18 22:09:16,653 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-18 22:09:16,780 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 22:09:16,780 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2021-12-18 22:09:16,795 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-18 22:09:16,946 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-18 22:09:16,951 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-18 22:09:17,004 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 22:09:17,004 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:09:17,521 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_458) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_458) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_459) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) is different from false [2021-12-18 22:09:17,567 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_458) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_458) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_459) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))) is different from false [2021-12-18 22:09:17,578 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:09:17,578 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2021-12-18 22:09:17,583 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:09:17,583 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2021-12-18 22:09:17,586 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 52 treesize of output 44 [2021-12-18 22:09:17,588 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 82 treesize of output 70 [2021-12-18 22:09:17,590 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 66 treesize of output 62 [2021-12-18 22:09:17,594 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-18 22:09:17,677 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:09:17,677 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 30 [2021-12-18 22:09:17,679 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 44 treesize of output 32 [2021-12-18 22:09:17,682 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-12-18 22:09:18,079 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:09:18,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1638544476] [2021-12-18 22:09:18,079 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1638544476] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:09:18,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [504129901] [2021-12-18 22:09:18,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:09:18,079 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-18 22:09:18,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-18 22:09:18,080 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-18 22:09:18,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2021-12-18 22:09:18,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:09:18,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 48 conjunts are in the unsatisfiable core [2021-12-18 22:09:18,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:09:18,285 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-18 22:09:18,291 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-18 22:09:18,556 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 22:09:18,556 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-18 22:09:18,570 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 22:09:18,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 14 treesize of output 14 [2021-12-18 22:09:18,715 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-18 22:09:18,719 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-18 22:09:18,888 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 22:09:18,888 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2021-12-18 22:09:18,891 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-18 22:09:19,165 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-18 22:09:19,168 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-18 22:09:19,179 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 22:09:19,180 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:09:19,308 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_511 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_511) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_510 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_511 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_511) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_510) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) is different from false [2021-12-18 22:09:19,336 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_511 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_511) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_510 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_511 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_511) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_510) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))) is different from false [2021-12-18 22:09:19,348 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:09:19,348 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2021-12-18 22:09:19,353 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:09:19,354 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2021-12-18 22:09:19,356 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 52 treesize of output 44 [2021-12-18 22:09:19,358 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 82 treesize of output 70 [2021-12-18 22:09:19,363 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2021-12-18 22:09:19,364 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 58 [2021-12-18 22:09:19,453 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:09:19,453 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 30 [2021-12-18 22:09:19,454 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 44 treesize of output 32 [2021-12-18 22:09:19,457 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-12-18 22:09:19,748 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [504129901] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:09:19,748 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 22:09:19,748 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 28 [2021-12-18 22:09:19,748 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64113595] [2021-12-18 22:09:19,748 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 22:09:19,749 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-12-18 22:09:19,749 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:09:19,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-12-18 22:09:19,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1307, Unknown=4, NotChecked=300, Total=1722 [2021-12-18 22:09:19,750 INFO L87 Difference]: Start difference. First operand 102 states and 114 transitions. Second operand has 29 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 25 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-18 22:09:21,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:09:21,501 INFO L93 Difference]: Finished difference Result 213 states and 235 transitions. [2021-12-18 22:09:21,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-18 22:09:21,501 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 25 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2021-12-18 22:09:21,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:09:21,502 INFO L225 Difference]: With dead ends: 213 [2021-12-18 22:09:21,502 INFO L226 Difference]: Without dead ends: 213 [2021-12-18 22:09:21,502 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 47 SyntacticMatches, 5 SemanticMatches, 49 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=232, Invalid=1942, Unknown=4, NotChecked=372, Total=2550 [2021-12-18 22:09:21,503 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 782 mSDsluCounter, 1451 mSDsCounter, 0 mSdLazyCounter, 844 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 782 SdHoareTripleChecker+Valid, 1546 SdHoareTripleChecker+Invalid, 1004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 130 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-18 22:09:21,503 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [782 Valid, 1546 Invalid, 1004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 844 Invalid, 0 Unknown, 130 Unchecked, 1.1s Time] [2021-12-18 22:09:21,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2021-12-18 22:09:21,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 110. [2021-12-18 22:09:21,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 84 states have (on average 1.4166666666666667) internal successors, (119), 104 states have internal predecessors, (119), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-18 22:09:21,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 125 transitions. [2021-12-18 22:09:21,507 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 125 transitions. Word has length 33 [2021-12-18 22:09:21,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:09:21,507 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 125 transitions. [2021-12-18 22:09:21,507 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 25 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-18 22:09:21,507 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 125 transitions. [2021-12-18 22:09:21,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-18 22:09:21,511 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:09:21,511 INFO L514 BasicCegarLoop]: trace histogram [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, 1] [2021-12-18 22:09:21,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Forceful destruction successful, exit code 0 [2021-12-18 22:09:21,722 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-18 22:09:21,914 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 22:09:21,914 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:09:21,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:09:21,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1020012727, now seen corresponding path program 2 times [2021-12-18 22:09:21,915 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:09:21,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1668856224] [2021-12-18 22:09:21,915 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 22:09:21,915 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:09:21,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:09:21,916 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-18 22:09:21,918 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-18 22:09:22,056 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-18 22:09:22,056 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 22:09:22,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-18 22:09:22,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:09:22,122 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-18 22:09:22,130 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:09:22,240 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-18 22:09:22,241 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:09:22,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1668856224] [2021-12-18 22:09:22,241 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1668856224] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 22:09:22,241 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 22:09:22,241 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2021-12-18 22:09:22,241 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743602448] [2021-12-18 22:09:22,241 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 22:09:22,241 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-18 22:09:22,241 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:09:22,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-18 22:09:22,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-12-18 22:09:22,242 INFO L87 Difference]: Start difference. First operand 110 states and 125 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-18 22:09:22,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:09:22,520 INFO L93 Difference]: Finished difference Result 401 states and 442 transitions. [2021-12-18 22:09:22,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-18 22:09:22,521 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 36 [2021-12-18 22:09:22,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:09:22,522 INFO L225 Difference]: With dead ends: 401 [2021-12-18 22:09:22,523 INFO L226 Difference]: Without dead ends: 401 [2021-12-18 22:09:22,523 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=356, Unknown=0, NotChecked=0, Total=506 [2021-12-18 22:09:22,523 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 1178 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1178 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 22:09:22,524 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1178 Valid, 416 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 22:09:22,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2021-12-18 22:09:22,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 129. [2021-12-18 22:09:22,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 103 states have (on average 1.3883495145631068) internal successors, (143), 123 states have internal predecessors, (143), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-18 22:09:22,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 149 transitions. [2021-12-18 22:09:22,529 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 149 transitions. Word has length 36 [2021-12-18 22:09:22,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:09:22,530 INFO L470 AbstractCegarLoop]: Abstraction has 129 states and 149 transitions. [2021-12-18 22:09:22,530 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-18 22:09:22,530 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 149 transitions. [2021-12-18 22:09:22,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-18 22:09:22,531 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:09:22,531 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:09:22,539 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-18 22:09:22,736 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-18 22:09:22,736 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:09:22,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:09:22,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1813078092, now seen corresponding path program 2 times [2021-12-18 22:09:22,737 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:09:22,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1982969518] [2021-12-18 22:09:22,737 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 22:09:22,737 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:09:22,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:09:22,738 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-18 22:09:22,750 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-18 22:09:22,868 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-18 22:09:22,868 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 22:09:22,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-18 22:09:22,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:09:22,929 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-18 22:09:22,929 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:09:23,002 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-18 22:09:23,003 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:09:23,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1982969518] [2021-12-18 22:09:23,003 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1982969518] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 22:09:23,003 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 22:09:23,003 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-12-18 22:09:23,003 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743945406] [2021-12-18 22:09:23,003 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 22:09:23,003 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 22:09:23,003 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:09:23,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 22:09:23,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-18 22:09:23,004 INFO L87 Difference]: Start difference. First operand 129 states and 149 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-18 22:09:23,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:09:23,020 INFO L93 Difference]: Finished difference Result 107 states and 120 transitions. [2021-12-18 22:09:23,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-18 22:09:23,027 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 37 [2021-12-18 22:09:23,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:09:23,027 INFO L225 Difference]: With dead ends: 107 [2021-12-18 22:09:23,027 INFO L226 Difference]: Without dead ends: 107 [2021-12-18 22:09:23,027 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-18 22:09:23,028 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 124 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 22:09:23,028 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 161 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 22:09:23,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-12-18 22:09:23,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2021-12-18 22:09:23,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 83 states have (on average 1.3975903614457832) internal successors, (116), 102 states have internal predecessors, (116), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:09:23,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 120 transitions. [2021-12-18 22:09:23,030 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 120 transitions. Word has length 37 [2021-12-18 22:09:23,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:09:23,030 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 120 transitions. [2021-12-18 22:09:23,030 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-18 22:09:23,030 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 120 transitions. [2021-12-18 22:09:23,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-18 22:09:23,030 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:09:23,030 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:09:23,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Ended with exit code 0 [2021-12-18 22:09:23,231 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-18 22:09:23,231 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:09:23,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:09:23,231 INFO L85 PathProgramCache]: Analyzing trace with hash 999795886, now seen corresponding path program 1 times [2021-12-18 22:09:23,231 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:09:23,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [342492308] [2021-12-18 22:09:23,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:09:23,232 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:09:23,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:09:23,233 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-18 22:09:23,234 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-18 22:09:23,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:09:23,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-18 22:09:23,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:09:23,445 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-18 22:09:23,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:09:23,529 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-18 22:09:23,529 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:09:23,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [342492308] [2021-12-18 22:09:23,529 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [342492308] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 22:09:23,529 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 22:09:23,529 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-12-18 22:09:23,529 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443399488] [2021-12-18 22:09:23,529 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 22:09:23,530 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 22:09:23,530 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:09:23,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 22:09:23,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-18 22:09:23,530 INFO L87 Difference]: Start difference. First operand 107 states and 120 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-18 22:09:23,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:09:23,580 INFO L93 Difference]: Finished difference Result 141 states and 155 transitions. [2021-12-18 22:09:23,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 22:09:23,581 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2021-12-18 22:09:23,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:09:23,581 INFO L225 Difference]: With dead ends: 141 [2021-12-18 22:09:23,581 INFO L226 Difference]: Without dead ends: 141 [2021-12-18 22:09:23,581 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2021-12-18 22:09:23,582 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 201 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 22:09:23,582 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [201 Valid, 297 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 22:09:23,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-12-18 22:09:23,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 116. [2021-12-18 22:09:23,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 92 states have (on average 1.4130434782608696) internal successors, (130), 111 states have internal predecessors, (130), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:09:23,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 134 transitions. [2021-12-18 22:09:23,584 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 134 transitions. Word has length 40 [2021-12-18 22:09:23,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:09:23,584 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 134 transitions. [2021-12-18 22:09:23,584 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-18 22:09:23,584 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 134 transitions. [2021-12-18 22:09:23,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-18 22:09:23,585 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:09:23,585 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2021-12-18 22:09:23,594 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-18 22:09:23,785 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-18 22:09:23,785 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:09:23,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:09:23,786 INFO L85 PathProgramCache]: Analyzing trace with hash 968760597, now seen corresponding path program 1 times [2021-12-18 22:09:23,786 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:09:23,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1214928322] [2021-12-18 22:09:23,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:09:23,786 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:09:23,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:09:23,787 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-18 22:09:23,791 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-18 22:09:23,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:09:23,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-18 22:09:23,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:09:24,011 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-18 22:09:24,012 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:09:24,115 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-18 22:09:24,115 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:09:24,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1214928322] [2021-12-18 22:09:24,115 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1214928322] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 22:09:24,115 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 22:09:24,115 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2021-12-18 22:09:24,116 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133951569] [2021-12-18 22:09:24,116 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 22:09:24,116 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-18 22:09:24,116 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:09:24,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-18 22:09:24,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-12-18 22:09:24,116 INFO L87 Difference]: Start difference. First operand 116 states and 134 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-18 22:09:24,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:09:24,201 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2021-12-18 22:09:24,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-18 22:09:24,201 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2021-12-18 22:09:24,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:09:24,202 INFO L225 Difference]: With dead ends: 100 [2021-12-18 22:09:24,202 INFO L226 Difference]: Without dead ends: 100 [2021-12-18 22:09:24,202 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2021-12-18 22:09:24,202 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 325 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 22:09:24,203 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [325 Valid, 271 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 22:09:24,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-12-18 22:09:24,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 93. [2021-12-18 22:09:24,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 73 states have (on average 1.356164383561644) internal successors, (99), 88 states have internal predecessors, (99), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:09:24,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2021-12-18 22:09:24,204 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 41 [2021-12-18 22:09:24,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:09:24,205 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2021-12-18 22:09:24,205 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-18 22:09:24,205 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2021-12-18 22:09:24,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-18 22:09:24,205 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:09:24,205 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:09:24,215 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-18 22:09:24,405 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-18 22:09:24,406 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:09:24,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:09:24,406 INFO L85 PathProgramCache]: Analyzing trace with hash 884092026, now seen corresponding path program 2 times [2021-12-18 22:09:24,407 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:09:24,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1078441943] [2021-12-18 22:09:24,407 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 22:09:24,407 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:09:24,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:09:24,408 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-18 22:09:24,410 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-18 22:09:24,494 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-18 22:09:24,495 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 22:09:24,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-18 22:09:24,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:09:24,517 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-18 22:09:24,621 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-18 22:09:24,621 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 22:09:24,621 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:09:24,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1078441943] [2021-12-18 22:09:24,622 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1078441943] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:09:24,622 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:09:24,622 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-18 22:09:24,622 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578501225] [2021-12-18 22:09:24,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:09:24,622 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-18 22:09:24,622 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:09:24,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-18 22:09:24,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-18 22:09:24,622 INFO L87 Difference]: Start difference. First operand 93 states and 103 transitions. Second operand has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:09:24,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:09:24,939 INFO L93 Difference]: Finished difference Result 121 states and 135 transitions. [2021-12-18 22:09:24,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 22:09:24,940 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2021-12-18 22:09:24,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:09:24,940 INFO L225 Difference]: With dead ends: 121 [2021-12-18 22:09:24,940 INFO L226 Difference]: Without dead ends: 121 [2021-12-18 22:09:24,941 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2021-12-18 22:09:24,941 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 269 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 22:09:24,941 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [269 Valid, 264 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-18 22:09:24,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-12-18 22:09:24,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 99. [2021-12-18 22:09:24,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 79 states have (on average 1.4050632911392404) internal successors, (111), 94 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:09:24,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 115 transitions. [2021-12-18 22:09:24,943 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 115 transitions. Word has length 45 [2021-12-18 22:09:24,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:09:24,943 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 115 transitions. [2021-12-18 22:09:24,943 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:09:24,943 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 115 transitions. [2021-12-18 22:09:24,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-18 22:09:24,943 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:09:24,944 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:09:24,951 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-18 22:09:25,144 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-18 22:09:25,144 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:09:25,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:09:25,145 INFO L85 PathProgramCache]: Analyzing trace with hash 884092027, now seen corresponding path program 1 times [2021-12-18 22:09:25,145 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:09:25,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1911866976] [2021-12-18 22:09:25,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:09:25,145 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:09:25,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:09:25,146 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-18 22:09:25,147 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-18 22:09:25,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:09:25,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-18 22:09:25,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:09:25,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-18 22:09:25,472 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-18 22:09:25,473 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 22:09:25,473 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:09:25,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1911866976] [2021-12-18 22:09:25,473 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1911866976] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:09:25,473 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:09:25,473 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-18 22:09:25,474 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029842192] [2021-12-18 22:09:25,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:09:25,474 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-18 22:09:25,474 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:09:25,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-18 22:09:25,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-18 22:09:25,475 INFO L87 Difference]: Start difference. First operand 99 states and 115 transitions. Second operand has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:09:25,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:09:25,832 INFO L93 Difference]: Finished difference Result 139 states and 154 transitions. [2021-12-18 22:09:25,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 22:09:25,833 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2021-12-18 22:09:25,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:09:25,834 INFO L225 Difference]: With dead ends: 139 [2021-12-18 22:09:25,834 INFO L226 Difference]: Without dead ends: 139 [2021-12-18 22:09:25,834 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2021-12-18 22:09:25,835 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 409 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 22:09:25,835 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [409 Valid, 259 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-18 22:09:25,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-12-18 22:09:25,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 99. [2021-12-18 22:09:25,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 79 states have (on average 1.3544303797468353) internal successors, (107), 94 states have internal predecessors, (107), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:09:25,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2021-12-18 22:09:25,843 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 45 [2021-12-18 22:09:25,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:09:25,843 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2021-12-18 22:09:25,843 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-18 22:09:25,843 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2021-12-18 22:09:25,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-12-18 22:09:25,844 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:09:25,844 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:09:25,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Ended with exit code 0 [2021-12-18 22:09:26,049 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-18 22:09:26,049 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:09:26,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:09:26,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1246140989, now seen corresponding path program 1 times [2021-12-18 22:09:26,050 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:09:26,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1405376434] [2021-12-18 22:09:26,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:09:26,050 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:09:26,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:09:26,051 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-18 22:09:26,052 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-18 22:09:26,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:09:26,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-18 22:09:26,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:09:26,299 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-12-18 22:09:26,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:09:26,429 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-12-18 22:09:26,429 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:09:26,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1405376434] [2021-12-18 22:09:26,429 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1405376434] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 22:09:26,429 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 22:09:26,429 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2021-12-18 22:09:26,430 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634317478] [2021-12-18 22:09:26,430 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 22:09:26,430 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-18 22:09:26,430 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:09:26,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-18 22:09:26,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-12-18 22:09:26,430 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-18 22:09:26,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:09:26,620 INFO L93 Difference]: Finished difference Result 179 states and 189 transitions. [2021-12-18 22:09:26,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-18 22:09:26,620 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 48 [2021-12-18 22:09:26,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:09:26,621 INFO L225 Difference]: With dead ends: 179 [2021-12-18 22:09:26,621 INFO L226 Difference]: Without dead ends: 179 [2021-12-18 22:09:26,621 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2021-12-18 22:09:26,622 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 406 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 22:09:26,622 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [406 Valid, 408 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 22:09:26,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2021-12-18 22:09:26,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 101. [2021-12-18 22:09:26,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 81 states have (on average 1.308641975308642) internal successors, (106), 96 states have internal predecessors, (106), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:09:26,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2021-12-18 22:09:26,624 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 48 [2021-12-18 22:09:26,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:09:26,624 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2021-12-18 22:09:26,624 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-18 22:09:26,624 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2021-12-18 22:09:26,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-12-18 22:09:26,624 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:09:26,624 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:09:26,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2021-12-18 22:09:26,832 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-18 22:09:26,832 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:09:26,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:09:26,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1246140934, now seen corresponding path program 1 times [2021-12-18 22:09:26,833 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:09:26,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1319511885] [2021-12-18 22:09:26,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:09:26,833 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:09:26,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:09:26,834 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-18 22:09:26,835 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-18 22:09:27,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:09:27,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 47 conjunts are in the unsatisfiable core [2021-12-18 22:09:27,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:09:27,049 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-18 22:09:27,164 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 22:09:27,165 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-18 22:09:27,247 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-18 22:09:27,304 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 22:09:27,305 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2021-12-18 22:09:27,574 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 22:09:27,574 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2021-12-18 22:09:27,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:09:27,637 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 33 treesize of output 28 [2021-12-18 22:09:27,705 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 27 treesize of output 15 [2021-12-18 22:09:27,748 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-18 22:09:27,748 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:09:28,006 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_915 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_915) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (_ bv1 1)))) is different from false [2021-12-18 22:09:28,014 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_915 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_915) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (_ bv1 1)))) is different from false [2021-12-18 22:09:28,026 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_915 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_915) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (_ bv1 1)))) is different from false [2021-12-18 22:09:28,033 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_915 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_915) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) (_ bv1 1)))) is different from false [2021-12-18 22:09:28,041 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_915 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_915) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (_ bv1 1)))) is different from false [2021-12-18 22:09:28,053 INFO L354 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2021-12-18 22:09:28,053 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-18 22:09:28,059 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_914 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_915 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_914))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_915)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) is different from false [2021-12-18 22:09:28,070 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_914 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_915 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_914))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_915)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) is different from false [2021-12-18 22:09:28,076 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:09:28,076 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 29 [2021-12-18 22:09:28,079 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 236 treesize of output 200 [2021-12-18 22:09:28,082 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 196 treesize of output 188 [2021-12-18 22:09:28,084 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 188 treesize of output 172 [2021-12-18 22:09:28,391 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:09:28,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1319511885] [2021-12-18 22:09:28,391 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1319511885] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:09:28,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [420950508] [2021-12-18 22:09:28,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:09:28,392 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-18 22:09:28,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-18 22:09:28,393 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-18 22:09:28,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2021-12-18 22:09:28,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:09:28,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 49 conjunts are in the unsatisfiable core [2021-12-18 22:09:28,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:09:28,710 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-18 22:09:28,903 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-18 22:09:28,903 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-18 22:09:29,019 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-18 22:09:29,162 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 22:09:29,162 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2021-12-18 22:09:29,590 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 22:09:29,591 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2021-12-18 22:09:29,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:09:29,699 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 35 treesize of output 30 [2021-12-18 22:09:29,855 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 29 treesize of output 17 [2021-12-18 22:09:29,973 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-18 22:09:29,973 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:09:32,136 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_975 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_975) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (_ bv1 1)))) is different from false [2021-12-18 22:09:32,256 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_975 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_975) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (_ bv1 1)))) is different from false [2021-12-18 22:09:32,279 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_975 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_975) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (_ bv1 1)))) is different from false [2021-12-18 22:09:32,289 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_975 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_975) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) (_ bv1 1)))) is different from false [2021-12-18 22:09:32,305 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_975 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_975) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (_ bv1 1)))) is different from false [2021-12-18 22:09:32,317 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_974 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_975 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_974))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_975)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (_ bv1 1)))) is different from false [2021-12-18 22:09:32,333 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_974 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_975 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_974))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_975)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (_ bv1 1)))) is different from false [2021-12-18 22:09:32,341 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:09:32,342 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 33 [2021-12-18 22:09:32,344 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 152 treesize of output 128 [2021-12-18 22:09:32,365 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 124 treesize of output 114 [2021-12-18 22:09:32,367 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 114 treesize of output 110 [2021-12-18 22:09:40,829 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [420950508] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:09:40,830 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 22:09:40,830 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 36 [2021-12-18 22:09:40,830 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283930025] [2021-12-18 22:09:40,830 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 22:09:40,831 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2021-12-18 22:09:40,831 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:09:40,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-12-18 22:09:40,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=2102, Unknown=22, NotChecked=1470, Total=3782 [2021-12-18 22:09:40,832 INFO L87 Difference]: Start difference. First operand 101 states and 110 transitions. Second operand has 37 states, 36 states have (on average 2.0) internal successors, (72), 33 states have internal predecessors, (72), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-18 22:09:42,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:09:42,797 INFO L93 Difference]: Finished difference Result 160 states and 171 transitions. [2021-12-18 22:09:42,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-18 22:09:42,798 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.0) internal successors, (72), 33 states have internal predecessors, (72), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 48 [2021-12-18 22:09:42,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:09:42,798 INFO L225 Difference]: With dead ends: 160 [2021-12-18 22:09:42,798 INFO L226 Difference]: Without dead ends: 160 [2021-12-18 22:09:42,799 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 88 SyntacticMatches, 6 SemanticMatches, 70 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 754 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=342, Invalid=2998, Unknown=22, NotChecked=1750, Total=5112 [2021-12-18 22:09:42,800 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 400 mSDsluCounter, 1111 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 1161 SdHoareTripleChecker+Invalid, 884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 114 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-18 22:09:42,800 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [400 Valid, 1161 Invalid, 884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 743 Invalid, 0 Unknown, 114 Unchecked, 1.0s Time] [2021-12-18 22:09:42,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-12-18 22:09:42,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 105. [2021-12-18 22:09:42,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 85 states have (on average 1.3176470588235294) internal successors, (112), 100 states have internal predecessors, (112), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 22:09:42,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 116 transitions. [2021-12-18 22:09:42,802 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 116 transitions. Word has length 48 [2021-12-18 22:09:42,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:09:42,802 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 116 transitions. [2021-12-18 22:09:42,802 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.0) internal successors, (72), 33 states have internal predecessors, (72), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-18 22:09:42,802 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 116 transitions. [2021-12-18 22:09:42,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-12-18 22:09:42,802 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:09:42,802 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:09:42,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (25)] Forceful destruction successful, exit code 0 [2021-12-18 22:09:43,014 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-18 22:09:43,212 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 22:09:43,212 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-18 22:09:43,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:09:43,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1246140935, now seen corresponding path program 1 times [2021-12-18 22:09:43,213 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:09:43,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [332804662] [2021-12-18 22:09:43,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:09:43,213 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:09:43,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:09:43,216 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-18 22:09:43,217 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-18 22:09:43,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:09:43,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 64 conjunts are in the unsatisfiable core [2021-12-18 22:09:43,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:09:43,465 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-18 22:09:43,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-18 22:09:43,709 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 22:09:43,710 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-18 22:09:43,717 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-18 22:09:43,802 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-18 22:09:43,807 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-18 22:09:43,919 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 22:09:43,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, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2021-12-18 22:09:43,923 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-18 22:09:44,292 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 22:09:44,292 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2021-12-18 22:09:44,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:09:44,298 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-18 22:09:44,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:09:44,390 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 26 [2021-12-18 22:09:44,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:09:44,402 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-18 22:09:44,541 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-18 22:09:44,545 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-18 22:09:44,640 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-18 22:09:44,640 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:09:45,841 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1041 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1041) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_1041 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1040 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1041) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1040) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2021-12-18 22:09:45,877 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1041 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1041) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_1041 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1040 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1041) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1040) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2021-12-18 22:09:45,910 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1041 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_1041) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_1041 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1040 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1041) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1040) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) is different from false [2021-12-18 22:09:45,972 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1041 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1041) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_1041 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1040 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1041) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1040) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) is different from false [2021-12-18 22:09:45,997 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1041 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1040 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1041) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1040) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))))) (forall ((v_ArrVal_1041 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_1041) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (bvule (bvadd .cse1 (_ bv4 32)) (bvadd .cse1 (_ bv8 32)))))) is different from false [2021-12-18 22:09:46,025 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1041 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1041) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_1041 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1040 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1041) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1040) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))) is different from false [2021-12-18 22:09:46,063 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1041 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1038 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1039 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1039) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1038) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1041) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_1041 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1040 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1038 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1039 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1038))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1039) .cse1 v_ArrVal_1041) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1040) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))))) is different from false [2021-12-18 22:09:46,106 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1041 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1038 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1039 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1039) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1038) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_1041) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_1041 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1040 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1038 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1039 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1038))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1039) .cse1 v_ArrVal_1041) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1040) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))))) is different from false [2021-12-18 22:09:46,129 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:09:46,129 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 74 [2021-12-18 22:09:46,138 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:09:46,138 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 50 [2021-12-18 22:09:46,142 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 632 treesize of output 556 [2021-12-18 22:09:46,148 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 1496 treesize of output 1428 [2021-12-18 22:09:46,158 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 1424 treesize of output 1360 [2021-12-18 22:09:46,164 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 1360 treesize of output 1328 [2021-12-18 22:09:46,170 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 1328 treesize of output 1264 [2021-12-18 22:09:46,176 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 1264 treesize of output 1156 Killed by 15