./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/forester-heap/sll-token-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version ff03de63 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/forester-heap/sll-token-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 10f8c5ed101296da8e76853e36294f37ed1d85898917b59e645db1ac667d60a8 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ff03de6 [2021-12-21 17:56:22,484 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 17:56:22,486 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 17:56:22,534 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 17:56:22,535 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 17:56:22,537 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 17:56:22,539 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 17:56:22,541 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 17:56:22,542 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 17:56:22,545 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 17:56:22,546 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 17:56:22,547 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 17:56:22,547 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 17:56:22,549 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 17:56:22,549 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 17:56:22,551 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 17:56:22,551 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 17:56:22,552 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 17:56:22,554 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 17:56:22,558 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 17:56:22,559 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 17:56:22,560 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 17:56:22,561 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 17:56:22,561 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 17:56:22,563 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 17:56:22,563 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 17:56:22,563 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 17:56:22,564 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 17:56:22,564 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 17:56:22,565 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 17:56:22,565 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 17:56:22,566 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 17:56:22,567 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 17:56:22,567 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 17:56:22,568 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 17:56:22,568 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 17:56:22,569 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 17:56:22,569 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 17:56:22,569 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 17:56:22,570 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 17:56:22,571 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 17:56:22,571 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2021-12-21 17:56:22,594 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 17:56:22,594 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 17:56:22,595 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 17:56:22,595 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 17:56:22,595 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-21 17:56:22,595 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-21 17:56:22,596 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 17:56:22,596 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 17:56:22,596 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 17:56:22,596 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 17:56:22,597 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-21 17:56:22,597 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-21 17:56:22,597 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 17:56:22,597 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-21 17:56:22,597 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 17:56:22,597 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-21 17:56:22,598 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-21 17:56:22,598 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-21 17:56:22,598 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-21 17:56:22,598 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-21 17:56:22,598 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 17:56:22,598 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 17:56:22,598 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 17:56:22,599 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-21 17:56:22,599 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 17:56:22,599 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 17:56:22,599 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-21 17:56:22,599 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-21 17:56:22,599 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-21 17:56:22,599 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 17:56:22,600 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-memcleanup) ) 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 -> 10f8c5ed101296da8e76853e36294f37ed1d85898917b59e645db1ac667d60a8 [2021-12-21 17:56:22,775 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 17:56:22,789 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 17:56:22,792 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 17:56:22,793 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 17:56:22,794 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 17:56:22,795 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-token-1.i [2021-12-21 17:56:22,848 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d588c00a/e76faf9bd38b4870b6d18d1e1306c009/FLAG00d92a477 [2021-12-21 17:56:23,185 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 17:56:23,186 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-token-1.i [2021-12-21 17:56:23,205 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d588c00a/e76faf9bd38b4870b6d18d1e1306c009/FLAG00d92a477 [2021-12-21 17:56:23,574 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d588c00a/e76faf9bd38b4870b6d18d1e1306c009 [2021-12-21 17:56:23,576 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 17:56:23,577 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 17:56:23,579 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 17:56:23,579 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 17:56:23,585 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 17:56:23,585 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 05:56:23" (1/1) ... [2021-12-21 17:56:23,587 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cd15e93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:56:23, skipping insertion in model container [2021-12-21 17:56:23,587 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 05:56:23" (1/1) ... [2021-12-21 17:56:23,591 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 17:56:23,615 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 17:56:23,797 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-token-1.i[22162,22175] [2021-12-21 17:56:23,806 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-token-1.i[22311,22324] [2021-12-21 17:56:23,807 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-token-1.i[22402,22415] [2021-12-21 17:56:23,808 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-token-1.i[22484,22497] [2021-12-21 17:56:23,810 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-token-1.i[22562,22575] [2021-12-21 17:56:23,815 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-token-1.i[22708,22721] [2021-12-21 17:56:23,822 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 17:56:23,828 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 17:56:23,868 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-token-1.i[22162,22175] [2021-12-21 17:56:23,874 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-token-1.i[22311,22324] [2021-12-21 17:56:23,874 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-token-1.i[22402,22415] [2021-12-21 17:56:23,875 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-token-1.i[22484,22497] [2021-12-21 17:56:23,876 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-token-1.i[22562,22575] [2021-12-21 17:56:23,877 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-token-1.i[22708,22721] [2021-12-21 17:56:23,878 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 17:56:23,898 INFO L208 MainTranslator]: Completed translation [2021-12-21 17:56:23,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:56:23 WrapperNode [2021-12-21 17:56:23,898 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 17:56:23,899 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 17:56:23,899 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 17:56:23,899 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 17:56:23,904 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:56:23" (1/1) ... [2021-12-21 17:56:23,913 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:56:23" (1/1) ... [2021-12-21 17:56:23,927 INFO L137 Inliner]: procedures = 119, calls = 31, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 132 [2021-12-21 17:56:23,928 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 17:56:23,928 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 17:56:23,928 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 17:56:23,928 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 17:56:23,934 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:56:23" (1/1) ... [2021-12-21 17:56:23,934 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:56:23" (1/1) ... [2021-12-21 17:56:23,936 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:56:23" (1/1) ... [2021-12-21 17:56:23,936 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:56:23" (1/1) ... [2021-12-21 17:56:23,942 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:56:23" (1/1) ... [2021-12-21 17:56:23,952 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:56:23" (1/1) ... [2021-12-21 17:56:23,953 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:56:23" (1/1) ... [2021-12-21 17:56:23,954 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 17:56:23,955 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 17:56:23,955 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 17:56:23,955 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 17:56:23,960 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:56:23" (1/1) ... [2021-12-21 17:56:23,965 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 17:56:23,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 17:56:23,980 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-21 17:56:23,982 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-21 17:56:24,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-21 17:56:24,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-21 17:56:24,004 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-21 17:56:24,004 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-21 17:56:24,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-21 17:56:24,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-21 17:56:24,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-21 17:56:24,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-21 17:56:24,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 17:56:24,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 17:56:24,080 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 17:56:24,081 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 17:56:24,328 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 17:56:24,333 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 17:56:24,334 INFO L299 CfgBuilder]: Removed 15 assume(true) statements. [2021-12-21 17:56:24,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 05:56:24 BoogieIcfgContainer [2021-12-21 17:56:24,335 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 17:56:24,337 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-21 17:56:24,337 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-21 17:56:24,339 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-21 17:56:24,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 05:56:23" (1/3) ... [2021-12-21 17:56:24,340 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a1401ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 05:56:24, skipping insertion in model container [2021-12-21 17:56:24,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:56:23" (2/3) ... [2021-12-21 17:56:24,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a1401ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 05:56:24, skipping insertion in model container [2021-12-21 17:56:24,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 05:56:24" (3/3) ... [2021-12-21 17:56:24,342 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-token-1.i [2021-12-21 17:56:24,346 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-21 17:56:24,346 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 54 error locations. [2021-12-21 17:56:24,376 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-21 17:56:24,380 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-21 17:56:24,380 INFO L340 AbstractCegarLoop]: Starting to check reachability of 54 error locations. [2021-12-21 17:56:24,393 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 64 states have (on average 2.21875) internal successors, (142), 118 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 17:56:24,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-21 17:56:24,403 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:56:24,403 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-21 17:56:24,404 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-21 17:56:24,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:56:24,412 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-21 17:56:24,418 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:56:24,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584213881] [2021-12-21 17:56:24,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:56:24,419 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:56:24,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:56:24,526 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-21 17:56:24,527 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:56:24,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584213881] [2021-12-21 17:56:24,528 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584213881] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 17:56:24,528 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 17:56:24,528 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 17:56:24,529 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855955494] [2021-12-21 17:56:24,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 17:56:24,532 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 17:56:24,532 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:56:24,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 17:56:24,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 17:56:24,553 INFO L87 Difference]: Start difference. First operand has 119 states, 64 states have (on average 2.21875) internal successors, (142), 118 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 17:56:24,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:56:24,667 INFO L93 Difference]: Finished difference Result 137 states and 140 transitions. [2021-12-21 17:56:24,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 17:56:24,669 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2021-12-21 17:56:24,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:56:24,691 INFO L225 Difference]: With dead ends: 137 [2021-12-21 17:56:24,692 INFO L226 Difference]: Without dead ends: 135 [2021-12-21 17:56:24,693 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-21 17:56:24,697 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 94 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 17:56:24,698 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 97 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 17:56:24,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-12-21 17:56:24,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 115. [2021-12-21 17:56:24,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 63 states have (on average 1.8571428571428572) internal successors, (117), 114 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 17:56:24,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 117 transitions. [2021-12-21 17:56:24,734 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 117 transitions. Word has length 3 [2021-12-21 17:56:24,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:56:24,734 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 117 transitions. [2021-12-21 17:56:24,734 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 17:56:24,735 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 117 transitions. [2021-12-21 17:56:24,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-21 17:56:24,736 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:56:24,736 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-21 17:56:24,736 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-21 17:56:24,736 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-21 17:56:24,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:56:24,739 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-21 17:56:24,740 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:56:24,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594928738] [2021-12-21 17:56:24,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:56:24,740 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:56:24,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:56:24,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 17:56:24,792 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:56:24,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594928738] [2021-12-21 17:56:24,793 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594928738] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 17:56:24,793 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 17:56:24,793 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 17:56:24,794 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422114060] [2021-12-21 17:56:24,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 17:56:24,795 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 17:56:24,796 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:56:24,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 17:56:24,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 17:56:24,797 INFO L87 Difference]: Start difference. First operand 115 states and 117 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 17:56:24,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:56:24,859 INFO L93 Difference]: Finished difference Result 141 states and 143 transitions. [2021-12-21 17:56:24,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 17:56:24,860 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2021-12-21 17:56:24,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:56:24,861 INFO L225 Difference]: With dead ends: 141 [2021-12-21 17:56:24,861 INFO L226 Difference]: Without dead ends: 141 [2021-12-21 17:56:24,861 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-21 17:56:24,862 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 100 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 17:56:24,862 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 99 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 17:56:24,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-12-21 17:56:24,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 113. [2021-12-21 17:56:24,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 63 states have (on average 1.8253968253968254) internal successors, (115), 112 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-21 17:56:24,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 115 transitions. [2021-12-21 17:56:24,869 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 115 transitions. Word has length 3 [2021-12-21 17:56:24,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:56:24,869 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 115 transitions. [2021-12-21 17:56:24,869 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 17:56:24,869 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 115 transitions. [2021-12-21 17:56:24,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-21 17:56:24,870 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:56:24,870 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 17:56:24,870 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-21 17:56:24,870 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-21 17:56:24,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:56:24,871 INFO L85 PathProgramCache]: Analyzing trace with hash 59263631, now seen corresponding path program 1 times [2021-12-21 17:56:24,871 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:56:24,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084702631] [2021-12-21 17:56:24,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:56:24,872 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:56:24,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:56:24,909 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-21 17:56:24,909 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:56:24,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084702631] [2021-12-21 17:56:24,909 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084702631] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 17:56:24,909 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 17:56:24,910 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 17:56:24,910 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247598027] [2021-12-21 17:56:24,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 17:56:24,910 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 17:56:24,910 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:56:24,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 17:56:24,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 17:56:24,911 INFO L87 Difference]: Start difference. First operand 113 states and 115 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 17:56:25,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:56:25,008 INFO L93 Difference]: Finished difference Result 119 states and 122 transitions. [2021-12-21 17:56:25,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 17:56:25,008 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-12-21 17:56:25,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:56:25,009 INFO L225 Difference]: With dead ends: 119 [2021-12-21 17:56:25,009 INFO L226 Difference]: Without dead ends: 119 [2021-12-21 17:56:25,010 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-21 17:56:25,011 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 165 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 17:56:25,011 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [165 Valid, 68 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 17:56:25,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-12-21 17:56:25,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 102. [2021-12-21 17:56:25,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 65 states have (on average 1.6307692307692307) internal successors, (106), 101 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 17:56:25,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 106 transitions. [2021-12-21 17:56:25,027 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 106 transitions. Word has length 8 [2021-12-21 17:56:25,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:56:25,027 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 106 transitions. [2021-12-21 17:56:25,027 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 17:56:25,028 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 106 transitions. [2021-12-21 17:56:25,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-21 17:56:25,028 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:56:25,028 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 17:56:25,029 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-21 17:56:25,029 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-21 17:56:25,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:56:25,030 INFO L85 PathProgramCache]: Analyzing trace with hash 59263632, now seen corresponding path program 1 times [2021-12-21 17:56:25,030 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:56:25,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016690236] [2021-12-21 17:56:25,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:56:25,030 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:56:25,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:56:25,105 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-21 17:56:25,105 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:56:25,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016690236] [2021-12-21 17:56:25,105 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016690236] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 17:56:25,106 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 17:56:25,106 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 17:56:25,106 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107814337] [2021-12-21 17:56:25,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 17:56:25,106 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 17:56:25,107 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:56:25,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 17:56:25,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 17:56:25,107 INFO L87 Difference]: Start difference. First operand 102 states and 106 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 17:56:25,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:56:25,242 INFO L93 Difference]: Finished difference Result 184 states and 188 transitions. [2021-12-21 17:56:25,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 17:56:25,243 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-12-21 17:56:25,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:56:25,244 INFO L225 Difference]: With dead ends: 184 [2021-12-21 17:56:25,244 INFO L226 Difference]: Without dead ends: 184 [2021-12-21 17:56:25,244 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-21 17:56:25,245 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 193 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 17:56:25,245 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 104 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 17:56:25,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2021-12-21 17:56:25,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 133. [2021-12-21 17:56:25,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 96 states have (on average 1.5) internal successors, (144), 132 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 17:56:25,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 144 transitions. [2021-12-21 17:56:25,258 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 144 transitions. Word has length 8 [2021-12-21 17:56:25,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:56:25,258 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 144 transitions. [2021-12-21 17:56:25,259 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 17:56:25,259 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 144 transitions. [2021-12-21 17:56:25,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-21 17:56:25,259 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:56:25,259 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 17:56:25,259 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-21 17:56:25,259 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-21 17:56:25,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:56:25,260 INFO L85 PathProgramCache]: Analyzing trace with hash 467003055, now seen corresponding path program 1 times [2021-12-21 17:56:25,260 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:56:25,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202539180] [2021-12-21 17:56:25,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:56:25,261 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:56:25,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:56:25,322 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-21 17:56:25,322 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:56:25,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202539180] [2021-12-21 17:56:25,322 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202539180] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 17:56:25,323 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 17:56:25,323 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 17:56:25,323 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425069672] [2021-12-21 17:56:25,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 17:56:25,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 17:56:25,323 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:56:25,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 17:56:25,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 17:56:25,324 INFO L87 Difference]: Start difference. First operand 133 states and 144 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 17:56:25,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:56:25,458 INFO L93 Difference]: Finished difference Result 132 states and 143 transitions. [2021-12-21 17:56:25,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-21 17:56:25,459 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2021-12-21 17:56:25,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:56:25,460 INFO L225 Difference]: With dead ends: 132 [2021-12-21 17:56:25,462 INFO L226 Difference]: Without dead ends: 132 [2021-12-21 17:56:25,463 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-12-21 17:56:25,464 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 64 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 17:56:25,464 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 221 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 17:56:25,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2021-12-21 17:56:25,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2021-12-21 17:56:25,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 96 states have (on average 1.4895833333333333) internal successors, (143), 131 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 17:56:25,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 143 transitions. [2021-12-21 17:56:25,476 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 143 transitions. Word has length 12 [2021-12-21 17:56:25,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:56:25,480 INFO L470 AbstractCegarLoop]: Abstraction has 132 states and 143 transitions. [2021-12-21 17:56:25,480 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 17:56:25,480 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 143 transitions. [2021-12-21 17:56:25,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-21 17:56:25,480 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:56:25,480 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 17:56:25,481 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-21 17:56:25,481 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-21 17:56:25,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:56:25,481 INFO L85 PathProgramCache]: Analyzing trace with hash 467003056, now seen corresponding path program 1 times [2021-12-21 17:56:25,482 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:56:25,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666458194] [2021-12-21 17:56:25,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:56:25,482 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:56:25,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:56:25,554 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-21 17:56:25,555 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:56:25,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666458194] [2021-12-21 17:56:25,556 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666458194] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 17:56:25,556 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 17:56:25,556 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 17:56:25,556 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255428413] [2021-12-21 17:56:25,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 17:56:25,557 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 17:56:25,557 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:56:25,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 17:56:25,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 17:56:25,557 INFO L87 Difference]: Start difference. First operand 132 states and 143 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 17:56:25,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:56:25,720 INFO L93 Difference]: Finished difference Result 131 states and 142 transitions. [2021-12-21 17:56:25,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-21 17:56:25,721 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2021-12-21 17:56:25,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:56:25,721 INFO L225 Difference]: With dead ends: 131 [2021-12-21 17:56:25,721 INFO L226 Difference]: Without dead ends: 131 [2021-12-21 17:56:25,722 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-12-21 17:56:25,727 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 19 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 17:56:25,727 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 302 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 17:56:25,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-12-21 17:56:25,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 116. [2021-12-21 17:56:25,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 86 states have (on average 1.4651162790697674) internal successors, (126), 115 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 17:56:25,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 126 transitions. [2021-12-21 17:56:25,732 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 126 transitions. Word has length 12 [2021-12-21 17:56:25,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:56:25,732 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 126 transitions. [2021-12-21 17:56:25,732 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 17:56:25,733 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 126 transitions. [2021-12-21 17:56:25,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-21 17:56:25,733 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:56:25,733 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 17:56:25,733 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-21 17:56:25,734 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-21 17:56:25,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:56:25,734 INFO L85 PathProgramCache]: Analyzing trace with hash 763856048, now seen corresponding path program 1 times [2021-12-21 17:56:25,734 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:56:25,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599465839] [2021-12-21 17:56:25,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:56:25,734 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:56:25,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:56:25,779 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-21 17:56:25,779 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:56:25,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599465839] [2021-12-21 17:56:25,779 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599465839] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 17:56:25,779 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 17:56:25,779 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 17:56:25,780 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966684387] [2021-12-21 17:56:25,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 17:56:25,780 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 17:56:25,781 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:56:25,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 17:56:25,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-21 17:56:25,782 INFO L87 Difference]: Start difference. First operand 116 states and 126 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 17:56:25,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:56:25,854 INFO L93 Difference]: Finished difference Result 115 states and 125 transitions. [2021-12-21 17:56:25,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 17:56:25,854 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-12-21 17:56:25,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:56:25,855 INFO L225 Difference]: With dead ends: 115 [2021-12-21 17:56:25,855 INFO L226 Difference]: Without dead ends: 115 [2021-12-21 17:56:25,855 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-21 17:56:25,855 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 4 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 17:56:25,856 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 244 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 17:56:25,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-12-21 17:56:25,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2021-12-21 17:56:25,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 86 states have (on average 1.4534883720930232) internal successors, (125), 114 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 17:56:25,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 125 transitions. [2021-12-21 17:56:25,858 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 125 transitions. Word has length 13 [2021-12-21 17:56:25,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:56:25,858 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 125 transitions. [2021-12-21 17:56:25,858 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 17:56:25,858 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 125 transitions. [2021-12-21 17:56:25,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-21 17:56:25,859 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:56:25,859 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 17:56:25,859 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-21 17:56:25,859 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-21 17:56:25,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:56:25,860 INFO L85 PathProgramCache]: Analyzing trace with hash 763856049, now seen corresponding path program 1 times [2021-12-21 17:56:25,860 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:56:25,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875781449] [2021-12-21 17:56:25,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:56:25,860 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:56:25,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:56:25,923 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-21 17:56:25,923 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:56:25,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875781449] [2021-12-21 17:56:25,924 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875781449] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 17:56:25,924 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 17:56:25,924 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 17:56:25,924 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012214158] [2021-12-21 17:56:25,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 17:56:25,924 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 17:56:25,925 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:56:25,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 17:56:25,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-21 17:56:25,926 INFO L87 Difference]: Start difference. First operand 115 states and 125 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 17:56:25,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:56:25,999 INFO L93 Difference]: Finished difference Result 114 states and 124 transitions. [2021-12-21 17:56:25,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 17:56:25,999 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-12-21 17:56:25,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:56:26,000 INFO L225 Difference]: With dead ends: 114 [2021-12-21 17:56:26,000 INFO L226 Difference]: Without dead ends: 114 [2021-12-21 17:56:26,000 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-21 17:56:26,001 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 2 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 17:56:26,001 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 246 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 17:56:26,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-12-21 17:56:26,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2021-12-21 17:56:26,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 86 states have (on average 1.441860465116279) internal successors, (124), 113 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 17:56:26,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 124 transitions. [2021-12-21 17:56:26,003 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 124 transitions. Word has length 13 [2021-12-21 17:56:26,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:56:26,003 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 124 transitions. [2021-12-21 17:56:26,004 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 17:56:26,004 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 124 transitions. [2021-12-21 17:56:26,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-21 17:56:26,004 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:56:26,004 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 17:56:26,004 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-21 17:56:26,004 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-21 17:56:26,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:56:26,005 INFO L85 PathProgramCache]: Analyzing trace with hash 2113337263, now seen corresponding path program 1 times [2021-12-21 17:56:26,005 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:56:26,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445886621] [2021-12-21 17:56:26,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:56:26,005 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:56:26,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:56:26,038 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-21 17:56:26,038 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:56:26,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445886621] [2021-12-21 17:56:26,039 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445886621] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 17:56:26,039 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 17:56:26,039 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 17:56:26,039 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433262036] [2021-12-21 17:56:26,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 17:56:26,039 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 17:56:26,039 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:56:26,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 17:56:26,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 17:56:26,040 INFO L87 Difference]: Start difference. First operand 114 states and 124 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 17:56:26,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:56:26,136 INFO L93 Difference]: Finished difference Result 125 states and 136 transitions. [2021-12-21 17:56:26,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-21 17:56:26,137 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-12-21 17:56:26,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:56:26,137 INFO L225 Difference]: With dead ends: 125 [2021-12-21 17:56:26,137 INFO L226 Difference]: Without dead ends: 125 [2021-12-21 17:56:26,137 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-12-21 17:56:26,138 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 16 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 17:56:26,138 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 366 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 17:56:26,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-12-21 17:56:26,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 112. [2021-12-21 17:56:26,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 85 states have (on average 1.4352941176470588) internal successors, (122), 111 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 17:56:26,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 122 transitions. [2021-12-21 17:56:26,140 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 122 transitions. Word has length 14 [2021-12-21 17:56:26,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:56:26,141 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 122 transitions. [2021-12-21 17:56:26,141 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 17:56:26,141 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 122 transitions. [2021-12-21 17:56:26,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-21 17:56:26,141 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:56:26,141 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 17:56:26,141 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-21 17:56:26,142 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-21 17:56:26,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:56:26,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1298827700, now seen corresponding path program 1 times [2021-12-21 17:56:26,142 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:56:26,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813844705] [2021-12-21 17:56:26,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:56:26,142 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:56:26,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:56:26,174 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-21 17:56:26,174 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:56:26,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813844705] [2021-12-21 17:56:26,174 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813844705] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 17:56:26,174 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 17:56:26,174 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 17:56:26,175 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721544853] [2021-12-21 17:56:26,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 17:56:26,175 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 17:56:26,175 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:56:26,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 17:56:26,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 17:56:26,176 INFO L87 Difference]: Start difference. First operand 112 states and 122 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 17:56:26,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:56:26,231 INFO L93 Difference]: Finished difference Result 168 states and 173 transitions. [2021-12-21 17:56:26,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 17:56:26,232 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-21 17:56:26,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:56:26,232 INFO L225 Difference]: With dead ends: 168 [2021-12-21 17:56:26,232 INFO L226 Difference]: Without dead ends: 168 [2021-12-21 17:56:26,233 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-21 17:56:26,233 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 165 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 17:56:26,234 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [165 Valid, 131 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 17:56:26,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2021-12-21 17:56:26,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 110. [2021-12-21 17:56:26,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 84 states have (on average 1.4285714285714286) internal successors, (120), 109 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 17:56:26,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2021-12-21 17:56:26,236 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 16 [2021-12-21 17:56:26,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:56:26,236 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2021-12-21 17:56:26,236 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 17:56:26,237 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2021-12-21 17:56:26,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-21 17:56:26,237 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:56:26,237 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-21 17:56:26,237 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-21 17:56:26,238 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-21 17:56:26,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:56:26,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1685750883, now seen corresponding path program 1 times [2021-12-21 17:56:26,238 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:56:26,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065598279] [2021-12-21 17:56:26,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:56:26,238 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:56:26,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 17:56:26,263 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 17:56:26,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 17:56:26,308 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 17:56:26,308 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-21 17:56:26,309 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK (53 of 54 remaining) [2021-12-21 17:56:26,310 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (52 of 54 remaining) [2021-12-21 17:56:26,311 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (51 of 54 remaining) [2021-12-21 17:56:26,312 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (50 of 54 remaining) [2021-12-21 17:56:26,313 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (49 of 54 remaining) [2021-12-21 17:56:26,313 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (48 of 54 remaining) [2021-12-21 17:56:26,313 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (47 of 54 remaining) [2021-12-21 17:56:26,313 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (46 of 54 remaining) [2021-12-21 17:56:26,314 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION (45 of 54 remaining) [2021-12-21 17:56:26,314 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION (44 of 54 remaining) [2021-12-21 17:56:26,314 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION (43 of 54 remaining) [2021-12-21 17:56:26,314 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK (42 of 54 remaining) [2021-12-21 17:56:26,314 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION (41 of 54 remaining) [2021-12-21 17:56:26,314 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION (40 of 54 remaining) [2021-12-21 17:56:26,314 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION (39 of 54 remaining) [2021-12-21 17:56:26,314 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION (38 of 54 remaining) [2021-12-21 17:56:26,315 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION (37 of 54 remaining) [2021-12-21 17:56:26,315 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION (36 of 54 remaining) [2021-12-21 17:56:26,315 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION (35 of 54 remaining) [2021-12-21 17:56:26,315 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION (34 of 54 remaining) [2021-12-21 17:56:26,315 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK (33 of 54 remaining) [2021-12-21 17:56:26,315 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION (32 of 54 remaining) [2021-12-21 17:56:26,315 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATION (31 of 54 remaining) [2021-12-21 17:56:26,316 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATION (30 of 54 remaining) [2021-12-21 17:56:26,316 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATION (29 of 54 remaining) [2021-12-21 17:56:26,316 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (28 of 54 remaining) [2021-12-21 17:56:26,316 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATION (27 of 54 remaining) [2021-12-21 17:56:26,316 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATION (26 of 54 remaining) [2021-12-21 17:56:26,316 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATION (25 of 54 remaining) [2021-12-21 17:56:26,316 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATION (24 of 54 remaining) [2021-12-21 17:56:26,316 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATION (23 of 54 remaining) [2021-12-21 17:56:26,317 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATION (22 of 54 remaining) [2021-12-21 17:56:26,317 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATION (21 of 54 remaining) [2021-12-21 17:56:26,317 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATION (20 of 54 remaining) [2021-12-21 17:56:26,317 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (19 of 54 remaining) [2021-12-21 17:56:26,317 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATION (18 of 54 remaining) [2021-12-21 17:56:26,317 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATION (17 of 54 remaining) [2021-12-21 17:56:26,317 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATION (16 of 54 remaining) [2021-12-21 17:56:26,317 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATION (15 of 54 remaining) [2021-12-21 17:56:26,318 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE (14 of 54 remaining) [2021-12-21 17:56:26,318 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE (13 of 54 remaining) [2021-12-21 17:56:26,318 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE (12 of 54 remaining) [2021-12-21 17:56:26,318 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATION (11 of 54 remaining) [2021-12-21 17:56:26,318 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATION (10 of 54 remaining) [2021-12-21 17:56:26,318 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK (9 of 54 remaining) [2021-12-21 17:56:26,318 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATION (8 of 54 remaining) [2021-12-21 17:56:26,318 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATION (7 of 54 remaining) [2021-12-21 17:56:26,319 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE (6 of 54 remaining) [2021-12-21 17:56:26,319 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE (5 of 54 remaining) [2021-12-21 17:56:26,319 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE (4 of 54 remaining) [2021-12-21 17:56:26,319 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE (3 of 54 remaining) [2021-12-21 17:56:26,319 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE (2 of 54 remaining) [2021-12-21 17:56:26,319 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE (1 of 54 remaining) [2021-12-21 17:56:26,319 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK (0 of 54 remaining) [2021-12-21 17:56:26,320 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-21 17:56:26,322 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 17:56:26,327 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-21 17:56:26,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 05:56:26 BoogieIcfgContainer [2021-12-21 17:56:26,349 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-21 17:56:26,349 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-21 17:56:26,349 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-21 17:56:26,349 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-21 17:56:26,350 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 05:56:24" (3/4) ... [2021-12-21 17:56:26,365 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-21 17:56:26,386 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-21 17:56:26,386 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-21 17:56:26,387 INFO L158 Benchmark]: Toolchain (without parser) took 2809.32ms. Allocated memory was 92.3MB in the beginning and 136.3MB in the end (delta: 44.0MB). Free memory was 63.2MB in the beginning and 111.3MB in the end (delta: -48.1MB). Peak memory consumption was 49.1MB. Max. memory is 16.1GB. [2021-12-21 17:56:26,387 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 92.3MB. Free memory is still 49.2MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 17:56:26,387 INFO L158 Benchmark]: CACSL2BoogieTranslator took 319.52ms. Allocated memory was 92.3MB in the beginning and 113.2MB in the end (delta: 21.0MB). Free memory was 62.9MB in the beginning and 83.5MB in the end (delta: -20.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-21 17:56:26,387 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.81ms. Allocated memory is still 113.2MB. Free memory was 83.5MB in the beginning and 81.4MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 17:56:26,388 INFO L158 Benchmark]: Boogie Preprocessor took 26.27ms. Allocated memory is still 113.2MB. Free memory was 81.4MB in the beginning and 79.3MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-21 17:56:26,388 INFO L158 Benchmark]: RCFGBuilder took 380.53ms. Allocated memory is still 113.2MB. Free memory was 79.3MB in the beginning and 61.8MB in the end (delta: 17.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2021-12-21 17:56:26,388 INFO L158 Benchmark]: TraceAbstraction took 2012.04ms. Allocated memory is still 113.2MB. Free memory was 61.1MB in the beginning and 37.0MB in the end (delta: 24.1MB). Peak memory consumption was 25.4MB. Max. memory is 16.1GB. [2021-12-21 17:56:26,388 INFO L158 Benchmark]: Witness Printer took 37.13ms. Allocated memory was 113.2MB in the beginning and 136.3MB in the end (delta: 23.1MB). Free memory was 37.0MB in the beginning and 111.3MB in the end (delta: -74.2MB). Peak memory consumption was 3.4MB. Max. memory is 16.1GB. [2021-12-21 17:56:26,389 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.32ms. Allocated memory is still 92.3MB. Free memory is still 49.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 319.52ms. Allocated memory was 92.3MB in the beginning and 113.2MB in the end (delta: 21.0MB). Free memory was 62.9MB in the beginning and 83.5MB in the end (delta: -20.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.81ms. Allocated memory is still 113.2MB. Free memory was 83.5MB in the beginning and 81.4MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.27ms. Allocated memory is still 113.2MB. Free memory was 81.4MB in the beginning and 79.3MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 380.53ms. Allocated memory is still 113.2MB. Free memory was 79.3MB in the beginning and 61.8MB in the end (delta: 17.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 2012.04ms. Allocated memory is still 113.2MB. Free memory was 61.1MB in the beginning and 37.0MB in the end (delta: 24.1MB). Peak memory consumption was 25.4MB. Max. memory is 16.1GB. * Witness Printer took 37.13ms. Allocated memory was 113.2MB in the beginning and 136.3MB in the end (delta: 23.1MB). Free memory was 37.0MB in the beginning and 111.3MB in the end (delta: -74.2MB). Peak memory consumption was 3.4MB. 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 - CounterExampleResult [Line: 1031]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1003] SLL* head = malloc(sizeof(SLL)); [L1004] head->next = ((void*)0) VAL [head={-1:0}] [L1005] head->data = 0 VAL [head={-1:0}] [L1007] SLL* x = head; VAL [head={-1:0}, x={-1:0}] [L1010] COND FALSE !(__VERIFIER_nondet_int()) [L1018] x->data = 1 VAL [head={-1:0}, x={-1:0}] [L1019] x->next = malloc(sizeof(SLL)) VAL [head={-1:0}, malloc(sizeof(SLL))={-2:0}, x={-1:0}] [L1020] EXPR x->next VAL [head={-1:0}, x={-1:0}, x->next={-2:0}] [L1020] x->next->data = 2 VAL [head={-1:0}, x={-1:0}, x->next={-2:0}] [L1022] x = head VAL [head={-1:0}, x={-1:0}] [L1024] COND FALSE !(!(((void*)0) != x)) VAL [head={-1:0}, x={-1:0}] [L1026] EXPR x->data VAL [head={-1:0}, x={-1:0}, x->data=1] [L1026] COND FALSE !(1 != x->data) [L1031] EXPR x->data VAL [head={-1:0}, x={-1:0}, x->data=1] [L1031] COND TRUE !(2 == x->data) [L1031] reach_error() VAL [head={-1:0}, x={-1:0}] - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1005]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1005]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1014]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1014]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1015]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1015]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1020]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1020]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1020]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1020]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1024]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1026]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1026]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1028]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1028]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1028]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1029]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1029]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1031]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1031]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1033]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1033]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1033]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1037]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1037]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1040]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1040]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1043]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1043]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1043]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 119 locations, 54 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 822 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 822 mSDsluCounter, 1878 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1127 mSDsCounter, 89 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1231 IncrementalHoareTripleChecker+Invalid, 1320 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 89 mSolverCounterUnsat, 751 mSDtfsCounter, 1231 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=133occurred in iteration=4, InterpolantAutomatonStates: 64, 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, 10 MinimizatonAttempts, 202 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 123 NumberOfCodeBlocks, 123 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 92 ConstructedInterpolants, 0 QuantifiedInterpolants, 397 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 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 proved your program to be incorrect! [2021-12-21 17:56:26,421 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 Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup)