./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2c_remove_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/sll2c_remove_all_reverse.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c14c077a0594782eb123e5b340b8e06ed5b95f63 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/sll2c_remove_all_reverse.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c14c077a0594782eb123e5b340b8e06ed5b95f63 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 07:23:52,003 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 07:23:52,005 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 07:23:52,036 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 07:23:52,037 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 07:23:52,039 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 07:23:52,040 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 07:23:52,044 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 07:23:52,045 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 07:23:52,049 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 07:23:52,050 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 07:23:52,054 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 07:23:52,054 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 07:23:52,056 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 07:23:52,058 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 07:23:52,061 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 07:23:52,061 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 07:23:52,062 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 07:23:52,064 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 07:23:52,069 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 07:23:52,070 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 07:23:52,071 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 07:23:52,073 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 07:23:52,074 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 07:23:52,079 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 07:23:52,080 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 07:23:52,080 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 07:23:52,081 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 07:23:52,082 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 07:23:52,082 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 07:23:52,082 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 07:23:52,083 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 07:23:52,084 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 07:23:52,085 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 07:23:52,085 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 07:23:52,086 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 07:23:52,086 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 07:23:52,086 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 07:23:52,087 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 07:23:52,088 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 07:23:52,088 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 07:23:52,092 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-08-27 07:23:52,113 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 07:23:52,113 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 07:23:52,114 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 07:23:52,114 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 07:23:52,116 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 07:23:52,116 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 07:23:52,116 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 07:23:52,116 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 07:23:52,116 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 07:23:52,116 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 07:23:52,117 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 07:23:52,117 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 07:23:52,117 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 07:23:52,117 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-08-27 07:23:52,118 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-08-27 07:23:52,118 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-08-27 07:23:52,125 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-27 07:23:52,125 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-08-27 07:23:52,125 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 07:23:52,126 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 07:23:52,126 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 07:23:52,126 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 07:23:52,126 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-27 07:23:52,126 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 07:23:52,126 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 07:23:52,126 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-27 07:23:52,127 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 07:23:52,127 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-27 07:23:52,127 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 07:23:52,127 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 -> c14c077a0594782eb123e5b340b8e06ed5b95f63 [2021-08-27 07:23:52,391 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 07:23:52,408 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 07:23:52,409 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 07:23:52,410 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 07:23:52,411 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 07:23:52,411 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_remove_all_reverse.i [2021-08-27 07:23:52,453 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ebd9b0db/f0249dc2e4d240888e709e19306c59ff/FLAG61262d11e [2021-08-27 07:23:52,834 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 07:23:52,837 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_remove_all_reverse.i [2021-08-27 07:23:52,849 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ebd9b0db/f0249dc2e4d240888e709e19306c59ff/FLAG61262d11e [2021-08-27 07:23:53,210 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ebd9b0db/f0249dc2e4d240888e709e19306c59ff [2021-08-27 07:23:53,212 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 07:23:53,213 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-27 07:23:53,215 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 07:23:53,216 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 07:23:53,220 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 07:23:53,220 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 07:23:53" (1/1) ... [2021-08-27 07:23:53,221 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a299af2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:23:53, skipping insertion in model container [2021-08-27 07:23:53,221 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 07:23:53" (1/1) ... [2021-08-27 07:23:53,226 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 07:23:53,257 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 07:23:53,461 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_remove_all_reverse.i[24151,24164] [2021-08-27 07:23:53,463 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 07:23:53,467 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 07:23:53,500 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_remove_all_reverse.i[24151,24164] [2021-08-27 07:23:53,505 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 07:23:53,531 INFO L208 MainTranslator]: Completed translation [2021-08-27 07:23:53,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:23:53 WrapperNode [2021-08-27 07:23:53,531 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 07:23:53,533 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 07:23:53,533 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 07:23:53,533 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 07:23:53,540 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:23:53" (1/1) ... [2021-08-27 07:23:53,540 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:23:53" (1/1) ... [2021-08-27 07:23:53,558 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:23:53" (1/1) ... [2021-08-27 07:23:53,559 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:23:53" (1/1) ... [2021-08-27 07:23:53,568 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:23:53" (1/1) ... [2021-08-27 07:23:53,570 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:23:53" (1/1) ... [2021-08-27 07:23:53,572 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:23:53" (1/1) ... [2021-08-27 07:23:53,576 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 07:23:53,576 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 07:23:53,576 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 07:23:53,576 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 07:23:53,577 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:23:53" (1/1) ... [2021-08-27 07:23:53,581 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 07:23:53,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 07:23:53,593 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-08-27 07:23:53,609 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-08-27 07:23:53,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-08-27 07:23:53,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 07:23:53,619 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-08-27 07:23:53,619 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2021-08-27 07:23:53,619 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2021-08-27 07:23:53,619 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2021-08-27 07:23:53,619 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-08-27 07:23:53,620 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_create [2021-08-27 07:23:53,620 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_remove_last [2021-08-27 07:23:53,620 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-08-27 07:23:53,620 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-08-27 07:23:53,620 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-08-27 07:23:53,621 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-08-27 07:23:53,621 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-08-27 07:23:53,621 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-08-27 07:23:53,621 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 07:23:53,621 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2021-08-27 07:23:53,621 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2021-08-27 07:23:53,621 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-08-27 07:23:53,621 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-08-27 07:23:53,622 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-08-27 07:23:53,622 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-08-27 07:23:53,622 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-08-27 07:23:53,622 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-08-27 07:23:53,622 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-08-27 07:23:53,622 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-08-27 07:23:53,622 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-08-27 07:23:53,622 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-08-27 07:23:53,622 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-08-27 07:23:53,623 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-08-27 07:23:53,623 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-08-27 07:23:53,623 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-08-27 07:23:53,623 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-08-27 07:23:53,623 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-08-27 07:23:53,623 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-08-27 07:23:53,623 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-08-27 07:23:53,623 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-08-27 07:23:53,624 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-08-27 07:23:53,624 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-08-27 07:23:53,624 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-08-27 07:23:53,624 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-08-27 07:23:53,624 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-08-27 07:23:53,624 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-08-27 07:23:53,624 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-08-27 07:23:53,624 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-08-27 07:23:53,624 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-08-27 07:23:53,625 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-08-27 07:23:53,625 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-08-27 07:23:53,625 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-08-27 07:23:53,625 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-08-27 07:23:53,625 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-08-27 07:23:53,625 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-08-27 07:23:53,625 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-08-27 07:23:53,625 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-08-27 07:23:53,625 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-08-27 07:23:53,626 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-08-27 07:23:53,626 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-08-27 07:23:53,626 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-08-27 07:23:53,626 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-08-27 07:23:53,626 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-08-27 07:23:53,626 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-08-27 07:23:53,626 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-08-27 07:23:53,626 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-08-27 07:23:53,627 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-08-27 07:23:53,627 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-08-27 07:23:53,627 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-08-27 07:23:53,627 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-08-27 07:23:53,627 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-08-27 07:23:53,627 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-08-27 07:23:53,627 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-08-27 07:23:53,627 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-08-27 07:23:53,628 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-08-27 07:23:53,628 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2021-08-27 07:23:53,628 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-08-27 07:23:53,628 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-08-27 07:23:53,628 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-08-27 07:23:53,628 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2021-08-27 07:23:53,628 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-08-27 07:23:53,628 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2021-08-27 07:23:53,628 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-08-27 07:23:53,629 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-08-27 07:23:53,629 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2021-08-27 07:23:53,629 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-08-27 07:23:53,629 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-08-27 07:23:53,629 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-08-27 07:23:53,629 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-08-27 07:23:53,629 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-08-27 07:23:53,629 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-08-27 07:23:53,630 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-08-27 07:23:53,630 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-08-27 07:23:53,630 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-08-27 07:23:53,630 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-08-27 07:23:53,630 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-08-27 07:23:53,630 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-08-27 07:23:53,630 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-08-27 07:23:53,630 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-08-27 07:23:53,630 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-08-27 07:23:53,631 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-08-27 07:23:53,631 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-08-27 07:23:53,631 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-08-27 07:23:53,631 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-08-27 07:23:53,631 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-08-27 07:23:53,631 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-08-27 07:23:53,631 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-08-27 07:23:53,631 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-08-27 07:23:53,631 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-08-27 07:23:53,632 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-08-27 07:23:53,632 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-08-27 07:23:53,632 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-08-27 07:23:53,632 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-08-27 07:23:53,632 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-08-27 07:23:53,632 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-08-27 07:23:53,632 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-08-27 07:23:53,632 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-08-27 07:23:53,632 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-08-27 07:23:53,633 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-08-27 07:23:53,633 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-08-27 07:23:53,633 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-08-27 07:23:53,633 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-08-27 07:23:53,633 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-08-27 07:23:53,633 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2021-08-27 07:23:53,633 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-08-27 07:23:53,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-27 07:23:53,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-27 07:23:53,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-27 07:23:53,634 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_create [2021-08-27 07:23:53,634 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_remove_last [2021-08-27 07:23:53,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-27 07:23:53,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 07:23:53,634 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-08-27 07:23:53,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-08-27 07:23:53,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-08-27 07:23:53,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-27 07:23:53,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 07:23:53,635 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-27 07:23:53,962 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2021-08-27 07:23:54,180 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 07:23:54,183 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-08-27 07:23:54,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 07:23:54 BoogieIcfgContainer [2021-08-27 07:23:54,185 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 07:23:54,187 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-27 07:23:54,189 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-27 07:23:54,191 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-27 07:23:54,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 07:23:53" (1/3) ... [2021-08-27 07:23:54,192 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b817e53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 07:23:54, skipping insertion in model container [2021-08-27 07:23:54,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:23:53" (2/3) ... [2021-08-27 07:23:54,192 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b817e53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 07:23:54, skipping insertion in model container [2021-08-27 07:23:54,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 07:23:54" (3/3) ... [2021-08-27 07:23:54,194 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_remove_all_reverse.i [2021-08-27 07:23:54,197 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-27 07:23:54,197 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 42 error locations. [2021-08-27 07:23:54,236 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-27 07:23:54,241 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, mConcurrency=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-08-27 07:23:54,241 INFO L340 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2021-08-27 07:23:54,260 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 56 states have (on average 1.9464285714285714) internal successors, (109), 98 states have internal predecessors, (109), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-08-27 07:23:54,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-27 07:23:54,265 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:23:54,266 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:23:54,266 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATION === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 38 more)] === [2021-08-27 07:23:54,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:23:54,274 INFO L82 PathProgramCache]: Analyzing trace with hash -13895041, now seen corresponding path program 1 times [2021-08-27 07:23:54,283 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:23:54,284 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818676736] [2021-08-27 07:23:54,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:23:54,284 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:23:54,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:23:54,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:23:54,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:23:54,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:23:54,505 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:23:54,505 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818676736] [2021-08-27 07:23:54,506 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818676736] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:23:54,506 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:23:54,506 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 07:23:54,507 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859738429] [2021-08-27 07:23:54,513 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:23:54,514 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:23:54,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:23:54,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:23:54,525 INFO L87 Difference]: Start difference. First operand has 111 states, 56 states have (on average 1.9464285714285714) internal successors, (109), 98 states have internal predecessors, (109), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:23:54,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:23:54,729 INFO L93 Difference]: Finished difference Result 109 states and 115 transitions. [2021-08-27 07:23:54,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:23:54,730 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2021-08-27 07:23:54,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:23:54,738 INFO L225 Difference]: With dead ends: 109 [2021-08-27 07:23:54,738 INFO L226 Difference]: Without dead ends: 103 [2021-08-27 07:23:54,739 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.0ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:23:54,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-08-27 07:23:54,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2021-08-27 07:23:54,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 53 states have (on average 1.830188679245283) internal successors, (97), 92 states have internal predecessors, (97), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-27 07:23:54,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 108 transitions. [2021-08-27 07:23:54,773 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 108 transitions. Word has length 12 [2021-08-27 07:23:54,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:23:54,774 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 108 transitions. [2021-08-27 07:23:54,774 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:23:54,774 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 108 transitions. [2021-08-27 07:23:54,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-27 07:23:54,774 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:23:54,774 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:23:54,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-27 07:23:54,775 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATION === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 38 more)] === [2021-08-27 07:23:54,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:23:54,775 INFO L82 PathProgramCache]: Analyzing trace with hash -13895040, now seen corresponding path program 1 times [2021-08-27 07:23:54,775 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:23:54,776 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458100737] [2021-08-27 07:23:54,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:23:54,776 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:23:54,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:23:54,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:23:54,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:23:54,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:23:54,883 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:23:54,883 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458100737] [2021-08-27 07:23:54,884 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458100737] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:23:54,884 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:23:54,884 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 07:23:54,884 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947512180] [2021-08-27 07:23:54,885 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:23:54,885 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:23:54,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:23:54,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:23:54,886 INFO L87 Difference]: Start difference. First operand 103 states and 108 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:23:55,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:23:55,028 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2021-08-27 07:23:55,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:23:55,029 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2021-08-27 07:23:55,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:23:55,029 INFO L225 Difference]: With dead ends: 101 [2021-08-27 07:23:55,030 INFO L226 Difference]: Without dead ends: 101 [2021-08-27 07:23:55,030 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 30.6ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:23:55,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-08-27 07:23:55,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2021-08-27 07:23:55,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 53 states have (on average 1.7924528301886793) internal successors, (95), 90 states have internal predecessors, (95), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-27 07:23:55,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2021-08-27 07:23:55,036 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 12 [2021-08-27 07:23:55,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:23:55,036 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2021-08-27 07:23:55,037 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:23:55,037 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2021-08-27 07:23:55,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-08-27 07:23:55,037 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:23:55,037 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:23:55,038 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-27 07:23:55,038 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting sll_circular_createErr2REQUIRES_VIOLATION === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 38 more)] === [2021-08-27 07:23:55,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:23:55,038 INFO L82 PathProgramCache]: Analyzing trace with hash 223144743, now seen corresponding path program 1 times [2021-08-27 07:23:55,038 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:23:55,039 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5359217] [2021-08-27 07:23:55,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:23:55,039 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:23:55,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:23:55,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:23:55,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:23:55,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-08-27 07:23:55,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:23:55,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:23:55,131 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:23:55,132 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5359217] [2021-08-27 07:23:55,132 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5359217] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:23:55,132 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:23:55,132 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-27 07:23:55,132 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439547221] [2021-08-27 07:23:55,133 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 07:23:55,133 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:23:55,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 07:23:55,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-27 07:23:55,134 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 07:23:55,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:23:55,398 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2021-08-27 07:23:55,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 07:23:55,398 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2021-08-27 07:23:55,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:23:55,399 INFO L225 Difference]: With dead ends: 108 [2021-08-27 07:23:55,399 INFO L226 Difference]: Without dead ends: 108 [2021-08-27 07:23:55,400 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 101.5ms TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2021-08-27 07:23:55,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-08-27 07:23:55,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 102. [2021-08-27 07:23:55,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 54 states have (on average 1.7777777777777777) internal successors, (96), 91 states have internal predecessors, (96), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-27 07:23:55,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 107 transitions. [2021-08-27 07:23:55,405 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 107 transitions. Word has length 19 [2021-08-27 07:23:55,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:23:55,406 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 107 transitions. [2021-08-27 07:23:55,406 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 07:23:55,406 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2021-08-27 07:23:55,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-08-27 07:23:55,406 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:23:55,407 INFO L512 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-08-27 07:23:55,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-27 07:23:55,407 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting sll_circular_createErr0REQUIRES_VIOLATION === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 38 more)] === [2021-08-27 07:23:55,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:23:55,407 INFO L82 PathProgramCache]: Analyzing trace with hash 901060830, now seen corresponding path program 1 times [2021-08-27 07:23:55,407 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:23:55,408 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440065294] [2021-08-27 07:23:55,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:23:55,408 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:23:55,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:23:55,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:23:55,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:23:55,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-08-27 07:23:55,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:23:55,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:23:55,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:23:55,497 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-08-27 07:23:55,498 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:23:55,498 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440065294] [2021-08-27 07:23:55,498 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440065294] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:23:55,498 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:23:55,498 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-27 07:23:55,498 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380224286] [2021-08-27 07:23:55,499 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 07:23:55,499 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:23:55,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 07:23:55,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-08-27 07:23:55,500 INFO L87 Difference]: Start difference. First operand 102 states and 107 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-27 07:23:55,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:23:55,766 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2021-08-27 07:23:55,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 07:23:55,767 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2021-08-27 07:23:55,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:23:55,770 INFO L225 Difference]: With dead ends: 102 [2021-08-27 07:23:55,771 INFO L226 Difference]: Without dead ends: 102 [2021-08-27 07:23:55,771 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 67.2ms TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-08-27 07:23:55,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-08-27 07:23:55,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2021-08-27 07:23:55,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 54 states have (on average 1.7592592592592593) internal successors, (95), 90 states have internal predecessors, (95), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-27 07:23:55,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2021-08-27 07:23:55,788 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 28 [2021-08-27 07:23:55,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:23:55,789 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2021-08-27 07:23:55,789 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-27 07:23:55,789 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2021-08-27 07:23:55,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-08-27 07:23:55,790 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:23:55,790 INFO L512 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-08-27 07:23:55,790 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-27 07:23:55,790 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting sll_circular_createErr1REQUIRES_VIOLATION === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 38 more)] === [2021-08-27 07:23:55,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:23:55,791 INFO L82 PathProgramCache]: Analyzing trace with hash 901060831, now seen corresponding path program 1 times [2021-08-27 07:23:55,791 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:23:55,791 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587760194] [2021-08-27 07:23:55,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:23:55,792 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:23:55,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:23:55,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:23:55,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:23:55,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-08-27 07:23:55,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:23:55,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:23:55,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:23:55,956 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 07:23:55,956 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:23:55,956 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587760194] [2021-08-27 07:23:55,956 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587760194] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:23:55,956 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:23:55,957 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-27 07:23:55,957 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162423137] [2021-08-27 07:23:55,957 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 07:23:55,957 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:23:55,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 07:23:55,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-08-27 07:23:55,958 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-27 07:23:56,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:23:56,231 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2021-08-27 07:23:56,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 07:23:56,232 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2021-08-27 07:23:56,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:23:56,232 INFO L225 Difference]: With dead ends: 101 [2021-08-27 07:23:56,233 INFO L226 Difference]: Without dead ends: 101 [2021-08-27 07:23:56,233 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 82.0ms TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-08-27 07:23:56,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-08-27 07:23:56,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2021-08-27 07:23:56,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 54 states have (on average 1.7407407407407407) internal successors, (94), 89 states have internal predecessors, (94), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-27 07:23:56,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2021-08-27 07:23:56,242 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 28 [2021-08-27 07:23:56,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:23:56,243 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2021-08-27 07:23:56,243 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-27 07:23:56,244 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2021-08-27 07:23:56,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-08-27 07:23:56,244 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:23:56,244 INFO L512 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-08-27 07:23:56,244 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-27 07:23:56,245 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting sll_circular_createErr2REQUIRES_VIOLATION === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 38 more)] === [2021-08-27 07:23:56,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:23:56,245 INFO L82 PathProgramCache]: Analyzing trace with hash -42279659, now seen corresponding path program 1 times [2021-08-27 07:23:56,245 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:23:56,245 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854273144] [2021-08-27 07:23:56,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:23:56,246 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:23:56,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:23:56,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:23:56,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:23:56,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-08-27 07:23:56,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:23:56,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:23:56,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:23:56,456 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-27 07:23:56,456 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:23:56,456 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854273144] [2021-08-27 07:23:56,456 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854273144] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:23:56,457 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887822242] [2021-08-27 07:23:56,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:23:56,457 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 07:23:56,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 07:23:56,458 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-08-27 07:23:56,476 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-08-27 07:23:56,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:23:56,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 21 conjunts are in the unsatisfiable core [2021-08-27 07:23:56,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:23:56,664 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 07:23:56,764 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-08-27 07:23:56,765 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-08-27 07:23:56,825 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 07:23:56,826 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [887822242] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:23:56,826 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-27 07:23:56,826 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9] total 14 [2021-08-27 07:23:56,826 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360481025] [2021-08-27 07:23:56,827 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-27 07:23:56,827 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:23:56,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 07:23:56,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2021-08-27 07:23:56,828 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand has 11 states, 10 states have (on average 2.3) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-08-27 07:23:57,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:23:57,035 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2021-08-27 07:23:57,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 07:23:57,035 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2021-08-27 07:23:57,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:23:57,036 INFO L225 Difference]: With dead ends: 101 [2021-08-27 07:23:57,036 INFO L226 Difference]: Without dead ends: 101 [2021-08-27 07:23:57,036 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 130.2ms TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2021-08-27 07:23:57,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-08-27 07:23:57,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2021-08-27 07:23:57,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 54 states have (on average 1.7222222222222223) internal successors, (93), 88 states have internal predecessors, (93), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-27 07:23:57,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 104 transitions. [2021-08-27 07:23:57,039 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 104 transitions. Word has length 31 [2021-08-27 07:23:57,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:23:57,040 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 104 transitions. [2021-08-27 07:23:57,040 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-08-27 07:23:57,040 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2021-08-27 07:23:57,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-08-27 07:23:57,040 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:23:57,041 INFO L512 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-08-27 07:23:57,073 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-08-27 07:23:57,274 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-08-27 07:23:57,274 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting sll_circular_createErr3REQUIRES_VIOLATION === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 38 more)] === [2021-08-27 07:23:57,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:23:57,275 INFO L82 PathProgramCache]: Analyzing trace with hash -42279658, now seen corresponding path program 1 times [2021-08-27 07:23:57,275 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:23:57,275 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275120697] [2021-08-27 07:23:57,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:23:57,275 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:23:57,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:23:57,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:23:57,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:23:57,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-08-27 07:23:57,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:23:57,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:23:57,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:23:57,427 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-27 07:23:57,427 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:23:57,428 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275120697] [2021-08-27 07:23:57,428 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275120697] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:23:57,428 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080334104] [2021-08-27 07:23:57,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:23:57,428 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 07:23:57,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 07:23:57,436 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-08-27 07:23:57,437 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-08-27 07:23:57,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:23:57,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 29 conjunts are in the unsatisfiable core [2021-08-27 07:23:57,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:23:57,597 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 07:23:57,761 INFO L354 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2021-08-27 07:23:57,762 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 9 [2021-08-27 07:23:57,839 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 07:23:57,840 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080334104] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:23:57,840 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 07:23:57,840 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2021-08-27 07:23:57,840 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687792278] [2021-08-27 07:23:57,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-27 07:23:57,841 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:23:57,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-27 07:23:57,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-08-27 07:23:57,841 INFO L87 Difference]: Start difference. First operand 99 states and 104 transitions. Second operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2021-08-27 07:23:58,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:23:58,232 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2021-08-27 07:23:58,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 07:23:58,232 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2021-08-27 07:23:58,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:23:58,233 INFO L225 Difference]: With dead ends: 99 [2021-08-27 07:23:58,233 INFO L226 Difference]: Without dead ends: 99 [2021-08-27 07:23:58,234 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 198.2ms TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2021-08-27 07:23:58,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-08-27 07:23:58,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2021-08-27 07:23:58,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 54 states have (on average 1.7037037037037037) internal successors, (92), 87 states have internal predecessors, (92), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-27 07:23:58,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 103 transitions. [2021-08-27 07:23:58,237 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 103 transitions. Word has length 31 [2021-08-27 07:23:58,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:23:58,251 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 103 transitions. [2021-08-27 07:23:58,252 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2021-08-27 07:23:58,252 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2021-08-27 07:23:58,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-08-27 07:23:58,252 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:23:58,253 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:23:58,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-08-27 07:23:58,465 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-08-27 07:23:58,466 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0REQUIRES_VIOLATION === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 38 more)] === [2021-08-27 07:23:58,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:23:58,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1938324851, now seen corresponding path program 1 times [2021-08-27 07:23:58,467 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:23:58,472 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674966509] [2021-08-27 07:23:58,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:23:58,472 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:23:58,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:23:58,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:23:58,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:23:58,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:23:58,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:23:58,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:23:58,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:23:58,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 07:23:58,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:23:58,626 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-08-27 07:23:58,626 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:23:58,626 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674966509] [2021-08-27 07:23:58,626 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674966509] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:23:58,626 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:23:58,626 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 07:23:58,626 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515890927] [2021-08-27 07:23:58,627 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 07:23:58,627 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:23:58,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 07:23:58,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-08-27 07:23:58,627 INFO L87 Difference]: Start difference. First operand 98 states and 103 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-08-27 07:23:58,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:23:58,780 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2021-08-27 07:23:58,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 07:23:58,781 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 37 [2021-08-27 07:23:58,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:23:58,781 INFO L225 Difference]: With dead ends: 101 [2021-08-27 07:23:58,781 INFO L226 Difference]: Without dead ends: 101 [2021-08-27 07:23:58,782 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 39.9ms TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-08-27 07:23:58,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-08-27 07:23:58,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2021-08-27 07:23:58,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 55 states have (on average 1.690909090909091) internal successors, (93), 88 states have internal predecessors, (93), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-27 07:23:58,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 104 transitions. [2021-08-27 07:23:58,784 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 104 transitions. Word has length 37 [2021-08-27 07:23:58,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:23:58,784 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 104 transitions. [2021-08-27 07:23:58,784 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-08-27 07:23:58,784 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2021-08-27 07:23:58,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-08-27 07:23:58,785 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:23:58,785 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:23:58,785 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-27 07:23:58,785 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting sll_circular_remove_lastErr1REQUIRES_VIOLATION === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 38 more)] === [2021-08-27 07:23:58,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:23:58,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1285812081, now seen corresponding path program 1 times [2021-08-27 07:23:58,786 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:23:58,786 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383215740] [2021-08-27 07:23:58,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:23:58,786 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:23:58,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:23:58,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:23:58,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:23:58,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:23:58,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:23:59,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:23:59,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:23:59,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 07:23:59,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:23:59,142 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-08-27 07:23:59,142 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:23:59,143 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383215740] [2021-08-27 07:23:59,143 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383215740] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:23:59,143 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103596503] [2021-08-27 07:23:59,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:23:59,143 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 07:23:59,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 07:23:59,144 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-08-27 07:23:59,161 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-08-27 07:23:59,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:23:59,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 23 conjunts are in the unsatisfiable core [2021-08-27 07:23:59,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:23:59,337 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 07:23:59,371 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-08-27 07:23:59,768 INFO L354 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2021-08-27 07:23:59,768 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2021-08-27 07:23:59,906 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-08-27 07:23:59,906 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103596503] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:23:59,906 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 07:23:59,906 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2021-08-27 07:23:59,906 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969047724] [2021-08-27 07:23:59,907 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-08-27 07:23:59,907 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:23:59,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-08-27 07:23:59,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2021-08-27 07:23:59,908 INFO L87 Difference]: Start difference. First operand 99 states and 104 transitions. Second operand has 19 states, 16 states have (on average 2.8125) internal successors, (45), 15 states have internal predecessors, (45), 8 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2021-08-27 07:24:00,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:24:00,864 INFO L93 Difference]: Finished difference Result 172 states and 184 transitions. [2021-08-27 07:24:00,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-27 07:24:00,864 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 2.8125) internal successors, (45), 15 states have internal predecessors, (45), 8 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) Word has length 39 [2021-08-27 07:24:00,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:24:00,865 INFO L225 Difference]: With dead ends: 172 [2021-08-27 07:24:00,865 INFO L226 Difference]: Without dead ends: 172 [2021-08-27 07:24:00,865 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 451.7ms TimeCoverageRelationStatistics Valid=132, Invalid=518, Unknown=0, NotChecked=0, Total=650 [2021-08-27 07:24:00,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2021-08-27 07:24:00,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 143. [2021-08-27 07:24:00,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 95 states have (on average 1.7052631578947368) internal successors, (162), 128 states have internal predecessors, (162), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2021-08-27 07:24:00,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 178 transitions. [2021-08-27 07:24:00,868 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 178 transitions. Word has length 39 [2021-08-27 07:24:00,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:24:00,869 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 178 transitions. [2021-08-27 07:24:00,869 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 2.8125) internal successors, (45), 15 states have internal predecessors, (45), 8 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2021-08-27 07:24:00,869 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 178 transitions. [2021-08-27 07:24:00,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-08-27 07:24:00,869 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:24:00,869 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:24:00,887 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-08-27 07:24:01,076 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 07:24:01,077 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting sll_circular_remove_lastErr0REQUIRES_VIOLATION === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 38 more)] === [2021-08-27 07:24:01,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:24:01,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1285812080, now seen corresponding path program 1 times [2021-08-27 07:24:01,077 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:24:01,077 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668513403] [2021-08-27 07:24:01,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:24:01,077 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:24:01,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:24:01,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:24:01,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:24:01,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:24:01,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:24:01,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:24:01,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:24:01,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 07:24:01,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:24:01,445 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-08-27 07:24:01,446 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:24:01,446 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668513403] [2021-08-27 07:24:01,446 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668513403] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:24:01,446 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140382720] [2021-08-27 07:24:01,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:24:01,446 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 07:24:01,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 07:24:01,473 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-08-27 07:24:01,497 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-08-27 07:24:01,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:24:01,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 26 conjunts are in the unsatisfiable core [2021-08-27 07:24:01,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:24:01,708 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 07:24:01,727 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-08-27 07:24:02,096 INFO L354 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2021-08-27 07:24:02,097 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 24 [2021-08-27 07:24:02,209 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 07:24:02,209 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [140382720] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:24:02,209 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 07:24:02,210 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2021-08-27 07:24:02,210 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249188690] [2021-08-27 07:24:02,210 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-08-27 07:24:02,210 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:24:02,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-08-27 07:24:02,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2021-08-27 07:24:02,211 INFO L87 Difference]: Start difference. First operand 143 states and 178 transitions. Second operand has 23 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 18 states have internal predecessors, (56), 7 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2021-08-27 07:25:19,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:25:19,685 INFO L93 Difference]: Finished difference Result 183 states and 223 transitions. [2021-08-27 07:25:19,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-27 07:25:19,685 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 18 states have internal predecessors, (56), 7 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) Word has length 39 [2021-08-27 07:25:19,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:25:19,686 INFO L225 Difference]: With dead ends: 183 [2021-08-27 07:25:19,686 INFO L226 Difference]: Without dead ends: 183 [2021-08-27 07:25:19,687 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 2563.2ms TimeCoverageRelationStatistics Valid=159, Invalid=832, Unknown=1, NotChecked=0, Total=992 [2021-08-27 07:25:19,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2021-08-27 07:25:19,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 156. [2021-08-27 07:25:19,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 107 states have (on average 1.6822429906542056) internal successors, (180), 140 states have internal predecessors, (180), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2021-08-27 07:25:19,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 198 transitions. [2021-08-27 07:25:19,690 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 198 transitions. Word has length 39 [2021-08-27 07:25:19,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:25:19,690 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 198 transitions. [2021-08-27 07:25:19,690 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 18 states have internal predecessors, (56), 7 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2021-08-27 07:25:19,690 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 198 transitions. [2021-08-27 07:25:19,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-08-27 07:25:19,691 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:25:19,691 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:25:19,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-08-27 07:25:19,898 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 07:25:19,899 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting sll_circular_remove_lastErr2REQUIRES_VIOLATION === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 38 more)] === [2021-08-27 07:25:19,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:25:19,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1285171243, now seen corresponding path program 1 times [2021-08-27 07:25:19,899 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:25:19,899 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80891006] [2021-08-27 07:25:19,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:25:19,899 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:25:19,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:19,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:25:19,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:19,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:25:19,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:20,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:25:20,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:20,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 07:25:20,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:20,099 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-08-27 07:25:20,100 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:25:20,100 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80891006] [2021-08-27 07:25:20,100 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80891006] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:25:20,100 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:25:20,100 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-08-27 07:25:20,101 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911825101] [2021-08-27 07:25:20,101 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-08-27 07:25:20,101 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:25:20,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-27 07:25:20,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2021-08-27 07:25:20,102 INFO L87 Difference]: Start difference. First operand 156 states and 198 transitions. Second operand has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 11 states have internal predecessors, (29), 2 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2021-08-27 07:25:20,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:25:20,847 INFO L93 Difference]: Finished difference Result 214 states and 268 transitions. [2021-08-27 07:25:20,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-27 07:25:20,848 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 11 states have internal predecessors, (29), 2 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 41 [2021-08-27 07:25:20,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:25:20,851 INFO L225 Difference]: With dead ends: 214 [2021-08-27 07:25:20,851 INFO L226 Difference]: Without dead ends: 214 [2021-08-27 07:25:20,851 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 289.0ms TimeCoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2021-08-27 07:25:20,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2021-08-27 07:25:20,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 160. [2021-08-27 07:25:20,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 112 states have (on average 1.6428571428571428) internal successors, (184), 143 states have internal predecessors, (184), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2021-08-27 07:25:20,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 204 transitions. [2021-08-27 07:25:20,857 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 204 transitions. Word has length 41 [2021-08-27 07:25:20,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:25:20,857 INFO L470 AbstractCegarLoop]: Abstraction has 160 states and 204 transitions. [2021-08-27 07:25:20,857 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 11 states have internal predecessors, (29), 2 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2021-08-27 07:25:20,857 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 204 transitions. [2021-08-27 07:25:20,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-08-27 07:25:20,860 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:25:20,860 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:25:20,860 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-27 07:25:20,861 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting sll_circular_remove_lastErr3REQUIRES_VIOLATION === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 38 more)] === [2021-08-27 07:25:20,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:25:20,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1285171242, now seen corresponding path program 1 times [2021-08-27 07:25:20,861 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:25:20,861 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582652730] [2021-08-27 07:25:20,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:25:20,861 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:25:20,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:20,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:25:20,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:20,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:25:20,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:21,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:25:21,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:21,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 07:25:21,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:21,118 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 07:25:21,118 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:25:21,118 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582652730] [2021-08-27 07:25:21,118 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582652730] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:25:21,118 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:25:21,119 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-08-27 07:25:21,121 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439926738] [2021-08-27 07:25:21,121 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-08-27 07:25:21,121 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:25:21,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-27 07:25:21,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2021-08-27 07:25:21,122 INFO L87 Difference]: Start difference. First operand 160 states and 204 transitions. Second operand has 16 states, 15 states have (on average 2.066666666666667) internal successors, (31), 11 states have internal predecessors, (31), 2 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2021-08-27 07:25:22,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:25:22,099 INFO L93 Difference]: Finished difference Result 297 states and 372 transitions. [2021-08-27 07:25:22,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-08-27 07:25:22,100 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.066666666666667) internal successors, (31), 11 states have internal predecessors, (31), 2 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 41 [2021-08-27 07:25:22,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:25:22,101 INFO L225 Difference]: With dead ends: 297 [2021-08-27 07:25:22,102 INFO L226 Difference]: Without dead ends: 297 [2021-08-27 07:25:22,103 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 397.7ms TimeCoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2021-08-27 07:25:22,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2021-08-27 07:25:22,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 208. [2021-08-27 07:25:22,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 158 states have (on average 1.6962025316455696) internal successors, (268), 191 states have internal predecessors, (268), 10 states have call successors, (10), 8 states have call predecessors, (10), 8 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) [2021-08-27 07:25:22,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 290 transitions. [2021-08-27 07:25:22,115 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 290 transitions. Word has length 41 [2021-08-27 07:25:22,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:25:22,116 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 290 transitions. [2021-08-27 07:25:22,116 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.066666666666667) internal successors, (31), 11 states have internal predecessors, (31), 2 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2021-08-27 07:25:22,116 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 290 transitions. [2021-08-27 07:25:22,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-08-27 07:25:22,119 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:25:22,119 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:25:22,119 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-27 07:25:22,119 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting sll_circular_remove_lastErr2REQUIRES_VIOLATION === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 38 more)] === [2021-08-27 07:25:22,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:25:22,120 INFO L82 PathProgramCache]: Analyzing trace with hash -208258903, now seen corresponding path program 1 times [2021-08-27 07:25:22,120 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:25:22,122 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836981061] [2021-08-27 07:25:22,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:25:22,124 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:25:22,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:22,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:25:22,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:22,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:25:22,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:22,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:25:22,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:22,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 07:25:22,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:22,510 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 07:25:22,510 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:25:22,510 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836981061] [2021-08-27 07:25:22,510 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836981061] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:25:22,511 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107790606] [2021-08-27 07:25:22,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:25:22,511 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 07:25:22,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 07:25:22,512 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-08-27 07:25:22,513 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-08-27 07:25:22,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:22,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 76 conjunts are in the unsatisfiable core [2021-08-27 07:25:22,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:25:22,790 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 07:25:22,945 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 07:25:22,945 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-08-27 07:25:23,020 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-08-27 07:25:23,115 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 07:25:23,115 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 27 [2021-08-27 07:25:23,509 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 62 [2021-08-27 07:25:23,704 INFO L354 Elim1Store]: treesize reduction 29, result has 12.1 percent of original size [2021-08-27 07:25:23,704 INFO L388 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 26 [2021-08-27 07:25:23,711 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:25:23,711 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1107790606] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:25:23,712 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 07:25:23,712 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 39 [2021-08-27 07:25:23,712 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331104132] [2021-08-27 07:25:23,712 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-08-27 07:25:23,712 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:25:23,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-08-27 07:25:23,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=1465, Unknown=0, NotChecked=0, Total=1560 [2021-08-27 07:25:23,713 INFO L87 Difference]: Start difference. First operand 208 states and 290 transitions. Second operand has 40 states, 38 states have (on average 1.6842105263157894) internal successors, (64), 30 states have internal predecessors, (64), 5 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) [2021-08-27 07:25:25,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:25:25,506 INFO L93 Difference]: Finished difference Result 246 states and 316 transitions. [2021-08-27 07:25:25,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-08-27 07:25:25,506 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 38 states have (on average 1.6842105263157894) internal successors, (64), 30 states have internal predecessors, (64), 5 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) Word has length 46 [2021-08-27 07:25:25,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:25:25,508 INFO L225 Difference]: With dead ends: 246 [2021-08-27 07:25:25,508 INFO L226 Difference]: Without dead ends: 246 [2021-08-27 07:25:25,509 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 1524.8ms TimeCoverageRelationStatistics Valid=257, Invalid=2823, Unknown=0, NotChecked=0, Total=3080 [2021-08-27 07:25:25,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2021-08-27 07:25:25,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 210. [2021-08-27 07:25:25,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 160 states have (on average 1.69375) internal successors, (271), 193 states have internal predecessors, (271), 10 states have call successors, (10), 8 states have call predecessors, (10), 8 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) [2021-08-27 07:25:25,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 293 transitions. [2021-08-27 07:25:25,517 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 293 transitions. Word has length 46 [2021-08-27 07:25:25,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:25:25,517 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 293 transitions. [2021-08-27 07:25:25,517 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 38 states have (on average 1.6842105263157894) internal successors, (64), 30 states have internal predecessors, (64), 5 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) [2021-08-27 07:25:25,517 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 293 transitions. [2021-08-27 07:25:25,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-08-27 07:25:25,518 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:25:25,518 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:25:25,537 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-08-27 07:25:25,737 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-08-27 07:25:25,737 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting sll_circular_remove_lastErr3REQUIRES_VIOLATION === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 38 more)] === [2021-08-27 07:25:25,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:25:25,738 INFO L82 PathProgramCache]: Analyzing trace with hash -208258902, now seen corresponding path program 1 times [2021-08-27 07:25:25,738 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:25:25,738 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881831590] [2021-08-27 07:25:25,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:25:25,739 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:25:25,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:25,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:25:25,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:25,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:25:25,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:26,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:25:26,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:26,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 07:25:26,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:26,326 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 07:25:26,327 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:25:26,327 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881831590] [2021-08-27 07:25:26,327 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881831590] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:25:26,327 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732590039] [2021-08-27 07:25:26,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:25:26,327 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 07:25:26,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 07:25:26,328 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-08-27 07:25:26,329 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-08-27 07:25:26,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:26,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 88 conjunts are in the unsatisfiable core [2021-08-27 07:25:26,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:25:26,672 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 07:25:26,675 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 07:25:27,025 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 07:25:27,026 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-08-27 07:25:27,031 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-08-27 07:25:27,156 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-08-27 07:25:27,165 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-08-27 07:25:27,320 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 07:25:27,320 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 55 [2021-08-27 07:25:27,328 INFO L354 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2021-08-27 07:25:27,328 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 56 [2021-08-27 07:25:28,551 INFO L354 Elim1Store]: treesize reduction 69, result has 10.4 percent of original size [2021-08-27 07:25:28,551 INFO L388 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 135 treesize of output 76 [2021-08-27 07:25:28,564 INFO L354 Elim1Store]: treesize reduction 62, result has 4.6 percent of original size [2021-08-27 07:25:28,564 INFO L388 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 61 treesize of output 43 [2021-08-27 07:25:28,697 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:25:28,697 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1732590039] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:25:28,697 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 07:25:28,698 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 46 [2021-08-27 07:25:28,698 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637723930] [2021-08-27 07:25:28,698 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2021-08-27 07:25:28,698 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:25:28,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-08-27 07:25:28,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=2049, Unknown=0, NotChecked=0, Total=2162 [2021-08-27 07:25:28,699 INFO L87 Difference]: Start difference. First operand 210 states and 293 transitions. Second operand has 47 states, 45 states have (on average 1.5777777777777777) internal successors, (71), 36 states have internal predecessors, (71), 6 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (7), 7 states have call predecessors, (7), 4 states have call successors, (7) [2021-08-27 07:25:32,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:25:32,556 INFO L93 Difference]: Finished difference Result 290 states and 362 transitions. [2021-08-27 07:25:32,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-08-27 07:25:32,556 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 45 states have (on average 1.5777777777777777) internal successors, (71), 36 states have internal predecessors, (71), 6 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (7), 7 states have call predecessors, (7), 4 states have call successors, (7) Word has length 46 [2021-08-27 07:25:32,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:25:32,558 INFO L225 Difference]: With dead ends: 290 [2021-08-27 07:25:32,558 INFO L226 Difference]: Without dead ends: 290 [2021-08-27 07:25:32,559 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 3063.5ms TimeCoverageRelationStatistics Valid=313, Invalid=4109, Unknown=0, NotChecked=0, Total=4422 [2021-08-27 07:25:32,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2021-08-27 07:25:32,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 213. [2021-08-27 07:25:32,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 163 states have (on average 1.6809815950920246) internal successors, (274), 196 states have internal predecessors, (274), 10 states have call successors, (10), 8 states have call predecessors, (10), 8 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) [2021-08-27 07:25:32,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 296 transitions. [2021-08-27 07:25:32,563 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 296 transitions. Word has length 46 [2021-08-27 07:25:32,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:25:32,564 INFO L470 AbstractCegarLoop]: Abstraction has 213 states and 296 transitions. [2021-08-27 07:25:32,564 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 45 states have (on average 1.5777777777777777) internal successors, (71), 36 states have internal predecessors, (71), 6 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (7), 7 states have call predecessors, (7), 4 states have call successors, (7) [2021-08-27 07:25:32,564 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 296 transitions. [2021-08-27 07:25:32,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-08-27 07:25:32,564 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:25:32,564 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:25:32,584 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-08-27 07:25:32,782 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 07:25:32,783 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting sll_circular_remove_lastErr12ASSERT_VIOLATIONMEMORY_FREE === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 38 more)] === [2021-08-27 07:25:32,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:25:32,783 INFO L82 PathProgramCache]: Analyzing trace with hash 2132279553, now seen corresponding path program 1 times [2021-08-27 07:25:32,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:25:32,784 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398762973] [2021-08-27 07:25:32,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:25:32,784 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:25:32,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:32,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:25:32,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:32,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:25:32,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:32,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:25:32,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:32,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 07:25:32,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:32,933 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 07:25:32,933 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:25:32,934 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398762973] [2021-08-27 07:25:32,934 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398762973] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:25:32,934 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:25:32,934 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-08-27 07:25:32,934 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314659867] [2021-08-27 07:25:32,934 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-27 07:25:32,934 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:25:32,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-27 07:25:32,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2021-08-27 07:25:32,935 INFO L87 Difference]: Start difference. First operand 213 states and 296 transitions. Second operand has 15 states, 14 states have (on average 2.642857142857143) internal successors, (37), 10 states have internal predecessors, (37), 2 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2021-08-27 07:25:33,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:25:33,640 INFO L93 Difference]: Finished difference Result 317 states and 431 transitions. [2021-08-27 07:25:33,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-08-27 07:25:33,640 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.642857142857143) internal successors, (37), 10 states have internal predecessors, (37), 2 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 47 [2021-08-27 07:25:33,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:25:33,642 INFO L225 Difference]: With dead ends: 317 [2021-08-27 07:25:33,642 INFO L226 Difference]: Without dead ends: 317 [2021-08-27 07:25:33,642 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 282.6ms TimeCoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2021-08-27 07:25:33,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2021-08-27 07:25:33,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 261. [2021-08-27 07:25:33,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 203 states have (on average 1.6896551724137931) internal successors, (343), 240 states have internal predecessors, (343), 12 states have call successors, (12), 10 states have call predecessors, (12), 14 states have return successors, (22), 10 states have call predecessors, (22), 11 states have call successors, (22) [2021-08-27 07:25:33,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 377 transitions. [2021-08-27 07:25:33,648 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 377 transitions. Word has length 47 [2021-08-27 07:25:33,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:25:33,648 INFO L470 AbstractCegarLoop]: Abstraction has 261 states and 377 transitions. [2021-08-27 07:25:33,648 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.642857142857143) internal successors, (37), 10 states have internal predecessors, (37), 2 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2021-08-27 07:25:33,649 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 377 transitions. [2021-08-27 07:25:33,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-08-27 07:25:33,649 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:25:33,649 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:25:33,649 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-27 07:25:33,649 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting sll_circular_remove_lastErr19REQUIRES_VIOLATION === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 38 more)] === [2021-08-27 07:25:33,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:25:33,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1676587782, now seen corresponding path program 1 times [2021-08-27 07:25:33,650 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:25:33,650 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470566221] [2021-08-27 07:25:33,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:25:33,650 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:25:33,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:33,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:25:33,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:33,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:25:33,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:33,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:25:33,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:33,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 07:25:33,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:33,726 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-08-27 07:25:33,726 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:25:33,726 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470566221] [2021-08-27 07:25:33,726 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470566221] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:25:33,727 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:25:33,727 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-27 07:25:33,727 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401992397] [2021-08-27 07:25:33,727 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 07:25:33,727 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:25:33,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 07:25:33,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-27 07:25:33,728 INFO L87 Difference]: Start difference. First operand 261 states and 377 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2021-08-27 07:25:34,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:25:34,029 INFO L93 Difference]: Finished difference Result 316 states and 458 transitions. [2021-08-27 07:25:34,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 07:25:34,030 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 48 [2021-08-27 07:25:34,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:25:34,031 INFO L225 Difference]: With dead ends: 316 [2021-08-27 07:25:34,031 INFO L226 Difference]: Without dead ends: 316 [2021-08-27 07:25:34,031 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 121.7ms TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-08-27 07:25:34,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2021-08-27 07:25:34,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 269. [2021-08-27 07:25:34,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 212 states have (on average 1.7122641509433962) internal successors, (363), 248 states have internal predecessors, (363), 12 states have call successors, (12), 10 states have call predecessors, (12), 13 states have return successors, (21), 10 states have call predecessors, (21), 11 states have call successors, (21) [2021-08-27 07:25:34,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 396 transitions. [2021-08-27 07:25:34,038 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 396 transitions. Word has length 48 [2021-08-27 07:25:34,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:25:34,039 INFO L470 AbstractCegarLoop]: Abstraction has 269 states and 396 transitions. [2021-08-27 07:25:34,039 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2021-08-27 07:25:34,039 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 396 transitions. [2021-08-27 07:25:34,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-08-27 07:25:34,039 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:25:34,040 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:25:34,040 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-27 07:25:34,040 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting sll_circular_remove_lastErr13ASSERT_VIOLATIONMEMORY_FREE === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 38 more)] === [2021-08-27 07:25:34,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:25:34,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1676156833, now seen corresponding path program 1 times [2021-08-27 07:25:34,040 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:25:34,041 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159869401] [2021-08-27 07:25:34,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:25:34,041 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:25:34,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:34,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:25:34,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:34,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:25:34,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:34,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:25:34,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:34,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 07:25:34,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:34,211 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 07:25:34,211 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:25:34,211 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159869401] [2021-08-27 07:25:34,211 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159869401] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:25:34,211 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:25:34,211 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-08-27 07:25:34,212 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947160196] [2021-08-27 07:25:34,212 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-27 07:25:34,212 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:25:34,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-27 07:25:34,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2021-08-27 07:25:34,213 INFO L87 Difference]: Start difference. First operand 269 states and 396 transitions. Second operand has 15 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 10 states have internal predecessors, (38), 2 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2021-08-27 07:25:34,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:25:34,929 INFO L93 Difference]: Finished difference Result 332 states and 470 transitions. [2021-08-27 07:25:34,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-27 07:25:34,929 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 10 states have internal predecessors, (38), 2 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 48 [2021-08-27 07:25:34,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:25:34,931 INFO L225 Difference]: With dead ends: 332 [2021-08-27 07:25:34,931 INFO L226 Difference]: Without dead ends: 332 [2021-08-27 07:25:34,931 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 290.1ms TimeCoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2021-08-27 07:25:34,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2021-08-27 07:25:34,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 281. [2021-08-27 07:25:34,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 224 states have (on average 1.7142857142857142) internal successors, (384), 260 states have internal predecessors, (384), 12 states have call successors, (12), 10 states have call predecessors, (12), 13 states have return successors, (21), 10 states have call predecessors, (21), 11 states have call successors, (21) [2021-08-27 07:25:34,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 417 transitions. [2021-08-27 07:25:34,937 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 417 transitions. Word has length 48 [2021-08-27 07:25:34,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:25:34,937 INFO L470 AbstractCegarLoop]: Abstraction has 281 states and 417 transitions. [2021-08-27 07:25:34,937 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 10 states have internal predecessors, (38), 2 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2021-08-27 07:25:34,937 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 417 transitions. [2021-08-27 07:25:34,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-08-27 07:25:34,937 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:25:34,938 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:25:34,938 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-27 07:25:34,938 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting sll_circular_remove_lastErr14ASSERT_VIOLATIONMEMORY_FREE === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 38 more)] === [2021-08-27 07:25:34,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:25:34,938 INFO L82 PathProgramCache]: Analyzing trace with hash 421254403, now seen corresponding path program 1 times [2021-08-27 07:25:34,938 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:25:34,938 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242464731] [2021-08-27 07:25:34,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:25:34,938 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:25:34,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:34,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:25:34,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:35,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:25:35,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:35,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:25:35,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:35,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 07:25:35,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:35,021 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-08-27 07:25:35,021 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:25:35,021 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242464731] [2021-08-27 07:25:35,021 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242464731] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:25:35,021 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:25:35,021 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 07:25:35,022 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275958792] [2021-08-27 07:25:35,022 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 07:25:35,022 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:25:35,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 07:25:35,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-08-27 07:25:35,023 INFO L87 Difference]: Start difference. First operand 281 states and 417 transitions. Second operand has 9 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 1 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2021-08-27 07:25:35,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:25:35,448 INFO L93 Difference]: Finished difference Result 327 states and 468 transitions. [2021-08-27 07:25:35,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 07:25:35,448 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 1 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 49 [2021-08-27 07:25:35,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:25:35,450 INFO L225 Difference]: With dead ends: 327 [2021-08-27 07:25:35,450 INFO L226 Difference]: Without dead ends: 327 [2021-08-27 07:25:35,450 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 205.4ms TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2021-08-27 07:25:35,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2021-08-27 07:25:35,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 280. [2021-08-27 07:25:35,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 224 states have (on average 1.6875) internal successors, (378), 259 states have internal predecessors, (378), 12 states have call successors, (12), 10 states have call predecessors, (12), 13 states have return successors, (21), 10 states have call predecessors, (21), 11 states have call successors, (21) [2021-08-27 07:25:35,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 411 transitions. [2021-08-27 07:25:35,458 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 411 transitions. Word has length 49 [2021-08-27 07:25:35,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:25:35,458 INFO L470 AbstractCegarLoop]: Abstraction has 280 states and 411 transitions. [2021-08-27 07:25:35,458 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 1 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2021-08-27 07:25:35,458 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 411 transitions. [2021-08-27 07:25:35,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-08-27 07:25:35,459 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:25:35,459 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:25:35,459 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-27 07:25:35,459 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting sll_circular_remove_lastErr15REQUIRES_VIOLATION === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 38 more)] === [2021-08-27 07:25:35,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:25:35,460 INFO L82 PathProgramCache]: Analyzing trace with hash 173984740, now seen corresponding path program 1 times [2021-08-27 07:25:35,460 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:25:35,460 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598349041] [2021-08-27 07:25:35,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:25:35,460 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:25:35,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:35,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:25:35,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:35,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:25:35,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:35,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:25:35,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:35,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 07:25:35,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:35,795 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 07:25:35,795 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:25:35,796 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598349041] [2021-08-27 07:25:35,796 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598349041] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:25:35,796 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [794015448] [2021-08-27 07:25:35,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:25:35,796 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 07:25:35,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 07:25:35,797 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-08-27 07:25:35,798 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-08-27 07:25:36,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:36,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-27 07:25:36,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:25:36,441 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-08-27 07:25:36,441 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 19 [2021-08-27 07:25:36,477 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-08-27 07:25:36,478 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [794015448] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:25:36,478 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-27 07:25:36,478 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [21] total 27 [2021-08-27 07:25:36,478 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175762821] [2021-08-27 07:25:36,479 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 07:25:36,479 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:25:36,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 07:25:36,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=687, Unknown=0, NotChecked=0, Total=756 [2021-08-27 07:25:36,480 INFO L87 Difference]: Start difference. First operand 280 states and 411 transitions. Second operand has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-08-27 07:25:36,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:25:36,665 INFO L93 Difference]: Finished difference Result 275 states and 377 transitions. [2021-08-27 07:25:36,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 07:25:36,666 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 50 [2021-08-27 07:25:36,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:25:36,667 INFO L225 Difference]: With dead ends: 275 [2021-08-27 07:25:36,667 INFO L226 Difference]: Without dead ends: 275 [2021-08-27 07:25:36,667 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 414.9ms TimeCoverageRelationStatistics Valid=99, Invalid=893, Unknown=0, NotChecked=0, Total=992 [2021-08-27 07:25:36,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2021-08-27 07:25:36,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 274. [2021-08-27 07:25:36,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 223 states have (on average 1.5381165919282511) internal successors, (343), 253 states have internal predecessors, (343), 12 states have call successors, (12), 10 states have call predecessors, (12), 13 states have return successors, (21), 10 states have call predecessors, (21), 11 states have call successors, (21) [2021-08-27 07:25:36,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 376 transitions. [2021-08-27 07:25:36,672 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 376 transitions. Word has length 50 [2021-08-27 07:25:36,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:25:36,673 INFO L470 AbstractCegarLoop]: Abstraction has 274 states and 376 transitions. [2021-08-27 07:25:36,673 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-08-27 07:25:36,673 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 376 transitions. [2021-08-27 07:25:36,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-08-27 07:25:36,673 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:25:36,673 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:25:36,692 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-08-27 07:25:36,891 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 07:25:36,892 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting sll_circular_remove_lastErr1REQUIRES_VIOLATION === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 38 more)] === [2021-08-27 07:25:36,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:25:36,892 INFO L82 PathProgramCache]: Analyzing trace with hash 430153311, now seen corresponding path program 2 times [2021-08-27 07:25:36,892 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:25:36,892 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731598530] [2021-08-27 07:25:36,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:25:36,892 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:25:36,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:36,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:25:36,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:36,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:25:36,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:36,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:25:36,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:36,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 07:25:36,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:36,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-27 07:25:36,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:36,980 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-08-27 07:25:36,981 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:25:36,981 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731598530] [2021-08-27 07:25:36,981 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731598530] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:25:36,981 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194519531] [2021-08-27 07:25:36,981 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 07:25:36,981 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 07:25:36,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 07:25:36,982 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-08-27 07:25:36,983 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-08-27 07:25:37,390 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-27 07:25:37,390 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 07:25:37,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-27 07:25:37,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:25:37,520 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-08-27 07:25:37,521 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [194519531] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:25:37,521 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 07:25:37,521 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 10 [2021-08-27 07:25:37,521 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856949745] [2021-08-27 07:25:37,522 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-27 07:25:37,522 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:25:37,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 07:25:37,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-08-27 07:25:37,522 INFO L87 Difference]: Start difference. First operand 274 states and 376 transitions. Second operand has 10 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 7 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8) [2021-08-27 07:25:37,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:25:37,799 INFO L93 Difference]: Finished difference Result 172 states and 212 transitions. [2021-08-27 07:25:37,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 07:25:37,800 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 7 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8) Word has length 51 [2021-08-27 07:25:37,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:25:37,801 INFO L225 Difference]: With dead ends: 172 [2021-08-27 07:25:37,801 INFO L226 Difference]: Without dead ends: 163 [2021-08-27 07:25:37,801 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 103.1ms TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2021-08-27 07:25:37,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-08-27 07:25:37,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2021-08-27 07:25:37,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 129 states have (on average 1.4031007751937985) internal successors, (181), 149 states have internal predecessors, (181), 8 states have call successors, (8), 7 states have call predecessors, (8), 8 states have return successors, (12), 6 states have call predecessors, (12), 7 states have call successors, (12) [2021-08-27 07:25:37,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 201 transitions. [2021-08-27 07:25:37,805 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 201 transitions. Word has length 51 [2021-08-27 07:25:37,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:25:37,805 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 201 transitions. [2021-08-27 07:25:37,805 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 7 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8) [2021-08-27 07:25:37,805 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 201 transitions. [2021-08-27 07:25:37,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-08-27 07:25:37,806 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:25:37,806 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:25:37,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-08-27 07:25:38,025 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 07:25:38,025 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting sll_circular_remove_lastErr2REQUIRES_VIOLATION === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 38 more)] === [2021-08-27 07:25:38,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:25:38,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1939522475, now seen corresponding path program 2 times [2021-08-27 07:25:38,026 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:25:38,026 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148479908] [2021-08-27 07:25:38,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:25:38,026 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:25:38,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:38,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:25:38,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:38,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:25:38,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:38,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:25:38,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:38,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 07:25:38,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:38,543 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 07:25:38,544 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:25:38,544 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148479908] [2021-08-27 07:25:38,544 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148479908] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:25:38,544 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1631336245] [2021-08-27 07:25:38,544 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 07:25:38,544 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 07:25:38,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 07:25:38,545 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-08-27 07:25:38,547 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-08-27 07:25:38,959 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-27 07:25:38,960 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 07:25:38,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 103 conjunts are in the unsatisfiable core [2021-08-27 07:25:38,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:25:39,006 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 07:25:39,341 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 07:25:39,342 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-08-27 07:25:39,449 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-08-27 07:25:39,453 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-08-27 07:25:39,613 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-08-27 07:25:39,614 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 40 [2021-08-27 07:25:39,623 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 07:25:39,623 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 41 [2021-08-27 07:25:40,474 INFO L354 Elim1Store]: treesize reduction 94, result has 3.1 percent of original size [2021-08-27 07:25:40,475 INFO L388 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 108 treesize of output 74 [2021-08-27 07:25:40,669 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-08-27 07:25:40,669 INFO L388 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 26 [2021-08-27 07:25:40,675 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:25:40,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1631336245] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:25:40,676 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 07:25:40,676 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 49 [2021-08-27 07:25:40,676 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627786816] [2021-08-27 07:25:40,676 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2021-08-27 07:25:40,676 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:25:40,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-08-27 07:25:40,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=2319, Unknown=0, NotChecked=0, Total=2450 [2021-08-27 07:25:40,678 INFO L87 Difference]: Start difference. First operand 163 states and 201 transitions. Second operand has 50 states, 48 states have (on average 1.6458333333333333) internal successors, (79), 39 states have internal predecessors, (79), 6 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (7), 7 states have call predecessors, (7), 4 states have call successors, (7) [2021-08-27 07:25:43,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:25:43,471 INFO L93 Difference]: Finished difference Result 197 states and 225 transitions. [2021-08-27 07:25:43,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-08-27 07:25:43,471 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 1.6458333333333333) internal successors, (79), 39 states have internal predecessors, (79), 6 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (7), 7 states have call predecessors, (7), 4 states have call successors, (7) Word has length 51 [2021-08-27 07:25:43,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:25:43,472 INFO L225 Difference]: With dead ends: 197 [2021-08-27 07:25:43,472 INFO L226 Difference]: Without dead ends: 197 [2021-08-27 07:25:43,473 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 743 ImplicationChecksByTransitivity, 2452.9ms TimeCoverageRelationStatistics Valid=342, Invalid=4350, Unknown=0, NotChecked=0, Total=4692 [2021-08-27 07:25:43,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-08-27 07:25:43,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 165. [2021-08-27 07:25:43,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 131 states have (on average 1.4045801526717556) internal successors, (184), 151 states have internal predecessors, (184), 8 states have call successors, (8), 7 states have call predecessors, (8), 8 states have return successors, (12), 6 states have call predecessors, (12), 7 states have call successors, (12) [2021-08-27 07:25:43,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 204 transitions. [2021-08-27 07:25:43,476 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 204 transitions. Word has length 51 [2021-08-27 07:25:43,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:25:43,477 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 204 transitions. [2021-08-27 07:25:43,477 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 1.6458333333333333) internal successors, (79), 39 states have internal predecessors, (79), 6 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (7), 7 states have call predecessors, (7), 4 states have call successors, (7) [2021-08-27 07:25:43,477 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 204 transitions. [2021-08-27 07:25:43,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-08-27 07:25:43,477 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:25:43,478 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:25:43,499 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-08-27 07:25:43,688 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 07:25:43,688 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting sll_circular_remove_lastErr3REQUIRES_VIOLATION === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 38 more)] === [2021-08-27 07:25:43,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:25:43,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1939522474, now seen corresponding path program 2 times [2021-08-27 07:25:43,689 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:25:43,689 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688058935] [2021-08-27 07:25:43,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:25:43,689 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:25:43,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:43,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:25:43,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:43,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:25:43,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:44,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:25:44,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:44,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 07:25:44,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:44,199 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 07:25:44,199 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:25:44,199 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688058935] [2021-08-27 07:25:44,199 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688058935] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:25:44,200 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643986111] [2021-08-27 07:25:44,200 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 07:25:44,200 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 07:25:44,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 07:25:44,201 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-08-27 07:25:44,202 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-08-27 07:25:44,681 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-27 07:25:44,681 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 07:25:44,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 94 conjunts are in the unsatisfiable core [2021-08-27 07:25:44,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:25:44,729 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 07:25:44,908 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 07:25:44,909 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-08-27 07:25:44,992 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-08-27 07:25:44,999 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-08-27 07:25:45,098 INFO L354 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2021-08-27 07:25:45,099 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2021-08-27 07:25:45,107 INFO L354 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2021-08-27 07:25:45,108 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 41 [2021-08-27 07:25:45,916 INFO L354 Elim1Store]: treesize reduction 118, result has 8.5 percent of original size [2021-08-27 07:25:45,917 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 10 new quantified variables, introduced 10 case distinctions, treesize of input 150 treesize of output 91 [2021-08-27 07:25:45,943 INFO L354 Elim1Store]: treesize reduction 102, result has 6.4 percent of original size [2021-08-27 07:25:45,945 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 52 treesize of output 39 [2021-08-27 07:25:45,995 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:25:45,996 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [643986111] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:25:45,996 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 07:25:45,996 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 46 [2021-08-27 07:25:45,997 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327993035] [2021-08-27 07:25:45,998 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2021-08-27 07:25:45,998 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:25:45,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-08-27 07:25:45,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1944, Unknown=0, NotChecked=0, Total=2070 [2021-08-27 07:25:45,999 INFO L87 Difference]: Start difference. First operand 165 states and 204 transitions. Second operand has 46 states, 45 states have (on average 1.6222222222222222) internal successors, (73), 36 states have internal predecessors, (73), 5 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) [2021-08-27 07:25:48,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:25:48,056 INFO L93 Difference]: Finished difference Result 165 states and 187 transitions. [2021-08-27 07:25:48,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-08-27 07:25:48,056 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 1.6222222222222222) internal successors, (73), 36 states have internal predecessors, (73), 5 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) Word has length 51 [2021-08-27 07:25:48,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:25:48,057 INFO L225 Difference]: With dead ends: 165 [2021-08-27 07:25:48,057 INFO L226 Difference]: Without dead ends: 165 [2021-08-27 07:25:48,058 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 565 ImplicationChecksByTransitivity, 2002.9ms TimeCoverageRelationStatistics Valid=315, Invalid=3591, Unknown=0, NotChecked=0, Total=3906 [2021-08-27 07:25:48,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2021-08-27 07:25:48,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 152. [2021-08-27 07:25:48,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 118 states have (on average 1.3898305084745763) internal successors, (164), 138 states have internal predecessors, (164), 8 states have call successors, (8), 7 states have call predecessors, (8), 8 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) [2021-08-27 07:25:48,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 182 transitions. [2021-08-27 07:25:48,061 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 182 transitions. Word has length 51 [2021-08-27 07:25:48,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:25:48,061 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 182 transitions. [2021-08-27 07:25:48,061 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 1.6222222222222222) internal successors, (73), 36 states have internal predecessors, (73), 5 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) [2021-08-27 07:25:48,061 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 182 transitions. [2021-08-27 07:25:48,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-08-27 07:25:48,061 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:25:48,061 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:25:48,095 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2021-08-27 07:25:48,262 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-08-27 07:25:48,262 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting sll_circular_remove_lastErr19REQUIRES_VIOLATION === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 38 more)] === [2021-08-27 07:25:48,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:25:48,263 INFO L82 PathProgramCache]: Analyzing trace with hash 84638642, now seen corresponding path program 1 times [2021-08-27 07:25:48,263 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:25:48,263 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941483521] [2021-08-27 07:25:48,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:25:48,263 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:25:48,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:48,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:25:48,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:48,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:25:48,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:48,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:25:48,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:48,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 07:25:48,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:48,437 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-08-27 07:25:48,437 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:25:48,438 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941483521] [2021-08-27 07:25:48,438 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941483521] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:25:48,438 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:25:48,438 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-08-27 07:25:48,438 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999390271] [2021-08-27 07:25:48,438 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-08-27 07:25:48,438 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:25:48,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-27 07:25:48,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2021-08-27 07:25:48,439 INFO L87 Difference]: Start difference. First operand 152 states and 182 transitions. Second operand has 16 states, 15 states have (on average 2.6) internal successors, (39), 11 states have internal predecessors, (39), 2 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2021-08-27 07:25:49,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:25:49,119 INFO L93 Difference]: Finished difference Result 157 states and 182 transitions. [2021-08-27 07:25:49,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-27 07:25:49,120 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.6) internal successors, (39), 11 states have internal predecessors, (39), 2 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 53 [2021-08-27 07:25:49,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:25:49,121 INFO L225 Difference]: With dead ends: 157 [2021-08-27 07:25:49,121 INFO L226 Difference]: Without dead ends: 157 [2021-08-27 07:25:49,122 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 308.7ms TimeCoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2021-08-27 07:25:49,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-08-27 07:25:49,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 152. [2021-08-27 07:25:49,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 119 states have (on average 1.3781512605042017) internal successors, (164), 138 states have internal predecessors, (164), 8 states have call successors, (8), 7 states have call predecessors, (8), 8 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) [2021-08-27 07:25:49,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 182 transitions. [2021-08-27 07:25:49,126 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 182 transitions. Word has length 53 [2021-08-27 07:25:49,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:25:49,126 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 182 transitions. [2021-08-27 07:25:49,126 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.6) internal successors, (39), 11 states have internal predecessors, (39), 2 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2021-08-27 07:25:49,126 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 182 transitions. [2021-08-27 07:25:49,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-08-27 07:25:49,127 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:25:49,127 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:25:49,127 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-08-27 07:25:49,127 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting sll_circular_remove_lastErr20REQUIRES_VIOLATION === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 38 more)] === [2021-08-27 07:25:49,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:25:49,128 INFO L82 PathProgramCache]: Analyzing trace with hash 84638643, now seen corresponding path program 1 times [2021-08-27 07:25:49,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:25:49,128 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750110593] [2021-08-27 07:25:49,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:25:49,129 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:25:49,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:49,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:25:49,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:49,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:25:49,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:49,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:25:49,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:49,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 07:25:49,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:49,363 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-27 07:25:49,363 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:25:49,363 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750110593] [2021-08-27 07:25:49,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750110593] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:25:49,363 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:25:49,363 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-08-27 07:25:49,363 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73528133] [2021-08-27 07:25:49,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-08-27 07:25:49,364 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:25:49,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-27 07:25:49,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2021-08-27 07:25:49,364 INFO L87 Difference]: Start difference. First operand 152 states and 182 transitions. Second operand has 16 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 11 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2021-08-27 07:25:50,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:25:50,108 INFO L93 Difference]: Finished difference Result 173 states and 196 transitions. [2021-08-27 07:25:50,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-08-27 07:25:50,109 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 11 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 53 [2021-08-27 07:25:50,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:25:50,109 INFO L225 Difference]: With dead ends: 173 [2021-08-27 07:25:50,109 INFO L226 Difference]: Without dead ends: 173 [2021-08-27 07:25:50,110 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 385.5ms TimeCoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2021-08-27 07:25:50,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2021-08-27 07:25:50,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 159. [2021-08-27 07:25:50,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 126 states have (on average 1.380952380952381) internal successors, (174), 145 states have internal predecessors, (174), 8 states have call successors, (8), 7 states have call predecessors, (8), 8 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) [2021-08-27 07:25:50,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 192 transitions. [2021-08-27 07:25:50,113 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 192 transitions. Word has length 53 [2021-08-27 07:25:50,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:25:50,113 INFO L470 AbstractCegarLoop]: Abstraction has 159 states and 192 transitions. [2021-08-27 07:25:50,113 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 11 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2021-08-27 07:25:50,113 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 192 transitions. [2021-08-27 07:25:50,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-08-27 07:25:50,113 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:25:50,114 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:25:50,114 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-08-27 07:25:50,114 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0REQUIRES_VIOLATION === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 38 more)] === [2021-08-27 07:25:50,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:25:50,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1278024817, now seen corresponding path program 1 times [2021-08-27 07:25:50,114 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:25:50,114 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156549193] [2021-08-27 07:25:50,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:25:50,115 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:25:50,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:50,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:25:50,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:50,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:25:50,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:50,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:25:50,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:50,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 07:25:50,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:50,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-08-27 07:25:50,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:50,192 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-08-27 07:25:50,192 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:25:50,193 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156549193] [2021-08-27 07:25:50,193 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156549193] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:25:50,193 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:25:50,193 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-27 07:25:50,193 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780429418] [2021-08-27 07:25:50,193 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 07:25:50,194 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:25:50,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 07:25:50,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-08-27 07:25:50,195 INFO L87 Difference]: Start difference. First operand 159 states and 192 transitions. Second operand has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 07:25:50,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:25:50,456 INFO L93 Difference]: Finished difference Result 157 states and 189 transitions. [2021-08-27 07:25:50,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 07:25:50,456 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 55 [2021-08-27 07:25:50,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:25:50,458 INFO L225 Difference]: With dead ends: 157 [2021-08-27 07:25:50,458 INFO L226 Difference]: Without dead ends: 157 [2021-08-27 07:25:50,459 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 137.0ms TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-08-27 07:25:50,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-08-27 07:25:50,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2021-08-27 07:25:50,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 126 states have (on average 1.3571428571428572) internal successors, (171), 143 states have internal predecessors, (171), 8 states have call successors, (8), 7 states have call predecessors, (8), 8 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) [2021-08-27 07:25:50,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 189 transitions. [2021-08-27 07:25:50,462 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 189 transitions. Word has length 55 [2021-08-27 07:25:50,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:25:50,463 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 189 transitions. [2021-08-27 07:25:50,463 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 07:25:50,463 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 189 transitions. [2021-08-27 07:25:50,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-08-27 07:25:50,464 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:25:50,464 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:25:50,464 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-08-27 07:25:50,464 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting sll_circular_remove_lastErr24ASSERT_VIOLATIONMEMORY_FREE === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 38 more)] === [2021-08-27 07:25:50,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:25:50,465 INFO L82 PathProgramCache]: Analyzing trace with hash 324071785, now seen corresponding path program 1 times [2021-08-27 07:25:50,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:25:50,465 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551903129] [2021-08-27 07:25:50,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:25:50,465 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:25:50,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:50,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:25:50,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:50,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:25:50,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:50,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:25:50,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:50,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 07:25:50,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:50,896 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 07:25:50,896 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:25:50,897 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551903129] [2021-08-27 07:25:50,897 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551903129] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:25:50,897 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182786541] [2021-08-27 07:25:50,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:25:50,897 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 07:25:50,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 07:25:50,898 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-08-27 07:25:50,899 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-08-27 07:25:51,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:51,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 77 conjunts are in the unsatisfiable core [2021-08-27 07:25:51,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:25:51,476 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 07:25:51,591 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2021-08-27 07:25:51,717 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 07:25:51,717 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-08-27 07:25:51,875 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-08-27 07:25:52,015 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 07:25:52,015 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 27 [2021-08-27 07:25:52,660 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 62 [2021-08-27 07:25:52,770 INFO L354 Elim1Store]: treesize reduction 29, result has 12.1 percent of original size [2021-08-27 07:25:52,770 INFO L388 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 26 [2021-08-27 07:25:52,853 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 07:25:52,854 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [182786541] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:25:52,854 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 07:25:52,854 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 44 [2021-08-27 07:25:52,854 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225302738] [2021-08-27 07:25:52,854 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2021-08-27 07:25:52,855 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:25:52,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-08-27 07:25:52,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1871, Unknown=0, NotChecked=0, Total=1980 [2021-08-27 07:25:52,856 INFO L87 Difference]: Start difference. First operand 157 states and 189 transitions. Second operand has 45 states, 43 states have (on average 2.0232558139534884) internal successors, (87), 35 states have internal predecessors, (87), 6 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2021-08-27 07:25:56,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:25:56,349 INFO L93 Difference]: Finished difference Result 173 states and 195 transitions. [2021-08-27 07:25:56,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-08-27 07:25:56,349 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 43 states have (on average 2.0232558139534884) internal successors, (87), 35 states have internal predecessors, (87), 6 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 56 [2021-08-27 07:25:56,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:25:56,350 INFO L225 Difference]: With dead ends: 173 [2021-08-27 07:25:56,350 INFO L226 Difference]: Without dead ends: 173 [2021-08-27 07:25:56,351 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 704 ImplicationChecksByTransitivity, 2280.6ms TimeCoverageRelationStatistics Valid=379, Invalid=4177, Unknown=0, NotChecked=0, Total=4556 [2021-08-27 07:25:56,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2021-08-27 07:25:56,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 157. [2021-08-27 07:25:56,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 126 states have (on average 1.3412698412698412) internal successors, (169), 143 states have internal predecessors, (169), 8 states have call successors, (8), 7 states have call predecessors, (8), 8 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) [2021-08-27 07:25:56,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 187 transitions. [2021-08-27 07:25:56,367 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 187 transitions. Word has length 56 [2021-08-27 07:25:56,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:25:56,367 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 187 transitions. [2021-08-27 07:25:56,367 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 43 states have (on average 2.0232558139534884) internal successors, (87), 35 states have internal predecessors, (87), 6 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2021-08-27 07:25:56,367 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 187 transitions. [2021-08-27 07:25:56,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-08-27 07:25:56,368 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:25:56,368 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:25:56,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2021-08-27 07:25:56,573 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,SelfDestructingSolverStorable25 [2021-08-27 07:25:56,573 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting sll_circular_remove_lastErr19REQUIRES_VIOLATION === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 38 more)] === [2021-08-27 07:25:56,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:25:56,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1456342568, now seen corresponding path program 1 times [2021-08-27 07:25:56,573 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:25:56,574 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536458932] [2021-08-27 07:25:56,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:25:56,574 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:25:56,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:56,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:25:56,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:56,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:25:56,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:56,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:25:56,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:56,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 07:25:56,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:56,723 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-08-27 07:25:56,723 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:25:56,723 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536458932] [2021-08-27 07:25:56,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536458932] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:25:56,723 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102477218] [2021-08-27 07:25:56,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:25:56,724 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 07:25:56,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 07:25:56,737 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-08-27 07:25:56,779 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-08-27 07:25:57,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:57,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 27 conjunts are in the unsatisfiable core [2021-08-27 07:25:57,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:25:57,532 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2021-08-27 07:25:57,598 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-27 07:25:57,599 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2021-08-27 07:25:57,607 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-08-27 07:25:57,607 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [102477218] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:25:57,607 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 07:25:57,607 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 16 [2021-08-27 07:25:57,608 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306344726] [2021-08-27 07:25:57,608 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-08-27 07:25:57,608 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:25:57,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-08-27 07:25:57,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2021-08-27 07:25:57,609 INFO L87 Difference]: Start difference. First operand 157 states and 187 transitions. Second operand has 17 states, 16 states have (on average 3.375) internal successors, (54), 15 states have internal predecessors, (54), 1 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2021-08-27 07:25:59,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:25:59,429 INFO L93 Difference]: Finished difference Result 259 states and 301 transitions. [2021-08-27 07:25:59,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-08-27 07:25:59,429 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.375) internal successors, (54), 15 states have internal predecessors, (54), 1 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 57 [2021-08-27 07:25:59,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:25:59,430 INFO L225 Difference]: With dead ends: 259 [2021-08-27 07:25:59,430 INFO L226 Difference]: Without dead ends: 259 [2021-08-27 07:25:59,431 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 705.9ms TimeCoverageRelationStatistics Valid=217, Invalid=905, Unknown=0, NotChecked=0, Total=1122 [2021-08-27 07:25:59,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2021-08-27 07:25:59,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 164. [2021-08-27 07:25:59,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 133 states have (on average 1.368421052631579) internal successors, (182), 150 states have internal predecessors, (182), 8 states have call successors, (8), 7 states have call predecessors, (8), 8 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) [2021-08-27 07:25:59,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 200 transitions. [2021-08-27 07:25:59,434 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 200 transitions. Word has length 57 [2021-08-27 07:25:59,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:25:59,434 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 200 transitions. [2021-08-27 07:25:59,434 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.375) internal successors, (54), 15 states have internal predecessors, (54), 1 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2021-08-27 07:25:59,434 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 200 transitions. [2021-08-27 07:25:59,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-08-27 07:25:59,434 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:25:59,434 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:25:59,454 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-08-27 07:25:59,641 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,SelfDestructingSolverStorable26 [2021-08-27 07:25:59,642 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting sll_circular_remove_lastErr20REQUIRES_VIOLATION === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 38 more)] === [2021-08-27 07:25:59,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:25:59,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1456342569, now seen corresponding path program 1 times [2021-08-27 07:25:59,642 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:25:59,642 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914315286] [2021-08-27 07:25:59,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:25:59,642 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:25:59,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:59,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:25:59,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:59,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:25:59,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:59,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:25:59,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:59,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 07:25:59,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:25:59,766 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-08-27 07:25:59,766 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:25:59,767 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914315286] [2021-08-27 07:25:59,767 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914315286] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:25:59,767 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967528732] [2021-08-27 07:25:59,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:25:59,767 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 07:25:59,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 07:25:59,768 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-08-27 07:25:59,807 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-08-27 07:26:00,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:00,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 31 conjunts are in the unsatisfiable core [2021-08-27 07:26:00,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:26:00,610 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-27 07:26:00,610 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 48 [2021-08-27 07:26:00,616 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-27 07:26:00,616 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 37 [2021-08-27 07:26:00,636 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-08-27 07:26:00,636 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967528732] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:26:00,636 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 07:26:00,636 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 13 [2021-08-27 07:26:00,637 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733458309] [2021-08-27 07:26:00,637 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-27 07:26:00,637 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:26:00,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-27 07:26:00,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2021-08-27 07:26:00,637 INFO L87 Difference]: Start difference. First operand 164 states and 200 transitions. Second operand has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2021-08-27 07:26:01,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:26:01,252 INFO L93 Difference]: Finished difference Result 221 states and 256 transitions. [2021-08-27 07:26:01,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-27 07:26:01,252 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 57 [2021-08-27 07:26:01,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:26:01,253 INFO L225 Difference]: With dead ends: 221 [2021-08-27 07:26:01,253 INFO L226 Difference]: Without dead ends: 221 [2021-08-27 07:26:01,253 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 333.3ms TimeCoverageRelationStatistics Valid=91, Invalid=371, Unknown=0, NotChecked=0, Total=462 [2021-08-27 07:26:01,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2021-08-27 07:26:01,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 170. [2021-08-27 07:26:01,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 139 states have (on average 1.3741007194244603) internal successors, (191), 156 states have internal predecessors, (191), 8 states have call successors, (8), 7 states have call predecessors, (8), 8 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) [2021-08-27 07:26:01,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 209 transitions. [2021-08-27 07:26:01,256 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 209 transitions. Word has length 57 [2021-08-27 07:26:01,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:26:01,256 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 209 transitions. [2021-08-27 07:26:01,256 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2021-08-27 07:26:01,257 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 209 transitions. [2021-08-27 07:26:01,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-08-27 07:26:01,257 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:26:01,257 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:26:01,276 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-08-27 07:26:01,472 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,SelfDestructingSolverStorable27 [2021-08-27 07:26:01,473 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting mainErr2ASSERT_VIOLATIONMEMORY_LEAK === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 38 more)] === [2021-08-27 07:26:01,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:26:01,473 INFO L82 PathProgramCache]: Analyzing trace with hash 178798289, now seen corresponding path program 1 times [2021-08-27 07:26:01,473 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:26:01,473 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42339784] [2021-08-27 07:26:01,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:26:01,473 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:26:01,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:01,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:26:01,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:01,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:26:01,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:01,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:26:01,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:01,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 07:26:01,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:01,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-08-27 07:26:01,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:01,589 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-08-27 07:26:01,589 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:26:01,589 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42339784] [2021-08-27 07:26:01,590 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42339784] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:26:01,590 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869955335] [2021-08-27 07:26:01,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:26:01,590 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 07:26:01,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 07:26:01,591 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-08-27 07:26:01,592 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-08-27 07:26:02,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:02,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 07:26:02,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:26:02,390 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-08-27 07:26:02,390 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869955335] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:26:02,390 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 07:26:02,390 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2021-08-27 07:26:02,390 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408800465] [2021-08-27 07:26:02,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-27 07:26:02,391 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:26:02,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 07:26:02,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-08-27 07:26:02,391 INFO L87 Difference]: Start difference. First operand 170 states and 209 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 8 states have internal predecessors, (49), 5 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2021-08-27 07:26:02,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:26:02,546 INFO L93 Difference]: Finished difference Result 174 states and 213 transitions. [2021-08-27 07:26:02,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 07:26:02,546 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 8 states have internal predecessors, (49), 5 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 57 [2021-08-27 07:26:02,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:26:02,547 INFO L225 Difference]: With dead ends: 174 [2021-08-27 07:26:02,547 INFO L226 Difference]: Without dead ends: 174 [2021-08-27 07:26:02,547 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 78.3ms TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:26:02,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2021-08-27 07:26:02,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2021-08-27 07:26:02,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 143 states have (on average 1.3636363636363635) internal successors, (195), 158 states have internal predecessors, (195), 8 states have call successors, (8), 7 states have call predecessors, (8), 8 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2021-08-27 07:26:02,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 213 transitions. [2021-08-27 07:26:02,550 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 213 transitions. Word has length 57 [2021-08-27 07:26:02,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:26:02,550 INFO L470 AbstractCegarLoop]: Abstraction has 174 states and 213 transitions. [2021-08-27 07:26:02,551 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 8 states have internal predecessors, (49), 5 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2021-08-27 07:26:02,551 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 213 transitions. [2021-08-27 07:26:02,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-08-27 07:26:02,551 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:26:02,551 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:26:02,570 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-08-27 07:26:02,770 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 07:26:02,770 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting sll_circular_remove_lastErr26REQUIRES_VIOLATION === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 38 more)] === [2021-08-27 07:26:02,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:26:02,770 INFO L82 PathProgramCache]: Analyzing trace with hash -2099621908, now seen corresponding path program 1 times [2021-08-27 07:26:02,770 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:26:02,770 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410659682] [2021-08-27 07:26:02,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:26:02,770 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:26:02,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:02,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:26:02,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:02,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:26:02,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:02,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:26:02,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:02,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 07:26:02,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:02,876 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-08-27 07:26:02,876 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:26:02,876 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410659682] [2021-08-27 07:26:02,877 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410659682] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:26:02,877 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [290411167] [2021-08-27 07:26:02,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:26:02,877 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 07:26:02,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 07:26:02,878 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 07:26:02,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-08-27 07:26:03,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:03,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-27 07:26:03,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:26:03,746 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-08-27 07:26:03,746 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 19 [2021-08-27 07:26:03,764 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-27 07:26:03,764 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [290411167] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:26:03,764 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-27 07:26:03,765 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 12 [2021-08-27 07:26:03,765 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004119110] [2021-08-27 07:26:03,765 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 07:26:03,765 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:26:03,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 07:26:03,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-08-27 07:26:03,766 INFO L87 Difference]: Start difference. First operand 174 states and 213 transitions. Second operand has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-08-27 07:26:03,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:26:03,905 INFO L93 Difference]: Finished difference Result 173 states and 211 transitions. [2021-08-27 07:26:03,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 07:26:03,905 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 58 [2021-08-27 07:26:03,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:26:03,906 INFO L225 Difference]: With dead ends: 173 [2021-08-27 07:26:03,906 INFO L226 Difference]: Without dead ends: 173 [2021-08-27 07:26:03,906 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 119.0ms TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2021-08-27 07:26:03,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2021-08-27 07:26:03,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2021-08-27 07:26:03,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 143 states have (on average 1.3496503496503496) internal successors, (193), 157 states have internal predecessors, (193), 8 states have call successors, (8), 7 states have call predecessors, (8), 8 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2021-08-27 07:26:03,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 211 transitions. [2021-08-27 07:26:03,909 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 211 transitions. Word has length 58 [2021-08-27 07:26:03,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:26:03,909 INFO L470 AbstractCegarLoop]: Abstraction has 173 states and 211 transitions. [2021-08-27 07:26:03,910 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-08-27 07:26:03,910 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 211 transitions. [2021-08-27 07:26:03,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-08-27 07:26:03,910 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:26:03,910 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:26:03,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-08-27 07:26:04,147 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 07:26:04,148 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting sll_circular_remove_lastErr2REQUIRES_VIOLATION === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 38 more)] === [2021-08-27 07:26:04,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:26:04,148 INFO L82 PathProgramCache]: Analyzing trace with hash 205842391, now seen corresponding path program 1 times [2021-08-27 07:26:04,148 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:26:04,148 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506108872] [2021-08-27 07:26:04,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:26:04,148 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:26:04,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:04,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:26:04,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:04,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:26:04,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:04,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:26:04,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:04,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 07:26:04,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:04,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-08-27 07:26:04,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:04,799 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 07:26:04,799 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:26:04,800 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506108872] [2021-08-27 07:26:04,800 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506108872] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:26:04,800 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942109090] [2021-08-27 07:26:04,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:26:04,800 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 07:26:04,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 07:26:04,801 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 07:26:04,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-08-27 07:26:05,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:05,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 81 conjunts are in the unsatisfiable core [2021-08-27 07:26:05,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:26:05,547 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 07:26:05,801 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 07:26:05,802 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-08-27 07:26:05,888 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-08-27 07:26:06,019 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 07:26:06,020 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 28 [2021-08-27 07:26:06,661 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2021-08-27 07:26:06,725 INFO L354 Elim1Store]: treesize reduction 56, result has 1.8 percent of original size [2021-08-27 07:26:06,726 INFO L388 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 57 treesize of output 1 [2021-08-27 07:26:06,740 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:26:06,740 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942109090] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:26:06,741 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 07:26:06,741 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 52 [2021-08-27 07:26:06,741 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967124073] [2021-08-27 07:26:06,741 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2021-08-27 07:26:06,741 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:26:06,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2021-08-27 07:26:06,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=2493, Unknown=0, NotChecked=0, Total=2652 [2021-08-27 07:26:06,742 INFO L87 Difference]: Start difference. First operand 173 states and 211 transitions. Second operand has 52 states, 51 states have (on average 1.588235294117647) internal successors, (81), 41 states have internal predecessors, (81), 7 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (9), 8 states have call predecessors, (9), 6 states have call successors, (9) [2021-08-27 07:26:09,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:26:09,400 INFO L93 Difference]: Finished difference Result 199 states and 234 transitions. [2021-08-27 07:26:09,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-08-27 07:26:09,401 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 1.588235294117647) internal successors, (81), 41 states have internal predecessors, (81), 7 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (9), 8 states have call predecessors, (9), 6 states have call successors, (9) Word has length 59 [2021-08-27 07:26:09,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:26:09,401 INFO L225 Difference]: With dead ends: 199 [2021-08-27 07:26:09,401 INFO L226 Difference]: Without dead ends: 190 [2021-08-27 07:26:09,403 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1090 ImplicationChecksByTransitivity, 2219.5ms TimeCoverageRelationStatistics Valid=403, Invalid=4853, Unknown=0, NotChecked=0, Total=5256 [2021-08-27 07:26:09,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2021-08-27 07:26:09,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 171. [2021-08-27 07:26:09,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 141 states have (on average 1.3475177304964538) internal successors, (190), 155 states have internal predecessors, (190), 8 states have call successors, (8), 7 states have call predecessors, (8), 8 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2021-08-27 07:26:09,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 208 transitions. [2021-08-27 07:26:09,405 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 208 transitions. Word has length 59 [2021-08-27 07:26:09,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:26:09,406 INFO L470 AbstractCegarLoop]: Abstraction has 171 states and 208 transitions. [2021-08-27 07:26:09,406 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 1.588235294117647) internal successors, (81), 41 states have internal predecessors, (81), 7 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (9), 8 states have call predecessors, (9), 6 states have call successors, (9) [2021-08-27 07:26:09,406 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 208 transitions. [2021-08-27 07:26:09,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-08-27 07:26:09,406 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:26:09,406 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:26:09,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-08-27 07:26:09,616 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 07:26:09,617 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting sll_circular_remove_lastErr28REQUIRES_VIOLATION === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 38 more)] === [2021-08-27 07:26:09,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:26:09,617 INFO L82 PathProgramCache]: Analyzing trace with hash -663769598, now seen corresponding path program 1 times [2021-08-27 07:26:09,617 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:26:09,617 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361945180] [2021-08-27 07:26:09,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:26:09,617 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:26:09,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:09,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:26:09,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:09,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:26:09,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:09,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:26:09,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:10,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 07:26:10,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:10,114 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 07:26:10,114 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:26:10,115 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361945180] [2021-08-27 07:26:10,115 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361945180] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:26:10,115 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690456135] [2021-08-27 07:26:10,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:26:10,115 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 07:26:10,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 07:26:10,116 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 07:26:10,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-08-27 07:26:10,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:10,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 45 conjunts are in the unsatisfiable core [2021-08-27 07:26:10,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:26:11,378 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-08-27 07:26:11,495 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-08-27 07:26:11,718 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-08-27 07:26:11,718 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2021-08-27 07:26:11,778 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-27 07:26:11,779 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1690456135] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:26:11,779 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-27 07:26:11,779 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [27] total 45 [2021-08-27 07:26:11,780 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202744030] [2021-08-27 07:26:11,782 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-08-27 07:26:11,782 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:26:11,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-08-27 07:26:11,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1972, Unknown=0, NotChecked=0, Total=2070 [2021-08-27 07:26:11,783 INFO L87 Difference]: Start difference. First operand 171 states and 208 transitions. Second operand has 21 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 18 states have internal predecessors, (49), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2021-08-27 07:26:12,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:26:12,631 INFO L93 Difference]: Finished difference Result 220 states and 257 transitions. [2021-08-27 07:26:12,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-08-27 07:26:12,632 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 18 states have internal predecessors, (49), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 59 [2021-08-27 07:26:12,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:26:12,633 INFO L225 Difference]: With dead ends: 220 [2021-08-27 07:26:12,633 INFO L226 Difference]: Without dead ends: 220 [2021-08-27 07:26:12,635 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 1426.4ms TimeCoverageRelationStatistics Valid=241, Invalid=3419, Unknown=0, NotChecked=0, Total=3660 [2021-08-27 07:26:12,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2021-08-27 07:26:12,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 187. [2021-08-27 07:26:12,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 156 states have (on average 1.358974358974359) internal successors, (212), 171 states have internal predecessors, (212), 8 states have call successors, (8), 7 states have call predecessors, (8), 9 states have return successors, (11), 8 states have call predecessors, (11), 7 states have call successors, (11) [2021-08-27 07:26:12,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 231 transitions. [2021-08-27 07:26:12,639 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 231 transitions. Word has length 59 [2021-08-27 07:26:12,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:26:12,639 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 231 transitions. [2021-08-27 07:26:12,639 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 18 states have internal predecessors, (49), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2021-08-27 07:26:12,639 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 231 transitions. [2021-08-27 07:26:12,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-08-27 07:26:12,640 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:26:12,640 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:26:12,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-08-27 07:26:12,858 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 07:26:12,859 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting sll_circular_remove_lastErr2REQUIRES_VIOLATION === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 38 more)] === [2021-08-27 07:26:12,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:26:12,859 INFO L82 PathProgramCache]: Analyzing trace with hash -701088853, now seen corresponding path program 1 times [2021-08-27 07:26:12,859 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:26:12,859 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584558872] [2021-08-27 07:26:12,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:26:12,859 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:26:12,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:12,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:26:12,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:12,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:26:12,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:12,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:26:12,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:12,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 07:26:12,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:12,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-08-27 07:26:12,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:12,989 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-08-27 07:26:12,989 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:26:12,989 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584558872] [2021-08-27 07:26:12,990 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584558872] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:26:12,990 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604497150] [2021-08-27 07:26:12,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:26:12,990 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 07:26:12,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 07:26:12,991 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 07:26:12,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-08-27 07:26:13,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:13,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 27 conjunts are in the unsatisfiable core [2021-08-27 07:26:13,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:26:13,986 INFO L354 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2021-08-27 07:26:13,986 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2021-08-27 07:26:13,989 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 07:26:13,989 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 25 [2021-08-27 07:26:14,011 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-08-27 07:26:14,011 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604497150] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:26:14,011 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 07:26:14,011 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 13 [2021-08-27 07:26:14,011 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509828392] [2021-08-27 07:26:14,011 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-27 07:26:14,012 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:26:14,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-27 07:26:14,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-08-27 07:26:14,012 INFO L87 Difference]: Start difference. First operand 187 states and 231 transitions. Second operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 10 states have internal predecessors, (56), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 07:26:14,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:26:14,437 INFO L93 Difference]: Finished difference Result 133 states and 147 transitions. [2021-08-27 07:26:14,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-27 07:26:14,438 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 10 states have internal predecessors, (56), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 64 [2021-08-27 07:26:14,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:26:14,438 INFO L225 Difference]: With dead ends: 133 [2021-08-27 07:26:14,438 INFO L226 Difference]: Without dead ends: 133 [2021-08-27 07:26:14,439 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 287.0ms TimeCoverageRelationStatistics Valid=134, Invalid=418, Unknown=0, NotChecked=0, Total=552 [2021-08-27 07:26:14,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-08-27 07:26:14,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 128. [2021-08-27 07:26:14,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 102 states have (on average 1.2941176470588236) internal successors, (132), 115 states have internal predecessors, (132), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-08-27 07:26:14,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 145 transitions. [2021-08-27 07:26:14,441 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 145 transitions. Word has length 64 [2021-08-27 07:26:14,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:26:14,441 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 145 transitions. [2021-08-27 07:26:14,441 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 10 states have internal predecessors, (56), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 07:26:14,441 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 145 transitions. [2021-08-27 07:26:14,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-08-27 07:26:14,442 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:26:14,442 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:26:14,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-08-27 07:26:14,661 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 07:26:14,661 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting sll_circular_remove_lastErr2REQUIRES_VIOLATION === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 38 more)] === [2021-08-27 07:26:14,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:26:14,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1210652012, now seen corresponding path program 1 times [2021-08-27 07:26:14,662 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:26:14,662 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625097669] [2021-08-27 07:26:14,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:26:14,662 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:26:14,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:14,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:26:14,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:14,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:26:14,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:14,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:26:14,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:14,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 07:26:14,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:15,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-08-27 07:26:15,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:15,275 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-27 07:26:15,276 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:26:15,277 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625097669] [2021-08-27 07:26:15,277 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625097669] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:26:15,277 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561445495] [2021-08-27 07:26:15,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:26:15,277 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 07:26:15,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 07:26:15,278 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 07:26:15,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-08-27 07:26:16,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:16,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 52 conjunts are in the unsatisfiable core [2021-08-27 07:26:16,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:26:17,340 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 07:26:17,340 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 28 [2021-08-27 07:26:17,502 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2021-08-27 07:26:17,508 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-27 07:26:17,508 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [561445495] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:26:17,508 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 07:26:17,508 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 20] total 45 [2021-08-27 07:26:17,508 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750205282] [2021-08-27 07:26:17,508 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2021-08-27 07:26:17,508 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:26:17,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-08-27 07:26:17,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1958, Unknown=0, NotChecked=0, Total=2070 [2021-08-27 07:26:17,509 INFO L87 Difference]: Start difference. First operand 128 states and 145 transitions. Second operand has 46 states, 43 states have (on average 2.2325581395348837) internal successors, (96), 35 states have internal predecessors, (96), 8 states have call successors, (13), 7 states have call predecessors, (13), 8 states have return successors, (9), 8 states have call predecessors, (9), 6 states have call successors, (9) [2021-08-27 07:26:47,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:26:47,017 INFO L93 Difference]: Finished difference Result 212 states and 239 transitions. [2021-08-27 07:26:47,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-08-27 07:26:47,018 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 43 states have (on average 2.2325581395348837) internal successors, (96), 35 states have internal predecessors, (96), 8 states have call successors, (13), 7 states have call predecessors, (13), 8 states have return successors, (9), 8 states have call predecessors, (9), 6 states have call successors, (9) Word has length 69 [2021-08-27 07:26:47,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:26:47,019 INFO L225 Difference]: With dead ends: 212 [2021-08-27 07:26:47,019 INFO L226 Difference]: Without dead ends: 212 [2021-08-27 07:26:47,019 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 622 ImplicationChecksByTransitivity, 5835.5ms TimeCoverageRelationStatistics Valid=391, Invalid=4713, Unknown=8, NotChecked=0, Total=5112 [2021-08-27 07:26:47,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2021-08-27 07:26:47,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 165. [2021-08-27 07:26:47,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 137 states have (on average 1.3430656934306568) internal successors, (184), 150 states have internal predecessors, (184), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2021-08-27 07:26:47,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 201 transitions. [2021-08-27 07:26:47,021 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 201 transitions. Word has length 69 [2021-08-27 07:26:47,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:26:47,022 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 201 transitions. [2021-08-27 07:26:47,022 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 43 states have (on average 2.2325581395348837) internal successors, (96), 35 states have internal predecessors, (96), 8 states have call successors, (13), 7 states have call predecessors, (13), 8 states have return successors, (9), 8 states have call predecessors, (9), 6 states have call successors, (9) [2021-08-27 07:26:47,022 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 201 transitions. [2021-08-27 07:26:47,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-08-27 07:26:47,022 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:26:47,022 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:26:47,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2021-08-27 07:26:47,232 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 07:26:47,233 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting sll_circular_remove_lastErr3REQUIRES_VIOLATION === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 38 more)] === [2021-08-27 07:26:47,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:26:47,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1210652013, now seen corresponding path program 1 times [2021-08-27 07:26:47,233 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:26:47,233 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008236463] [2021-08-27 07:26:47,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:26:47,233 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:26:47,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:47,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:26:47,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:47,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:26:47,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:47,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:26:47,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:47,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 07:26:47,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:47,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-08-27 07:26:47,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:47,915 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-27 07:26:47,915 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:26:47,915 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008236463] [2021-08-27 07:26:47,915 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008236463] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:26:47,916 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879701606] [2021-08-27 07:26:47,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:26:47,916 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 07:26:47,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 07:26:47,917 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 07:26:47,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-08-27 07:26:48,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:26:48,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 88 conjunts are in the unsatisfiable core [2021-08-27 07:26:48,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:26:48,835 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 07:26:49,285 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2021-08-27 07:26:49,287 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-08-27 07:26:51,869 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 07:26:51,870 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 60 [2021-08-27 07:26:51,897 INFO L354 Elim1Store]: treesize reduction 64, result has 29.7 percent of original size [2021-08-27 07:26:51,897 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 59 treesize of output 65 [2021-08-27 07:26:52,128 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2021-08-27 07:26:52,130 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2021-08-27 07:26:52,143 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-08-27 07:26:52,143 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [879701606] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:26:52,143 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 07:26:52,143 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 23] total 49 [2021-08-27 07:26:52,144 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460585719] [2021-08-27 07:26:52,144 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2021-08-27 07:26:52,144 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:26:52,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-08-27 07:26:52,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=2307, Unknown=1, NotChecked=0, Total=2450 [2021-08-27 07:26:52,145 INFO L87 Difference]: Start difference. First operand 165 states and 201 transitions. Second operand has 50 states, 47 states have (on average 2.276595744680851) internal successors, (107), 39 states have internal predecessors, (107), 7 states have call successors, (13), 7 states have call predecessors, (13), 8 states have return successors, (9), 8 states have call predecessors, (9), 6 states have call successors, (9) [2021-08-27 07:28:12,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:28:12,683 INFO L93 Difference]: Finished difference Result 225 states and 250 transitions. [2021-08-27 07:28:12,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-08-27 07:28:12,684 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 47 states have (on average 2.276595744680851) internal successors, (107), 39 states have internal predecessors, (107), 7 states have call successors, (13), 7 states have call predecessors, (13), 8 states have return successors, (9), 8 states have call predecessors, (9), 6 states have call successors, (9) Word has length 69 [2021-08-27 07:28:12,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:28:12,684 INFO L225 Difference]: With dead ends: 225 [2021-08-27 07:28:12,684 INFO L226 Difference]: Without dead ends: 225 [2021-08-27 07:28:12,685 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1135 ImplicationChecksByTransitivity, 28331.9ms TimeCoverageRelationStatistics Valid=525, Invalid=5929, Unknown=26, NotChecked=0, Total=6480 [2021-08-27 07:28:12,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2021-08-27 07:28:12,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 184. [2021-08-27 07:28:12,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 154 states have (on average 1.3376623376623376) internal successors, (206), 169 states have internal predecessors, (206), 8 states have call successors, (8), 7 states have call predecessors, (8), 8 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2021-08-27 07:28:12,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 224 transitions. [2021-08-27 07:28:12,687 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 224 transitions. Word has length 69 [2021-08-27 07:28:12,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:28:12,688 INFO L470 AbstractCegarLoop]: Abstraction has 184 states and 224 transitions. [2021-08-27 07:28:12,688 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 47 states have (on average 2.276595744680851) internal successors, (107), 39 states have internal predecessors, (107), 7 states have call successors, (13), 7 states have call predecessors, (13), 8 states have return successors, (9), 8 states have call predecessors, (9), 6 states have call successors, (9) [2021-08-27 07:28:12,688 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 224 transitions. [2021-08-27 07:28:12,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-08-27 07:28:12,688 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:28:12,688 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:28:12,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2021-08-27 07:28:12,896 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2021-08-27 07:28:12,897 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting sll_circular_remove_lastErr2REQUIRES_VIOLATION === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 38 more)] === [2021-08-27 07:28:12,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:28:12,897 INFO L82 PathProgramCache]: Analyzing trace with hash -100867726, now seen corresponding path program 2 times [2021-08-27 07:28:12,897 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:28:12,897 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698239396] [2021-08-27 07:28:12,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:28:12,897 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:28:12,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:28:13,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:28:13,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:28:13,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:28:13,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:28:13,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:28:13,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:28:13,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 07:28:13,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:28:13,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-08-27 07:28:13,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:28:13,717 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-27 07:28:13,717 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:28:13,717 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698239396] [2021-08-27 07:28:13,718 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698239396] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:28:13,718 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821209963] [2021-08-27 07:28:13,718 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 07:28:13,718 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 07:28:13,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 07:28:13,719 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 07:28:13,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-08-27 07:28:14,672 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-27 07:28:14,672 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 07:28:14,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 71 conjunts are in the unsatisfiable core [2021-08-27 07:28:14,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:28:15,458 INFO L354 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2021-08-27 07:28:15,458 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 57 [2021-08-27 07:28:15,577 INFO L354 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2021-08-27 07:28:15,577 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 32 [2021-08-27 07:28:15,967 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 44 [2021-08-27 07:28:16,059 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 07:28:16,059 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 20 [2021-08-27 07:28:16,064 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-27 07:28:16,065 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [821209963] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:28:16,065 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 07:28:16,065 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 24] total 53 [2021-08-27 07:28:16,065 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422316316] [2021-08-27 07:28:16,065 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2021-08-27 07:28:16,065 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:28:16,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2021-08-27 07:28:16,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=2717, Unknown=0, NotChecked=0, Total=2862 [2021-08-27 07:28:16,066 INFO L87 Difference]: Start difference. First operand 184 states and 224 transitions. Second operand has 54 states, 51 states have (on average 2.0588235294117645) internal successors, (105), 43 states have internal predecessors, (105), 8 states have call successors, (13), 7 states have call predecessors, (13), 8 states have return successors, (9), 8 states have call predecessors, (9), 6 states have call successors, (9) [2021-08-27 07:28:19,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:28:19,663 INFO L93 Difference]: Finished difference Result 226 states and 249 transitions. [2021-08-27 07:28:19,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-08-27 07:28:19,663 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 51 states have (on average 2.0588235294117645) internal successors, (105), 43 states have internal predecessors, (105), 8 states have call successors, (13), 7 states have call predecessors, (13), 8 states have return successors, (9), 8 states have call predecessors, (9), 6 states have call successors, (9) Word has length 74 [2021-08-27 07:28:19,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:28:19,664 INFO L225 Difference]: With dead ends: 226 [2021-08-27 07:28:19,664 INFO L226 Difference]: Without dead ends: 226 [2021-08-27 07:28:19,665 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1227 ImplicationChecksByTransitivity, 3339.5ms TimeCoverageRelationStatistics Valid=569, Invalid=7263, Unknown=0, NotChecked=0, Total=7832 [2021-08-27 07:28:19,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2021-08-27 07:28:19,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 184. [2021-08-27 07:28:19,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 154 states have (on average 1.3311688311688312) internal successors, (205), 169 states have internal predecessors, (205), 8 states have call successors, (8), 7 states have call predecessors, (8), 8 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2021-08-27 07:28:19,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 223 transitions. [2021-08-27 07:28:19,668 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 223 transitions. Word has length 74 [2021-08-27 07:28:19,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:28:19,669 INFO L470 AbstractCegarLoop]: Abstraction has 184 states and 223 transitions. [2021-08-27 07:28:19,669 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 51 states have (on average 2.0588235294117645) internal successors, (105), 43 states have internal predecessors, (105), 8 states have call successors, (13), 7 states have call predecessors, (13), 8 states have return successors, (9), 8 states have call predecessors, (9), 6 states have call successors, (9) [2021-08-27 07:28:19,669 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 223 transitions. [2021-08-27 07:28:19,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-08-27 07:28:19,669 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:28:19,669 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:28:19,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2021-08-27 07:28:19,890 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2021-08-27 07:28:19,891 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting sll_circular_remove_lastErr3REQUIRES_VIOLATION === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 38 more)] === [2021-08-27 07:28:19,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:28:19,891 INFO L82 PathProgramCache]: Analyzing trace with hash -100867725, now seen corresponding path program 2 times [2021-08-27 07:28:19,891 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:28:19,891 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006165842] [2021-08-27 07:28:19,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:28:19,891 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:28:19,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:28:20,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:28:20,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:28:20,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:28:20,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:28:20,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:28:20,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:28:20,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 07:28:20,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:28:20,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-08-27 07:28:20,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:28:20,550 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-27 07:28:20,551 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:28:20,551 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006165842] [2021-08-27 07:28:20,551 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006165842] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:28:20,553 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100662589] [2021-08-27 07:28:20,554 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 07:28:20,554 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 07:28:20,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 07:28:20,554 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 07:28:20,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2021-08-27 07:28:21,576 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-27 07:28:21,576 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 07:28:21,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 106 conjunts are in the unsatisfiable core [2021-08-27 07:28:21,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:28:22,867 INFO L354 Elim1Store]: treesize reduction 44, result has 21.4 percent of original size [2021-08-27 07:28:22,868 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 82 treesize of output 56 [2021-08-27 07:28:22,875 INFO L354 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2021-08-27 07:28:22,875 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 48 [2021-08-27 07:28:23,267 INFO L354 Elim1Store]: treesize reduction 34, result has 8.1 percent of original size [2021-08-27 07:28:23,267 INFO L388 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 86 treesize of output 52 [2021-08-27 07:28:23,273 INFO L354 Elim1Store]: treesize reduction 26, result has 10.3 percent of original size [2021-08-27 07:28:23,273 INFO L388 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 40 treesize of output 26 [2021-08-27 07:28:23,313 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 14 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 07:28:23,313 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100662589] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:28:23,313 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 07:28:23,313 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 61 [2021-08-27 07:28:23,314 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875612793] [2021-08-27 07:28:23,315 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2021-08-27 07:28:23,315 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:28:23,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2021-08-27 07:28:23,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=3465, Unknown=0, NotChecked=0, Total=3660 [2021-08-27 07:28:23,315 INFO L87 Difference]: Start difference. First operand 184 states and 223 transitions. Second operand has 61 states, 60 states have (on average 1.9333333333333333) internal successors, (116), 50 states have internal predecessors, (116), 7 states have call successors, (13), 7 states have call predecessors, (13), 8 states have return successors, (9), 8 states have call predecessors, (9), 5 states have call successors, (9) [2021-08-27 07:28:27,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:28:27,214 INFO L93 Difference]: Finished difference Result 207 states and 216 transitions. [2021-08-27 07:28:27,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2021-08-27 07:28:27,214 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 60 states have (on average 1.9333333333333333) internal successors, (116), 50 states have internal predecessors, (116), 7 states have call successors, (13), 7 states have call predecessors, (13), 8 states have return successors, (9), 8 states have call predecessors, (9), 5 states have call successors, (9) Word has length 74 [2021-08-27 07:28:27,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:28:27,215 INFO L225 Difference]: With dead ends: 207 [2021-08-27 07:28:27,215 INFO L226 Difference]: Without dead ends: 207 [2021-08-27 07:28:27,216 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2187 ImplicationChecksByTransitivity, 3893.1ms TimeCoverageRelationStatistics Valid=891, Invalid=10665, Unknown=0, NotChecked=0, Total=11556 [2021-08-27 07:28:27,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2021-08-27 07:28:27,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 169. [2021-08-27 07:28:27,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 138 states have (on average 1.3115942028985508) internal successors, (181), 153 states have internal predecessors, (181), 9 states have call successors, (9), 8 states have call predecessors, (9), 8 states have return successors, (10), 7 states have call predecessors, (10), 8 states have call successors, (10) [2021-08-27 07:28:27,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 200 transitions. [2021-08-27 07:28:27,218 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 200 transitions. Word has length 74 [2021-08-27 07:28:27,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:28:27,218 INFO L470 AbstractCegarLoop]: Abstraction has 169 states and 200 transitions. [2021-08-27 07:28:27,218 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 60 states have (on average 1.9333333333333333) internal successors, (116), 50 states have internal predecessors, (116), 7 states have call successors, (13), 7 states have call predecessors, (13), 8 states have return successors, (9), 8 states have call predecessors, (9), 5 states have call successors, (9) [2021-08-27 07:28:27,219 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 200 transitions. [2021-08-27 07:28:27,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-08-27 07:28:27,219 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:28:27,219 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:28:27,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2021-08-27 07:28:27,419 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2021-08-27 07:28:27,420 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting sll_circular_remove_lastErr12ASSERT_VIOLATIONMEMORY_FREE === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 38 more)] === [2021-08-27 07:28:27,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:28:27,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1166438744, now seen corresponding path program 1 times [2021-08-27 07:28:27,420 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:28:27,420 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119244829] [2021-08-27 07:28:27,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:28:27,421 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:28:27,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:28:27,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:28:27,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:28:27,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:28:27,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:28:27,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:28:27,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:28:27,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 07:28:27,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:28:27,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-08-27 07:28:27,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:28:27,976 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-27 07:28:27,976 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:28:27,976 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119244829] [2021-08-27 07:28:27,976 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119244829] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:28:27,977 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214628086] [2021-08-27 07:28:27,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:28:27,977 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 07:28:27,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 07:28:27,978 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 07:28:27,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2021-08-27 07:28:29,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:28:29,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 83 conjunts are in the unsatisfiable core [2021-08-27 07:28:29,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:28:39,215 INFO L354 Elim1Store]: treesize reduction 31, result has 31.1 percent of original size [2021-08-27 07:28:39,215 INFO L388 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 62 treesize of output 46 [2021-08-27 07:28:39,224 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 07:28:39,225 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 34 [2021-08-27 07:28:39,370 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-08-27 07:28:39,373 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-08-27 07:28:39,373 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214628086] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:28:39,373 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 07:28:39,373 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26] total 50 [2021-08-27 07:28:39,373 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311199642] [2021-08-27 07:28:39,374 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2021-08-27 07:28:39,374 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:28:39,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2021-08-27 07:28:39,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=2380, Unknown=9, NotChecked=0, Total=2550 [2021-08-27 07:28:39,375 INFO L87 Difference]: Start difference. First operand 169 states and 200 transitions. Second operand has 51 states, 49 states have (on average 2.326530612244898) internal successors, (114), 40 states have internal predecessors, (114), 6 states have call successors, (13), 7 states have call predecessors, (13), 8 states have return successors, (9), 8 states have call predecessors, (9), 5 states have call successors, (9) [2021-08-27 07:28:53,879 WARN L224 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2021-08-27 07:28:53,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2021-08-27 07:28:53,901 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2021-08-27 07:28:54,080 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 07:28:54,081 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. No stderr output. at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:254) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.pop(ManagedScript.java:128) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.unAssertPostcondition(IncrementalHoareTripleChecker.java:662) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.clearAssertionStack(IncrementalHoareTripleChecker.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.releaseLock(IncrementalHoareTripleChecker.java:281) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ProtectiveHoareTripleChecker.releaseLock(ProtectiveHoareTripleChecker.java:93) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.EfficientHoareTripleChecker.releaseLock(EfficientHoareTripleChecker.java:162) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.releaseLock(CachingHoareTripleChecker.java:201) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.switchToReadonlyMode(AbstractInterpolantAutomaton.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:881) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:778) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:462) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:53) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:392) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1461) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:654) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:235) ... 36 more [2021-08-27 07:28:54,083 INFO L168 Benchmark]: Toolchain (without parser) took 300869.89 ms. Allocated memory was 65.0 MB in the beginning and 813.7 MB in the end (delta: 748.7 MB). Free memory was 44.2 MB in the beginning and 691.4 MB in the end (delta: -647.2 MB). Peak memory consumption was 102.7 MB. Max. memory is 16.1 GB. [2021-08-27 07:28:54,083 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 65.0 MB. Free memory was 46.8 MB in the beginning and 46.7 MB in the end (delta: 44.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 07:28:54,083 INFO L168 Benchmark]: CACSL2BoogieTranslator took 317.30 ms. Allocated memory is still 65.0 MB. Free memory was 44.1 MB in the beginning and 41.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-08-27 07:28:54,083 INFO L168 Benchmark]: Boogie Preprocessor took 42.39 ms. Allocated memory is still 65.0 MB. Free memory was 41.5 MB in the beginning and 38.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 07:28:54,083 INFO L168 Benchmark]: RCFGBuilder took 609.15 ms. Allocated memory was 65.0 MB in the beginning and 90.2 MB in the end (delta: 25.2 MB). Free memory was 38.6 MB in the beginning and 45.5 MB in the end (delta: -6.9 MB). Peak memory consumption was 23.7 MB. Max. memory is 16.1 GB. [2021-08-27 07:28:54,084 INFO L168 Benchmark]: TraceAbstraction took 299896.02 ms. Allocated memory was 90.2 MB in the beginning and 813.7 MB in the end (delta: 723.5 MB). Free memory was 45.1 MB in the beginning and 691.4 MB in the end (delta: -646.3 MB). Peak memory consumption was 77.5 MB. Max. memory is 16.1 GB. [2021-08-27 07:28:54,084 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 65.0 MB. Free memory was 46.8 MB in the beginning and 46.7 MB in the end (delta: 44.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 317.30 ms. Allocated memory is still 65.0 MB. Free memory was 44.1 MB in the beginning and 41.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 42.39 ms. Allocated memory is still 65.0 MB. Free memory was 41.5 MB in the beginning and 38.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 609.15 ms. Allocated memory was 65.0 MB in the beginning and 90.2 MB in the end (delta: 25.2 MB). Free memory was 38.6 MB in the beginning and 45.5 MB in the end (delta: -6.9 MB). Peak memory consumption was 23.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 299896.02 ms. Allocated memory was 90.2 MB in the beginning and 813.7 MB in the end (delta: 723.5 MB). Free memory was 45.1 MB in the beginning and 691.4 MB in the end (delta: -646.3 MB). Peak memory consumption was 77.5 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. No stderr output. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. No stderr output.: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 07:28:55,717 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 07:28:55,719 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 07:28:55,749 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 07:28:55,750 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 07:28:55,752 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 07:28:55,754 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 07:28:55,758 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 07:28:55,759 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 07:28:55,762 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 07:28:55,763 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 07:28:55,766 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 07:28:55,766 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 07:28:55,768 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 07:28:55,769 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 07:28:55,771 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 07:28:55,772 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 07:28:55,772 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 07:28:55,774 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 07:28:55,779 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 07:28:55,780 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 07:28:55,780 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 07:28:55,781 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 07:28:55,782 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 07:28:55,787 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 07:28:55,788 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 07:28:55,788 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 07:28:55,789 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 07:28:55,789 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 07:28:55,790 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 07:28:55,790 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 07:28:55,791 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 07:28:55,792 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 07:28:55,792 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 07:28:55,793 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 07:28:55,793 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 07:28:55,794 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 07:28:55,794 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 07:28:55,794 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 07:28:55,795 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 07:28:55,796 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 07:28:55,796 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-08-27 07:28:55,825 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 07:28:55,826 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 07:28:55,827 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 07:28:55,827 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 07:28:55,828 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 07:28:55,828 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 07:28:55,829 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 07:28:55,829 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 07:28:55,829 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 07:28:55,829 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 07:28:55,830 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 07:28:55,830 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 07:28:55,830 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 07:28:55,830 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-08-27 07:28:55,830 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-08-27 07:28:55,830 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-08-27 07:28:55,830 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-27 07:28:55,830 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-08-27 07:28:55,838 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-08-27 07:28:55,838 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-08-27 07:28:55,838 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 07:28:55,838 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 07:28:55,838 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 07:28:55,839 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 07:28:55,839 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-27 07:28:55,839 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 07:28:55,839 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 07:28:55,839 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-27 07:28:55,839 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-08-27 07:28:55,839 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-08-27 07:28:55,839 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 07:28:55,840 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-08-27 07:28:55,840 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c14c077a0594782eb123e5b340b8e06ed5b95f63 [2021-08-27 07:28:56,113 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 07:28:56,136 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 07:28:56,138 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 07:28:56,139 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 07:28:56,140 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 07:28:56,141 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_remove_all_reverse.i [2021-08-27 07:28:56,214 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/644e62f2f/cfd456e9aa8141a5bfec85fb390c4dc0/FLAGc2bab3dea [2021-08-27 07:28:56,653 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 07:28:56,656 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_remove_all_reverse.i [2021-08-27 07:28:56,670 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/644e62f2f/cfd456e9aa8141a5bfec85fb390c4dc0/FLAGc2bab3dea [2021-08-27 07:28:56,684 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/644e62f2f/cfd456e9aa8141a5bfec85fb390c4dc0 [2021-08-27 07:28:56,686 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 07:28:56,688 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-27 07:28:56,690 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 07:28:56,690 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 07:28:56,693 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 07:28:56,693 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 07:28:56" (1/1) ... [2021-08-27 07:28:56,694 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@985e12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:28:56, skipping insertion in model container [2021-08-27 07:28:56,694 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 07:28:56" (1/1) ... [2021-08-27 07:28:56,698 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 07:28:56,731 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 07:28:56,970 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_remove_all_reverse.i[24151,24164] [2021-08-27 07:28:56,971 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 07:28:56,978 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 07:28:57,003 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_remove_all_reverse.i[24151,24164] [2021-08-27 07:28:57,003 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 07:28:57,021 INFO L208 MainTranslator]: Completed translation [2021-08-27 07:28:57,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:28:57 WrapperNode [2021-08-27 07:28:57,022 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 07:28:57,023 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 07:28:57,023 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 07:28:57,023 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 07:28:57,029 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:28:57" (1/1) ... [2021-08-27 07:28:57,030 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:28:57" (1/1) ... [2021-08-27 07:28:57,039 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:28:57" (1/1) ... [2021-08-27 07:28:57,040 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:28:57" (1/1) ... [2021-08-27 07:28:57,051 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:28:57" (1/1) ... [2021-08-27 07:28:57,054 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:28:57" (1/1) ... [2021-08-27 07:28:57,056 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:28:57" (1/1) ... [2021-08-27 07:28:57,060 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 07:28:57,060 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 07:28:57,060 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 07:28:57,061 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 07:28:57,061 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:28:57" (1/1) ... [2021-08-27 07:28:57,075 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 07:28:57,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 07:28:57,087 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-08-27 07:28:57,103 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-08-27 07:28:57,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-08-27 07:28:57,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 07:28:57,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2021-08-27 07:28:57,113 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-08-27 07:28:57,113 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2021-08-27 07:28:57,113 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2021-08-27 07:28:57,113 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2021-08-27 07:28:57,113 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-08-27 07:28:57,114 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_create [2021-08-27 07:28:57,114 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_remove_last [2021-08-27 07:28:57,114 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-08-27 07:28:57,114 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-08-27 07:28:57,114 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-08-27 07:28:57,114 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-08-27 07:28:57,114 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-08-27 07:28:57,114 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-08-27 07:28:57,114 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 07:28:57,114 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2021-08-27 07:28:57,114 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2021-08-27 07:28:57,114 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-08-27 07:28:57,115 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-08-27 07:28:57,115 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-08-27 07:28:57,115 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-08-27 07:28:57,115 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-08-27 07:28:57,115 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-08-27 07:28:57,115 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-08-27 07:28:57,115 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-08-27 07:28:57,115 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-08-27 07:28:57,115 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-08-27 07:28:57,115 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-08-27 07:28:57,115 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-08-27 07:28:57,115 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-08-27 07:28:57,115 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-08-27 07:28:57,115 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-08-27 07:28:57,115 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-08-27 07:28:57,116 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-08-27 07:28:57,116 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-08-27 07:28:57,116 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-08-27 07:28:57,116 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-08-27 07:28:57,116 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-08-27 07:28:57,116 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-08-27 07:28:57,116 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-08-27 07:28:57,116 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-08-27 07:28:57,116 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-08-27 07:28:57,116 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-08-27 07:28:57,117 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-08-27 07:28:57,117 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-08-27 07:28:57,117 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-08-27 07:28:57,117 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-08-27 07:28:57,117 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-08-27 07:28:57,118 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-08-27 07:28:57,118 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-08-27 07:28:57,118 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-08-27 07:28:57,118 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-08-27 07:28:57,118 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-08-27 07:28:57,118 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-08-27 07:28:57,118 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-08-27 07:28:57,118 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-08-27 07:28:57,118 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-08-27 07:28:57,118 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-08-27 07:28:57,119 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-08-27 07:28:57,119 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-08-27 07:28:57,119 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-08-27 07:28:57,120 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-08-27 07:28:57,120 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-08-27 07:28:57,120 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-08-27 07:28:57,120 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-08-27 07:28:57,121 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-08-27 07:28:57,121 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-08-27 07:28:57,121 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-08-27 07:28:57,121 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-08-27 07:28:57,121 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-08-27 07:28:57,121 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-08-27 07:28:57,122 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2021-08-27 07:28:57,122 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-08-27 07:28:57,122 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-08-27 07:28:57,123 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-08-27 07:28:57,123 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2021-08-27 07:28:57,125 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-08-27 07:28:57,126 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2021-08-27 07:28:57,126 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-08-27 07:28:57,126 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-08-27 07:28:57,126 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2021-08-27 07:28:57,126 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-08-27 07:28:57,126 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-08-27 07:28:57,126 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-08-27 07:28:57,127 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-08-27 07:28:57,127 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-08-27 07:28:57,127 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-08-27 07:28:57,127 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-08-27 07:28:57,127 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-08-27 07:28:57,127 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-08-27 07:28:57,127 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-08-27 07:28:57,127 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-08-27 07:28:57,127 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-08-27 07:28:57,127 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-08-27 07:28:57,127 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-08-27 07:28:57,127 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-08-27 07:28:57,127 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-08-27 07:28:57,127 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-08-27 07:28:57,128 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-08-27 07:28:57,128 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-08-27 07:28:57,128 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-08-27 07:28:57,128 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-08-27 07:28:57,128 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-08-27 07:28:57,128 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-08-27 07:28:57,128 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-08-27 07:28:57,128 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-08-27 07:28:57,128 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-08-27 07:28:57,128 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-08-27 07:28:57,128 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-08-27 07:28:57,128 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-08-27 07:28:57,129 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-08-27 07:28:57,129 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-08-27 07:28:57,129 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-08-27 07:28:57,129 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-08-27 07:28:57,129 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-08-27 07:28:57,129 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-08-27 07:28:57,129 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-08-27 07:28:57,129 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-08-27 07:28:57,129 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-08-27 07:28:57,129 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2021-08-27 07:28:57,129 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-08-27 07:28:57,130 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-27 07:28:57,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-27 07:28:57,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-08-27 07:28:57,132 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_create [2021-08-27 07:28:57,133 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_remove_last [2021-08-27 07:28:57,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-27 07:28:57,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 07:28:57,134 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-08-27 07:28:57,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-08-27 07:28:57,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-08-27 07:28:57,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-08-27 07:28:57,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 07:28:57,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2021-08-27 07:28:57,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2021-08-27 07:28:57,138 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-08-27 07:28:57,138 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-08-27 07:28:57,417 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2021-08-27 07:28:57,648 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 07:28:57,649 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-08-27 07:28:57,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 07:28:57 BoogieIcfgContainer [2021-08-27 07:28:57,650 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 07:28:57,651 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-27 07:28:57,651 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-27 07:28:57,653 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-27 07:28:57,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 07:28:56" (1/3) ... [2021-08-27 07:28:57,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d14142 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 07:28:57, skipping insertion in model container [2021-08-27 07:28:57,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:28:57" (2/3) ... [2021-08-27 07:28:57,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d14142 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 07:28:57, skipping insertion in model container [2021-08-27 07:28:57,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 07:28:57" (3/3) ... [2021-08-27 07:28:57,655 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_remove_all_reverse.i [2021-08-27 07:28:57,659 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-27 07:28:57,659 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 42 error locations. [2021-08-27 07:28:57,690 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-27 07:28:57,694 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, mConcurrency=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-08-27 07:28:57,694 INFO L340 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2021-08-27 07:28:57,703 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 56 states have (on average 1.9464285714285714) internal successors, (109), 98 states have internal predecessors, (109), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-08-27 07:28:57,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-27 07:28:57,708 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:28:57,708 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:28:57,708 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATION === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 38 more)] === [2021-08-27 07:28:57,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:28:57,715 INFO L82 PathProgramCache]: Analyzing trace with hash -801719553, now seen corresponding path program 1 times [2021-08-27 07:28:57,722 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 07:28:57,723 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1941484495] [2021-08-27 07:28:57,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:28:57,723 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 07:28:57,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 07:28:57,749 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 07:28:57,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-08-27 07:28:57,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:28:57,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 07:28:57,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:28:57,999 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 07:28:58,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:28:58,020 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 07:28:58,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:28:58,082 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 07:28:58,082 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1941484495] [2021-08-27 07:28:58,083 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1941484495] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 07:28:58,083 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:28:58,083 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-08-27 07:28:58,085 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700695180] [2021-08-27 07:28:58,089 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 07:28:58,089 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 07:28:58,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 07:28:58,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 07:28:58,103 INFO L87 Difference]: Start difference. First operand has 111 states, 56 states have (on average 1.9464285714285714) internal successors, (109), 98 states have internal predecessors, (109), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:28:58,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:28:58,243 INFO L93 Difference]: Finished difference Result 109 states and 115 transitions. [2021-08-27 07:28:58,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 07:28:58,245 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2021-08-27 07:28:58,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:28:58,253 INFO L225 Difference]: With dead ends: 109 [2021-08-27 07:28:58,253 INFO L226 Difference]: Without dead ends: 103 [2021-08-27 07:28:58,254 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 07:28:58,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-08-27 07:28:58,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2021-08-27 07:28:58,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 53 states have (on average 1.830188679245283) internal successors, (97), 92 states have internal predecessors, (97), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-27 07:28:58,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 108 transitions. [2021-08-27 07:28:58,294 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 108 transitions. Word has length 12 [2021-08-27 07:28:58,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:28:58,295 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 108 transitions. [2021-08-27 07:28:58,295 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:28:58,295 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 108 transitions. [2021-08-27 07:28:58,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-27 07:28:58,296 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:28:58,296 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:28:58,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-08-27 07:28:58,504 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 07:28:58,505 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATION === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 38 more)] === [2021-08-27 07:28:58,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:28:58,507 INFO L82 PathProgramCache]: Analyzing trace with hash -801719552, now seen corresponding path program 1 times [2021-08-27 07:28:58,507 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 07:28:58,509 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [230526075] [2021-08-27 07:28:58,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:28:58,509 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 07:28:58,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 07:28:58,525 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 07:28:58,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-08-27 07:28:58,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:28:58,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-27 07:28:58,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:28:58,675 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 07:28:58,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:28:58,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 07:28:58,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:28:58,765 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 07:28:58,765 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [230526075] [2021-08-27 07:28:58,765 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [230526075] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 07:28:58,765 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:28:58,765 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-08-27 07:28:58,766 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702273078] [2021-08-27 07:28:58,766 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:28:58,767 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 07:28:58,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:28:58,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:28:58,767 INFO L87 Difference]: Start difference. First operand 103 states and 108 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:28:58,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:28:58,915 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2021-08-27 07:28:58,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 07:28:58,916 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2021-08-27 07:28:58,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:28:58,917 INFO L225 Difference]: With dead ends: 101 [2021-08-27 07:28:58,917 INFO L226 Difference]: Without dead ends: 101 [2021-08-27 07:28:58,918 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.8ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:28:58,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-08-27 07:28:58,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2021-08-27 07:28:58,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 53 states have (on average 1.7924528301886793) internal successors, (95), 90 states have internal predecessors, (95), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-27 07:28:58,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2021-08-27 07:28:58,923 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 12 [2021-08-27 07:28:58,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:28:58,923 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2021-08-27 07:28:58,923 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:28:58,923 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2021-08-27 07:28:58,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-08-27 07:28:58,924 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:28:58,924 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:28:58,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-08-27 07:28:59,131 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 07:28:59,131 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting sll_circular_createErr2REQUIRES_VIOLATION === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 38 more)] === [2021-08-27 07:28:59,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:28:59,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1641327229, now seen corresponding path program 1 times [2021-08-27 07:28:59,133 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 07:28:59,133 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [170816064] [2021-08-27 07:28:59,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:28:59,133 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 07:28:59,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 07:28:59,134 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 07:28:59,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-08-27 07:28:59,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:28:59,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 07:28:59,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:28:59,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:28:59,336 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 07:28:59,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:28:59,403 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 07:28:59,403 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [170816064] [2021-08-27 07:28:59,403 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [170816064] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 07:28:59,403 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:28:59,403 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2021-08-27 07:28:59,403 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970494254] [2021-08-27 07:28:59,404 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 07:28:59,404 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 07:28:59,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 07:28:59,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-27 07:28:59,405 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand has 8 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-27 07:28:59,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:28:59,450 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2021-08-27 07:28:59,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 07:28:59,450 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 19 [2021-08-27 07:28:59,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:28:59,451 INFO L225 Difference]: With dead ends: 108 [2021-08-27 07:28:59,451 INFO L226 Difference]: Without dead ends: 108 [2021-08-27 07:28:59,452 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 34.5ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-08-27 07:28:59,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-08-27 07:28:59,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 102. [2021-08-27 07:28:59,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 54 states have (on average 1.7777777777777777) internal successors, (96), 91 states have internal predecessors, (96), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-27 07:28:59,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 107 transitions. [2021-08-27 07:28:59,457 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 107 transitions. Word has length 19 [2021-08-27 07:28:59,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:28:59,457 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 107 transitions. [2021-08-27 07:28:59,458 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-27 07:28:59,458 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2021-08-27 07:28:59,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-08-27 07:28:59,458 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:28:59,458 INFO L512 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-08-27 07:28:59,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-08-27 07:28:59,661 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 07:28:59,662 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting sll_circular_createErr0REQUIRES_VIOLATION === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 38 more)] === [2021-08-27 07:28:59,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:28:59,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1123004254, now seen corresponding path program 1 times [2021-08-27 07:28:59,665 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 07:28:59,665 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2095543606] [2021-08-27 07:28:59,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:28:59,666 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 07:28:59,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 07:28:59,666 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 07:28:59,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-08-27 07:28:59,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:28:59,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-27 07:28:59,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:28:59,914 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 07:28:59,954 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 07:28:59,954 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 07:29:00,047 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 07:29:00,047 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 07:29:00,048 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2095543606] [2021-08-27 07:29:00,048 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2095543606] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 07:29:00,048 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:29:00,048 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-08-27 07:29:00,048 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692257871] [2021-08-27 07:29:00,048 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 07:29:00,049 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 07:29:00,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 07:29:00,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 07:29:00,049 INFO L87 Difference]: Start difference. First operand 102 states and 107 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-27 07:29:00,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:29:00,273 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2021-08-27 07:29:00,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 07:29:00,274 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2021-08-27 07:29:00,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:29:00,276 INFO L225 Difference]: With dead ends: 102 [2021-08-27 07:29:00,276 INFO L226 Difference]: Without dead ends: 102 [2021-08-27 07:29:00,276 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 28.4ms TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-08-27 07:29:00,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-08-27 07:29:00,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2021-08-27 07:29:00,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 54 states have (on average 1.7592592592592593) internal successors, (95), 90 states have internal predecessors, (95), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-27 07:29:00,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2021-08-27 07:29:00,280 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 28 [2021-08-27 07:29:00,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:29:00,280 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2021-08-27 07:29:00,281 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-27 07:29:00,281 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2021-08-27 07:29:00,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-08-27 07:29:00,281 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:29:00,281 INFO L512 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-08-27 07:29:00,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-08-27 07:29:00,489 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 07:29:00,489 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting sll_circular_createErr1REQUIRES_VIOLATION === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 38 more)] === [2021-08-27 07:29:00,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:29:00,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1123004255, now seen corresponding path program 1 times [2021-08-27 07:29:00,490 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 07:29:00,490 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [924896398] [2021-08-27 07:29:00,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:29:00,491 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 07:29:00,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 07:29:00,496 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 07:29:00,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-08-27 07:29:00,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:29:00,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-27 07:29:00,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:29:00,751 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 07:29:00,845 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 07:29:00,846 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 07:29:01,099 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 07:29:01,099 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 07:29:01,100 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [924896398] [2021-08-27 07:29:01,100 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [924896398] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 07:29:01,100 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:29:01,100 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2021-08-27 07:29:01,100 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481779645] [2021-08-27 07:29:01,101 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-27 07:29:01,101 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 07:29:01,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 07:29:01,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-08-27 07:29:01,101 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2021-08-27 07:29:01,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:29:01,583 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2021-08-27 07:29:01,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 07:29:01,583 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2021-08-27 07:29:01,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:29:01,584 INFO L225 Difference]: With dead ends: 101 [2021-08-27 07:29:01,584 INFO L226 Difference]: Without dead ends: 101 [2021-08-27 07:29:01,584 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 134.0ms TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-08-27 07:29:01,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-08-27 07:29:01,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2021-08-27 07:29:01,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 54 states have (on average 1.7407407407407407) internal successors, (94), 89 states have internal predecessors, (94), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-27 07:29:01,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2021-08-27 07:29:01,589 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 28 [2021-08-27 07:29:01,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:29:01,589 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2021-08-27 07:29:01,589 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2021-08-27 07:29:01,589 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2021-08-27 07:29:01,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-08-27 07:29:01,590 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:29:01,590 INFO L512 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-08-27 07:29:01,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-08-27 07:29:01,797 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 07:29:01,797 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting sll_circular_createErr2REQUIRES_VIOLATION === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 38 more)] === [2021-08-27 07:29:01,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:29:01,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1919618027, now seen corresponding path program 1 times [2021-08-27 07:29:01,798 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 07:29:01,798 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2122984426] [2021-08-27 07:29:01,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:29:01,799 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 07:29:01,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 07:29:01,800 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 07:29:01,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-08-27 07:29:01,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:29:01,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-27 07:29:02,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:29:02,023 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 07:29:02,179 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-08-27 07:29:02,179 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 34 [2021-08-27 07:29:02,282 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:29:02,283 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 07:29:26,923 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:29:26,924 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 07:29:26,924 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2122984426] [2021-08-27 07:29:26,924 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2122984426] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-27 07:29:26,924 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 07:29:26,924 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2021-08-27 07:29:26,924 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578920113] [2021-08-27 07:29:26,926 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-27 07:29:26,926 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 07:29:26,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-27 07:29:26,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=166, Unknown=7, NotChecked=0, Total=210 [2021-08-27 07:29:26,926 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand has 15 states, 14 states have (on average 3.0) internal successors, (42), 11 states have internal predecessors, (42), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2021-08-27 07:31:38,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:31:38,466 INFO L93 Difference]: Finished difference Result 108 states and 116 transitions. [2021-08-27 07:31:38,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 07:31:38,466 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.0) internal successors, (42), 11 states have internal predecessors, (42), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 31 [2021-08-27 07:31:38,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:31:38,467 INFO L225 Difference]: With dead ends: 108 [2021-08-27 07:31:38,467 INFO L226 Difference]: Without dead ends: 108 [2021-08-27 07:31:38,467 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 24380.8ms TimeCoverageRelationStatistics Valid=75, Invalid=298, Unknown=7, NotChecked=0, Total=380 [2021-08-27 07:31:38,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-08-27 07:31:38,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 99. [2021-08-27 07:31:38,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 54 states have (on average 1.7222222222222223) internal successors, (93), 88 states have internal predecessors, (93), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-27 07:31:38,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 104 transitions. [2021-08-27 07:31:38,471 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 104 transitions. Word has length 31 [2021-08-27 07:31:38,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:31:38,471 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 104 transitions. [2021-08-27 07:31:38,472 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.0) internal successors, (42), 11 states have internal predecessors, (42), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2021-08-27 07:31:38,472 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2021-08-27 07:31:38,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-08-27 07:31:38,472 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:31:38,472 INFO L512 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-08-27 07:31:38,479 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2021-08-27 07:31:38,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 07:31:38,680 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting sll_circular_createErr3REQUIRES_VIOLATION === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 38 more)] === [2021-08-27 07:31:38,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:31:38,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1919618028, now seen corresponding path program 1 times [2021-08-27 07:31:38,681 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 07:31:38,681 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [451840227] [2021-08-27 07:31:38,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:31:38,681 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 07:31:38,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 07:31:38,682 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 07:31:38,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-08-27 07:31:38,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:31:38,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 18 conjunts are in the unsatisfiable core [2021-08-27 07:31:38,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:31:38,968 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 07:31:38,977 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 07:31:39,325 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-08-27 07:31:39,325 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 33 [2021-08-27 07:31:39,338 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 07:31:39,338 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 30 [2021-08-27 07:31:39,471 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:31:39,472 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 07:31:52,339 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_node_create_~temp~0.base_41 (_ BitVec 32)) (v_sll_circular_create_~last~0.offset_BEFORE_CALL_2 (_ BitVec 32)) (v_sll_circular_create_~last~0.base_BEFORE_CALL_4 (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| v_node_create_~temp~0.base_41)))) (let ((.cse0 (bvadd (_ bv4 32) v_sll_circular_create_~last~0.offset_BEFORE_CALL_2))) (and (bvule v_sll_circular_create_~last~0.offset_BEFORE_CALL_2 .cse0) (bvule .cse0 (select (store |c_#length| v_node_create_~temp~0.base_41 (_ bv8 32)) v_sll_circular_create_~last~0.base_BEFORE_CALL_4)))) (exists ((v_node_create_~temp~0.base_40 (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |c_old(#valid)| v_node_create_~temp~0.base_40))) (let ((.cse1 (bvadd (_ bv4 32) v_sll_circular_create_~last~0.offset_BEFORE_CALL_2))) (or (not (bvule .cse1 (select (store |c_old(#length)| v_node_create_~temp~0.base_40 (_ bv8 32)) v_sll_circular_create_~last~0.base_BEFORE_CALL_4))) (not (bvule v_sll_circular_create_~last~0.offset_BEFORE_CALL_2 .cse1)))))))) is different from false [2021-08-27 07:31:55,948 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_node_create_~temp~0.base_40 (_ BitVec 32))) (or (let ((.cse0 (bvadd (_ bv4 32) c_node_create_~temp~0.offset))) (and (bvule .cse0 (select (store |c_#length| v_node_create_~temp~0.base_40 (_ bv8 32)) c_node_create_~temp~0.base)) (bvule c_node_create_~temp~0.offset .cse0))) (not (= (_ bv0 1) (select |c_#valid| v_node_create_~temp~0.base_40))))) is different from false [2021-08-27 07:31:56,091 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2021-08-27 07:31:56,092 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 07:31:56,092 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [451840227] [2021-08-27 07:31:56,092 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [451840227] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-27 07:31:56,092 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 07:31:56,092 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2021-08-27 07:31:56,093 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816010824] [2021-08-27 07:31:56,093 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-08-27 07:31:56,093 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 07:31:56,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-27 07:31:56,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=148, Unknown=6, NotChecked=50, Total=240 [2021-08-27 07:31:56,094 INFO L87 Difference]: Start difference. First operand 99 states and 104 transitions. Second operand has 16 states, 15 states have (on average 2.8) internal successors, (42), 12 states have internal predecessors, (42), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2021-08-27 07:32:12,896 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_node_create_~temp~0.base_41 (_ BitVec 32)) (v_sll_circular_create_~last~0.offset_BEFORE_CALL_2 (_ BitVec 32)) (v_sll_circular_create_~last~0.base_BEFORE_CALL_4 (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| v_node_create_~temp~0.base_41)))) (let ((.cse0 (bvadd (_ bv4 32) v_sll_circular_create_~last~0.offset_BEFORE_CALL_2))) (and (bvule v_sll_circular_create_~last~0.offset_BEFORE_CALL_2 .cse0) (bvule .cse0 (select (store |c_#length| v_node_create_~temp~0.base_41 (_ bv8 32)) v_sll_circular_create_~last~0.base_BEFORE_CALL_4)))) (exists ((v_node_create_~temp~0.base_40 (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |c_old(#valid)| v_node_create_~temp~0.base_40))) (let ((.cse1 (bvadd (_ bv4 32) v_sll_circular_create_~last~0.offset_BEFORE_CALL_2))) (or (not (bvule .cse1 (select (store |c_old(#length)| v_node_create_~temp~0.base_40 (_ bv8 32)) v_sll_circular_create_~last~0.base_BEFORE_CALL_4))) (not (bvule v_sll_circular_create_~last~0.offset_BEFORE_CALL_2 .cse1)))))))) (= |c_old(#valid)| |c_#valid|) (= |c_#length| |c_old(#length)|)) is different from false [2021-08-27 07:34:19,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:34:19,782 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2021-08-27 07:34:19,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 07:34:19,783 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.8) internal successors, (42), 12 states have internal predecessors, (42), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 31 [2021-08-27 07:34:19,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:34:19,784 INFO L225 Difference]: With dead ends: 100 [2021-08-27 07:34:19,784 INFO L226 Difference]: Without dead ends: 100 [2021-08-27 07:34:19,784 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 18185.1ms TimeCoverageRelationStatistics Valid=70, Invalid=277, Unknown=7, NotChecked=108, Total=462 [2021-08-27 07:34:19,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-08-27 07:34:19,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2021-08-27 07:34:19,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 54 states have (on average 1.7037037037037037) internal successors, (92), 87 states have internal predecessors, (92), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-27 07:34:19,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 103 transitions. [2021-08-27 07:34:19,787 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 103 transitions. Word has length 31 [2021-08-27 07:34:19,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:34:19,787 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 103 transitions. [2021-08-27 07:34:19,788 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.8) internal successors, (42), 12 states have internal predecessors, (42), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2021-08-27 07:34:19,788 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2021-08-27 07:34:19,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-08-27 07:34:19,788 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:34:19,788 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:34:19,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-08-27 07:34:19,989 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 07:34:19,989 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0REQUIRES_VIOLATION === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 38 more)] === [2021-08-27 07:34:19,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:34:19,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1263382819, now seen corresponding path program 1 times [2021-08-27 07:34:19,990 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 07:34:19,990 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [154325522] [2021-08-27 07:34:19,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:34:19,990 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 07:34:19,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 07:34:19,991 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 07:34:19,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-08-27 07:34:20,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:34:20,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-27 07:34:20,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:34:20,415 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-08-27 07:34:20,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 07:34:20,543 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-08-27 07:34:20,543 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 07:34:20,543 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [154325522] [2021-08-27 07:34:20,543 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [154325522] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 07:34:20,543 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:34:20,544 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-27 07:34:20,544 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694509874] [2021-08-27 07:34:20,544 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 07:34:20,544 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 07:34:20,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 07:34:20,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-08-27 07:34:20,545 INFO L87 Difference]: Start difference. First operand 98 states and 103 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2021-08-27 07:34:20,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:34:20,630 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2021-08-27 07:34:20,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 07:34:20,632 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 37 [2021-08-27 07:34:20,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:34:20,633 INFO L225 Difference]: With dead ends: 102 [2021-08-27 07:34:20,633 INFO L226 Difference]: Without dead ends: 102 [2021-08-27 07:34:20,633 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 60.3ms TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2021-08-27 07:34:20,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-08-27 07:34:20,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2021-08-27 07:34:20,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 57 states have (on average 1.6666666666666667) internal successors, (95), 90 states have internal predecessors, (95), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-08-27 07:34:20,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 108 transitions. [2021-08-27 07:34:20,636 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 108 transitions. Word has length 37 [2021-08-27 07:34:20,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:34:20,636 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 108 transitions. [2021-08-27 07:34:20,636 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2021-08-27 07:34:20,637 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2021-08-27 07:34:20,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-08-27 07:34:20,637 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:34:20,637 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:34:20,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-08-27 07:34:20,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 07:34:20,848 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting sll_circular_remove_lastErr0REQUIRES_VIOLATION === [node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION (and 38 more)] === [2021-08-27 07:34:20,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:34:20,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1364667578, now seen corresponding path program 1 times [2021-08-27 07:34:20,848 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 07:34:20,848 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [503377251] [2021-08-27 07:34:20,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:34:20,848 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 07:34:20,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 07:34:20,861 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 07:34:20,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-08-27 07:34:21,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:34:21,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 15 conjunts are in the unsatisfiable core [2021-08-27 07:34:21,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:34:21,267 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 07:34:21,645 INFO L354 Elim1Store]: treesize reduction 42, result has 33.3 percent of original size [2021-08-27 07:34:21,645 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 39 [2021-08-27 07:34:22,001 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 07:34:22,001 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 07:34:51,315 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 07:34:51,315 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [503377251] [2021-08-27 07:34:51,316 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Alternating quantifiers not yet supported [2021-08-27 07:34:51,316 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [804548800] [2021-08-27 07:34:51,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:34:51,316 INFO L170 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-08-27 07:34:51,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-08-27 07:34:51,348 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-08-27 07:34:51,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2021-08-27 07:34:51,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:34:51,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 18 conjunts are in the unsatisfiable core [2021-08-27 07:34:51,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:34:51,927 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 07:34:52,029 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2021-08-27 07:35:17,386 INFO L354 Elim1Store]: treesize reduction 39, result has 29.1 percent of original size [2021-08-27 07:35:17,386 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 43 [2021-08-27 07:35:18,511 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-27 07:35:18,511 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 07:35:31,535 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Alternating quantifiers not yet supported [2021-08-27 07:35:31,535 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172114727] [2021-08-27 07:35:31,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:35:31,535 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 07:35:31,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 07:35:31,544 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-08-27 07:35:31,583 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-08-27 07:35:32,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:35:32,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 15 conjunts are in the unsatisfiable core [2021-08-27 07:35:32,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:35:32,035 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 07:35:32,868 INFO L354 Elim1Store]: treesize reduction 42, result has 33.3 percent of original size [2021-08-27 07:35:32,869 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 39 [2021-08-27 07:35:33,184 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 07:35:33,184 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 07:36:50,908 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Alternating quantifiers not yet supported [2021-08-27 07:36:50,909 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:36:50,909 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2021-08-27 07:36:50,909 ERROR L172 FreeRefinementEngine]: Strategy WOLF failed to provide any proof altough trace is infeasible [2021-08-27 07:36:50,909 INFO L626 BasicCegarLoop]: Counterexample might be feasible [2021-08-27 07:36:50,912 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location sll_circular_remove_lastErr0REQUIRES_VIOLATION [2021-08-27 07:36:50,913 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location node_createErr0REQUIRES_VIOLATION [2021-08-27 07:36:50,914 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location node_createErr1REQUIRES_VIOLATION [2021-08-27 07:36:50,914 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location node_createErr2REQUIRES_VIOLATION [2021-08-27 07:36:50,914 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location node_createErr3REQUIRES_VIOLATION [2021-08-27 07:36:50,914 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr0REQUIRES_VIOLATION [2021-08-27 07:36:50,914 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr1REQUIRES_VIOLATION [2021-08-27 07:36:50,914 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr2ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 07:36:50,914 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr3ENSURES_VIOLATIONMEMORY_LEAK [2021-08-27 07:36:50,914 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location sll_circular_remove_lastErr1REQUIRES_VIOLATION [2021-08-27 07:36:50,914 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location sll_circular_remove_lastErr2REQUIRES_VIOLATION [2021-08-27 07:36:50,914 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location sll_circular_remove_lastErr3REQUIRES_VIOLATION [2021-08-27 07:36:50,915 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location sll_circular_remove_lastErr4REQUIRES_VIOLATION [2021-08-27 07:36:50,915 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location sll_circular_remove_lastErr5REQUIRES_VIOLATION [2021-08-27 07:36:50,915 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location sll_circular_remove_lastErr6REQUIRES_VIOLATION [2021-08-27 07:36:50,915 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location sll_circular_remove_lastErr7REQUIRES_VIOLATION [2021-08-27 07:36:50,915 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location sll_circular_remove_lastErr8REQUIRES_VIOLATION [2021-08-27 07:36:50,915 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location sll_circular_remove_lastErr9REQUIRES_VIOLATION [2021-08-27 07:36:50,915 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location sll_circular_remove_lastErr10REQUIRES_VIOLATION [2021-08-27 07:36:50,915 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location sll_circular_remove_lastErr11REQUIRES_VIOLATION [2021-08-27 07:36:50,915 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location sll_circular_remove_lastErr12ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 07:36:50,915 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location sll_circular_remove_lastErr13ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 07:36:50,915 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location sll_circular_remove_lastErr14ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 07:36:50,915 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location sll_circular_remove_lastErr15REQUIRES_VIOLATION [2021-08-27 07:36:50,915 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location sll_circular_remove_lastErr16REQUIRES_VIOLATION [2021-08-27 07:36:50,916 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location sll_circular_remove_lastErr17REQUIRES_VIOLATION [2021-08-27 07:36:50,916 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location sll_circular_remove_lastErr18REQUIRES_VIOLATION [2021-08-27 07:36:50,916 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location sll_circular_remove_lastErr19REQUIRES_VIOLATION [2021-08-27 07:36:50,916 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location sll_circular_remove_lastErr20REQUIRES_VIOLATION [2021-08-27 07:36:50,916 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location sll_circular_remove_lastErr21REQUIRES_VIOLATION [2021-08-27 07:36:50,916 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location sll_circular_remove_lastErr22REQUIRES_VIOLATION [2021-08-27 07:36:50,916 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location sll_circular_remove_lastErr23ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 07:36:50,916 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location sll_circular_remove_lastErr24ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 07:36:50,916 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location sll_circular_remove_lastErr25ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 07:36:50,916 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location sll_circular_remove_lastErr26REQUIRES_VIOLATION [2021-08-27 07:36:50,918 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location sll_circular_remove_lastErr27REQUIRES_VIOLATION [2021-08-27 07:36:50,918 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location sll_circular_remove_lastErr28REQUIRES_VIOLATION [2021-08-27 07:36:50,920 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location sll_circular_remove_lastErr29REQUIRES_VIOLATION [2021-08-27 07:36:50,920 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location sll_circular_createErr0REQUIRES_VIOLATION [2021-08-27 07:36:50,920 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location sll_circular_createErr1REQUIRES_VIOLATION [2021-08-27 07:36:50,920 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location sll_circular_createErr2REQUIRES_VIOLATION [2021-08-27 07:36:50,920 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location sll_circular_createErr3REQUIRES_VIOLATION [2021-08-27 07:36:50,940 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-08-27 07:36:51,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Forceful destruction successful, exit code 0 [2021-08-27 07:36:51,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-08-27 07:36:51,521 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,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 07:36:51,525 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-27 07:36:51,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 07:36:51 BoogieIcfgContainer [2021-08-27 07:36:51,552 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-27 07:36:51,553 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 07:36:51,553 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 07:36:51,553 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 07:36:51,554 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 07:28:57" (3/4) ... [2021-08-27 07:36:51,556 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-27 07:36:51,557 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 07:36:51,557 INFO L168 Benchmark]: Toolchain (without parser) took 474869.62 ms. Allocated memory was 58.7 MB in the beginning and 172.0 MB in the end (delta: 113.2 MB). Free memory was 35.8 MB in the beginning and 122.7 MB in the end (delta: -86.9 MB). Peak memory consumption was 25.3 MB. Max. memory is 16.1 GB. [2021-08-27 07:36:51,558 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 58.7 MB. Free memory was 40.6 MB in the beginning and 40.6 MB in the end (delta: 44.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 07:36:51,558 INFO L168 Benchmark]: CACSL2BoogieTranslator took 332.14 ms. Allocated memory was 58.7 MB in the beginning and 86.0 MB in the end (delta: 27.3 MB). Free memory was 35.6 MB in the beginning and 60.9 MB in the end (delta: -25.4 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-08-27 07:36:51,559 INFO L168 Benchmark]: Boogie Preprocessor took 37.37 ms. Allocated memory is still 86.0 MB. Free memory was 60.9 MB in the beginning and 57.6 MB in the end (delta: 3.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 07:36:51,559 INFO L168 Benchmark]: RCFGBuilder took 589.82 ms. Allocated memory is still 86.0 MB. Free memory was 57.6 MB in the beginning and 42.5 MB in the end (delta: 15.1 MB). Peak memory consumption was 22.5 MB. Max. memory is 16.1 GB. [2021-08-27 07:36:51,559 INFO L168 Benchmark]: TraceAbstraction took 473901.36 ms. Allocated memory was 86.0 MB in the beginning and 172.0 MB in the end (delta: 86.0 MB). Free memory was 42.1 MB in the beginning and 123.7 MB in the end (delta: -81.6 MB). Peak memory consumption was 81.0 MB. Max. memory is 16.1 GB. [2021-08-27 07:36:51,559 INFO L168 Benchmark]: Witness Printer took 3.66 ms. Allocated memory is still 172.0 MB. Free memory was 123.7 MB in the beginning and 122.7 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 07:36:51,560 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 58.7 MB. Free memory was 40.6 MB in the beginning and 40.6 MB in the end (delta: 44.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 332.14 ms. Allocated memory was 58.7 MB in the beginning and 86.0 MB in the end (delta: 27.3 MB). Free memory was 35.6 MB in the beginning and 60.9 MB in the end (delta: -25.4 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 37.37 ms. Allocated memory is still 86.0 MB. Free memory was 60.9 MB in the beginning and 57.6 MB in the end (delta: 3.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 589.82 ms. Allocated memory is still 86.0 MB. Free memory was 57.6 MB in the beginning and 42.5 MB in the end (delta: 15.1 MB). Peak memory consumption was 22.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 473901.36 ms. Allocated memory was 86.0 MB in the beginning and 172.0 MB in the end (delta: 86.0 MB). Free memory was 42.1 MB in the beginning and 123.7 MB in the end (delta: -81.6 MB). Peak memory consumption was 81.0 MB. Max. memory is 16.1 GB. * Witness Printer took 3.66 ms. Allocated memory is still 172.0 MB. Free memory was 123.7 MB in the beginning and 122.7 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 596]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L613] const int len = 2; [L614] const int data = 1; [L615] SLL s = sll_circular_create(len, data); [L615] CALL, EXPR sll_circular_create(len, data) [L584] CALL, EXPR node_create(data) [L575] SLL temp = (SLL) malloc(sizeof(struct node)); [L576] COND FALSE !(((void *)0) == temp) [L579] temp->next = ((void *)0) [L580] temp->data = data [L581] return temp; [L584] RET, EXPR node_create(data) [L584] SLL head = node_create(data); [L585] SLL last = head; [L586] COND TRUE len > 1 [L587] CALL, EXPR node_create(data) [L575] SLL temp = (SLL) malloc(sizeof(struct node)); [L576] COND FALSE !(((void *)0) == temp) [L579] temp->next = ((void *)0) [L580] temp->data = data [L581] return temp; [L587] RET, EXPR node_create(data) [L587] SLL new_head = node_create(data); [L588] new_head->next = head [L589] head = new_head [L590] len-- [L586] COND FALSE !(len > 1) [L592] last->next = head [L593] return head; [L615] RET, EXPR sll_circular_create(len, data) [L615] SLL s = sll_circular_create(len, data); [L616] int i; [L617] i = 0 [L617] COND TRUE i < len [L618] CALL sll_circular_remove_last(&s) [L596] \read(*head) - UnprovableResult [Line: 579]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 579]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 580]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 580]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 620]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 620]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 624]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 612]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 596]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 597]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 597]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 597]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 597]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 598]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 598]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 600]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 600]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 601]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 601]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 601]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 601]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 601]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 604]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 604]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 605]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 605]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 606]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 606]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 608]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 608]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 608]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 609]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 609]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 609]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 609]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 588]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 588]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 592]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 592]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 127 locations, 42 error locations. Started 1 CEGAR loops. OverallTime: 473834.9ms, OverallIterations: 9, TraceHistogramMax: 2, EmptinessCheckTime: 10.5ms, AutomataDifference: 276395.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 6.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 735 SDtfs, 325 SDslu, 2074 SDs, 0 SdLazy, 1555 SolverSat, 58 SolverUnsat, 135 SolverUnknown, 0 SolverNotchecked, 269780.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 404 GetRequests, 332 SyntacticMatches, 4 SemanticMatches, 68 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 42847.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=111occurred in iteration=0, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 56.9ms AutomataMinimizationTime, 8 MinimizatonAttempts, 19 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 116.0ms SsaConstructionTime, 313.0ms SatisfiabilityAnalysisTime, 43396.1ms InterpolantComputationTime, 198 NumberOfCodeBlocks, 198 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 380 ConstructedInterpolants, 54 QuantifiedInterpolants, 2701 SizeOfPredicates, 18 NumberOfNonLiveVariables, 1129 ConjunctsInSsa, 54 ConjunctsInUnsatCore, 16 InterpolantComputations, 12 PerfectInterpolantSequences, 50/76 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-08-27 07:36:51,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...