./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext-properties/test-0232_1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version ae007674 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-ext-properties/test-0232_1-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b36390e4ace21fb538f0c1df6f562bcf2825b5901fb45d9987e6242615034592 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-28 05:52:44,444 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-28 05:52:44,446 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-28 05:52:44,485 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-28 05:52:44,485 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-28 05:52:44,488 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-28 05:52:44,490 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-28 05:52:44,495 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-28 05:52:44,497 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-28 05:52:44,502 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-28 05:52:44,503 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-28 05:52:44,504 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-28 05:52:44,505 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-28 05:52:44,507 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-28 05:52:44,508 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-28 05:52:44,514 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-28 05:52:44,514 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-28 05:52:44,515 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-28 05:52:44,517 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-28 05:52:44,521 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-28 05:52:44,522 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-28 05:52:44,523 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-28 05:52:44,524 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-28 05:52:44,525 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-28 05:52:44,527 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-28 05:52:44,527 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-28 05:52:44,527 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-28 05:52:44,528 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-28 05:52:44,531 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-28 05:52:44,532 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-28 05:52:44,533 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-28 05:52:44,533 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-28 05:52:44,534 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-28 05:52:44,535 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-28 05:52:44,536 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-28 05:52:44,536 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-28 05:52:44,537 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-28 05:52:44,537 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-28 05:52:44,537 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-28 05:52:44,538 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-28 05:52:44,539 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-28 05:52:44,540 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-28 05:52:44,565 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-28 05:52:44,567 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-28 05:52:44,568 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-28 05:52:44,568 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-28 05:52:44,568 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-28 05:52:44,569 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-28 05:52:44,570 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-28 05:52:44,570 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-28 05:52:44,570 INFO L138 SettingsManager]: * Use SBE=true [2021-12-28 05:52:44,570 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-28 05:52:44,571 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-28 05:52:44,571 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-28 05:52:44,571 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-28 05:52:44,571 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-28 05:52:44,572 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-28 05:52:44,572 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-28 05:52:44,572 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-28 05:52:44,572 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-28 05:52:44,572 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-28 05:52:44,572 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-28 05:52:44,572 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-28 05:52:44,573 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-28 05:52:44,573 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-28 05:52:44,573 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-28 05:52:44,573 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-28 05:52:44,573 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 05:52:44,573 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-28 05:52:44,573 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-28 05:52:44,574 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-28 05:52:44,574 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-28 05:52:44,574 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 -> b36390e4ace21fb538f0c1df6f562bcf2825b5901fb45d9987e6242615034592 [2021-12-28 05:52:44,843 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-28 05:52:44,864 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-28 05:52:44,866 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-28 05:52:44,867 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-28 05:52:44,868 INFO L275 PluginConnector]: CDTParser initialized [2021-12-28 05:52:44,869 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/test-0232_1-1.i [2021-12-28 05:52:44,926 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d4e99c67/0619d85f92ad4888b200b1144bd14049/FLAGd5a184380 [2021-12-28 05:52:45,288 INFO L306 CDTParser]: Found 1 translation units. [2021-12-28 05:52:45,288 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0232_1-1.i [2021-12-28 05:52:45,300 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d4e99c67/0619d85f92ad4888b200b1144bd14049/FLAGd5a184380 [2021-12-28 05:52:45,670 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d4e99c67/0619d85f92ad4888b200b1144bd14049 [2021-12-28 05:52:45,673 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-28 05:52:45,674 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-28 05:52:45,677 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-28 05:52:45,677 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-28 05:52:45,679 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-28 05:52:45,680 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 05:52:45" (1/1) ... [2021-12-28 05:52:45,680 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bce0634 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:52:45, skipping insertion in model container [2021-12-28 05:52:45,681 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 05:52:45" (1/1) ... [2021-12-28 05:52:45,685 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-28 05:52:45,717 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-28 05:52:45,958 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 05:52:45,965 INFO L203 MainTranslator]: Completed pre-run [2021-12-28 05:52:46,006 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 05:52:46,030 INFO L208 MainTranslator]: Completed translation [2021-12-28 05:52:46,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:52:46 WrapperNode [2021-12-28 05:52:46,031 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-28 05:52:46,032 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-28 05:52:46,032 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-28 05:52:46,032 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-28 05:52:46,037 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:52:46" (1/1) ... [2021-12-28 05:52:46,060 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:52:46" (1/1) ... [2021-12-28 05:52:46,087 INFO L137 Inliner]: procedures = 126, calls = 33, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 98 [2021-12-28 05:52:46,087 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-28 05:52:46,088 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-28 05:52:46,088 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-28 05:52:46,088 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-28 05:52:46,094 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:52:46" (1/1) ... [2021-12-28 05:52:46,094 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:52:46" (1/1) ... [2021-12-28 05:52:46,101 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:52:46" (1/1) ... [2021-12-28 05:52:46,101 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:52:46" (1/1) ... [2021-12-28 05:52:46,116 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:52:46" (1/1) ... [2021-12-28 05:52:46,119 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:52:46" (1/1) ... [2021-12-28 05:52:46,123 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:52:46" (1/1) ... [2021-12-28 05:52:46,125 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-28 05:52:46,129 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-28 05:52:46,129 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-28 05:52:46,130 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-28 05:52:46,130 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:52:46" (1/1) ... [2021-12-28 05:52:46,135 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 05:52:46,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:52:46,164 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-28 05:52:46,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-28 05:52:46,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-28 05:52:46,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-28 05:52:46,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-28 05:52:46,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-28 05:52:46,223 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-28 05:52:46,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-28 05:52:46,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-28 05:52:46,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-28 05:52:46,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-28 05:52:46,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-28 05:52:46,330 INFO L234 CfgBuilder]: Building ICFG [2021-12-28 05:52:46,344 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-28 05:52:46,554 INFO L275 CfgBuilder]: Performing block encoding [2021-12-28 05:52:46,558 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-28 05:52:46,558 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-28 05:52:46,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 05:52:46 BoogieIcfgContainer [2021-12-28 05:52:46,560 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-28 05:52:46,561 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-28 05:52:46,561 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-28 05:52:46,564 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-28 05:52:46,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 05:52:45" (1/3) ... [2021-12-28 05:52:46,569 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22e80fd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 05:52:46, skipping insertion in model container [2021-12-28 05:52:46,569 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:52:46" (2/3) ... [2021-12-28 05:52:46,570 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22e80fd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 05:52:46, skipping insertion in model container [2021-12-28 05:52:46,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 05:52:46" (3/3) ... [2021-12-28 05:52:46,571 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0232_1-1.i [2021-12-28 05:52:46,574 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-28 05:52:46,582 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2021-12-28 05:52:46,618 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-28 05:52:46,624 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-28 05:52:46,624 INFO L340 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2021-12-28 05:52:46,638 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 46 states have (on average 2.108695652173913) internal successors, (97), 90 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:52:46,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-12-28 05:52:46,643 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:52:46,644 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-12-28 05:52:46,645 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 40 more)] === [2021-12-28 05:52:46,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:52:46,649 INFO L85 PathProgramCache]: Analyzing trace with hash 925637, now seen corresponding path program 1 times [2021-12-28 05:52:46,656 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:52:46,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294459017] [2021-12-28 05:52:46,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:52:46,658 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:52:46,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:52:46,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:52:46,905 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:52:46,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294459017] [2021-12-28 05:52:46,906 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294459017] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:52:46,906 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:52:46,906 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 05:52:46,908 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486878] [2021-12-28 05:52:46,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:52:46,913 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 05:52:46,913 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:52:46,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 05:52:46,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-28 05:52:46,946 INFO L87 Difference]: Start difference. First operand has 91 states, 46 states have (on average 2.108695652173913) internal successors, (97), 90 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:52:47,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:52:47,108 INFO L93 Difference]: Finished difference Result 116 states and 121 transitions. [2021-12-28 05:52:47,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 05:52:47,110 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2021-12-28 05:52:47,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:52:47,122 INFO L225 Difference]: With dead ends: 116 [2021-12-28 05:52:47,122 INFO L226 Difference]: Without dead ends: 114 [2021-12-28 05:52:47,124 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:52:47,126 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 166 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:52:47,127 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [166 Valid, 71 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:52:47,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-12-28 05:52:47,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 84. [2021-12-28 05:52:47,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 46 states have (on average 1.934782608695652) internal successors, (89), 83 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:52:47,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2021-12-28 05:52:47,156 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 4 [2021-12-28 05:52:47,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:52:47,156 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2021-12-28 05:52:47,156 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:52:47,157 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2021-12-28 05:52:47,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-12-28 05:52:47,157 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:52:47,157 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-12-28 05:52:47,157 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-28 05:52:47,158 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 40 more)] === [2021-12-28 05:52:47,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:52:47,158 INFO L85 PathProgramCache]: Analyzing trace with hash 925638, now seen corresponding path program 1 times [2021-12-28 05:52:47,159 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:52:47,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099585016] [2021-12-28 05:52:47,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:52:47,159 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:52:47,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:52:47,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:52:47,227 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:52:47,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099585016] [2021-12-28 05:52:47,228 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099585016] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:52:47,228 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:52:47,228 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 05:52:47,228 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827460489] [2021-12-28 05:52:47,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:52:47,230 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 05:52:47,230 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:52:47,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 05:52:47,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-28 05:52:47,231 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:52:47,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:52:47,329 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2021-12-28 05:52:47,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 05:52:47,329 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2021-12-28 05:52:47,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:52:47,330 INFO L225 Difference]: With dead ends: 107 [2021-12-28 05:52:47,330 INFO L226 Difference]: Without dead ends: 107 [2021-12-28 05:52:47,331 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:52:47,332 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 165 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:52:47,332 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [165 Valid, 50 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:52:47,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-12-28 05:52:47,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 89. [2021-12-28 05:52:47,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 88 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:52:47,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2021-12-28 05:52:47,339 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 4 [2021-12-28 05:52:47,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:52:47,339 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2021-12-28 05:52:47,339 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:52:47,340 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2021-12-28 05:52:47,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-28 05:52:47,340 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:52:47,340 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-28 05:52:47,340 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-28 05:52:47,341 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 40 more)] === [2021-12-28 05:52:47,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:52:47,341 INFO L85 PathProgramCache]: Analyzing trace with hash 28694727, now seen corresponding path program 1 times [2021-12-28 05:52:47,341 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:52:47,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980814930] [2021-12-28 05:52:47,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:52:47,342 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:52:47,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:52:47,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:52:47,367 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:52:47,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980814930] [2021-12-28 05:52:47,368 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980814930] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:52:47,368 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:52:47,368 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 05:52:47,368 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525957770] [2021-12-28 05:52:47,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:52:47,369 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 05:52:47,369 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:52:47,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 05:52:47,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:52:47,370 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:52:47,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:52:47,423 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2021-12-28 05:52:47,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:52:47,424 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-12-28 05:52:47,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:52:47,425 INFO L225 Difference]: With dead ends: 103 [2021-12-28 05:52:47,425 INFO L226 Difference]: Without dead ends: 103 [2021-12-28 05:52:47,425 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:52:47,426 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 57 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 05:52:47,427 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 71 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 05:52:47,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-12-28 05:52:47,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 85. [2021-12-28 05:52:47,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 54 states have (on average 1.7407407407407407) internal successors, (94), 84 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:52:47,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2021-12-28 05:52:47,432 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 5 [2021-12-28 05:52:47,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:52:47,432 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2021-12-28 05:52:47,432 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:52:47,433 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2021-12-28 05:52:47,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-28 05:52:47,433 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:52:47,433 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-28 05:52:47,433 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-28 05:52:47,434 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 40 more)] === [2021-12-28 05:52:47,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:52:47,434 INFO L85 PathProgramCache]: Analyzing trace with hash 28694728, now seen corresponding path program 1 times [2021-12-28 05:52:47,434 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:52:47,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76150605] [2021-12-28 05:52:47,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:52:47,435 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:52:47,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:52:47,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:52:47,475 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:52:47,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76150605] [2021-12-28 05:52:47,476 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76150605] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:52:47,476 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:52:47,476 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 05:52:47,477 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712578408] [2021-12-28 05:52:47,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:52:47,477 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 05:52:47,477 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:52:47,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 05:52:47,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:52:47,478 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:52:47,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:52:47,542 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2021-12-28 05:52:47,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:52:47,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-12-28 05:52:47,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:52:47,544 INFO L225 Difference]: With dead ends: 82 [2021-12-28 05:52:47,544 INFO L226 Difference]: Without dead ends: 82 [2021-12-28 05:52:47,544 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:52:47,545 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 71 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:52:47,545 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 48 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:52:47,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-12-28 05:52:47,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2021-12-28 05:52:47,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 54 states have (on average 1.6666666666666667) internal successors, (90), 80 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:52:47,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2021-12-28 05:52:47,551 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 5 [2021-12-28 05:52:47,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:52:47,552 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2021-12-28 05:52:47,552 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:52:47,552 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2021-12-28 05:52:47,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-28 05:52:47,553 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:52:47,553 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:52:47,553 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-28 05:52:47,553 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 40 more)] === [2021-12-28 05:52:47,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:52:47,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1328641136, now seen corresponding path program 1 times [2021-12-28 05:52:47,554 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:52:47,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900947894] [2021-12-28 05:52:47,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:52:47,555 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:52:47,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:52:47,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:52:47,686 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:52:47,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900947894] [2021-12-28 05:52:47,687 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900947894] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:52:47,687 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:52:47,687 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 05:52:47,687 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220519277] [2021-12-28 05:52:47,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:52:47,688 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 05:52:47,688 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:52:47,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 05:52:47,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-28 05:52:47,689 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:52:47,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:52:47,826 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2021-12-28 05:52:47,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-28 05:52:47,827 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-28 05:52:47,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:52:47,827 INFO L225 Difference]: With dead ends: 92 [2021-12-28 05:52:47,828 INFO L226 Difference]: Without dead ends: 92 [2021-12-28 05:52:47,828 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-12-28 05:52:47,829 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 14 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:52:47,829 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 366 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:52:47,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-12-28 05:52:47,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 87. [2021-12-28 05:52:47,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 60 states have (on average 1.6) internal successors, (96), 86 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:52:47,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 96 transitions. [2021-12-28 05:52:47,832 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 96 transitions. Word has length 10 [2021-12-28 05:52:47,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:52:47,832 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 96 transitions. [2021-12-28 05:52:47,833 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:52:47,833 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 96 transitions. [2021-12-28 05:52:47,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-28 05:52:47,839 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:52:47,839 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:52:47,839 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-28 05:52:47,839 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 40 more)] === [2021-12-28 05:52:47,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:52:47,840 INFO L85 PathProgramCache]: Analyzing trace with hash 2075089492, now seen corresponding path program 1 times [2021-12-28 05:52:47,840 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:52:47,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165100509] [2021-12-28 05:52:47,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:52:47,840 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:52:47,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:52:47,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:52:47,897 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:52:47,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165100509] [2021-12-28 05:52:47,897 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165100509] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:52:47,897 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:52:47,898 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 05:52:47,898 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700111179] [2021-12-28 05:52:47,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:52:47,898 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:52:47,898 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:52:47,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:52:47,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:52:47,899 INFO L87 Difference]: Start difference. First operand 87 states and 96 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:52:48,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:52:48,011 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2021-12-28 05:52:48,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:52:48,011 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-12-28 05:52:48,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:52:48,012 INFO L225 Difference]: With dead ends: 103 [2021-12-28 05:52:48,012 INFO L226 Difference]: Without dead ends: 103 [2021-12-28 05:52:48,012 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-28 05:52:48,013 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 177 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:52:48,013 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [177 Valid, 109 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:52:48,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-12-28 05:52:48,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 87. [2021-12-28 05:52:48,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 60 states have (on average 1.5833333333333333) internal successors, (95), 86 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:52:48,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2021-12-28 05:52:48,015 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 18 [2021-12-28 05:52:48,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:52:48,016 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2021-12-28 05:52:48,016 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:52:48,016 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2021-12-28 05:52:48,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-28 05:52:48,016 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:52:48,016 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:52:48,016 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-28 05:52:48,016 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 40 more)] === [2021-12-28 05:52:48,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:52:48,017 INFO L85 PathProgramCache]: Analyzing trace with hash 2075089493, now seen corresponding path program 1 times [2021-12-28 05:52:48,017 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:52:48,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154154931] [2021-12-28 05:52:48,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:52:48,017 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:52:48,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:52:48,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:52:48,110 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:52:48,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154154931] [2021-12-28 05:52:48,111 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154154931] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:52:48,111 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:52:48,111 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 05:52:48,111 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407171233] [2021-12-28 05:52:48,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:52:48,111 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:52:48,111 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:52:48,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:52:48,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:52:48,112 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:52:48,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:52:48,213 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2021-12-28 05:52:48,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 05:52:48,213 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-12-28 05:52:48,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:52:48,214 INFO L225 Difference]: With dead ends: 98 [2021-12-28 05:52:48,214 INFO L226 Difference]: Without dead ends: 98 [2021-12-28 05:52:48,214 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-28 05:52:48,215 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 132 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:52:48,215 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 103 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:52:48,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-12-28 05:52:48,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 86. [2021-12-28 05:52:48,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 60 states have (on average 1.55) internal successors, (93), 85 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:52:48,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2021-12-28 05:52:48,221 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 18 [2021-12-28 05:52:48,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:52:48,222 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2021-12-28 05:52:48,222 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:52:48,222 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2021-12-28 05:52:48,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-28 05:52:48,225 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:52:48,225 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:52:48,225 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-28 05:52:48,225 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 40 more)] === [2021-12-28 05:52:48,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:52:48,226 INFO L85 PathProgramCache]: Analyzing trace with hash 2075075558, now seen corresponding path program 1 times [2021-12-28 05:52:48,226 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:52:48,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910147022] [2021-12-28 05:52:48,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:52:48,226 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:52:48,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:52:48,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:52:48,273 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:52:48,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910147022] [2021-12-28 05:52:48,273 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910147022] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:52:48,273 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:52:48,273 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 05:52:48,274 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636371996] [2021-12-28 05:52:48,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:52:48,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 05:52:48,274 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:52:48,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 05:52:48,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:52:48,275 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:52:48,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:52:48,282 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2021-12-28 05:52:48,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:52:48,282 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-12-28 05:52:48,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:52:48,283 INFO L225 Difference]: With dead ends: 68 [2021-12-28 05:52:48,283 INFO L226 Difference]: Without dead ends: 68 [2021-12-28 05:52:48,283 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:52:48,284 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 31 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 05:52:48,284 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 78 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 05:52:48,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-12-28 05:52:48,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2021-12-28 05:52:48,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 51 states have (on average 1.4509803921568627) internal successors, (74), 67 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:52:48,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2021-12-28 05:52:48,290 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 18 [2021-12-28 05:52:48,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:52:48,290 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2021-12-28 05:52:48,290 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:52:48,291 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2021-12-28 05:52:48,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-28 05:52:48,291 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:52:48,291 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:52:48,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-28 05:52:48,292 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 40 more)] === [2021-12-28 05:52:48,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:52:48,292 INFO L85 PathProgramCache]: Analyzing trace with hash 2076311688, now seen corresponding path program 1 times [2021-12-28 05:52:48,292 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:52:48,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781777388] [2021-12-28 05:52:48,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:52:48,293 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:52:48,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:52:48,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:52:48,332 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:52:48,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781777388] [2021-12-28 05:52:48,333 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781777388] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:52:48,333 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:52:48,333 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 05:52:48,333 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258439931] [2021-12-28 05:52:48,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:52:48,334 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 05:52:48,334 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:52:48,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 05:52:48,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-28 05:52:48,335 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:52:48,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:52:48,392 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2021-12-28 05:52:48,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 05:52:48,392 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-12-28 05:52:48,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:52:48,393 INFO L225 Difference]: With dead ends: 67 [2021-12-28 05:52:48,393 INFO L226 Difference]: Without dead ends: 67 [2021-12-28 05:52:48,393 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-28 05:52:48,395 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 48 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:52:48,395 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 126 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:52:48,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-12-28 05:52:48,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2021-12-28 05:52:48,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 46 states have (on average 1.4130434782608696) internal successors, (65), 62 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:52:48,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2021-12-28 05:52:48,404 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 18 [2021-12-28 05:52:48,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:52:48,404 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2021-12-28 05:52:48,404 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:52:48,404 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2021-12-28 05:52:48,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-28 05:52:48,405 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:52:48,405 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:52:48,405 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-28 05:52:48,405 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 40 more)] === [2021-12-28 05:52:48,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:52:48,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1526810556, now seen corresponding path program 1 times [2021-12-28 05:52:48,406 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:52:48,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937229070] [2021-12-28 05:52:48,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:52:48,406 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:52:48,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:52:48,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:52:48,502 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:52:48,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937229070] [2021-12-28 05:52:48,502 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937229070] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:52:48,502 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:52:48,502 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 05:52:48,503 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470826260] [2021-12-28 05:52:48,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:52:48,503 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 05:52:48,503 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:52:48,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 05:52:48,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:52:48,504 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:52:48,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:52:48,546 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2021-12-28 05:52:48,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 05:52:48,547 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-28 05:52:48,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:52:48,547 INFO L225 Difference]: With dead ends: 62 [2021-12-28 05:52:48,547 INFO L226 Difference]: Without dead ends: 62 [2021-12-28 05:52:48,548 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-28 05:52:48,548 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 60 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 05:52:48,548 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 91 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 05:52:48,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-12-28 05:52:48,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2021-12-28 05:52:48,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 46 states have (on average 1.391304347826087) internal successors, (64), 61 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:52:48,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2021-12-28 05:52:48,550 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 21 [2021-12-28 05:52:48,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:52:48,550 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2021-12-28 05:52:48,551 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:52:48,551 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2021-12-28 05:52:48,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-28 05:52:48,551 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:52:48,551 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:52:48,551 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-28 05:52:48,552 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 40 more)] === [2021-12-28 05:52:48,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:52:48,552 INFO L85 PathProgramCache]: Analyzing trace with hash 86487093, now seen corresponding path program 1 times [2021-12-28 05:52:48,552 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:52:48,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044514640] [2021-12-28 05:52:48,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:52:48,553 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:52:48,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:52:48,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:52:48,591 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:52:48,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044514640] [2021-12-28 05:52:48,592 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044514640] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:52:48,592 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:52:48,592 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 05:52:48,592 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969539273] [2021-12-28 05:52:48,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:52:48,593 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 05:52:48,593 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:52:48,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 05:52:48,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:52:48,593 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:52:48,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:52:48,652 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2021-12-28 05:52:48,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 05:52:48,653 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-12-28 05:52:48,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:52:48,653 INFO L225 Difference]: With dead ends: 61 [2021-12-28 05:52:48,653 INFO L226 Difference]: Without dead ends: 61 [2021-12-28 05:52:48,654 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-28 05:52:48,667 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 53 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 05:52:48,668 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 77 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 05:52:48,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-12-28 05:52:48,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2021-12-28 05:52:48,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 60 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:52:48,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2021-12-28 05:52:48,672 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 22 [2021-12-28 05:52:48,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:52:48,673 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2021-12-28 05:52:48,673 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:52:48,673 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2021-12-28 05:52:48,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-28 05:52:48,673 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:52:48,673 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:52:48,674 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-28 05:52:48,674 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 40 more)] === [2021-12-28 05:52:48,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:52:48,674 INFO L85 PathProgramCache]: Analyzing trace with hash -428723026, now seen corresponding path program 1 times [2021-12-28 05:52:48,674 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:52:48,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886573112] [2021-12-28 05:52:48,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:52:48,675 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:52:48,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:52:48,775 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:52:48,776 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:52:48,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886573112] [2021-12-28 05:52:48,776 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886573112] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 05:52:48,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216845540] [2021-12-28 05:52:48,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:52:48,777 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:52:48,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:52:48,784 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 05:52:48,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-28 05:52:48,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:52:48,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 36 conjunts are in the unsatisfiable core [2021-12-28 05:52:48,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:52:49,035 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-28 05:52:49,095 INFO L353 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2021-12-28 05:52:49,096 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2021-12-28 05:52:49,178 INFO L353 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-28 05:52:49,178 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2021-12-28 05:52:49,242 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-28 05:52:49,243 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 16 [2021-12-28 05:52:49,247 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:52:49,247 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:52:49,353 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2021-12-28 05:52:49,752 INFO L353 Elim1Store]: treesize reduction 10, result has 60.0 percent of original size [2021-12-28 05:52:49,752 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 72 [2021-12-28 05:52:49,835 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:52:49,835 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [216845540] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 05:52:49,835 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 05:52:49,835 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 19 [2021-12-28 05:52:49,835 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883173456] [2021-12-28 05:52:49,835 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 05:52:49,835 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-28 05:52:49,836 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:52:49,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-28 05:52:49,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2021-12-28 05:52:49,836 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand has 20 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 20 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:52:50,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:52:50,169 INFO L93 Difference]: Finished difference Result 157 states and 165 transitions. [2021-12-28 05:52:50,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-28 05:52:50,170 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 20 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-12-28 05:52:50,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:52:50,171 INFO L225 Difference]: With dead ends: 157 [2021-12-28 05:52:50,171 INFO L226 Difference]: Without dead ends: 157 [2021-12-28 05:52:50,171 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=146, Invalid=556, Unknown=0, NotChecked=0, Total=702 [2021-12-28 05:52:50,172 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 261 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 124 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:52:50,172 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [261 Valid, 365 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 368 Invalid, 0 Unknown, 124 Unchecked, 0.2s Time] [2021-12-28 05:52:50,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-12-28 05:52:50,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 75. [2021-12-28 05:52:50,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 60 states have (on average 1.3333333333333333) internal successors, (80), 74 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:52:50,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2021-12-28 05:52:50,175 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 22 [2021-12-28 05:52:50,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:52:50,176 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2021-12-28 05:52:50,176 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 20 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:52:50,176 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2021-12-28 05:52:50,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-28 05:52:50,178 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:52:50,178 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:52:50,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-28 05:52:50,391 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,SelfDestructingSolverStorable11 [2021-12-28 05:52:50,391 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 40 more)] === [2021-12-28 05:52:50,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:52:50,392 INFO L85 PathProgramCache]: Analyzing trace with hash -428723025, now seen corresponding path program 1 times [2021-12-28 05:52:50,392 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:52:50,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938791806] [2021-12-28 05:52:50,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:52:50,392 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:52:50,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:52:50,511 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:52:50,511 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:52:50,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938791806] [2021-12-28 05:52:50,512 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938791806] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 05:52:50,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266432294] [2021-12-28 05:52:50,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:52:50,512 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:52:50,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:52:50,528 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 05:52:50,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-28 05:52:50,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:52:50,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 53 conjunts are in the unsatisfiable core [2021-12-28 05:52:50,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:52:50,741 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-28 05:52:50,745 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-28 05:52:50,834 INFO L353 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-12-28 05:52:50,834 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2021-12-28 05:52:50,842 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-28 05:52:50,938 INFO L353 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-28 05:52:50,939 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2021-12-28 05:52:50,948 INFO L353 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-28 05:52:50,948 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2021-12-28 05:52:51,032 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-28 05:52:51,032 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 16 [2021-12-28 05:52:51,037 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-28 05:52:51,037 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2021-12-28 05:52:51,040 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:52:51,041 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:52:51,249 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 80 [2021-12-28 05:52:51,252 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 123 [2021-12-28 05:52:51,362 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 05:52:51,364 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2021-12-28 05:52:51,425 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:52:51,425 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [266432294] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 05:52:51,425 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 05:52:51,425 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 22 [2021-12-28 05:52:51,426 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240203995] [2021-12-28 05:52:51,426 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 05:52:51,426 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-28 05:52:51,426 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:52:51,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-28 05:52:51,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2021-12-28 05:52:51,427 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand has 23 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 23 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:52:51,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:52:51,850 INFO L93 Difference]: Finished difference Result 159 states and 167 transitions. [2021-12-28 05:52:51,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-28 05:52:51,851 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 23 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-12-28 05:52:51,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:52:51,851 INFO L225 Difference]: With dead ends: 159 [2021-12-28 05:52:51,852 INFO L226 Difference]: Without dead ends: 159 [2021-12-28 05:52:51,852 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=200, Invalid=922, Unknown=0, NotChecked=0, Total=1122 [2021-12-28 05:52:51,852 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 208 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 133 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:52:51,852 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 529 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 444 Invalid, 0 Unknown, 133 Unchecked, 0.2s Time] [2021-12-28 05:52:51,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-12-28 05:52:51,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 75. [2021-12-28 05:52:51,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 60 states have (on average 1.3166666666666667) internal successors, (79), 74 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:52:51,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2021-12-28 05:52:51,854 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 22 [2021-12-28 05:52:51,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:52:51,854 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2021-12-28 05:52:51,854 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 23 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:52:51,854 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2021-12-28 05:52:51,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-28 05:52:51,855 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:52:51,855 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:52:51,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-28 05:52:52,067 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,SelfDestructingSolverStorable12 [2021-12-28 05:52:52,067 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 40 more)] === [2021-12-28 05:52:52,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:52:52,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1613867298, now seen corresponding path program 1 times [2021-12-28 05:52:52,068 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:52:52,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703462387] [2021-12-28 05:52:52,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:52:52,068 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:52:52,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:52:52,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:52:52,107 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:52:52,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703462387] [2021-12-28 05:52:52,107 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703462387] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:52:52,107 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:52:52,107 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 05:52:52,109 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593126730] [2021-12-28 05:52:52,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:52:52,109 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 05:52:52,109 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:52:52,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 05:52:52,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:52:52,110 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:52:52,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:52:52,180 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2021-12-28 05:52:52,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 05:52:52,180 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-28 05:52:52,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:52:52,182 INFO L225 Difference]: With dead ends: 74 [2021-12-28 05:52:52,182 INFO L226 Difference]: Without dead ends: 74 [2021-12-28 05:52:52,182 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-28 05:52:52,182 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 4 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:52:52,183 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 128 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:52:52,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-12-28 05:52:52,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2021-12-28 05:52:52,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 60 states have (on average 1.3) internal successors, (78), 73 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:52:52,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2021-12-28 05:52:52,184 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 23 [2021-12-28 05:52:52,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:52:52,185 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2021-12-28 05:52:52,185 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:52:52,185 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2021-12-28 05:52:52,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-28 05:52:52,187 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:52:52,187 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:52:52,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-28 05:52:52,187 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 40 more)] === [2021-12-28 05:52:52,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:52:52,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1509721432, now seen corresponding path program 1 times [2021-12-28 05:52:52,188 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:52:52,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760550694] [2021-12-28 05:52:52,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:52:52,188 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:52:52,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:52:52,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:52:52,275 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:52:52,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760550694] [2021-12-28 05:52:52,275 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760550694] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:52:52,275 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:52:52,275 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 05:52:52,275 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57287072] [2021-12-28 05:52:52,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:52:52,275 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:52:52,276 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:52:52,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:52:52,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:52:52,276 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:52:52,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:52:52,342 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2021-12-28 05:52:52,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:52:52,344 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-12-28 05:52:52,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:52:52,344 INFO L225 Difference]: With dead ends: 73 [2021-12-28 05:52:52,344 INFO L226 Difference]: Without dead ends: 73 [2021-12-28 05:52:52,345 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2021-12-28 05:52:52,345 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 94 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 05:52:52,345 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 60 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 05:52:52,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-12-28 05:52:52,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2021-12-28 05:52:52,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 60 states have (on average 1.2833333333333334) internal successors, (77), 72 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:52:52,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2021-12-28 05:52:52,347 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 24 [2021-12-28 05:52:52,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:52:52,347 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2021-12-28 05:52:52,347 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:52:52,347 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2021-12-28 05:52:52,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-28 05:52:52,347 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:52:52,347 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:52:52,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-28 05:52:52,347 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 40 more)] === [2021-12-28 05:52:52,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:52:52,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1509721433, now seen corresponding path program 1 times [2021-12-28 05:52:52,348 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:52:52,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238205316] [2021-12-28 05:52:52,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:52:52,348 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:52:52,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:52:52,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:52:52,396 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:52:52,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238205316] [2021-12-28 05:52:52,396 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238205316] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:52:52,396 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:52:52,396 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 05:52:52,396 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004329105] [2021-12-28 05:52:52,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:52:52,397 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 05:52:52,397 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:52:52,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 05:52:52,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-28 05:52:52,398 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:52:52,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:52:52,431 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2021-12-28 05:52:52,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:52:52,431 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-12-28 05:52:52,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:52:52,432 INFO L225 Difference]: With dead ends: 69 [2021-12-28 05:52:52,433 INFO L226 Difference]: Without dead ends: 69 [2021-12-28 05:52:52,433 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-28 05:52:52,433 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 71 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 05:52:52,434 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 32 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 05:52:52,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-12-28 05:52:52,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2021-12-28 05:52:52,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 60 states have (on average 1.2166666666666666) internal successors, (73), 68 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:52:52,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2021-12-28 05:52:52,436 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 24 [2021-12-28 05:52:52,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:52:52,436 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2021-12-28 05:52:52,436 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:52:52,437 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2021-12-28 05:52:52,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-28 05:52:52,437 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:52:52,437 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:52:52,437 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-28 05:52:52,438 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 40 more)] === [2021-12-28 05:52:52,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:52:52,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1394996802, now seen corresponding path program 1 times [2021-12-28 05:52:52,438 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:52:52,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461546544] [2021-12-28 05:52:52,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:52:52,439 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:52:52,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 05:52:52,495 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 05:52:52,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 05:52:52,554 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 05:52:52,555 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-28 05:52:52,556 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK (43 of 44 remaining) [2021-12-28 05:52:52,557 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (42 of 44 remaining) [2021-12-28 05:52:52,558 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (41 of 44 remaining) [2021-12-28 05:52:52,558 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (40 of 44 remaining) [2021-12-28 05:52:52,558 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (39 of 44 remaining) [2021-12-28 05:52:52,558 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (38 of 44 remaining) [2021-12-28 05:52:52,558 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (37 of 44 remaining) [2021-12-28 05:52:52,558 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (36 of 44 remaining) [2021-12-28 05:52:52,559 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION (35 of 44 remaining) [2021-12-28 05:52:52,559 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION (34 of 44 remaining) [2021-12-28 05:52:52,559 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION (33 of 44 remaining) [2021-12-28 05:52:52,559 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION (32 of 44 remaining) [2021-12-28 05:52:52,559 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION (31 of 44 remaining) [2021-12-28 05:52:52,560 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION (30 of 44 remaining) [2021-12-28 05:52:52,560 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION (29 of 44 remaining) [2021-12-28 05:52:52,560 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION (28 of 44 remaining) [2021-12-28 05:52:52,560 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION (27 of 44 remaining) [2021-12-28 05:52:52,560 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION (26 of 44 remaining) [2021-12-28 05:52:52,560 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION (25 of 44 remaining) [2021-12-28 05:52:52,561 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (24 of 44 remaining) [2021-12-28 05:52:52,561 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE (23 of 44 remaining) [2021-12-28 05:52:52,561 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE (22 of 44 remaining) [2021-12-28 05:52:52,561 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATION (21 of 44 remaining) [2021-12-28 05:52:52,561 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATION (20 of 44 remaining) [2021-12-28 05:52:52,562 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATION (19 of 44 remaining) [2021-12-28 05:52:52,562 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATION (18 of 44 remaining) [2021-12-28 05:52:52,562 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATION (17 of 44 remaining) [2021-12-28 05:52:52,562 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATION (16 of 44 remaining) [2021-12-28 05:52:52,562 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE (15 of 44 remaining) [2021-12-28 05:52:52,562 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE (14 of 44 remaining) [2021-12-28 05:52:52,563 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE (13 of 44 remaining) [2021-12-28 05:52:52,563 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATION (12 of 44 remaining) [2021-12-28 05:52:52,563 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATION (11 of 44 remaining) [2021-12-28 05:52:52,563 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATION (10 of 44 remaining) [2021-12-28 05:52:52,563 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATION (9 of 44 remaining) [2021-12-28 05:52:52,564 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATION (8 of 44 remaining) [2021-12-28 05:52:52,564 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATION (7 of 44 remaining) [2021-12-28 05:52:52,564 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATION (6 of 44 remaining) [2021-12-28 05:52:52,564 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATION (5 of 44 remaining) [2021-12-28 05:52:52,564 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE (4 of 44 remaining) [2021-12-28 05:52:52,565 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE (3 of 44 remaining) [2021-12-28 05:52:52,565 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE (2 of 44 remaining) [2021-12-28 05:52:52,565 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATION (1 of 44 remaining) [2021-12-28 05:52:52,565 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATION (0 of 44 remaining) [2021-12-28 05:52:52,565 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-28 05:52:52,568 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:52:52,571 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-28 05:52:52,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 05:52:52 BoogieIcfgContainer [2021-12-28 05:52:52,598 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-28 05:52:52,599 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-28 05:52:52,599 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-28 05:52:52,599 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-28 05:52:52,600 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 05:52:46" (3/4) ... [2021-12-28 05:52:52,602 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-28 05:52:52,603 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-28 05:52:52,603 INFO L158 Benchmark]: Toolchain (without parser) took 6929.04ms. Allocated memory was 52.4MB in the beginning and 127.9MB in the end (delta: 75.5MB). Free memory was 29.1MB in the beginning and 41.3MB in the end (delta: -12.2MB). Peak memory consumption was 62.7MB. Max. memory is 16.1GB. [2021-12-28 05:52:52,603 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 52.4MB. Free memory was 35.4MB in the beginning and 35.4MB in the end (delta: 39.3kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-28 05:52:52,604 INFO L158 Benchmark]: CACSL2BoogieTranslator took 354.72ms. Allocated memory was 52.4MB in the beginning and 65.0MB in the end (delta: 12.6MB). Free memory was 28.9MB in the beginning and 42.6MB in the end (delta: -13.7MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. [2021-12-28 05:52:52,604 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.65ms. Allocated memory is still 65.0MB. Free memory was 42.4MB in the beginning and 40.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-28 05:52:52,604 INFO L158 Benchmark]: Boogie Preprocessor took 40.39ms. Allocated memory is still 65.0MB. Free memory was 40.6MB in the beginning and 38.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-28 05:52:52,605 INFO L158 Benchmark]: RCFGBuilder took 430.79ms. Allocated memory is still 65.0MB. Free memory was 38.9MB in the beginning and 39.2MB in the end (delta: -296.4kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-28 05:52:52,605 INFO L158 Benchmark]: TraceAbstraction took 6037.71ms. Allocated memory was 65.0MB in the beginning and 127.9MB in the end (delta: 62.9MB). Free memory was 38.7MB in the beginning and 41.3MB in the end (delta: -2.6MB). Peak memory consumption was 59.3MB. Max. memory is 16.1GB. [2021-12-28 05:52:52,605 INFO L158 Benchmark]: Witness Printer took 3.74ms. Allocated memory is still 127.9MB. Free memory is still 41.3MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-28 05:52:52,606 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.17ms. Allocated memory is still 52.4MB. Free memory was 35.4MB in the beginning and 35.4MB in the end (delta: 39.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 354.72ms. Allocated memory was 52.4MB in the beginning and 65.0MB in the end (delta: 12.6MB). Free memory was 28.9MB in the beginning and 42.6MB in the end (delta: -13.7MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.65ms. Allocated memory is still 65.0MB. Free memory was 42.4MB in the beginning and 40.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.39ms. Allocated memory is still 65.0MB. Free memory was 40.6MB in the beginning and 38.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 430.79ms. Allocated memory is still 65.0MB. Free memory was 38.9MB in the beginning and 39.2MB in the end (delta: -296.4kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 6037.71ms. Allocated memory was 65.0MB in the beginning and 127.9MB in the end (delta: 62.9MB). Free memory was 38.7MB in the beginning and 41.3MB in the end (delta: -2.6MB). Peak memory consumption was 59.3MB. Max. memory is 16.1GB. * Witness Printer took 3.74ms. Allocated memory is still 127.9MB. Free memory is still 41.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 539]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 539. Possible FailurePath: [L524] int c = 0; VAL [c=0] [L541] struct item *list = ((void *)0); [L542] int length = 0; VAL [c=0, length=0, list={6:0}] [L544] CALL append(&list) [L531] c++ [L532] struct item *item = malloc(sizeof *item); [L533] EXPR \read(**plist) VAL [\read(**plist)={0:0}, c=1, item={3:0}, plist={6:0}, plist={6:0}] [L533] item->next = *plist VAL [\read(**plist)={0:0}, c=1, item={3:0}, plist={6:0}, plist={6:0}] [L534] EXPR item->next VAL [c=1, item={3:0}, item->next={0:0}, plist={6:0}, plist={6:0}] [L534-L536] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L534-L536] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={-1:0}, c=1, item={3:0}, item->next={0:0}, malloc(sizeof *item)={-1:0}, plist={6:0}, plist={6:0}] [L534-L536] item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={-1:0}, c=1, item={3:0}, item->next={0:0}, malloc(sizeof *item)={-1:0}, plist={6:0}, plist={6:0}] [L537] *plist = item VAL [c=1, item={3:0}, plist={6:0}, plist={6:0}] [L544] RET append(&list) [L545] length++ VAL [c=1, length=1, list={6:0}] [L546] COND FALSE !(__VERIFIER_nondet_int() && c < 20) [L547] COND TRUE length > 0 VAL [c=1, length=1, list={6:0}] [L548] COND FALSE !(length < 0) VAL [c=1, length=1, list={6:0}] [L551] EXPR \read(*list) VAL [\read(*list)={3:0}, c=1, length=1, list={6:0}] [L551] EXPR list->next VAL [\read(*list)={3:0}, c=1, length=1, list={6:0}, list->next={0:0}] [L551] struct item *next = list->next; [L552] EXPR \read(*list) VAL [\read(*list)={3:0}, c=1, length=1, list={6:0}, next={0:0}] [L552] free(list) VAL [\read(*list)={3:0}, c=1, length=1, list={6:0}, next={0:0}] [L552] free(list) VAL [\read(*list)={3:0}, c=1, length=1, list={6:0}, next={0:0}] [L552] free(list) [L553] list = next VAL [c=1, length=1, list={6:0}, next={0:0}] [L554] length-- VAL [c=1, length=0, list={6:0}, next={0:0}] [L556] COND FALSE !(length > 0) VAL [c=1, length=0, list={6:0}, next={0:0}] [L562] return 0; [L541] struct item *list = ((void *)0); [L562] return 0; VAL [\result=0, c=1, length=0, next={0:0}] - UnprovableResult [Line: 533]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 533]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 533]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 533]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 534]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 534]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 535]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 535]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 535]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 535]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 534]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 534]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 549]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 549]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 549]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 549]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 549]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 549]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 549]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 553]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 553]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 557]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 557]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 557]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 557]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 558]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 558]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 558]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 558]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 558]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 559]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 559]: 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 1 procedures, 91 locations, 44 error locations. Started 1 CEGAR loops. OverallTime: 6.0s, OverallIterations: 17, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1612 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1612 mSDsluCounter, 2304 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 257 IncrementalHoareTripleChecker+Unchecked, 1608 mSDsCounter, 110 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1748 IncrementalHoareTripleChecker+Invalid, 2115 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 110 mSolverCounterUnsat, 696 mSDtfsCounter, 1748 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 196 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=91occurred in iteration=0, InterpolantAutomatonStates: 109, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 270 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 330 NumberOfCodeBlocks, 330 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 326 ConstructedInterpolants, 22 QuantifiedInterpolants, 3332 SizeOfPredicates, 42 NumberOfNonLiveVariables, 442 ConjunctsInSsa, 89 ConjunctsInUnsatCore, 20 InterpolantComputations, 14 PerfectInterpolantSequences, 6/36 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-12-28 05:52:52,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-ext-properties/test-0232_1-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b36390e4ace21fb538f0c1df6f562bcf2825b5901fb45d9987e6242615034592 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-28 05:52:54,632 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-28 05:52:54,633 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-28 05:52:54,653 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-28 05:52:54,653 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-28 05:52:54,654 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-28 05:52:54,655 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-28 05:52:54,656 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-28 05:52:54,658 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-28 05:52:54,658 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-28 05:52:54,659 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-28 05:52:54,660 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-28 05:52:54,660 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-28 05:52:54,661 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-28 05:52:54,661 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-28 05:52:54,662 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-28 05:52:54,663 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-28 05:52:54,663 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-28 05:52:54,665 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-28 05:52:54,666 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-28 05:52:54,667 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-28 05:52:54,668 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-28 05:52:54,668 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-28 05:52:54,669 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-28 05:52:54,671 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-28 05:52:54,671 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-28 05:52:54,671 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-28 05:52:54,676 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-28 05:52:54,676 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-28 05:52:54,677 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-28 05:52:54,677 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-28 05:52:54,677 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-28 05:52:54,678 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-28 05:52:54,678 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-28 05:52:54,679 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-28 05:52:54,679 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-28 05:52:54,680 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-28 05:52:54,680 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-28 05:52:54,680 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-28 05:52:54,681 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-28 05:52:54,681 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-28 05:52:54,682 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-12-28 05:52:54,698 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-28 05:52:54,698 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-28 05:52:54,698 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-28 05:52:54,699 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-28 05:52:54,699 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-28 05:52:54,699 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-28 05:52:54,700 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-28 05:52:54,700 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-28 05:52:54,700 INFO L138 SettingsManager]: * Use SBE=true [2021-12-28 05:52:54,700 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-28 05:52:54,701 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-28 05:52:54,701 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-28 05:52:54,701 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-28 05:52:54,701 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-28 05:52:54,701 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-28 05:52:54,702 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-28 05:52:54,702 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-28 05:52:54,702 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-28 05:52:54,702 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-28 05:52:54,702 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-28 05:52:54,702 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-28 05:52:54,703 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-28 05:52:54,703 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-28 05:52:54,703 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-28 05:52:54,703 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-28 05:52:54,704 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-28 05:52:54,704 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-28 05:52:54,704 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 05:52:54,704 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-28 05:52:54,704 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-28 05:52:54,704 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-28 05:52:54,705 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-28 05:52:54,705 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-28 05:52:54,705 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 -> b36390e4ace21fb538f0c1df6f562bcf2825b5901fb45d9987e6242615034592 [2021-12-28 05:52:54,926 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-28 05:52:54,941 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-28 05:52:54,942 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-28 05:52:54,943 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-28 05:52:54,944 INFO L275 PluginConnector]: CDTParser initialized [2021-12-28 05:52:54,945 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/test-0232_1-1.i [2021-12-28 05:52:54,988 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd0fb20bf/2d7a38ece66f4427950f2c999a4f275e/FLAGfa6c69c4a [2021-12-28 05:52:55,404 INFO L306 CDTParser]: Found 1 translation units. [2021-12-28 05:52:55,404 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0232_1-1.i [2021-12-28 05:52:55,419 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd0fb20bf/2d7a38ece66f4427950f2c999a4f275e/FLAGfa6c69c4a [2021-12-28 05:52:55,429 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd0fb20bf/2d7a38ece66f4427950f2c999a4f275e [2021-12-28 05:52:55,431 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-28 05:52:55,435 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-28 05:52:55,439 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-28 05:52:55,439 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-28 05:52:55,442 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-28 05:52:55,443 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 05:52:55" (1/1) ... [2021-12-28 05:52:55,444 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a0bf4e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:52:55, skipping insertion in model container [2021-12-28 05:52:55,444 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 05:52:55" (1/1) ... [2021-12-28 05:52:55,450 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-28 05:52:55,487 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-28 05:52:55,833 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 05:52:55,848 INFO L203 MainTranslator]: Completed pre-run [2021-12-28 05:52:55,904 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 05:52:55,935 INFO L208 MainTranslator]: Completed translation [2021-12-28 05:52:55,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:52:55 WrapperNode [2021-12-28 05:52:55,937 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-28 05:52:55,938 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-28 05:52:55,938 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-28 05:52:55,939 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-28 05:52:55,943 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:52:55" (1/1) ... [2021-12-28 05:52:55,976 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:52:55" (1/1) ... [2021-12-28 05:52:55,997 INFO L137 Inliner]: procedures = 127, calls = 33, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 98 [2021-12-28 05:52:55,997 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-28 05:52:55,998 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-28 05:52:55,998 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-28 05:52:55,999 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-28 05:52:56,004 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:52:55" (1/1) ... [2021-12-28 05:52:56,005 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:52:55" (1/1) ... [2021-12-28 05:52:56,010 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:52:55" (1/1) ... [2021-12-28 05:52:56,010 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:52:55" (1/1) ... [2021-12-28 05:52:56,027 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:52:55" (1/1) ... [2021-12-28 05:52:56,029 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:52:55" (1/1) ... [2021-12-28 05:52:56,030 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:52:55" (1/1) ... [2021-12-28 05:52:56,032 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-28 05:52:56,033 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-28 05:52:56,033 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-28 05:52:56,033 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-28 05:52:56,034 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:52:55" (1/1) ... [2021-12-28 05:52:56,040 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 05:52:56,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:52:56,084 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-28 05:52:56,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-28 05:52:56,115 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-28 05:52:56,115 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-28 05:52:56,116 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-28 05:52:56,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-28 05:52:56,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-28 05:52:56,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-28 05:52:56,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-28 05:52:56,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-28 05:52:56,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-28 05:52:56,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-28 05:52:56,243 INFO L234 CfgBuilder]: Building ICFG [2021-12-28 05:52:56,249 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-28 05:52:56,595 INFO L275 CfgBuilder]: Performing block encoding [2021-12-28 05:52:56,599 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-28 05:52:56,599 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-28 05:52:56,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 05:52:56 BoogieIcfgContainer [2021-12-28 05:52:56,601 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-28 05:52:56,602 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-28 05:52:56,602 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-28 05:52:56,605 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-28 05:52:56,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 05:52:55" (1/3) ... [2021-12-28 05:52:56,606 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dfa09d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 05:52:56, skipping insertion in model container [2021-12-28 05:52:56,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:52:55" (2/3) ... [2021-12-28 05:52:56,606 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dfa09d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 05:52:56, skipping insertion in model container [2021-12-28 05:52:56,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 05:52:56" (3/3) ... [2021-12-28 05:52:56,607 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0232_1-1.i [2021-12-28 05:52:56,611 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-28 05:52:56,611 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2021-12-28 05:52:56,643 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-28 05:52:56,649 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-28 05:52:56,649 INFO L340 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2021-12-28 05:52:56,673 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 45 states have (on average 2.1333333333333333) internal successors, (96), 89 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:52:56,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-12-28 05:52:56,678 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:52:56,678 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-12-28 05:52:56,678 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 40 more)] === [2021-12-28 05:52:56,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:52:56,682 INFO L85 PathProgramCache]: Analyzing trace with hash 925637, now seen corresponding path program 1 times [2021-12-28 05:52:56,689 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:52:56,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1232162594] [2021-12-28 05:52:56,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:52:56,690 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:52:56,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:52:56,692 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:52:56,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-28 05:52:56,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:52:56,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-28 05:52:56,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:52:56,821 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-28 05:52:56,859 INFO L353 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-12-28 05:52:56,859 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17 [2021-12-28 05:52:56,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:52:56,878 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:52:56,879 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:52:56,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1232162594] [2021-12-28 05:52:56,880 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1232162594] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:52:56,880 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:52:56,880 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 05:52:56,881 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058203715] [2021-12-28 05:52:56,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:52:56,885 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 05:52:56,885 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:52:56,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 05:52:56,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-28 05:52:56,907 INFO L87 Difference]: Start difference. First operand has 90 states, 45 states have (on average 2.1333333333333333) internal successors, (96), 89 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:52:57,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:52:57,091 INFO L93 Difference]: Finished difference Result 115 states and 120 transitions. [2021-12-28 05:52:57,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 05:52:57,093 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2021-12-28 05:52:57,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:52:57,098 INFO L225 Difference]: With dead ends: 115 [2021-12-28 05:52:57,098 INFO L226 Difference]: Without dead ends: 113 [2021-12-28 05:52:57,099 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:52:57,101 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 164 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:52:57,101 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 70 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 05:52:57,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-12-28 05:52:57,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 83. [2021-12-28 05:52:57,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 45 states have (on average 1.9555555555555555) internal successors, (88), 82 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:52:57,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2021-12-28 05:52:57,122 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 4 [2021-12-28 05:52:57,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:52:57,122 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2021-12-28 05:52:57,122 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:52:57,122 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2021-12-28 05:52:57,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-12-28 05:52:57,123 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:52:57,123 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-12-28 05:52:57,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-28 05:52:57,329 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:52:57,329 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 40 more)] === [2021-12-28 05:52:57,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:52:57,330 INFO L85 PathProgramCache]: Analyzing trace with hash 925638, now seen corresponding path program 1 times [2021-12-28 05:52:57,330 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:52:57,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [356062681] [2021-12-28 05:52:57,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:52:57,330 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:52:57,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:52:57,343 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:52:57,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-28 05:52:57,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:52:57,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-28 05:52:57,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:52:57,407 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-28 05:52:57,411 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-28 05:52:57,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:52:57,453 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-28 05:52:57,466 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-28 05:52:57,467 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-28 05:52:57,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:52:57,479 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:52:57,480 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:52:57,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [356062681] [2021-12-28 05:52:57,480 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [356062681] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:52:57,480 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:52:57,480 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 05:52:57,481 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191458824] [2021-12-28 05:52:57,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:52:57,482 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 05:52:57,482 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:52:57,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 05:52:57,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-28 05:52:57,486 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:52:57,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:52:57,811 INFO L93 Difference]: Finished difference Result 193 states and 202 transitions. [2021-12-28 05:52:57,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 05:52:57,812 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2021-12-28 05:52:57,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:52:57,813 INFO L225 Difference]: With dead ends: 193 [2021-12-28 05:52:57,813 INFO L226 Difference]: Without dead ends: 193 [2021-12-28 05:52:57,813 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:52:57,814 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 164 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 05:52:57,814 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 131 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-28 05:52:57,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2021-12-28 05:52:57,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 92. [2021-12-28 05:52:57,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 56 states have (on average 1.8392857142857142) internal successors, (103), 91 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:52:57,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 103 transitions. [2021-12-28 05:52:57,820 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 103 transitions. Word has length 4 [2021-12-28 05:52:57,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:52:57,820 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 103 transitions. [2021-12-28 05:52:57,820 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:52:57,820 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2021-12-28 05:52:57,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-28 05:52:57,820 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:52:57,821 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-28 05:52:57,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-28 05:52:58,027 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:52:58,028 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 40 more)] === [2021-12-28 05:52:58,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:52:58,028 INFO L85 PathProgramCache]: Analyzing trace with hash 28694727, now seen corresponding path program 1 times [2021-12-28 05:52:58,028 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:52:58,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [703620705] [2021-12-28 05:52:58,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:52:58,029 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:52:58,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:52:58,030 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:52:58,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-28 05:52:58,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:52:58,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-28 05:52:58,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:52:58,094 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-28 05:52:58,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:52:58,101 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:52:58,101 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:52:58,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [703620705] [2021-12-28 05:52:58,101 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [703620705] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:52:58,101 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:52:58,101 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 05:52:58,101 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707591135] [2021-12-28 05:52:58,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:52:58,101 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 05:52:58,102 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:52:58,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 05:52:58,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:52:58,102 INFO L87 Difference]: Start difference. First operand 92 states and 103 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:52:58,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:52:58,248 INFO L93 Difference]: Finished difference Result 106 states and 112 transitions. [2021-12-28 05:52:58,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:52:58,249 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-12-28 05:52:58,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:52:58,249 INFO L225 Difference]: With dead ends: 106 [2021-12-28 05:52:58,249 INFO L226 Difference]: Without dead ends: 106 [2021-12-28 05:52:58,250 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:52:58,250 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 57 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:52:58,251 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 71 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:52:58,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-12-28 05:52:58,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 88. [2021-12-28 05:52:58,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 56 states have (on average 1.75) internal successors, (98), 87 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:52:58,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 98 transitions. [2021-12-28 05:52:58,254 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 98 transitions. Word has length 5 [2021-12-28 05:52:58,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:52:58,254 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 98 transitions. [2021-12-28 05:52:58,255 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:52:58,255 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 98 transitions. [2021-12-28 05:52:58,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-28 05:52:58,255 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:52:58,259 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-28 05:52:58,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-28 05:52:58,466 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:52:58,466 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 40 more)] === [2021-12-28 05:52:58,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:52:58,467 INFO L85 PathProgramCache]: Analyzing trace with hash 28694728, now seen corresponding path program 1 times [2021-12-28 05:52:58,467 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:52:58,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1159383140] [2021-12-28 05:52:58,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:52:58,468 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:52:58,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:52:58,472 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:52:58,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-28 05:52:58,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:52:58,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-28 05:52:58,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:52:58,595 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-28 05:52:58,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:52:58,610 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:52:58,610 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:52:58,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1159383140] [2021-12-28 05:52:58,610 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1159383140] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:52:58,610 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:52:58,610 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 05:52:58,610 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281813955] [2021-12-28 05:52:58,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:52:58,611 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 05:52:58,611 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:52:58,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 05:52:58,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:52:58,611 INFO L87 Difference]: Start difference. First operand 88 states and 98 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:52:58,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:52:58,713 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2021-12-28 05:52:58,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:52:58,714 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-12-28 05:52:58,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:52:58,714 INFO L225 Difference]: With dead ends: 85 [2021-12-28 05:52:58,714 INFO L226 Difference]: Without dead ends: 85 [2021-12-28 05:52:58,715 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:52:58,715 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 71 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:52:58,716 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 47 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:52:58,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-12-28 05:52:58,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2021-12-28 05:52:58,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 56 states have (on average 1.6607142857142858) internal successors, (93), 83 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:52:58,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2021-12-28 05:52:58,719 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 5 [2021-12-28 05:52:58,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:52:58,719 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2021-12-28 05:52:58,719 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:52:58,719 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2021-12-28 05:52:58,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-28 05:52:58,720 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:52:58,720 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:52:58,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-28 05:52:58,931 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:52:58,932 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 40 more)] === [2021-12-28 05:52:58,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:52:58,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1328641136, now seen corresponding path program 1 times [2021-12-28 05:52:58,932 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:52:58,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1074175560] [2021-12-28 05:52:58,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:52:58,933 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:52:58,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:52:58,934 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:52:58,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-28 05:52:58,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:52:58,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-28 05:52:58,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:52:59,091 INFO L353 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-28 05:52:59,091 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2021-12-28 05:52:59,109 INFO L353 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-28 05:52:59,109 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2021-12-28 05:52:59,173 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-28 05:52:59,174 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2021-12-28 05:52:59,179 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-28 05:52:59,179 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2021-12-28 05:52:59,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:52:59,203 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:52:59,203 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:52:59,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1074175560] [2021-12-28 05:52:59,203 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1074175560] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:52:59,203 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:52:59,203 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 05:52:59,203 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154886333] [2021-12-28 05:52:59,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:52:59,204 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 05:52:59,204 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:52:59,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 05:52:59,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-28 05:52:59,204 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:52:59,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:52:59,353 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2021-12-28 05:52:59,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:52:59,354 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-28 05:52:59,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:52:59,354 INFO L225 Difference]: With dead ends: 90 [2021-12-28 05:52:59,354 INFO L226 Difference]: Without dead ends: 90 [2021-12-28 05:52:59,354 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-28 05:52:59,355 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 5 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:52:59,355 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 352 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 40 Unchecked, 0.1s Time] [2021-12-28 05:52:59,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2021-12-28 05:52:59,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2021-12-28 05:52:59,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 62 states have (on average 1.596774193548387) internal successors, (99), 89 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:52:59,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2021-12-28 05:52:59,359 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 10 [2021-12-28 05:52:59,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:52:59,359 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2021-12-28 05:52:59,359 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:52:59,360 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2021-12-28 05:52:59,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-28 05:52:59,360 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:52:59,360 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:52:59,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-12-28 05:52:59,566 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:52:59,566 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 40 more)] === [2021-12-28 05:52:59,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:52:59,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1762075788, now seen corresponding path program 1 times [2021-12-28 05:52:59,567 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:52:59,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2078504782] [2021-12-28 05:52:59,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:52:59,567 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:52:59,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:52:59,568 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:52:59,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-28 05:52:59,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:52:59,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-28 05:52:59,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:52:59,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:52:59,744 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-28 05:52:59,753 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-28 05:52:59,754 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-28 05:52:59,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:52:59,782 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:52:59,782 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:52:59,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2078504782] [2021-12-28 05:52:59,783 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2078504782] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:52:59,783 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:52:59,783 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 05:52:59,783 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668472636] [2021-12-28 05:52:59,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:52:59,784 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:52:59,784 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:52:59,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:52:59,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:52:59,785 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:52:59,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:52:59,973 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2021-12-28 05:52:59,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:52:59,974 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-28 05:52:59,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:52:59,974 INFO L225 Difference]: With dead ends: 106 [2021-12-28 05:52:59,974 INFO L226 Difference]: Without dead ends: 106 [2021-12-28 05:52:59,975 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2021-12-28 05:52:59,975 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 280 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:52:59,976 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [280 Valid, 53 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 05:52:59,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-12-28 05:52:59,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 86. [2021-12-28 05:52:59,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 59 states have (on average 1.6101694915254237) internal successors, (95), 85 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:52:59,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions. [2021-12-28 05:52:59,981 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 11 [2021-12-28 05:52:59,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:52:59,981 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 95 transitions. [2021-12-28 05:52:59,981 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:52:59,981 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2021-12-28 05:52:59,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-28 05:52:59,982 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:52:59,982 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:52:59,991 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2021-12-28 05:53:00,192 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:53:00,193 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 40 more)] === [2021-12-28 05:53:00,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:53:00,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1870124675, now seen corresponding path program 1 times [2021-12-28 05:53:00,193 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:53:00,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [118218738] [2021-12-28 05:53:00,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:53:00,194 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:53:00,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:53:00,195 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:53:00,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-28 05:53:00,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:53:00,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-28 05:53:00,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:53:00,350 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-28 05:53:00,379 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-12-28 05:53:00,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:53:00,386 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:53:00,386 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:53:00,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [118218738] [2021-12-28 05:53:00,386 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [118218738] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:53:00,386 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:53:00,386 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 05:53:00,386 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696163601] [2021-12-28 05:53:00,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:53:00,387 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:53:00,387 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:53:00,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:53:00,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:53:00,387 INFO L87 Difference]: Start difference. First operand 86 states and 95 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:53:00,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:53:00,605 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2021-12-28 05:53:00,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:53:00,605 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-12-28 05:53:00,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:53:00,606 INFO L225 Difference]: With dead ends: 102 [2021-12-28 05:53:00,606 INFO L226 Difference]: Without dead ends: 102 [2021-12-28 05:53:00,606 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-28 05:53:00,606 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 129 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:53:00,607 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 107 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 05:53:00,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-12-28 05:53:00,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 86. [2021-12-28 05:53:00,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 59 states have (on average 1.5932203389830508) internal successors, (94), 85 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:53:00,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2021-12-28 05:53:00,609 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 17 [2021-12-28 05:53:00,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:53:00,610 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2021-12-28 05:53:00,610 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:53:00,610 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2021-12-28 05:53:00,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-28 05:53:00,610 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:53:00,610 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:53:00,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-12-28 05:53:00,810 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:53:00,811 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 40 more)] === [2021-12-28 05:53:00,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:53:00,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1870124676, now seen corresponding path program 1 times [2021-12-28 05:53:00,811 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:53:00,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1046537320] [2021-12-28 05:53:00,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:53:00,812 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:53:00,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:53:00,813 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:53:00,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-28 05:53:00,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:53:00,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-28 05:53:00,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:53:01,000 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-28 05:53:01,005 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-28 05:53:01,050 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-12-28 05:53:01,053 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-28 05:53:01,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:53:01,067 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:53:01,067 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:53:01,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1046537320] [2021-12-28 05:53:01,068 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1046537320] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:53:01,068 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:53:01,068 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 05:53:01,068 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753906816] [2021-12-28 05:53:01,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:53:01,068 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:53:01,068 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:53:01,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:53:01,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:53:01,069 INFO L87 Difference]: Start difference. First operand 86 states and 94 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:53:01,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:53:01,286 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2021-12-28 05:53:01,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 05:53:01,287 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-12-28 05:53:01,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:53:01,287 INFO L225 Difference]: With dead ends: 97 [2021-12-28 05:53:01,287 INFO L226 Difference]: Without dead ends: 97 [2021-12-28 05:53:01,287 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-28 05:53:01,288 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 131 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:53:01,288 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 101 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 05:53:01,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-12-28 05:53:01,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 85. [2021-12-28 05:53:01,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 59 states have (on average 1.5593220338983051) internal successors, (92), 84 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:53:01,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2021-12-28 05:53:01,290 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 17 [2021-12-28 05:53:01,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:53:01,291 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2021-12-28 05:53:01,291 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:53:01,291 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2021-12-28 05:53:01,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-28 05:53:01,291 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:53:01,291 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:53:01,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-12-28 05:53:01,500 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:53:01,500 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 40 more)] === [2021-12-28 05:53:01,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:53:01,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1870110741, now seen corresponding path program 1 times [2021-12-28 05:53:01,501 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:53:01,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [110752006] [2021-12-28 05:53:01,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:53:01,501 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:53:01,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:53:01,502 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:53:01,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-28 05:53:01,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:53:01,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-28 05:53:01,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:53:01,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:53:01,636 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:53:01,636 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:53:01,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [110752006] [2021-12-28 05:53:01,636 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [110752006] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:53:01,636 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:53:01,636 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 05:53:01,636 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131712241] [2021-12-28 05:53:01,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:53:01,636 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 05:53:01,636 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:53:01,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 05:53:01,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-28 05:53:01,637 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:53:01,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:53:01,665 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2021-12-28 05:53:01,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 05:53:01,665 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-12-28 05:53:01,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:53:01,666 INFO L225 Difference]: With dead ends: 125 [2021-12-28 05:53:01,666 INFO L226 Difference]: Without dead ends: 125 [2021-12-28 05:53:01,666 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-28 05:53:01,667 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 33 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 05:53:01,667 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 206 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 05:53:01,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-12-28 05:53:01,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 102. [2021-12-28 05:53:01,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 76 states have (on average 1.513157894736842) internal successors, (115), 101 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:53:01,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 115 transitions. [2021-12-28 05:53:01,669 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 115 transitions. Word has length 17 [2021-12-28 05:53:01,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:53:01,670 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 115 transitions. [2021-12-28 05:53:01,670 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:53:01,670 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 115 transitions. [2021-12-28 05:53:01,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-28 05:53:01,670 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:53:01,670 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:53:01,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-12-28 05:53:01,877 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:53:01,877 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 40 more)] === [2021-12-28 05:53:01,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:53:01,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1431526068, now seen corresponding path program 1 times [2021-12-28 05:53:01,878 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:53:01,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [575522013] [2021-12-28 05:53:01,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:53:01,878 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:53:01,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:53:01,878 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:53:01,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-12-28 05:53:01,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:53:01,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-28 05:53:01,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:53:02,026 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-28 05:53:02,050 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-28 05:53:02,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:53:02,056 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:53:02,056 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:53:02,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [575522013] [2021-12-28 05:53:02,056 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [575522013] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:53:02,057 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:53:02,057 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 05:53:02,057 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326151260] [2021-12-28 05:53:02,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:53:02,057 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 05:53:02,057 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:53:02,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 05:53:02,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:53:02,058 INFO L87 Difference]: Start difference. First operand 102 states and 115 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:53:02,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:53:02,190 INFO L93 Difference]: Finished difference Result 113 states and 123 transitions. [2021-12-28 05:53:02,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 05:53:02,190 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-12-28 05:53:02,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:53:02,191 INFO L225 Difference]: With dead ends: 113 [2021-12-28 05:53:02,191 INFO L226 Difference]: Without dead ends: 113 [2021-12-28 05:53:02,191 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-28 05:53:02,191 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 122 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:53:02,191 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 111 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:53:02,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-12-28 05:53:02,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 101. [2021-12-28 05:53:02,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 76 states have (on average 1.486842105263158) internal successors, (113), 100 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:53:02,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 113 transitions. [2021-12-28 05:53:02,194 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 113 transitions. Word has length 20 [2021-12-28 05:53:02,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:53:02,194 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 113 transitions. [2021-12-28 05:53:02,194 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:53:02,194 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 113 transitions. [2021-12-28 05:53:02,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-28 05:53:02,195 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:53:02,195 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:53:02,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-12-28 05:53:02,401 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:53:02,401 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 40 more)] === [2021-12-28 05:53:02,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:53:02,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1427635036, now seen corresponding path program 1 times [2021-12-28 05:53:02,402 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:53:02,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1738608164] [2021-12-28 05:53:02,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:53:02,402 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:53:02,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:53:02,403 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:53:02,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-12-28 05:53:02,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:53:02,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-28 05:53:02,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:53:02,587 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-28 05:53:02,636 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-12-28 05:53:02,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:53:02,654 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:53:02,654 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:53:02,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1738608164] [2021-12-28 05:53:02,654 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1738608164] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:53:02,654 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:53:02,654 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 05:53:02,654 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977174637] [2021-12-28 05:53:02,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:53:02,655 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:53:02,655 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:53:02,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:53:02,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:53:02,656 INFO L87 Difference]: Start difference. First operand 101 states and 113 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:53:02,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:53:02,910 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2021-12-28 05:53:02,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 05:53:02,911 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-28 05:53:02,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:53:02,911 INFO L225 Difference]: With dead ends: 112 [2021-12-28 05:53:02,911 INFO L226 Difference]: Without dead ends: 112 [2021-12-28 05:53:02,912 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-12-28 05:53:02,912 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 124 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:53:02,912 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 91 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 05:53:02,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2021-12-28 05:53:02,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 100. [2021-12-28 05:53:02,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 76 states have (on average 1.4605263157894737) internal successors, (111), 99 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:53:02,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 111 transitions. [2021-12-28 05:53:02,914 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 111 transitions. Word has length 21 [2021-12-28 05:53:02,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:53:02,914 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 111 transitions. [2021-12-28 05:53:02,914 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:53:02,915 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 111 transitions. [2021-12-28 05:53:02,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-28 05:53:02,915 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:53:02,915 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:53:02,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Ended with exit code 0 [2021-12-28 05:53:03,115 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:53:03,115 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 40 more)] === [2021-12-28 05:53:03,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:53:03,116 INFO L85 PathProgramCache]: Analyzing trace with hash 717052317, now seen corresponding path program 1 times [2021-12-28 05:53:03,116 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:53:03,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [951048181] [2021-12-28 05:53:03,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:53:03,116 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:53:03,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:53:03,117 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:53:03,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-12-28 05:53:03,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:53:03,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 21 conjunts are in the unsatisfiable core [2021-12-28 05:53:03,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:53:03,260 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-28 05:53:03,292 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-28 05:53:03,318 INFO L353 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2021-12-28 05:53:03,318 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 21 [2021-12-28 05:53:03,371 INFO L353 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-28 05:53:03,371 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 22 [2021-12-28 05:53:03,429 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-28 05:53:03,430 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 14 [2021-12-28 05:53:03,449 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:53:03,449 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:53:03,536 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2021-12-28 05:53:03,678 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:53:03,678 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:53:03,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [951048181] [2021-12-28 05:53:03,678 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [951048181] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 05:53:03,678 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-28 05:53:03,678 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 13 [2021-12-28 05:53:03,678 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457223684] [2021-12-28 05:53:03,678 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-28 05:53:03,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-28 05:53:03,679 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:53:03,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-28 05:53:03,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2021-12-28 05:53:03,679 INFO L87 Difference]: Start difference. First operand 100 states and 111 transitions. Second operand has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:53:04,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:53:04,082 INFO L93 Difference]: Finished difference Result 148 states and 164 transitions. [2021-12-28 05:53:04,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-28 05:53:04,083 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-28 05:53:04,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:53:04,083 INFO L225 Difference]: With dead ends: 148 [2021-12-28 05:53:04,083 INFO L226 Difference]: Without dead ends: 148 [2021-12-28 05:53:04,084 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2021-12-28 05:53:04,084 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 165 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 111 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 05:53:04,084 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [165 Valid, 336 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 286 Invalid, 0 Unknown, 111 Unchecked, 0.3s Time] [2021-12-28 05:53:04,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2021-12-28 05:53:04,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 113. [2021-12-28 05:53:04,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 89 states have (on average 1.4269662921348314) internal successors, (127), 112 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:53:04,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 127 transitions. [2021-12-28 05:53:04,086 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 127 transitions. Word has length 21 [2021-12-28 05:53:04,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:53:04,086 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 127 transitions. [2021-12-28 05:53:04,086 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:53:04,086 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 127 transitions. [2021-12-28 05:53:04,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-28 05:53:04,087 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:53:04,087 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:53:04,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Ended with exit code 0 [2021-12-28 05:53:04,293 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:53:04,294 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 40 more)] === [2021-12-28 05:53:04,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:53:04,294 INFO L85 PathProgramCache]: Analyzing trace with hash 717052318, now seen corresponding path program 1 times [2021-12-28 05:53:04,294 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:53:04,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1948674038] [2021-12-28 05:53:04,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:53:04,294 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:53:04,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:53:04,308 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:53:04,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-12-28 05:53:04,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:53:04,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 31 conjunts are in the unsatisfiable core [2021-12-28 05:53:04,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:53:04,551 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-28 05:53:04,607 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-28 05:53:04,612 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-28 05:53:04,661 INFO L353 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2021-12-28 05:53:04,661 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 26 [2021-12-28 05:53:04,679 INFO L353 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-12-28 05:53:04,679 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2021-12-28 05:53:04,758 INFO L353 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-28 05:53:04,758 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2021-12-28 05:53:04,774 INFO L353 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-28 05:53:04,774 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2021-12-28 05:53:04,837 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-28 05:53:04,840 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-28 05:53:04,858 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:53:04,858 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:53:05,221 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 94 [2021-12-28 05:53:05,224 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 127