./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/dll2n_remove_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version ae007674 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/dll2n_remove_all.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 b594cdd667b896d6ce097f6fd96950290806f015d929f3b2b06ffea35d861f89 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-28 06:02:17,007 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-28 06:02:17,011 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-28 06:02:17,056 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-28 06:02:17,057 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-28 06:02:17,061 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-28 06:02:17,062 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-28 06:02:17,067 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-28 06:02:17,069 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-28 06:02:17,074 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-28 06:02:17,076 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-28 06:02:17,079 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-28 06:02:17,080 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-28 06:02:17,082 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-28 06:02:17,084 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-28 06:02:17,087 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-28 06:02:17,088 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-28 06:02:17,088 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-28 06:02:17,091 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-28 06:02:17,096 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-28 06:02:17,098 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-28 06:02:17,099 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-28 06:02:17,100 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-28 06:02:17,102 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-28 06:02:17,107 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-28 06:02:17,107 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-28 06:02:17,108 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-28 06:02:17,108 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-28 06:02:17,108 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-28 06:02:17,109 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-28 06:02:17,109 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-28 06:02:17,110 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-28 06:02:17,110 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-28 06:02:17,111 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-28 06:02:17,111 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-28 06:02:17,112 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-28 06:02:17,113 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-28 06:02:17,113 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-28 06:02:17,113 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-28 06:02:17,115 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-28 06:02:17,116 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-28 06:02:17,116 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-28 06:02:17,153 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-28 06:02:17,154 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-28 06:02:17,155 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-28 06:02:17,155 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-28 06:02:17,156 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-28 06:02:17,156 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-28 06:02:17,157 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-28 06:02:17,158 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-28 06:02:17,158 INFO L138 SettingsManager]: * Use SBE=true [2021-12-28 06:02:17,158 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-28 06:02:17,159 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-28 06:02:17,159 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-28 06:02:17,159 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-28 06:02:17,160 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-28 06:02:17,160 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-28 06:02:17,160 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-28 06:02:17,160 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-28 06:02:17,160 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-28 06:02:17,161 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-28 06:02:17,161 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-28 06:02:17,161 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-28 06:02:17,161 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-28 06:02:17,161 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-28 06:02:17,162 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-28 06:02:17,162 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-28 06:02:17,162 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 06:02:17,162 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-28 06:02:17,162 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-28 06:02:17,163 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-28 06:02:17,163 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-28 06:02:17,163 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 -> b594cdd667b896d6ce097f6fd96950290806f015d929f3b2b06ffea35d861f89 [2021-12-28 06:02:17,501 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-28 06:02:17,530 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-28 06:02:17,533 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-28 06:02:17,534 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-28 06:02:17,539 INFO L275 PluginConnector]: CDTParser initialized [2021-12-28 06:02:17,541 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_remove_all.i [2021-12-28 06:02:17,608 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23a470788/5bde563aef264d68a0b039a8c133e67f/FLAG851504026 [2021-12-28 06:02:18,105 INFO L306 CDTParser]: Found 1 translation units. [2021-12-28 06:02:18,106 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_remove_all.i [2021-12-28 06:02:18,120 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23a470788/5bde563aef264d68a0b039a8c133e67f/FLAG851504026 [2021-12-28 06:02:18,601 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23a470788/5bde563aef264d68a0b039a8c133e67f [2021-12-28 06:02:18,605 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-28 06:02:18,606 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-28 06:02:18,608 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-28 06:02:18,609 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-28 06:02:18,612 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-28 06:02:18,613 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 06:02:18" (1/1) ... [2021-12-28 06:02:18,614 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5361ef21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:02:18, skipping insertion in model container [2021-12-28 06:02:18,614 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 06:02:18" (1/1) ... [2021-12-28 06:02:18,620 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-28 06:02:18,666 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-28 06:02:18,923 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/dll2n_remove_all.i[24090,24103] [2021-12-28 06:02:18,925 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 06:02:18,936 INFO L203 MainTranslator]: Completed pre-run [2021-12-28 06:02:18,995 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/dll2n_remove_all.i[24090,24103] [2021-12-28 06:02:18,997 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 06:02:19,024 INFO L208 MainTranslator]: Completed translation [2021-12-28 06:02:19,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:02:19 WrapperNode [2021-12-28 06:02:19,026 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-28 06:02:19,027 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-28 06:02:19,027 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-28 06:02:19,028 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-28 06:02:19,034 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:02:19" (1/1) ... [2021-12-28 06:02:19,062 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:02:19" (1/1) ... [2021-12-28 06:02:19,088 INFO L137 Inliner]: procedures = 126, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 81 [2021-12-28 06:02:19,089 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-28 06:02:19,090 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-28 06:02:19,090 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-28 06:02:19,090 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-28 06:02:19,097 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:02:19" (1/1) ... [2021-12-28 06:02:19,097 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:02:19" (1/1) ... [2021-12-28 06:02:19,106 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:02:19" (1/1) ... [2021-12-28 06:02:19,106 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:02:19" (1/1) ... [2021-12-28 06:02:19,122 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:02:19" (1/1) ... [2021-12-28 06:02:19,127 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:02:19" (1/1) ... [2021-12-28 06:02:19,128 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:02:19" (1/1) ... [2021-12-28 06:02:19,130 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-28 06:02:19,131 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-28 06:02:19,131 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-28 06:02:19,131 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-28 06:02:19,132 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:02:19" (1/1) ... [2021-12-28 06:02:19,137 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 06:02:19,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:02:19,160 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-28 06:02:19,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-28 06:02:19,201 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2021-12-28 06:02:19,202 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2021-12-28 06:02:19,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-28 06:02:19,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-28 06:02:19,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-28 06:02:19,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-28 06:02:19,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-28 06:02:19,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-28 06:02:19,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-28 06:02:19,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-28 06:02:19,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-28 06:02:19,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-28 06:02:19,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-28 06:02:19,356 INFO L234 CfgBuilder]: Building ICFG [2021-12-28 06:02:19,357 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-28 06:02:19,388 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2021-12-28 06:02:19,588 INFO L275 CfgBuilder]: Performing block encoding [2021-12-28 06:02:19,593 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-28 06:02:19,595 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-28 06:02:19,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 06:02:19 BoogieIcfgContainer [2021-12-28 06:02:19,597 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-28 06:02:19,598 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-28 06:02:19,598 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-28 06:02:19,601 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-28 06:02:19,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 06:02:18" (1/3) ... [2021-12-28 06:02:19,602 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f7f62c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 06:02:19, skipping insertion in model container [2021-12-28 06:02:19,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:02:19" (2/3) ... [2021-12-28 06:02:19,603 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f7f62c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 06:02:19, skipping insertion in model container [2021-12-28 06:02:19,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 06:02:19" (3/3) ... [2021-12-28 06:02:19,604 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2n_remove_all.i [2021-12-28 06:02:19,608 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-28 06:02:19,609 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 25 error locations. [2021-12-28 06:02:19,663 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-28 06:02:19,674 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-28 06:02:19,675 INFO L340 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2021-12-28 06:02:19,689 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 32 states have (on average 2.03125) internal successors, (65), 57 states have internal predecessors, (65), 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-28 06:02:19,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-28 06:02:19,706 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:19,707 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-28 06:02:19,708 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-12-28 06:02:19,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:19,713 INFO L85 PathProgramCache]: Analyzing trace with hash 33471376, now seen corresponding path program 1 times [2021-12-28 06:02:19,723 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:02:19,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051027139] [2021-12-28 06:02:19,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:19,725 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:02:19,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:19,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:02:19,900 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:02:19,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051027139] [2021-12-28 06:02:19,901 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051027139] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:02:19,901 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 06:02:19,901 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 06:02:19,902 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571384588] [2021-12-28 06:02:19,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:02:19,905 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 06:02:19,906 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:02:19,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 06:02:19,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 06:02:19,941 INFO L87 Difference]: Start difference. First operand has 59 states, 32 states have (on average 2.03125) internal successors, (65), 57 states have internal predecessors, (65), 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) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:20,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:20,065 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2021-12-28 06:02:20,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 06:02:20,068 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-12-28 06:02:20,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:20,074 INFO L225 Difference]: With dead ends: 86 [2021-12-28 06:02:20,074 INFO L226 Difference]: Without dead ends: 81 [2021-12-28 06:02:20,076 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 06:02:20,079 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 43 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:20,080 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 93 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 06:02:20,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-12-28 06:02:20,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 51. [2021-12-28 06:02:20,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 50 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:20,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2021-12-28 06:02:20,108 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 5 [2021-12-28 06:02:20,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:20,108 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2021-12-28 06:02:20,109 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:20,109 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2021-12-28 06:02:20,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-28 06:02:20,109 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:20,110 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-28 06:02:20,110 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-28 06:02:20,110 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-12-28 06:02:20,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:20,111 INFO L85 PathProgramCache]: Analyzing trace with hash 33471377, now seen corresponding path program 1 times [2021-12-28 06:02:20,111 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:02:20,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015230473] [2021-12-28 06:02:20,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:20,112 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:02:20,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:20,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:02:20,152 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:02:20,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015230473] [2021-12-28 06:02:20,153 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015230473] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:02:20,153 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 06:02:20,153 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 06:02:20,153 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569671581] [2021-12-28 06:02:20,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:02:20,155 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 06:02:20,155 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:02:20,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 06:02:20,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 06:02:20,156 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:20,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:20,209 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2021-12-28 06:02:20,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 06:02:20,209 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-12-28 06:02:20,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:20,211 INFO L225 Difference]: With dead ends: 85 [2021-12-28 06:02:20,211 INFO L226 Difference]: Without dead ends: 85 [2021-12-28 06:02:20,211 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 06:02:20,212 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 47 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:20,213 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 96 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 06:02:20,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-12-28 06:02:20,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 48. [2021-12-28 06:02:20,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 47 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:20,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2021-12-28 06:02:20,218 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 5 [2021-12-28 06:02:20,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:20,219 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2021-12-28 06:02:20,219 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:20,219 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2021-12-28 06:02:20,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-28 06:02:20,220 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:20,220 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:02:20,220 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-28 06:02:20,220 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-12-28 06:02:20,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:20,221 INFO L85 PathProgramCache]: Analyzing trace with hash 2100113076, now seen corresponding path program 1 times [2021-12-28 06:02:20,221 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:02:20,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747843037] [2021-12-28 06:02:20,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:20,222 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:02:20,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:20,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:02:20,247 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:02:20,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747843037] [2021-12-28 06:02:20,248 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747843037] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:02:20,248 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 06:02:20,248 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 06:02:20,248 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842497682] [2021-12-28 06:02:20,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:02:20,249 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 06:02:20,249 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:02:20,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 06:02:20,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 06:02:20,250 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:20,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:20,258 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2021-12-28 06:02:20,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 06:02:20,259 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-12-28 06:02:20,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:20,260 INFO L225 Difference]: With dead ends: 58 [2021-12-28 06:02:20,260 INFO L226 Difference]: Without dead ends: 58 [2021-12-28 06:02:20,260 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 06:02:20,261 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 10 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 96 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-28 06:02:20,262 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 96 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 06:02:20,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2021-12-28 06:02:20,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 49. [2021-12-28 06:02:20,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 48 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:20,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2021-12-28 06:02:20,267 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 7 [2021-12-28 06:02:20,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:20,267 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2021-12-28 06:02:20,268 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:20,268 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2021-12-28 06:02:20,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-28 06:02:20,268 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:20,269 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:02:20,269 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-28 06:02:20,269 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-12-28 06:02:20,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:20,270 INFO L85 PathProgramCache]: Analyzing trace with hash 638916372, now seen corresponding path program 1 times [2021-12-28 06:02:20,270 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:02:20,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69515042] [2021-12-28 06:02:20,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:20,271 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:02:20,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:20,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:02:20,348 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:02:20,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69515042] [2021-12-28 06:02:20,348 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69515042] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:02:20,348 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 06:02:20,349 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 06:02:20,349 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054766279] [2021-12-28 06:02:20,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:02:20,349 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 06:02:20,350 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:02:20,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 06:02:20,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 06:02:20,351 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:20,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:20,381 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2021-12-28 06:02:20,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 06:02:20,382 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-12-28 06:02:20,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:20,383 INFO L225 Difference]: With dead ends: 55 [2021-12-28 06:02:20,383 INFO L226 Difference]: Without dead ends: 55 [2021-12-28 06:02:20,383 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 06:02:20,384 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 1 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:20,385 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 91 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 06:02:20,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-12-28 06:02:20,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2021-12-28 06:02:20,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 53 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:20,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2021-12-28 06:02:20,390 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 9 [2021-12-28 06:02:20,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:20,391 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2021-12-28 06:02:20,391 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:20,391 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2021-12-28 06:02:20,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-28 06:02:20,392 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:20,392 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:02:20,392 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-28 06:02:20,392 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-12-28 06:02:20,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:20,393 INFO L85 PathProgramCache]: Analyzing trace with hash -763066877, now seen corresponding path program 1 times [2021-12-28 06:02:20,393 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:02:20,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567442610] [2021-12-28 06:02:20,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:20,394 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:02:20,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:20,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:02:20,444 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:02:20,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567442610] [2021-12-28 06:02:20,444 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567442610] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:02:20,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927302598] [2021-12-28 06:02:20,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:20,445 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:02:20,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:02:20,447 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 06:02:20,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-28 06:02:20,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:20,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-28 06:02:20,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:02:20,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:02:20,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 06:02:20,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:02:20,670 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927302598] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 06:02:20,670 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 06:02:20,670 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2021-12-28 06:02:20,670 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500318403] [2021-12-28 06:02:20,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 06:02:20,672 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 06:02:20,672 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:02:20,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 06:02:20,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-12-28 06:02:20,677 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:20,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:20,702 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2021-12-28 06:02:20,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 06:02:20,703 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-12-28 06:02:20,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:20,705 INFO L225 Difference]: With dead ends: 56 [2021-12-28 06:02:20,705 INFO L226 Difference]: Without dead ends: 56 [2021-12-28 06:02:20,708 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-12-28 06:02:20,714 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 16 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:20,717 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 134 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 06:02:20,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2021-12-28 06:02:20,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2021-12-28 06:02:20,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 37 states have (on average 1.5945945945945945) internal successors, (59), 55 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:20,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2021-12-28 06:02:20,729 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 14 [2021-12-28 06:02:20,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:20,733 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2021-12-28 06:02:20,734 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:20,734 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2021-12-28 06:02:20,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-28 06:02:20,735 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:20,735 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2021-12-28 06:02:20,760 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-28 06:02:20,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:02:20,952 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-12-28 06:02:20,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:20,952 INFO L85 PathProgramCache]: Analyzing trace with hash -2097949021, now seen corresponding path program 1 times [2021-12-28 06:02:20,953 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:02:20,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081649077] [2021-12-28 06:02:20,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:20,953 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:02:21,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:21,095 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:02:21,095 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:02:21,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081649077] [2021-12-28 06:02:21,095 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081649077] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:02:21,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156196348] [2021-12-28 06:02:21,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:21,096 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:02:21,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:02:21,098 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-28 06:02:21,100 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-28 06:02:21,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:21,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-28 06:02:21,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:02:21,219 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-28 06:02:21,274 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-28 06:02:21,275 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-28 06:02:21,294 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:02:21,295 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 06:02:21,466 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:02:21,467 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156196348] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 06:02:21,467 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 06:02:21,467 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2021-12-28 06:02:21,467 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470718140] [2021-12-28 06:02:21,468 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 06:02:21,468 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 06:02:21,468 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:02:21,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 06:02:21,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-28 06:02:21,469 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:21,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:21,549 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2021-12-28 06:02:21,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 06:02:21,550 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-28 06:02:21,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:21,551 INFO L225 Difference]: With dead ends: 82 [2021-12-28 06:02:21,551 INFO L226 Difference]: Without dead ends: 82 [2021-12-28 06:02:21,551 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-12-28 06:02:21,552 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 76 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 46 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:21,553 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 123 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 46 Unchecked, 0.1s Time] [2021-12-28 06:02:21,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-12-28 06:02:21,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 55. [2021-12-28 06:02:21,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 37 states have (on average 1.5675675675675675) internal successors, (58), 54 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:21,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2021-12-28 06:02:21,559 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 16 [2021-12-28 06:02:21,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:21,560 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2021-12-28 06:02:21,560 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:21,560 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2021-12-28 06:02:21,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-28 06:02:21,561 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:21,561 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2021-12-28 06:02:21,587 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-28 06:02:21,780 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,SelfDestructingSolverStorable5 [2021-12-28 06:02:21,781 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-12-28 06:02:21,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:21,781 INFO L85 PathProgramCache]: Analyzing trace with hash -2097949020, now seen corresponding path program 1 times [2021-12-28 06:02:21,781 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:02:21,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123848743] [2021-12-28 06:02:21,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:21,782 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:02:21,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:21,881 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:02:21,881 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:02:21,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123848743] [2021-12-28 06:02:21,881 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123848743] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:02:21,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496275188] [2021-12-28 06:02:21,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:21,882 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:02:21,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:02:21,883 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-28 06:02:21,892 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-28 06:02:21,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:21,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-28 06:02:21,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:02:21,991 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-28 06:02:22,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 06:02:22,086 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-28 06:02:22,094 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-28 06:02:22,095 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-28 06:02:22,145 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:02:22,145 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 06:02:22,357 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2021-12-28 06:02:22,497 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:02:22,498 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496275188] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 06:02:22,499 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 06:02:22,499 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2021-12-28 06:02:22,499 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906211485] [2021-12-28 06:02:22,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 06:02:22,501 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-28 06:02:22,501 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:02:22,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-28 06:02:22,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2021-12-28 06:02:22,502 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:22,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:22,637 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2021-12-28 06:02:22,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 06:02:22,638 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-28 06:02:22,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:22,639 INFO L225 Difference]: With dead ends: 81 [2021-12-28 06:02:22,639 INFO L226 Difference]: Without dead ends: 81 [2021-12-28 06:02:22,640 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2021-12-28 06:02:22,640 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 323 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 58 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:22,641 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [323 Valid, 60 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 105 Invalid, 0 Unknown, 58 Unchecked, 0.1s Time] [2021-12-28 06:02:22,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-12-28 06:02:22,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 54. [2021-12-28 06:02:22,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 37 states have (on average 1.5405405405405406) internal successors, (57), 53 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:22,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2021-12-28 06:02:22,645 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 16 [2021-12-28 06:02:22,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:22,645 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2021-12-28 06:02:22,645 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:22,646 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2021-12-28 06:02:22,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-28 06:02:22,646 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:22,646 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:02:22,673 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-28 06:02:22,859 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:02:22,859 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-12-28 06:02:22,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:22,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1307957292, now seen corresponding path program 2 times [2021-12-28 06:02:22,860 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:02:22,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191631967] [2021-12-28 06:02:22,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:22,860 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:02:22,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:22,899 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:02:22,899 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:02:22,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191631967] [2021-12-28 06:02:22,900 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191631967] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:02:22,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208205859] [2021-12-28 06:02:22,900 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-28 06:02:22,900 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:02:22,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:02:22,901 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-28 06:02:22,927 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-28 06:02:22,977 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-28 06:02:22,978 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-28 06:02:22,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-28 06:02:22,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:02:23,022 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-28 06:02:23,022 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 06:02:23,022 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208205859] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:02:23,023 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 06:02:23,023 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2021-12-28 06:02:23,023 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443554948] [2021-12-28 06:02:23,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:02:23,024 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 06:02:23,024 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:02:23,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 06:02:23,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 06:02:23,025 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:23,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:23,044 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2021-12-28 06:02:23,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 06:02:23,045 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-28 06:02:23,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:23,046 INFO L225 Difference]: With dead ends: 80 [2021-12-28 06:02:23,046 INFO L226 Difference]: Without dead ends: 80 [2021-12-28 06:02:23,047 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 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-28 06:02:23,047 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 90 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 91 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-28 06:02:23,048 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 91 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 06:02:23,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-12-28 06:02:23,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 55. [2021-12-28 06:02:23,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 38 states have (on average 1.5263157894736843) internal successors, (58), 54 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:23,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2021-12-28 06:02:23,066 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 21 [2021-12-28 06:02:23,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:23,067 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2021-12-28 06:02:23,067 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:23,067 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2021-12-28 06:02:23,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-28 06:02:23,068 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:23,068 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:02:23,097 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-28 06:02:23,271 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:02:23,271 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-12-28 06:02:23,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:23,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1307957265, now seen corresponding path program 1 times [2021-12-28 06:02:23,272 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:02:23,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889218485] [2021-12-28 06:02:23,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:23,273 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:02:23,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:23,351 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:02:23,351 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:02:23,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889218485] [2021-12-28 06:02:23,351 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889218485] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:02:23,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927654253] [2021-12-28 06:02:23,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:23,352 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:02:23,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:02:23,353 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-28 06:02:23,354 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-28 06:02:23,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:23,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-28 06:02:23,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:02:23,486 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:02:23,487 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 06:02:23,532 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:02:23,532 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927654253] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 06:02:23,532 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 06:02:23,532 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2021-12-28 06:02:23,533 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645515255] [2021-12-28 06:02:23,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 06:02:23,533 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 06:02:23,533 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:02:23,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 06:02:23,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-28 06:02:23,534 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:23,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:23,564 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2021-12-28 06:02:23,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 06:02:23,564 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-28 06:02:23,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:23,565 INFO L225 Difference]: With dead ends: 55 [2021-12-28 06:02:23,565 INFO L226 Difference]: Without dead ends: 55 [2021-12-28 06:02:23,565 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-28 06:02:23,566 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 81 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:23,566 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 45 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 06:02:23,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-12-28 06:02:23,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2021-12-28 06:02:23,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 38 states have (on average 1.5) internal successors, (57), 54 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:23,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2021-12-28 06:02:23,569 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 21 [2021-12-28 06:02:23,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:23,569 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2021-12-28 06:02:23,569 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:23,569 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2021-12-28 06:02:23,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-28 06:02:23,570 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:23,570 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:02:23,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-28 06:02:23,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:02:23,776 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-12-28 06:02:23,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:23,776 INFO L85 PathProgramCache]: Analyzing trace with hash 2020822154, now seen corresponding path program 1 times [2021-12-28 06:02:23,776 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:02:23,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356243030] [2021-12-28 06:02:23,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:23,777 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:02:23,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:23,894 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-28 06:02:23,894 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:02:23,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356243030] [2021-12-28 06:02:23,894 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356243030] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:02:23,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116983742] [2021-12-28 06:02:23,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:23,895 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:02:23,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:02:23,896 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-28 06:02:23,903 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-28 06:02:24,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:24,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-28 06:02:24,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:02:24,020 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-28 06:02:24,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 06:02:24,054 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-28 06:02:24,077 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 06:02:24,078 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-12-28 06:02:24,104 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-28 06:02:24,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 06:02:24,180 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-28 06:02:24,180 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116983742] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 06:02:24,180 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 06:02:24,181 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 8 [2021-12-28 06:02:24,181 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036338901] [2021-12-28 06:02:24,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 06:02:24,181 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-28 06:02:24,182 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:02:24,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-28 06:02:24,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2021-12-28 06:02:24,182 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:24,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:24,261 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2021-12-28 06:02:24,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 06:02:24,262 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-12-28 06:02:24,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:24,262 INFO L225 Difference]: With dead ends: 72 [2021-12-28 06:02:24,263 INFO L226 Difference]: Without dead ends: 72 [2021-12-28 06:02:24,263 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2021-12-28 06:02:24,263 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 99 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:24,264 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 92 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 90 Invalid, 0 Unknown, 19 Unchecked, 0.1s Time] [2021-12-28 06:02:24,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-12-28 06:02:24,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 55. [2021-12-28 06:02:24,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 39 states have (on average 1.4871794871794872) internal successors, (58), 54 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:24,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2021-12-28 06:02:24,267 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 22 [2021-12-28 06:02:24,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:24,268 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2021-12-28 06:02:24,268 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:24,268 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2021-12-28 06:02:24,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-28 06:02:24,268 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:24,269 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:02:24,296 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-28 06:02:24,469 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:02:24,470 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-12-28 06:02:24,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:24,470 INFO L85 PathProgramCache]: Analyzing trace with hash 2020822155, now seen corresponding path program 1 times [2021-12-28 06:02:24,470 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:02:24,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560806479] [2021-12-28 06:02:24,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:24,470 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:02:24,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:24,645 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:02:24,645 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:02:24,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560806479] [2021-12-28 06:02:24,646 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560806479] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:02:24,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544318764] [2021-12-28 06:02:24,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:24,646 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:02:24,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:02:24,647 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-28 06:02:24,648 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-28 06:02:24,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:24,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-28 06:02:24,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:02:24,761 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-28 06:02:24,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 06:02:24,789 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-28 06:02:24,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 06:02:24,850 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-28 06:02:24,915 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-28 06:02:24,915 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 06:02:25,363 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-28 06:02:25,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544318764] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 06:02:25,363 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 06:02:25,363 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 10 [2021-12-28 06:02:25,363 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055024052] [2021-12-28 06:02:25,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 06:02:25,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-28 06:02:25,364 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:02:25,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-28 06:02:25,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-12-28 06:02:25,365 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:25,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:25,482 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2021-12-28 06:02:25,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 06:02:25,482 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-12-28 06:02:25,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:25,483 INFO L225 Difference]: With dead ends: 81 [2021-12-28 06:02:25,483 INFO L226 Difference]: Without dead ends: 81 [2021-12-28 06:02:25,483 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2021-12-28 06:02:25,484 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 130 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:25,484 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 115 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 108 Invalid, 0 Unknown, 25 Unchecked, 0.1s Time] [2021-12-28 06:02:25,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-12-28 06:02:25,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 53. [2021-12-28 06:02:25,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 52 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:25,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2021-12-28 06:02:25,489 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 22 [2021-12-28 06:02:25,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:25,490 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2021-12-28 06:02:25,490 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:25,490 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2021-12-28 06:02:25,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-28 06:02:25,490 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:25,491 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:02:25,519 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-28 06:02:25,707 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:02:25,707 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-12-28 06:02:25,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:25,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1779022636, now seen corresponding path program 1 times [2021-12-28 06:02:25,708 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:02:25,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386401488] [2021-12-28 06:02:25,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:25,708 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:02:25,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:25,780 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-28 06:02:25,781 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:02:25,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386401488] [2021-12-28 06:02:25,781 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386401488] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:02:25,781 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 06:02:25,781 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 06:02:25,781 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074563942] [2021-12-28 06:02:25,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:02:25,782 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-28 06:02:25,782 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:02:25,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-28 06:02:25,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-28 06:02:25,782 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:25,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:25,968 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2021-12-28 06:02:25,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 06:02:25,968 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-28 06:02:25,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:25,969 INFO L225 Difference]: With dead ends: 74 [2021-12-28 06:02:25,969 INFO L226 Difference]: Without dead ends: 74 [2021-12-28 06:02:25,971 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-12-28 06:02:25,972 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 109 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:25,972 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 131 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 06:02:25,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-12-28 06:02:25,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 54. [2021-12-28 06:02:25,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 40 states have (on average 1.425) internal successors, (57), 53 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:25,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2021-12-28 06:02:25,979 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 23 [2021-12-28 06:02:25,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:25,980 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2021-12-28 06:02:25,980 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:25,980 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2021-12-28 06:02:25,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-28 06:02:25,981 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:25,981 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:02:25,981 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-28 06:02:25,981 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-12-28 06:02:25,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:25,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1779022635, now seen corresponding path program 1 times [2021-12-28 06:02:25,982 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:02:25,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425074122] [2021-12-28 06:02:25,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:25,983 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:02:26,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:26,090 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-28 06:02:26,091 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:02:26,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425074122] [2021-12-28 06:02:26,091 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425074122] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:02:26,091 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 06:02:26,091 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 06:02:26,091 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633040308] [2021-12-28 06:02:26,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:02:26,092 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-28 06:02:26,092 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:02:26,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-28 06:02:26,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-28 06:02:26,092 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:26,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:26,260 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2021-12-28 06:02:26,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-28 06:02:26,261 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-28 06:02:26,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:26,261 INFO L225 Difference]: With dead ends: 68 [2021-12-28 06:02:26,261 INFO L226 Difference]: Without dead ends: 68 [2021-12-28 06:02:26,262 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-12-28 06:02:26,262 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 190 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:26,262 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [190 Valid, 89 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 06:02:26,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-12-28 06:02:26,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 54. [2021-12-28 06:02:26,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 40 states have (on average 1.4) internal successors, (56), 53 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:26,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2021-12-28 06:02:26,264 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 23 [2021-12-28 06:02:26,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:26,265 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2021-12-28 06:02:26,265 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:26,265 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2021-12-28 06:02:26,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-28 06:02:26,265 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:26,265 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] [2021-12-28 06:02:26,266 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-28 06:02:26,266 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-12-28 06:02:26,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:26,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1033116430, now seen corresponding path program 1 times [2021-12-28 06:02:26,266 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:02:26,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808231777] [2021-12-28 06:02:26,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:26,266 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:02:26,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:26,447 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:02:26,447 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:02:26,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808231777] [2021-12-28 06:02:26,447 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808231777] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:02:26,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302860594] [2021-12-28 06:02:26,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:26,448 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:02:26,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:02:26,449 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-28 06:02:26,450 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-28 06:02:26,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:26,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 49 conjunts are in the unsatisfiable core [2021-12-28 06:02:26,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:02:26,590 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-28 06:02:26,659 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-28 06:02:26,660 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-28 06:02:26,691 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-28 06:02:26,736 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-12-28 06:02:26,736 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2021-12-28 06:02:26,761 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 06:02:26,762 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2021-12-28 06:02:26,926 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2021-12-28 06:02:26,979 INFO L353 Elim1Store]: treesize reduction 3, result has 78.6 percent of original size [2021-12-28 06:02:26,979 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 27 [2021-12-28 06:02:26,993 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:02:26,993 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 06:02:27,081 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2021-12-28 06:02:27,218 INFO L353 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2021-12-28 06:02:27,219 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 27 [2021-12-28 06:02:27,226 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_812 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_812))) (let ((.cse1 (select (select .cse0 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse0 .cse1) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1)))))) is different from false [2021-12-28 06:02:27,268 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_812 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_810 Int)) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_810)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_812))) (let ((.cse0 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse0)) (= (select (select .cse1 .cse0) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|))))) is different from false [2021-12-28 06:02:27,295 INFO L353 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2021-12-28 06:02:27,296 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 51 [2021-12-28 06:02:27,333 INFO L353 Elim1Store]: treesize reduction 36, result has 48.6 percent of original size [2021-12-28 06:02:27,334 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 123 treesize of output 124 [2021-12-28 06:02:27,349 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 06:02:27,349 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 104 [2021-12-28 06:02:27,539 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-28 06:02:27,539 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [302860594] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 06:02:27,539 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 06:02:27,539 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 35 [2021-12-28 06:02:27,539 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214425269] [2021-12-28 06:02:27,539 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 06:02:27,540 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-12-28 06:02:27,540 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:02:27,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-12-28 06:02:27,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1027, Unknown=2, NotChecked=130, Total=1260 [2021-12-28 06:02:27,541 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand has 36 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 36 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:27,651 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_ArrVal_812 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_810 Int)) (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_810)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_812))) (let ((.cse1 (select (select .cse2 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1)) (= (select (select .cse2 .cse1) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |c_#valid| .cse0) 1))) is different from false [2021-12-28 06:02:27,655 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_ArrVal_812 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_812))) (let ((.cse1 (select (select .cse0 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse0 .cse1) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1))))))) is different from false [2021-12-28 06:02:27,657 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_ArrVal_812 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_812))) (let ((.cse1 (select (select .cse0 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse0 .cse1) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1))))))) is different from false [2021-12-28 06:02:28,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:28,328 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2021-12-28 06:02:28,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-28 06:02:28,328 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 36 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-28 06:02:28,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:28,329 INFO L225 Difference]: With dead ends: 114 [2021-12-28 06:02:28,329 INFO L226 Difference]: Without dead ends: 114 [2021-12-28 06:02:28,330 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=236, Invalid=1585, Unknown=5, NotChecked=430, Total=2256 [2021-12-28 06:02:28,330 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 141 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 1107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 343 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:28,331 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 651 Invalid, 1107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 756 Invalid, 0 Unknown, 343 Unchecked, 0.4s Time] [2021-12-28 06:02:28,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-12-28 06:02:28,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 70. [2021-12-28 06:02:28,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 69 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:28,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2021-12-28 06:02:28,333 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 26 [2021-12-28 06:02:28,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:28,333 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2021-12-28 06:02:28,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 36 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:28,334 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2021-12-28 06:02:28,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-28 06:02:28,334 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:28,334 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] [2021-12-28 06:02:28,362 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-12-28 06:02:28,543 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,SelfDestructingSolverStorable13 [2021-12-28 06:02:28,544 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-12-28 06:02:28,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:28,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1033116431, now seen corresponding path program 1 times [2021-12-28 06:02:28,544 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:02:28,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053896093] [2021-12-28 06:02:28,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:28,545 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:02:28,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:28,849 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:02:28,849 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:02:28,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053896093] [2021-12-28 06:02:28,849 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053896093] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:02:28,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [895078230] [2021-12-28 06:02:28,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:28,850 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:02:28,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:02:28,852 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-28 06:02:28,861 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-28 06:02:28,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:28,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 69 conjunts are in the unsatisfiable core [2021-12-28 06:02:28,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:02:29,007 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-28 06:02:29,108 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-28 06:02:29,108 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-28 06:02:29,161 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-28 06:02:29,169 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-28 06:02:29,223 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-12-28 06:02:29,224 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2021-12-28 06:02:29,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 06:02:29,233 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-28 06:02:29,320 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 06:02:29,321 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 68 [2021-12-28 06:02:29,325 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2021-12-28 06:02:29,742 INFO L353 Elim1Store]: treesize reduction 56, result has 1.8 percent of original size [2021-12-28 06:02:29,743 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 161 treesize of output 74 [2021-12-28 06:02:29,770 INFO L353 Elim1Store]: treesize reduction 14, result has 57.6 percent of original size [2021-12-28 06:02:29,770 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 45 [2021-12-28 06:02:29,851 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:02:29,852 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 06:02:30,607 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 06:02:30,607 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 94 [2021-12-28 06:02:31,338 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_920 (Array Int Int)) (v_ArrVal_921 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_921))) (let ((.cse0 (select (select .cse4 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_920))) (let ((.cse3 (select (select .cse6 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (+ .cse0 4))) (let ((.cse2 (select (select .cse6 .cse3) .cse5)) (.cse1 (select (select .cse4 .cse3) .cse5))) (or (not (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (and (= .cse1 0) (= .cse2 0)) (and (<= 0 (+ .cse1 8)) (= .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (<= .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.offset|)) (not (= .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))))) is different from false [2021-12-28 06:02:32,495 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_920 (Array Int Int)) (v_ArrVal_921 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse7 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse7 0)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_921))) (let ((.cse2 (select (select .cse4 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse7 0)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_920))) (let ((.cse3 (select (select .cse6 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (+ .cse2 4))) (let ((.cse1 (select (select .cse6 .cse3) .cse5)) (.cse0 (select (select .cse4 .cse3) .cse5))) (or (and (<= 0 (+ .cse0 8)) (= .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (<= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.offset|)) (not (= .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (and (= .cse1 0) (= .cse0 0))))))))) is different from false [2021-12-28 06:02:32,515 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 06:02:32,522 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 06:02:32,524 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 386 treesize of output 271 [2021-12-28 06:02:32,803 INFO L353 Elim1Store]: treesize reduction 289, result has 32.5 percent of original size [2021-12-28 06:02:32,804 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 10 new quantified variables, introduced 21 case distinctions, treesize of input 1159 treesize of output 969 [2021-12-28 06:02:32,845 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 06:02:32,853 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 06:02:32,866 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 06:02:32,867 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 759 treesize of output 430 [2021-12-28 06:02:32,887 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 06:02:32,953 INFO L353 Elim1Store]: treesize reduction 21, result has 72.7 percent of original size [2021-12-28 06:02:32,953 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 586 treesize of output 563 [2021-12-28 06:02:33,008 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 06:02:33,009 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 565 treesize of output 551 [2021-12-28 06:02:33,048 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 06:02:33,097 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 06:02:33,097 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 726 treesize of output 720 [2021-12-28 06:02:33,183 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 06:02:33,184 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 688 treesize of output 644 [2021-12-28 06:02:41,212 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-28 06:02:41,213 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [895078230] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 06:02:41,213 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 06:02:41,213 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 42 [2021-12-28 06:02:41,213 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359774703] [2021-12-28 06:02:41,213 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 06:02:41,214 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2021-12-28 06:02:41,214 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:02:41,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-12-28 06:02:41,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1521, Unknown=2, NotChecked=158, Total=1806 [2021-12-28 06:02:41,216 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand has 43 states, 42 states have (on average 1.7857142857142858) internal successors, (75), 43 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:41,482 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0))) (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= .cse1 0) (= (select |c_#length| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 12) (= (select |c_#length| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 12) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| .cse1) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (forall ((v_ArrVal_920 (Array Int Int)) (v_ArrVal_921 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse9 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse6 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse9 0)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_921))) (let ((.cse4 (select (select .cse6 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse9 0)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_920))) (let ((.cse5 (select (select .cse8 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (+ .cse4 4))) (let ((.cse3 (select (select .cse8 .cse5) .cse7)) (.cse2 (select (select .cse6 .cse5) .cse7))) (or (and (<= 0 (+ .cse2 8)) (= .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (<= .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.offset|)) (not (= .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (and (= .cse3 0) (= .cse2 0)))))))))))) is different from false [2021-12-28 06:02:41,486 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse8 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse10 (select .cse11 .cse8)) (.cse9 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (and (forall ((v_ArrVal_920 (Array Int Int)) (v_ArrVal_921 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_921))) (let ((.cse0 (select (select .cse4 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_920))) (let ((.cse3 (select (select .cse6 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (+ .cse0 4))) (let ((.cse2 (select (select .cse6 .cse3) .cse5)) (.cse1 (select (select .cse4 .cse3) .cse5))) (or (not (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (and (= .cse1 0) (= .cse2 0)) (and (<= 0 (+ .cse1 8)) (= .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (<= .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.offset|)) (not (= .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= (select .cse7 .cse8) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select .cse7 .cse9) 0) (= .cse10 0) (= (select |c_#length| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 12) (= (select |c_#length| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 12) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| .cse10) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)) (= (select .cse11 .cse9) 0)))) is different from false [2021-12-28 06:02:41,490 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse8 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse10 (select .cse11 .cse8)) (.cse9 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (and (forall ((v_ArrVal_920 (Array Int Int)) (v_ArrVal_921 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_921))) (let ((.cse0 (select (select .cse4 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_920))) (let ((.cse3 (select (select .cse6 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (+ .cse0 4))) (let ((.cse2 (select (select .cse6 .cse3) .cse5)) (.cse1 (select (select .cse4 .cse3) .cse5))) (or (not (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (and (= .cse1 0) (= .cse2 0)) (and (<= 0 (+ .cse1 8)) (= .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (<= .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.offset|)) (not (= .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse7 .cse8) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select .cse7 .cse9) 0) (= .cse10 0) (= (select |c_#length| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 12) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| .cse10) (= (select .cse11 .cse9) 0)))) is different from false [2021-12-28 06:02:43,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:43,243 INFO L93 Difference]: Finished difference Result 180 states and 185 transitions. [2021-12-28 06:02:43,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-12-28 06:02:43,243 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 1.7857142857142858) internal successors, (75), 43 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-28 06:02:43,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:43,244 INFO L225 Difference]: With dead ends: 180 [2021-12-28 06:02:43,244 INFO L226 Difference]: Without dead ends: 180 [2021-12-28 06:02:43,246 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=344, Invalid=3093, Unknown=5, NotChecked=590, Total=4032 [2021-12-28 06:02:43,246 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 298 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 1185 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 1233 SdHoareTripleChecker+Invalid, 1718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 507 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:43,246 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [298 Valid, 1233 Invalid, 1718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1185 Invalid, 0 Unknown, 507 Unchecked, 0.7s Time] [2021-12-28 06:02:43,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2021-12-28 06:02:43,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 70. [2021-12-28 06:02:43,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 69 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:43,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2021-12-28 06:02:43,249 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 26 [2021-12-28 06:02:43,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:43,249 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2021-12-28 06:02:43,249 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 1.7857142857142858) internal successors, (75), 43 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:43,250 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2021-12-28 06:02:43,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-28 06:02:43,250 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:43,250 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] [2021-12-28 06:02:43,275 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-28 06:02:43,451 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,SelfDestructingSolverStorable14 [2021-12-28 06:02:43,451 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-12-28 06:02:43,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:43,452 INFO L85 PathProgramCache]: Analyzing trace with hash 687445232, now seen corresponding path program 1 times [2021-12-28 06:02:43,452 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:02:43,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420217277] [2021-12-28 06:02:43,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:43,452 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:02:43,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:43,584 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-28 06:02:43,584 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:02:43,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420217277] [2021-12-28 06:02:43,585 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420217277] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:02:43,585 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 06:02:43,585 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-28 06:02:43,585 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469314334] [2021-12-28 06:02:43,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:02:43,585 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-28 06:02:43,586 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:02:43,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-28 06:02:43,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-28 06:02:43,587 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:43,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:43,718 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2021-12-28 06:02:43,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 06:02:43,719 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-12-28 06:02:43,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:43,719 INFO L225 Difference]: With dead ends: 83 [2021-12-28 06:02:43,719 INFO L226 Difference]: Without dead ends: 83 [2021-12-28 06:02:43,719 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2021-12-28 06:02:43,720 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 192 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:43,720 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [192 Valid, 134 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 06:02:43,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-12-28 06:02:43,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 75. [2021-12-28 06:02:43,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 61 states have (on average 1.3278688524590163) internal successors, (81), 74 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:43,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2021-12-28 06:02:43,722 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 28 [2021-12-28 06:02:43,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:43,722 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2021-12-28 06:02:43,723 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:43,723 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2021-12-28 06:02:43,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-28 06:02:43,723 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:43,723 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:02:43,723 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-28 06:02:43,724 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-12-28 06:02:43,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:43,724 INFO L85 PathProgramCache]: Analyzing trace with hash -164034179, now seen corresponding path program 1 times [2021-12-28 06:02:43,724 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:02:43,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399895077] [2021-12-28 06:02:43,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:43,724 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:02:43,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:43,964 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-28 06:02:43,964 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:02:43,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399895077] [2021-12-28 06:02:43,964 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399895077] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:02:43,964 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 06:02:43,964 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-28 06:02:43,964 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058180656] [2021-12-28 06:02:43,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:02:43,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-28 06:02:43,965 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:02:43,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-28 06:02:43,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-12-28 06:02:43,966 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:44,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:44,162 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2021-12-28 06:02:44,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-28 06:02:44,162 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-28 06:02:44,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:44,163 INFO L225 Difference]: With dead ends: 82 [2021-12-28 06:02:44,163 INFO L226 Difference]: Without dead ends: 82 [2021-12-28 06:02:44,163 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2021-12-28 06:02:44,164 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 192 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:44,164 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [192 Valid, 94 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 06:02:44,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-12-28 06:02:44,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 76. [2021-12-28 06:02:44,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 62 states have (on average 1.3225806451612903) internal successors, (82), 75 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:44,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2021-12-28 06:02:44,166 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 29 [2021-12-28 06:02:44,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:44,167 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2021-12-28 06:02:44,167 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:44,167 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2021-12-28 06:02:44,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-28 06:02:44,168 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:44,168 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-28 06:02:44,168 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-28 06:02:44,168 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-12-28 06:02:44,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:44,169 INFO L85 PathProgramCache]: Analyzing trace with hash -790092142, now seen corresponding path program 1 times [2021-12-28 06:02:44,169 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:02:44,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497957670] [2021-12-28 06:02:44,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:44,169 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:02:44,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:44,323 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-28 06:02:44,323 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:02:44,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497957670] [2021-12-28 06:02:44,323 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497957670] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:02:44,323 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 06:02:44,323 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-28 06:02:44,324 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21408250] [2021-12-28 06:02:44,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:02:44,324 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-28 06:02:44,324 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:02:44,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-28 06:02:44,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-12-28 06:02:44,324 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:44,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:44,567 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2021-12-28 06:02:44,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-28 06:02:44,568 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-12-28 06:02:44,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:44,568 INFO L225 Difference]: With dead ends: 83 [2021-12-28 06:02:44,568 INFO L226 Difference]: Without dead ends: 83 [2021-12-28 06:02:44,568 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2021-12-28 06:02:44,569 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 116 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:44,569 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 137 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 06:02:44,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-12-28 06:02:44,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 77. [2021-12-28 06:02:44,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 63 states have (on average 1.3174603174603174) internal successors, (83), 76 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:44,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2021-12-28 06:02:44,572 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 30 [2021-12-28 06:02:44,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:44,572 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2021-12-28 06:02:44,572 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:44,572 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2021-12-28 06:02:44,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-28 06:02:44,573 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:44,573 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] [2021-12-28 06:02:44,573 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-28 06:02:44,574 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-12-28 06:02:44,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:44,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1276947488, now seen corresponding path program 1 times [2021-12-28 06:02:44,574 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:02:44,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95346276] [2021-12-28 06:02:44,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:44,575 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:02:44,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:44,660 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-28 06:02:44,660 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:02:44,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95346276] [2021-12-28 06:02:44,660 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95346276] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:02:44,661 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 06:02:44,661 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 06:02:44,662 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678982182] [2021-12-28 06:02:44,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:02:44,663 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-28 06:02:44,663 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:02:44,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-28 06:02:44,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-12-28 06:02:44,664 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:44,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:44,738 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2021-12-28 06:02:44,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 06:02:44,739 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-12-28 06:02:44,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:44,739 INFO L225 Difference]: With dead ends: 76 [2021-12-28 06:02:44,739 INFO L226 Difference]: Without dead ends: 76 [2021-12-28 06:02:44,740 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-12-28 06:02:44,740 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 85 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:44,740 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 66 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 06:02:44,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-12-28 06:02:44,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2021-12-28 06:02:44,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 63 states have (on average 1.3015873015873016) internal successors, (82), 75 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:44,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2021-12-28 06:02:44,743 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 31 [2021-12-28 06:02:44,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:44,743 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2021-12-28 06:02:44,744 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:44,744 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2021-12-28 06:02:44,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-28 06:02:44,746 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:44,746 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:02:44,746 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-28 06:02:44,747 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-12-28 06:02:44,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:44,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1691393914, now seen corresponding path program 2 times [2021-12-28 06:02:44,747 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:02:44,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628039460] [2021-12-28 06:02:44,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:44,748 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:02:44,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:44,801 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:02:44,801 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:02:44,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628039460] [2021-12-28 06:02:44,802 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628039460] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:02:44,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700772923] [2021-12-28 06:02:44,802 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-28 06:02:44,802 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:02:44,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:02:44,804 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-28 06:02:44,832 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-28 06:02:44,972 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-28 06:02:44,972 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-28 06:02:44,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-28 06:02:44,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:02:45,028 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:02:45,028 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 06:02:45,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700772923] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:02:45,028 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 06:02:45,028 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2021-12-28 06:02:45,029 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790819962] [2021-12-28 06:02:45,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:02:45,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 06:02:45,029 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:02:45,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 06:02:45,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-28 06:02:45,030 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:45,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:45,038 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2021-12-28 06:02:45,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 06:02:45,038 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-12-28 06:02:45,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:45,039 INFO L225 Difference]: With dead ends: 60 [2021-12-28 06:02:45,039 INFO L226 Difference]: Without dead ends: 60 [2021-12-28 06:02:45,039 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-28 06:02:45,041 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 36 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:45,041 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 64 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 06:02:45,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-12-28 06:02:45,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2021-12-28 06:02:45,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 47 states have (on average 1.297872340425532) internal successors, (61), 59 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:45,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2021-12-28 06:02:45,049 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 34 [2021-12-28 06:02:45,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:45,049 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2021-12-28 06:02:45,049 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:45,049 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2021-12-28 06:02:45,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-28 06:02:45,050 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:45,051 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] [2021-12-28 06:02:45,078 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-28 06:02:45,267 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:02:45,267 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-12-28 06:02:45,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:45,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1472458184, now seen corresponding path program 1 times [2021-12-28 06:02:45,268 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:02:45,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951758742] [2021-12-28 06:02:45,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:45,268 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:02:45,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:45,302 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-28 06:02:45,302 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:02:45,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951758742] [2021-12-28 06:02:45,303 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951758742] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:02:45,303 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 06:02:45,303 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 06:02:45,303 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874079282] [2021-12-28 06:02:45,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:02:45,303 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 06:02:45,304 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:02:45,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 06:02:45,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-28 06:02:45,304 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:45,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:45,334 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2021-12-28 06:02:45,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 06:02:45,334 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-12-28 06:02:45,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:45,335 INFO L225 Difference]: With dead ends: 58 [2021-12-28 06:02:45,335 INFO L226 Difference]: Without dead ends: 58 [2021-12-28 06:02:45,335 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-28 06:02:45,336 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 50 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:45,336 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 31 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 06:02:45,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2021-12-28 06:02:45,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2021-12-28 06:02:45,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 57 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:45,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2021-12-28 06:02:45,338 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 35 [2021-12-28 06:02:45,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:45,338 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2021-12-28 06:02:45,338 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:45,338 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2021-12-28 06:02:45,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-28 06:02:45,339 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:45,339 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] [2021-12-28 06:02:45,339 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-28 06:02:45,339 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-12-28 06:02:45,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:45,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1472458185, now seen corresponding path program 1 times [2021-12-28 06:02:45,340 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:02:45,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969137140] [2021-12-28 06:02:45,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:45,340 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:02:45,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:45,387 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-28 06:02:45,388 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:02:45,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969137140] [2021-12-28 06:02:45,388 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969137140] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:02:45,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604123624] [2021-12-28 06:02:45,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:45,389 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:02:45,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:02:45,392 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-28 06:02:45,421 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-28 06:02:45,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:45,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-28 06:02:45,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:02:45,587 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-28 06:02:45,588 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 06:02:45,639 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-28 06:02:45,640 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604123624] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 06:02:45,640 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 06:02:45,640 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6 [2021-12-28 06:02:45,640 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950308299] [2021-12-28 06:02:45,640 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 06:02:45,640 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 06:02:45,640 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:02:45,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 06:02:45,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-28 06:02:45,641 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:45,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:45,663 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2021-12-28 06:02:45,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 06:02:45,663 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-12-28 06:02:45,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:45,664 INFO L225 Difference]: With dead ends: 62 [2021-12-28 06:02:45,664 INFO L226 Difference]: Without dead ends: 62 [2021-12-28 06:02:45,664 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-12-28 06:02:45,664 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 75 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:45,665 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 125 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 06:02:45,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-12-28 06:02:45,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2021-12-28 06:02:45,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 61 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:45,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2021-12-28 06:02:45,666 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 35 [2021-12-28 06:02:45,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:45,667 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2021-12-28 06:02:45,667 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:45,667 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2021-12-28 06:02:45,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-28 06:02:45,667 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:45,668 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-28 06:02:45,686 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-28 06:02:45,871 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-12-28 06:02:45,871 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-12-28 06:02:45,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:45,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1472458212, now seen corresponding path program 1 times [2021-12-28 06:02:45,872 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:02:45,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427091669] [2021-12-28 06:02:45,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:45,872 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:02:45,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:45,951 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-28 06:02:45,952 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:02:45,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427091669] [2021-12-28 06:02:45,952 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427091669] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:02:45,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23360890] [2021-12-28 06:02:45,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:45,952 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:02:45,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:02:45,956 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-28 06:02:45,978 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-28 06:02:46,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:46,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-28 06:02:46,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:02:46,207 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-28 06:02:46,208 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 06:02:46,290 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 06:02:46,291 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2021-12-28 06:02:46,367 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-28 06:02:46,367 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23360890] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 06:02:46,368 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 06:02:46,368 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2021-12-28 06:02:46,368 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763876352] [2021-12-28 06:02:46,368 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 06:02:46,368 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-28 06:02:46,369 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:02:46,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-28 06:02:46,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-12-28 06:02:46,369 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand has 10 states, 9 states have (on average 6.0) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:46,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:46,411 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2021-12-28 06:02:46,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 06:02:46,412 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.0) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-12-28 06:02:46,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:46,413 INFO L225 Difference]: With dead ends: 60 [2021-12-28 06:02:46,413 INFO L226 Difference]: Without dead ends: 60 [2021-12-28 06:02:46,413 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-12-28 06:02:46,414 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 137 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:46,414 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 50 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 06:02:46,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-12-28 06:02:46,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2021-12-28 06:02:46,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 51 states have (on average 1.196078431372549) internal successors, (61), 59 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:46,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2021-12-28 06:02:46,416 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 35 [2021-12-28 06:02:46,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:46,417 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2021-12-28 06:02:46,417 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.0) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:46,417 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2021-12-28 06:02:46,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-28 06:02:46,417 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:46,417 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:02:46,446 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-28 06:02:46,631 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,SelfDestructingSolverStorable22 [2021-12-28 06:02:46,631 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-12-28 06:02:46,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:46,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1598435685, now seen corresponding path program 1 times [2021-12-28 06:02:46,632 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:02:46,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201886848] [2021-12-28 06:02:46,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:46,632 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:02:46,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:47,087 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:02:47,088 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:02:47,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201886848] [2021-12-28 06:02:47,088 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201886848] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:02:47,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048059298] [2021-12-28 06:02:47,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:47,088 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:02:47,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:02:47,090 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 06:02:47,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-28 06:02:47,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:47,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 69 conjunts are in the unsatisfiable core [2021-12-28 06:02:47,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:02:47,252 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-28 06:02:47,320 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-28 06:02:47,320 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-28 06:02:47,357 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-28 06:02:47,391 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-12-28 06:02:47,392 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2021-12-28 06:02:47,412 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 06:02:47,412 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2021-12-28 06:02:47,568 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-12-28 06:02:47,748 INFO L353 Elim1Store]: treesize reduction 64, result has 22.0 percent of original size [2021-12-28 06:02:47,748 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 38 treesize of output 50 [2021-12-28 06:02:47,759 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-12-28 06:02:48,022 INFO L353 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-28 06:02:48,023 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 26 [2021-12-28 06:02:48,165 INFO L353 Elim1Store]: treesize reduction 66, result has 46.3 percent of original size [2021-12-28 06:02:48,165 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 90 treesize of output 101 [2021-12-28 06:02:50,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 06:02:50,083 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 06:02:50,084 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 77 [2021-12-28 06:02:50,178 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:02:50,178 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 06:02:50,418 INFO L353 Elim1Store]: treesize reduction 13, result has 78.7 percent of original size [2021-12-28 06:02:50,418 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 99 [2021-12-28 06:02:50,849 WARN L838 $PredicateComparison]: unable to prove that (or (= (select (select |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|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_ArrVal_1720 (Array Int Int))) (not (let ((.cse0 (select (select |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|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1720) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2021-12-28 06:02:50,857 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 49 [2021-12-28 06:02:50,866 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1720 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse1) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1720) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse0)) (not (= .cse1 |c_ULTIMATE.start_dll_create_#res#1.base|)) (= .cse0 |ULTIMATE.start_main_~#s~0#1.base|))))) is different from false [2021-12-28 06:02:50,880 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1720 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse1) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)))) (or (not (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1720) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 |ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base|)))))) is different from false [2021-12-28 06:02:50,905 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1720 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse0)) (not (= .cse1 (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1720) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse1 |ULTIMATE.start_main_~#s~0#1.base|))))) is different from false [2021-12-28 06:02:50,920 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1720 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_1719 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1719))) (let ((.cse2 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select .cse1 .cse2) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (or (= |ULTIMATE.start_main_~#s~0#1.base| .cse0) (not (= (select (select (store .cse1 .cse0 v_ArrVal_1720) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse0)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse2))))))) is different from false [2021-12-28 06:02:50,953 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1717 Int) (v_ArrVal_1720 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_1719 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1717)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1719))) (let ((.cse2 (select (select .cse0 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select .cse0 .cse2) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (or (not (= (select (select (store .cse0 .cse1 v_ArrVal_1720) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse1)) (= |ULTIMATE.start_main_~#s~0#1.base| .cse1) (not (= .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))))) is different from false [2021-12-28 06:02:50,971 INFO L353 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2021-12-28 06:02:50,972 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 197 treesize of output 97 [2021-12-28 06:02:50,997 INFO L353 Elim1Store]: treesize reduction 55, result has 21.4 percent of original size [2021-12-28 06:02:50,998 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 525 treesize of output 343 [2021-12-28 06:02:51,015 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 238 treesize of output 226 [2021-12-28 06:02:51,024 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 06:02:51,025 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 296 treesize of output 252 [2021-12-28 06:02:51,207 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2021-12-28 06:02:51,207 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048059298] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 06:02:51,207 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 06:02:51,207 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 20] total 56 [2021-12-28 06:02:51,207 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480484545] [2021-12-28 06:02:51,208 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 06:02:51,209 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2021-12-28 06:02:51,209 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:02:51,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2021-12-28 06:02:51,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=2339, Unknown=52, NotChecked=618, Total=3192 [2021-12-28 06:02:51,211 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand has 57 states, 56 states have (on average 1.8571428571428572) internal successors, (104), 57 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:51,384 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_ArrVal_1717 Int) (v_ArrVal_1720 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_1719 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1717)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1719))) (let ((.cse2 (select (select .cse0 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select .cse0 .cse2) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (or (not (= (select (select (store .cse0 .cse1 v_ArrVal_1720) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse1)) (= |ULTIMATE.start_main_~#s~0#1.base| .cse1) (not (= .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)) is different from false [2021-12-28 06:02:51,389 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_ArrVal_1720 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_1719 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1719))) (let ((.cse2 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select .cse1 .cse2) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (or (= |ULTIMATE.start_main_~#s~0#1.base| .cse0) (not (= (select (select (store .cse1 .cse0 v_ArrVal_1720) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse0)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse2)))))))) is different from false [2021-12-28 06:02:51,392 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_ArrVal_1720 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_1719 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1719))) (let ((.cse2 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select .cse1 .cse2) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (or (= |ULTIMATE.start_main_~#s~0#1.base| .cse0) (not (= (select (select (store .cse1 .cse0 v_ArrVal_1720) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse0)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse2)))))))) is different from false [2021-12-28 06:02:51,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:51,991 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2021-12-28 06:02:51,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-28 06:02:51,992 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 1.8571428571428572) internal successors, (104), 57 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-12-28 06:02:51,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:51,992 INFO L225 Difference]: With dead ends: 62 [2021-12-28 06:02:51,993 INFO L226 Difference]: Without dead ends: 62 [2021-12-28 06:02:51,994 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 710 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=331, Invalid=3432, Unknown=55, NotChecked=1152, Total=4970 [2021-12-28 06:02:51,995 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 64 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 280 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:51,995 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 508 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 407 Invalid, 0 Unknown, 280 Unchecked, 0.2s Time] [2021-12-28 06:02:51,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-12-28 06:02:51,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2021-12-28 06:02:51,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 61 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:51,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2021-12-28 06:02:51,997 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 36 [2021-12-28 06:02:51,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:51,997 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2021-12-28 06:02:51,998 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 1.8571428571428572) internal successors, (104), 57 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:51,998 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2021-12-28 06:02:51,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-28 06:02:51,998 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:51,998 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:02:52,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-12-28 06:02:52,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-12-28 06:02:52,211 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-12-28 06:02:52,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:52,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1598435684, now seen corresponding path program 1 times [2021-12-28 06:02:52,212 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:02:52,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604472051] [2021-12-28 06:02:52,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:52,212 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:02:52,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:52,552 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:02:52,552 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:02:52,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604472051] [2021-12-28 06:02:52,552 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604472051] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:02:52,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663446657] [2021-12-28 06:02:52,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:52,553 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:02:52,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:02:52,554 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 06:02:52,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-28 06:02:52,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:52,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 93 conjunts are in the unsatisfiable core [2021-12-28 06:02:52,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:02:52,728 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-28 06:02:52,825 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-28 06:02:52,825 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-28 06:02:52,877 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-28 06:02:52,881 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-28 06:02:52,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 06:02:52,922 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-28 06:02:52,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 06:02:52,929 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-28 06:02:52,957 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 06:02:52,959 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-12-28 06:02:52,971 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-28 06:02:53,396 INFO L353 Elim1Store]: treesize reduction 68, result has 17.1 percent of original size [2021-12-28 06:02:53,396 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 81 treesize of output 79 [2021-12-28 06:02:53,403 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 06:02:53,422 INFO L353 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2021-12-28 06:02:53,422 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 59 treesize of output 54 [2021-12-28 06:02:53,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 06:02:53,661 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 06:02:53,663 INFO L353 Elim1Store]: treesize reduction 2, result has 33.3 percent of original size [2021-12-28 06:02:53,663 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 126 treesize of output 85 [2021-12-28 06:02:53,678 INFO L353 Elim1Store]: treesize reduction 49, result has 5.8 percent of original size [2021-12-28 06:02:53,679 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 74 treesize of output 53 [2021-12-28 06:02:53,849 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 06:02:53,850 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 21 [2021-12-28 06:02:53,859 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 06:02:53,859 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2021-12-28 06:02:53,887 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:02:53,887 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 06:02:54,157 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 06:02:54,158 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 80 [2021-12-28 06:02:54,544 WARN L838 $PredicateComparison]: unable to prove that (or (<= 0 (+ 4 (select (select |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|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (forall ((v_ArrVal_1858 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |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|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) v_ArrVal_1858) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from false [2021-12-28 06:02:54,770 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1857 (Array Int Int)) (v_ArrVal_1856 (Array Int Int)) (v_ArrVal_1858 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1856))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1857)) (.cse3 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (+ .cse3 4)) (.cse1 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (<= 0 (+ (select (select .cse0 .cse1) .cse2) 4)) (not (= .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= (select (select (store .cse0 (select (select .cse4 .cse1) .cse2) v_ArrVal_1858) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))))) is different from false [2021-12-28 06:02:54,873 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1857 (Array Int Int)) (v_ArrVal_1856 (Array Int Int)) (v_ArrVal_1853 Int) (v_ArrVal_1854 Int) (v_ArrVal_1858 (Array Int Int))) (let ((.cse5 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5 v_ArrVal_1853)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1856))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5 v_ArrVal_1854)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1857)) (.cse4 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (+ .cse4 4)) (.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select (store .cse0 (select (select .cse1 .cse2) .cse3) v_ArrVal_1858) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (<= 0 (+ (select (select .cse0 .cse2) .cse3) 4)) (not (= .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse4)))))))) is different from false [2021-12-28 06:02:54,888 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 06:02:54,895 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 06:02:54,895 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 197 treesize of output 142 [2021-12-28 06:02:54,901 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 06:02:54,907 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 06:02:54,907 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 137 treesize of output 97 [2021-12-28 06:02:54,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 06:02:54,959 INFO L353 Elim1Store]: treesize reduction 23, result has 72.6 percent of original size [2021-12-28 06:02:54,959 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 244 treesize of output 254 [2021-12-28 06:02:55,111 INFO L353 Elim1Store]: treesize reduction 83, result has 60.8 percent of original size [2021-12-28 06:02:55,112 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 792 treesize of output 804 [2021-12-28 06:02:55,159 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 06:02:55,160 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 642 treesize of output 582 [2021-12-28 06:02:55,177 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 374 treesize of output 350 [2021-12-28 06:02:55,204 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 06:02:55,205 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 649 treesize of output 631 [2021-12-28 06:03:14,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 06:03:14,302 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2021-12-28 06:03:14,303 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1663446657] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 06:03:14,303 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 06:03:14,303 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 20] total 55 [2021-12-28 06:03:14,303 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944016427] [2021-12-28 06:03:14,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 06:03:14,303 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2021-12-28 06:03:14,303 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:03:14,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2021-12-28 06:03:14,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=2493, Unknown=35, NotChecked=312, Total=3080 [2021-12-28 06:03:14,304 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand has 56 states, 55 states have (on average 1.9090909090909092) internal successors, (105), 56 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:03:15,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:03:15,907 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2021-12-28 06:03:15,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-28 06:03:15,907 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 1.9090909090909092) internal successors, (105), 56 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-12-28 06:03:15,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:03:15,908 INFO L225 Difference]: With dead ends: 63 [2021-12-28 06:03:15,908 INFO L226 Difference]: Without dead ends: 63 [2021-12-28 06:03:15,909 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 69 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1187 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=593, Invalid=3940, Unknown=35, NotChecked=402, Total=4970 [2021-12-28 06:03:15,910 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 147 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 366 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 06:03:15,910 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 535 Invalid, 939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 513 Invalid, 0 Unknown, 366 Unchecked, 0.3s Time] [2021-12-28 06:03:15,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-12-28 06:03:15,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2021-12-28 06:03:15,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 53 states have (on average 1.1886792452830188) internal successors, (63), 61 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:03:15,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2021-12-28 06:03:15,912 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 36 [2021-12-28 06:03:15,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:03:15,912 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2021-12-28 06:03:15,913 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 1.9090909090909092) internal successors, (105), 56 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:03:15,913 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2021-12-28 06:03:15,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-28 06:03:15,913 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:03:15,913 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] [2021-12-28 06:03:15,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-12-28 06:03:16,127 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:03:16,128 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-12-28 06:03:16,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:03:16,128 INFO L85 PathProgramCache]: Analyzing trace with hash -695048217, now seen corresponding path program 1 times [2021-12-28 06:03:16,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:03:16,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53500611] [2021-12-28 06:03:16,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:03:16,128 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:03:16,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat