./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 503e46fe74670dc8b1fd2e8b2c5a408fc01c83cb421ff9aefb8796417315d291 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-16 05:59:42,496 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-16 05:59:42,498 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-16 05:59:42,561 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-16 05:59:42,562 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-16 05:59:42,565 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-16 05:59:42,566 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-16 05:59:42,571 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-16 05:59:42,573 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-16 05:59:42,577 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-16 05:59:42,578 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-16 05:59:42,579 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-16 05:59:42,580 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-16 05:59:42,582 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-16 05:59:42,584 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-16 05:59:42,587 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-16 05:59:42,588 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-16 05:59:42,589 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-16 05:59:42,591 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-16 05:59:42,596 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-16 05:59:42,597 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-16 05:59:42,598 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-16 05:59:42,600 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-16 05:59:42,601 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-16 05:59:42,608 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-16 05:59:42,608 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-16 05:59:42,608 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-16 05:59:42,609 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-16 05:59:42,610 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-16 05:59:42,611 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-16 05:59:42,611 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-16 05:59:42,612 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-16 05:59:42,613 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-16 05:59:42,614 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-16 05:59:42,615 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-16 05:59:42,616 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-16 05:59:42,616 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-16 05:59:42,616 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-16 05:59:42,616 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-16 05:59:42,617 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-16 05:59:42,618 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-16 05:59:42,620 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-16 05:59:42,655 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-16 05:59:42,656 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-16 05:59:42,656 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-16 05:59:42,656 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-16 05:59:42,657 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-16 05:59:42,657 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-16 05:59:42,658 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-16 05:59:42,658 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-16 05:59:42,658 INFO L138 SettingsManager]: * Use SBE=true [2021-12-16 05:59:42,659 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-16 05:59:42,659 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-16 05:59:42,660 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-16 05:59:42,660 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-16 05:59:42,660 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-16 05:59:42,660 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-16 05:59:42,660 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-16 05:59:42,660 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-16 05:59:42,661 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-16 05:59:42,661 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-16 05:59:42,661 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-16 05:59:42,661 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-16 05:59:42,661 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-16 05:59:42,662 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-16 05:59:42,662 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-16 05:59:42,662 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-16 05:59:42,662 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 05:59:42,662 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-16 05:59:42,663 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-16 05:59:42,663 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-16 05:59:42,663 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-16 05:59:42,663 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-16 05:59:42,663 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 503e46fe74670dc8b1fd2e8b2c5a408fc01c83cb421ff9aefb8796417315d291 [2021-12-16 05:59:42,905 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 05:59:42,933 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 05:59:42,935 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 05:59:42,937 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 05:59:42,937 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 05:59:42,939 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i [2021-12-16 05:59:43,015 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0f1c5a9b/6a1d1871e5494a1491e1092a382e754a/FLAGe28519777 [2021-12-16 05:59:43,516 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 05:59:43,516 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i [2021-12-16 05:59:43,532 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0f1c5a9b/6a1d1871e5494a1491e1092a382e754a/FLAGe28519777 [2021-12-16 05:59:44,015 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0f1c5a9b/6a1d1871e5494a1491e1092a382e754a [2021-12-16 05:59:44,018 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 05:59:44,020 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 05:59:44,023 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 05:59:44,024 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 05:59:44,027 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 05:59:44,027 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 05:59:44" (1/1) ... [2021-12-16 05:59:44,028 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50de11e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:59:44, skipping insertion in model container [2021-12-16 05:59:44,029 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 05:59:44" (1/1) ... [2021-12-16 05:59:44,034 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 05:59:44,081 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 05:59:44,370 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/dll-rb-sentinel-1.i[22665,22678] [2021-12-16 05:59:44,376 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/dll-rb-sentinel-1.i[22735,22748] [2021-12-16 05:59:44,378 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/dll-rb-sentinel-1.i[22799,22812] [2021-12-16 05:59:44,379 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/dll-rb-sentinel-1.i[22894,22907] [2021-12-16 05:59:44,381 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/dll-rb-sentinel-1.i[22966,22979] [2021-12-16 05:59:44,383 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/dll-rb-sentinel-1.i[23105,23118] [2021-12-16 05:59:44,384 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/dll-rb-sentinel-1.i[23179,23192] [2021-12-16 05:59:44,393 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 05:59:44,408 INFO L203 MainTranslator]: Completed pre-run [2021-12-16 05:59:44,456 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/dll-rb-sentinel-1.i[22665,22678] [2021-12-16 05:59:44,460 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/dll-rb-sentinel-1.i[22735,22748] [2021-12-16 05:59:44,461 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/dll-rb-sentinel-1.i[22799,22812] [2021-12-16 05:59:44,462 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/dll-rb-sentinel-1.i[22894,22907] [2021-12-16 05:59:44,462 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/dll-rb-sentinel-1.i[22966,22979] [2021-12-16 05:59:44,464 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/dll-rb-sentinel-1.i[23105,23118] [2021-12-16 05:59:44,464 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/dll-rb-sentinel-1.i[23179,23192] [2021-12-16 05:59:44,467 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 05:59:44,489 INFO L208 MainTranslator]: Completed translation [2021-12-16 05:59:44,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:59:44 WrapperNode [2021-12-16 05:59:44,490 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 05:59:44,491 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-16 05:59:44,491 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-16 05:59:44,491 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-16 05:59:44,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:59:44" (1/1) ... [2021-12-16 05:59:44,523 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:59:44" (1/1) ... [2021-12-16 05:59:44,556 INFO L137 Inliner]: procedures = 119, calls = 43, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 165 [2021-12-16 05:59:44,557 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-16 05:59:44,558 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-16 05:59:44,558 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-16 05:59:44,558 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-16 05:59:44,565 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:59:44" (1/1) ... [2021-12-16 05:59:44,566 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:59:44" (1/1) ... [2021-12-16 05:59:44,582 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:59:44" (1/1) ... [2021-12-16 05:59:44,585 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:59:44" (1/1) ... [2021-12-16 05:59:44,592 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:59:44" (1/1) ... [2021-12-16 05:59:44,603 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:59:44" (1/1) ... [2021-12-16 05:59:44,605 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:59:44" (1/1) ... [2021-12-16 05:59:44,607 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-16 05:59:44,608 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-16 05:59:44,608 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-16 05:59:44,608 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-16 05:59:44,615 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:59:44" (1/1) ... [2021-12-16 05:59:44,622 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 05:59:44,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 05:59:44,644 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-16 05:59:44,665 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-16 05:59:44,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-16 05:59:44,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-16 05:59:44,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-16 05:59:44,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-16 05:59:44,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-16 05:59:44,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-16 05:59:44,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-16 05:59:44,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-16 05:59:44,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-16 05:59:44,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-16 05:59:44,834 INFO L236 CfgBuilder]: Building ICFG [2021-12-16 05:59:44,835 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-16 05:59:45,287 INFO L277 CfgBuilder]: Performing block encoding [2021-12-16 05:59:45,296 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-16 05:59:45,297 INFO L301 CfgBuilder]: Removed 17 assume(true) statements. [2021-12-16 05:59:45,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 05:59:45 BoogieIcfgContainer [2021-12-16 05:59:45,299 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-16 05:59:45,300 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-16 05:59:45,301 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-16 05:59:45,304 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-16 05:59:45,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 05:59:44" (1/3) ... [2021-12-16 05:59:45,306 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c1a17c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 05:59:45, skipping insertion in model container [2021-12-16 05:59:45,306 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:59:44" (2/3) ... [2021-12-16 05:59:45,307 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c1a17c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 05:59:45, skipping insertion in model container [2021-12-16 05:59:45,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 05:59:45" (3/3) ... [2021-12-16 05:59:45,308 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel-1.i [2021-12-16 05:59:45,314 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-16 05:59:45,314 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 77 error locations. [2021-12-16 05:59:45,347 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-16 05:59:45,353 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-16 05:59:45,353 INFO L340 AbstractCegarLoop]: Starting to check reachability of 77 error locations. [2021-12-16 05:59:45,370 INFO L276 IsEmpty]: Start isEmpty. Operand has 166 states, 88 states have (on average 2.215909090909091) internal successors, (195), 165 states have internal predecessors, (195), 0 states have call successors, (0), 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-16 05:59:45,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-16 05:59:45,385 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:59:45,386 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-16 05:59:45,386 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2021-12-16 05:59:45,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:59:45,395 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-16 05:59:45,403 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:59:45,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250077114] [2021-12-16 05:59:45,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:59:45,404 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:59:45,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:59:45,546 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-16 05:59:45,547 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:59:45,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250077114] [2021-12-16 05:59:45,549 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250077114] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:59:45,550 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:59:45,550 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 05:59:45,552 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200908929] [2021-12-16 05:59:45,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:59:45,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 05:59:45,557 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:59:45,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 05:59:45,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 05:59:45,588 INFO L87 Difference]: Start difference. First operand has 166 states, 88 states have (on average 2.215909090909091) internal successors, (195), 165 states have internal predecessors, (195), 0 states have call successors, (0), 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-16 05:59:45,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:59:45,796 INFO L93 Difference]: Finished difference Result 193 states and 199 transitions. [2021-12-16 05:59:45,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 05:59:45,799 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-16 05:59:45,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:59:45,809 INFO L225 Difference]: With dead ends: 193 [2021-12-16 05:59:45,809 INFO L226 Difference]: Without dead ends: 189 [2021-12-16 05:59:45,811 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-16 05:59:45,814 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 151 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 05:59:45,815 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 112 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 05:59:45,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2021-12-16 05:59:45,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 161. [2021-12-16 05:59:45,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 87 states have (on average 1.9080459770114941) internal successors, (166), 160 states have internal predecessors, (166), 0 states have call successors, (0), 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-16 05:59:45,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 166 transitions. [2021-12-16 05:59:45,866 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 166 transitions. Word has length 3 [2021-12-16 05:59:45,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:59:45,867 INFO L470 AbstractCegarLoop]: Abstraction has 161 states and 166 transitions. [2021-12-16 05:59:45,867 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-16 05:59:45,867 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 166 transitions. [2021-12-16 05:59:45,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-16 05:59:45,868 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:59:45,868 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-16 05:59:45,868 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-16 05:59:45,869 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2021-12-16 05:59:45,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:59:45,871 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-16 05:59:45,871 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:59:45,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95416420] [2021-12-16 05:59:45,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:59:45,872 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:59:45,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:59:45,938 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-16 05:59:45,939 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:59:45,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95416420] [2021-12-16 05:59:45,942 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95416420] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:59:45,943 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:59:45,943 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 05:59:45,943 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468937593] [2021-12-16 05:59:45,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:59:45,944 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 05:59:45,944 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:59:45,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 05:59:45,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 05:59:45,945 INFO L87 Difference]: Start difference. First operand 161 states and 166 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-16 05:59:46,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:59:46,036 INFO L93 Difference]: Finished difference Result 158 states and 163 transitions. [2021-12-16 05:59:46,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 05:59:46,037 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-16 05:59:46,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:59:46,044 INFO L225 Difference]: With dead ends: 158 [2021-12-16 05:59:46,045 INFO L226 Difference]: Without dead ends: 158 [2021-12-16 05:59:46,047 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-16 05:59:46,049 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 158 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:59:46,049 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [158 Valid, 91 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:59:46,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-12-16 05:59:46,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2021-12-16 05:59:46,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 87 states have (on average 1.8735632183908046) internal successors, (163), 157 states have internal predecessors, (163), 0 states have call successors, (0), 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-16 05:59:46,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 163 transitions. [2021-12-16 05:59:46,061 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 163 transitions. Word has length 3 [2021-12-16 05:59:46,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:59:46,065 INFO L470 AbstractCegarLoop]: Abstraction has 158 states and 163 transitions. [2021-12-16 05:59:46,065 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-16 05:59:46,065 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 163 transitions. [2021-12-16 05:59:46,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-16 05:59:46,066 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:59:46,066 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:59:46,066 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-16 05:59:46,066 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2021-12-16 05:59:46,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:59:46,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1803026981, now seen corresponding path program 1 times [2021-12-16 05:59:46,067 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:59:46,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400263153] [2021-12-16 05:59:46,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:59:46,067 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:59:46,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:59:46,141 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-16 05:59:46,142 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:59:46,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400263153] [2021-12-16 05:59:46,142 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400263153] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:59:46,142 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:59:46,142 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 05:59:46,143 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901293699] [2021-12-16 05:59:46,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:59:46,143 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 05:59:46,143 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:59:46,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 05:59:46,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 05:59:46,144 INFO L87 Difference]: Start difference. First operand 158 states and 163 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:59:46,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:59:46,267 INFO L93 Difference]: Finished difference Result 157 states and 162 transitions. [2021-12-16 05:59:46,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 05:59:46,267 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-12-16 05:59:46,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:59:46,269 INFO L225 Difference]: With dead ends: 157 [2021-12-16 05:59:46,269 INFO L226 Difference]: Without dead ends: 157 [2021-12-16 05:59:46,269 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-16 05:59:46,272 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 135 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:59:46,273 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 97 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:59:46,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-12-16 05:59:46,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 153. [2021-12-16 05:59:46,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 89 states have (on average 1.797752808988764) internal successors, (160), 152 states have internal predecessors, (160), 0 states have call successors, (0), 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-16 05:59:46,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 160 transitions. [2021-12-16 05:59:46,291 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 160 transitions. Word has length 7 [2021-12-16 05:59:46,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:59:46,291 INFO L470 AbstractCegarLoop]: Abstraction has 153 states and 160 transitions. [2021-12-16 05:59:46,291 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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-16 05:59:46,291 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 160 transitions. [2021-12-16 05:59:46,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-16 05:59:46,292 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:59:46,292 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:59:46,292 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-16 05:59:46,292 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2021-12-16 05:59:46,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:59:46,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1803026982, now seen corresponding path program 1 times [2021-12-16 05:59:46,293 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:59:46,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503447316] [2021-12-16 05:59:46,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:59:46,293 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:59:46,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:59:46,341 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-16 05:59:46,342 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:59:46,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503447316] [2021-12-16 05:59:46,342 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503447316] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:59:46,342 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:59:46,342 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 05:59:46,343 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525999182] [2021-12-16 05:59:46,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:59:46,343 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 05:59:46,343 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:59:46,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 05:59:46,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 05:59:46,344 INFO L87 Difference]: Start difference. First operand 153 states and 160 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:59:46,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:59:46,437 INFO L93 Difference]: Finished difference Result 170 states and 176 transitions. [2021-12-16 05:59:46,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 05:59:46,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-12-16 05:59:46,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:59:46,439 INFO L225 Difference]: With dead ends: 170 [2021-12-16 05:59:46,439 INFO L226 Difference]: Without dead ends: 170 [2021-12-16 05:59:46,440 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-16 05:59:46,440 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 131 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:59:46,441 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 104 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:59:46,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2021-12-16 05:59:46,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 157. [2021-12-16 05:59:46,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 96 states have (on average 1.7083333333333333) internal successors, (164), 156 states have internal predecessors, (164), 0 states have call successors, (0), 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-16 05:59:46,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 164 transitions. [2021-12-16 05:59:46,445 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 164 transitions. Word has length 7 [2021-12-16 05:59:46,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:59:46,445 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 164 transitions. [2021-12-16 05:59:46,445 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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-16 05:59:46,446 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 164 transitions. [2021-12-16 05:59:46,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-16 05:59:46,446 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:59:46,446 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:59:46,446 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-16 05:59:46,447 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2021-12-16 05:59:46,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:59:46,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1253214510, now seen corresponding path program 1 times [2021-12-16 05:59:46,447 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:59:46,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002020790] [2021-12-16 05:59:46,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:59:46,448 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:59:46,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:59:46,512 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-16 05:59:46,512 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:59:46,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002020790] [2021-12-16 05:59:46,513 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002020790] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:59:46,513 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:59:46,513 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 05:59:46,513 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459203657] [2021-12-16 05:59:46,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:59:46,514 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 05:59:46,514 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:59:46,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 05:59:46,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 05:59:46,515 INFO L87 Difference]: Start difference. First operand 157 states and 164 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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-16 05:59:46,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:59:46,671 INFO L93 Difference]: Finished difference Result 158 states and 166 transitions. [2021-12-16 05:59:46,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 05:59:46,674 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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-16 05:59:46,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:59:46,675 INFO L225 Difference]: With dead ends: 158 [2021-12-16 05:59:46,675 INFO L226 Difference]: Without dead ends: 158 [2021-12-16 05:59:46,675 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-16 05:59:46,676 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 214 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:59:46,676 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [214 Valid, 81 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:59:46,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-12-16 05:59:46,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 144. [2021-12-16 05:59:46,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 98 states have (on average 1.5612244897959184) internal successors, (153), 143 states have internal predecessors, (153), 0 states have call successors, (0), 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-16 05:59:46,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 153 transitions. [2021-12-16 05:59:46,680 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 153 transitions. Word has length 13 [2021-12-16 05:59:46,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:59:46,680 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 153 transitions. [2021-12-16 05:59:46,680 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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-16 05:59:46,680 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 153 transitions. [2021-12-16 05:59:46,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-16 05:59:46,681 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:59:46,681 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:59:46,681 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-16 05:59:46,681 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2021-12-16 05:59:46,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:59:46,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1253214511, now seen corresponding path program 1 times [2021-12-16 05:59:46,682 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:59:46,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833361531] [2021-12-16 05:59:46,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:59:46,682 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:59:46,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:59:46,761 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-16 05:59:46,762 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:59:46,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833361531] [2021-12-16 05:59:46,762 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833361531] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:59:46,762 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:59:46,763 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 05:59:46,763 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663328801] [2021-12-16 05:59:46,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:59:46,763 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 05:59:46,764 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:59:46,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 05:59:46,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 05:59:46,764 INFO L87 Difference]: Start difference. First operand 144 states and 153 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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-16 05:59:46,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:59:46,954 INFO L93 Difference]: Finished difference Result 183 states and 193 transitions. [2021-12-16 05:59:46,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 05:59:46,955 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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-16 05:59:46,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:59:46,956 INFO L225 Difference]: With dead ends: 183 [2021-12-16 05:59:46,956 INFO L226 Difference]: Without dead ends: 183 [2021-12-16 05:59:46,957 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-16 05:59:46,958 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 178 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 05:59:46,958 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [178 Valid, 121 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 05:59:46,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2021-12-16 05:59:46,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 154. [2021-12-16 05:59:46,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 109 states have (on average 1.5229357798165137) internal successors, (166), 153 states have internal predecessors, (166), 0 states have call successors, (0), 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-16 05:59:46,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 166 transitions. [2021-12-16 05:59:46,961 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 166 transitions. Word has length 13 [2021-12-16 05:59:46,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:59:46,962 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 166 transitions. [2021-12-16 05:59:46,962 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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-16 05:59:46,962 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 166 transitions. [2021-12-16 05:59:46,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-16 05:59:46,962 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:59:46,962 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:59:46,962 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-16 05:59:46,963 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2021-12-16 05:59:46,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:59:46,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1748354145, now seen corresponding path program 1 times [2021-12-16 05:59:46,963 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:59:46,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744236912] [2021-12-16 05:59:46,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:59:46,964 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:59:46,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:59:47,014 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-16 05:59:47,014 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:59:47,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744236912] [2021-12-16 05:59:47,015 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744236912] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:59:47,015 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:59:47,015 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-16 05:59:47,015 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675351967] [2021-12-16 05:59:47,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:59:47,016 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 05:59:47,016 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:59:47,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 05:59:47,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 05:59:47,016 INFO L87 Difference]: Start difference. First operand 154 states and 166 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 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-16 05:59:47,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:59:47,185 INFO L93 Difference]: Finished difference Result 197 states and 206 transitions. [2021-12-16 05:59:47,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 05:59:47,185 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2021-12-16 05:59:47,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:59:47,187 INFO L225 Difference]: With dead ends: 197 [2021-12-16 05:59:47,188 INFO L226 Difference]: Without dead ends: 197 [2021-12-16 05:59:47,188 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-16 05:59:47,189 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 301 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:59:47,189 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [301 Valid, 153 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:59:47,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-12-16 05:59:47,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 152. [2021-12-16 05:59:47,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 108 states have (on average 1.5) internal successors, (162), 151 states have internal predecessors, (162), 0 states have call successors, (0), 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-16 05:59:47,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 162 transitions. [2021-12-16 05:59:47,193 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 162 transitions. Word has length 15 [2021-12-16 05:59:47,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:59:47,193 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 162 transitions. [2021-12-16 05:59:47,193 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 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-16 05:59:47,193 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 162 transitions. [2021-12-16 05:59:47,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-16 05:59:47,194 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:59:47,194 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:59:47,194 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-16 05:59:47,194 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2021-12-16 05:59:47,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:59:47,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1637230725, now seen corresponding path program 1 times [2021-12-16 05:59:47,195 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:59:47,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254558446] [2021-12-16 05:59:47,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:59:47,195 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:59:47,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:59:47,273 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-16 05:59:47,273 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:59:47,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254558446] [2021-12-16 05:59:47,274 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254558446] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:59:47,274 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:59:47,274 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 05:59:47,274 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467387919] [2021-12-16 05:59:47,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:59:47,275 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 05:59:47,275 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:59:47,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 05:59:47,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 05:59:47,276 INFO L87 Difference]: Start difference. First operand 152 states and 162 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 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-16 05:59:47,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:59:47,418 INFO L93 Difference]: Finished difference Result 151 states and 160 transitions. [2021-12-16 05:59:47,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 05:59:47,418 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 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-16 05:59:47,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:59:47,419 INFO L225 Difference]: With dead ends: 151 [2021-12-16 05:59:47,419 INFO L226 Difference]: Without dead ends: 151 [2021-12-16 05:59:47,420 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-16 05:59:47,420 INFO L933 BasicCegarLoop]: 127 mSDtfsCounter, 9 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:59:47,420 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 342 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:59:47,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-12-16 05:59:47,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2021-12-16 05:59:47,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 108 states have (on average 1.4814814814814814) internal successors, (160), 150 states have internal predecessors, (160), 0 states have call successors, (0), 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-16 05:59:47,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 160 transitions. [2021-12-16 05:59:47,424 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 160 transitions. Word has length 16 [2021-12-16 05:59:47,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:59:47,424 INFO L470 AbstractCegarLoop]: Abstraction has 151 states and 160 transitions. [2021-12-16 05:59:47,424 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 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-16 05:59:47,424 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 160 transitions. [2021-12-16 05:59:47,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-16 05:59:47,425 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:59:47,425 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:59:47,430 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-16 05:59:47,430 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2021-12-16 05:59:47,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:59:47,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1637230724, now seen corresponding path program 1 times [2021-12-16 05:59:47,431 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:59:47,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789624957] [2021-12-16 05:59:47,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:59:47,432 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:59:47,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:59:47,536 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-16 05:59:47,537 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:59:47,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789624957] [2021-12-16 05:59:47,537 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789624957] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:59:47,537 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:59:47,538 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 05:59:47,538 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924566591] [2021-12-16 05:59:47,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:59:47,538 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 05:59:47,538 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:59:47,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 05:59:47,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 05:59:47,539 INFO L87 Difference]: Start difference. First operand 151 states and 160 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 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-16 05:59:47,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:59:47,696 INFO L93 Difference]: Finished difference Result 150 states and 158 transitions. [2021-12-16 05:59:47,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 05:59:47,697 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 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-16 05:59:47,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:59:47,697 INFO L225 Difference]: With dead ends: 150 [2021-12-16 05:59:47,697 INFO L226 Difference]: Without dead ends: 150 [2021-12-16 05:59:47,698 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-16 05:59:47,698 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 4 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:59:47,698 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 327 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:59:47,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2021-12-16 05:59:47,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2021-12-16 05:59:47,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 108 states have (on average 1.462962962962963) internal successors, (158), 149 states have internal predecessors, (158), 0 states have call successors, (0), 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-16 05:59:47,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 158 transitions. [2021-12-16 05:59:47,701 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 158 transitions. Word has length 16 [2021-12-16 05:59:47,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:59:47,702 INFO L470 AbstractCegarLoop]: Abstraction has 150 states and 158 transitions. [2021-12-16 05:59:47,702 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 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-16 05:59:47,702 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 158 transitions. [2021-12-16 05:59:47,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-16 05:59:47,702 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:59:47,702 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:59:47,703 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-16 05:59:47,703 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2021-12-16 05:59:47,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:59:47,703 INFO L85 PathProgramCache]: Analyzing trace with hash 154003716, now seen corresponding path program 1 times [2021-12-16 05:59:47,703 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:59:47,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691271875] [2021-12-16 05:59:47,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:59:47,703 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:59:47,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:59:47,848 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-16 05:59:47,848 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:59:47,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691271875] [2021-12-16 05:59:47,848 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691271875] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:59:47,849 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:59:47,849 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-16 05:59:47,849 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312729761] [2021-12-16 05:59:47,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:59:47,849 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 05:59:47,849 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:59:47,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 05:59:47,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-12-16 05:59:47,850 INFO L87 Difference]: Start difference. First operand 150 states and 158 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:59:48,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:59:48,138 INFO L93 Difference]: Finished difference Result 204 states and 216 transitions. [2021-12-16 05:59:48,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-16 05:59:48,138 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-12-16 05:59:48,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:59:48,139 INFO L225 Difference]: With dead ends: 204 [2021-12-16 05:59:48,139 INFO L226 Difference]: Without dead ends: 204 [2021-12-16 05:59:48,139 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2021-12-16 05:59:48,140 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 369 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 05:59:48,140 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [369 Valid, 338 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 05:59:48,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2021-12-16 05:59:48,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 155. [2021-12-16 05:59:48,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 113 states have (on average 1.4424778761061947) internal successors, (163), 154 states have internal predecessors, (163), 0 states have call successors, (0), 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-16 05:59:48,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 163 transitions. [2021-12-16 05:59:48,147 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 163 transitions. Word has length 18 [2021-12-16 05:59:48,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:59:48,148 INFO L470 AbstractCegarLoop]: Abstraction has 155 states and 163 transitions. [2021-12-16 05:59:48,148 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:59:48,148 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 163 transitions. [2021-12-16 05:59:48,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-16 05:59:48,149 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:59:48,149 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:59:48,149 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-16 05:59:48,149 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2021-12-16 05:59:48,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:59:48,150 INFO L85 PathProgramCache]: Analyzing trace with hash 510771581, now seen corresponding path program 1 times [2021-12-16 05:59:48,150 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:59:48,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162073499] [2021-12-16 05:59:48,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:59:48,151 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:59:48,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:59:48,278 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-16 05:59:48,278 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:59:48,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162073499] [2021-12-16 05:59:48,278 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162073499] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:59:48,279 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:59:48,279 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-16 05:59:48,279 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775017046] [2021-12-16 05:59:48,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:59:48,280 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-16 05:59:48,280 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:59:48,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-16 05:59:48,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-16 05:59:48,281 INFO L87 Difference]: Start difference. First operand 155 states and 163 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:59:48,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:59:48,591 INFO L93 Difference]: Finished difference Result 154 states and 162 transitions. [2021-12-16 05:59:48,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-16 05:59:48,592 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-12-16 05:59:48,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:59:48,592 INFO L225 Difference]: With dead ends: 154 [2021-12-16 05:59:48,592 INFO L226 Difference]: Without dead ends: 154 [2021-12-16 05:59:48,593 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2021-12-16 05:59:48,593 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 183 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 05:59:48,593 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [183 Valid, 266 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 05:59:48,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2021-12-16 05:59:48,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2021-12-16 05:59:48,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 113 states have (on average 1.4336283185840708) internal successors, (162), 153 states have internal predecessors, (162), 0 states have call successors, (0), 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-16 05:59:48,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 162 transitions. [2021-12-16 05:59:48,597 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 162 transitions. Word has length 20 [2021-12-16 05:59:48,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:59:48,597 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 162 transitions. [2021-12-16 05:59:48,598 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:59:48,598 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 162 transitions. [2021-12-16 05:59:48,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-16 05:59:48,598 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:59:48,598 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:59:48,599 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-16 05:59:48,599 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2021-12-16 05:59:48,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:59:48,599 INFO L85 PathProgramCache]: Analyzing trace with hash 510771582, now seen corresponding path program 1 times [2021-12-16 05:59:48,599 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:59:48,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111952843] [2021-12-16 05:59:48,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:59:48,600 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:59:48,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:59:48,726 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-16 05:59:48,726 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:59:48,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111952843] [2021-12-16 05:59:48,726 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111952843] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:59:48,726 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:59:48,726 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-16 05:59:48,726 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649348825] [2021-12-16 05:59:48,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:59:48,727 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-16 05:59:48,727 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:59:48,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-16 05:59:48,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-12-16 05:59:48,727 INFO L87 Difference]: Start difference. First operand 154 states and 162 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:59:49,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:59:49,238 INFO L93 Difference]: Finished difference Result 172 states and 181 transitions. [2021-12-16 05:59:49,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-16 05:59:49,238 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-12-16 05:59:49,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:59:49,240 INFO L225 Difference]: With dead ends: 172 [2021-12-16 05:59:49,240 INFO L226 Difference]: Without dead ends: 172 [2021-12-16 05:59:49,240 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2021-12-16 05:59:49,241 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 233 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 05:59:49,241 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [233 Valid, 359 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 05:59:49,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2021-12-16 05:59:49,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 158. [2021-12-16 05:59:49,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 123 states have (on average 1.3821138211382114) internal successors, (170), 157 states have internal predecessors, (170), 0 states have call successors, (0), 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-16 05:59:49,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 170 transitions. [2021-12-16 05:59:49,252 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 170 transitions. Word has length 20 [2021-12-16 05:59:49,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:59:49,253 INFO L470 AbstractCegarLoop]: Abstraction has 158 states and 170 transitions. [2021-12-16 05:59:49,253 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:59:49,253 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 170 transitions. [2021-12-16 05:59:49,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-16 05:59:49,254 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:59:49,254 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:59:49,254 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-16 05:59:49,255 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2021-12-16 05:59:49,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:59:49,255 INFO L85 PathProgramCache]: Analyzing trace with hash 2006006511, now seen corresponding path program 1 times [2021-12-16 05:59:49,255 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:59:49,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987492677] [2021-12-16 05:59:49,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:59:49,256 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:59:49,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:59:49,328 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:59:49,328 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:59:49,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987492677] [2021-12-16 05:59:49,328 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987492677] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 05:59:49,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [337035317] [2021-12-16 05:59:49,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:59:49,329 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 05:59:49,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 05:59:49,331 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 05:59:49,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-16 05:59:49,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:59:49,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 33 conjunts are in the unsatisfiable core [2021-12-16 05:59:49,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:59:49,570 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-16 05:59:49,576 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-16 05:59:49,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:59:49,623 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-16 05:59:49,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:59:49,637 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-16 05:59:49,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:59:49,660 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-16 05:59:49,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:59:49,668 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-16 05:59:49,840 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-16 05:59:49,847 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-16 05:59:49,893 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:59:49,893 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 05:59:50,038 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:59:50,038 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [337035317] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 05:59:50,039 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 05:59:50,039 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 6] total 12 [2021-12-16 05:59:50,039 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864464872] [2021-12-16 05:59:50,039 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 05:59:50,040 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-16 05:59:50,040 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:59:50,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-16 05:59:50,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-12-16 05:59:50,041 INFO L87 Difference]: Start difference. First operand 158 states and 170 transitions. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 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-16 05:59:50,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:59:50,448 INFO L93 Difference]: Finished difference Result 209 states and 225 transitions. [2021-12-16 05:59:50,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-16 05:59:50,448 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 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 25 [2021-12-16 05:59:50,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:59:50,449 INFO L225 Difference]: With dead ends: 209 [2021-12-16 05:59:50,449 INFO L226 Difference]: Without dead ends: 209 [2021-12-16 05:59:50,449 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2021-12-16 05:59:50,450 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 231 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 05:59:50,450 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [231 Valid, 521 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 05:59:50,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-12-16 05:59:50,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 165. [2021-12-16 05:59:50,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 130 states have (on average 1.3692307692307693) internal successors, (178), 164 states have internal predecessors, (178), 0 states have call successors, (0), 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-16 05:59:50,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 178 transitions. [2021-12-16 05:59:50,453 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 178 transitions. Word has length 25 [2021-12-16 05:59:50,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:59:50,453 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 178 transitions. [2021-12-16 05:59:50,453 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 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-16 05:59:50,454 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 178 transitions. [2021-12-16 05:59:50,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-16 05:59:50,454 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:59:50,454 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:59:50,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-16 05:59:50,659 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-12-16 05:59:50,659 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2021-12-16 05:59:50,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:59:50,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1963988258, now seen corresponding path program 1 times [2021-12-16 05:59:50,660 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:59:50,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363593188] [2021-12-16 05:59:50,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:59:50,660 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:59:50,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:59:50,749 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-16 05:59:50,750 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:59:50,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363593188] [2021-12-16 05:59:50,750 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363593188] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:59:50,750 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:59:50,750 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-16 05:59:50,751 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424255989] [2021-12-16 05:59:50,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:59:50,752 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 05:59:50,752 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:59:50,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 05:59:50,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 05:59:50,752 INFO L87 Difference]: Start difference. First operand 165 states and 178 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:59:50,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:59:50,875 INFO L93 Difference]: Finished difference Result 169 states and 180 transitions. [2021-12-16 05:59:50,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 05:59:50,876 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-12-16 05:59:50,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:59:50,877 INFO L225 Difference]: With dead ends: 169 [2021-12-16 05:59:50,877 INFO L226 Difference]: Without dead ends: 169 [2021-12-16 05:59:50,877 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-16 05:59:50,878 INFO L933 BasicCegarLoop]: 117 mSDtfsCounter, 25 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:59:50,878 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 338 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:59:50,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2021-12-16 05:59:50,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 164. [2021-12-16 05:59:50,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 129 states have (on average 1.3565891472868217) internal successors, (175), 163 states have internal predecessors, (175), 0 states have call successors, (0), 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-16 05:59:50,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 175 transitions. [2021-12-16 05:59:50,884 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 175 transitions. Word has length 25 [2021-12-16 05:59:50,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:59:50,884 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 175 transitions. [2021-12-16 05:59:50,884 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:59:50,884 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 175 transitions. [2021-12-16 05:59:50,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-16 05:59:50,887 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:59:50,887 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:59:50,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-16 05:59:50,887 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2021-12-16 05:59:50,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:59:50,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1375479745, now seen corresponding path program 1 times [2021-12-16 05:59:50,888 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:59:50,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540163158] [2021-12-16 05:59:50,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:59:50,888 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:59:50,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:59:50,939 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-16 05:59:50,939 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:59:50,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540163158] [2021-12-16 05:59:50,939 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540163158] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:59:50,940 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:59:50,940 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 05:59:50,940 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737557684] [2021-12-16 05:59:50,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:59:50,940 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 05:59:50,941 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:59:50,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 05:59:50,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 05:59:50,941 INFO L87 Difference]: Start difference. First operand 164 states and 175 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 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-16 05:59:51,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:59:51,025 INFO L93 Difference]: Finished difference Result 166 states and 176 transitions. [2021-12-16 05:59:51,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 05:59:51,025 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-16 05:59:51,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:59:51,026 INFO L225 Difference]: With dead ends: 166 [2021-12-16 05:59:51,026 INFO L226 Difference]: Without dead ends: 166 [2021-12-16 05:59:51,027 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-16 05:59:51,027 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 20 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:59:51,027 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 288 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:59:51,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2021-12-16 05:59:51,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 162. [2021-12-16 05:59:51,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 128 states have (on average 1.34375) internal successors, (172), 161 states have internal predecessors, (172), 0 states have call successors, (0), 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-16 05:59:51,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 172 transitions. [2021-12-16 05:59:51,031 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 172 transitions. Word has length 26 [2021-12-16 05:59:51,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:59:51,031 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 172 transitions. [2021-12-16 05:59:51,031 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 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-16 05:59:51,032 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 172 transitions. [2021-12-16 05:59:51,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-16 05:59:51,032 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:59:51,032 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:59:51,032 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-16 05:59:51,033 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2021-12-16 05:59:51,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:59:51,033 INFO L85 PathProgramCache]: Analyzing trace with hash -752171090, now seen corresponding path program 1 times [2021-12-16 05:59:51,033 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:59:51,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662010998] [2021-12-16 05:59:51,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:59:51,034 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:59:51,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:59:51,079 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-16 05:59:51,079 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:59:51,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662010998] [2021-12-16 05:59:51,079 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662010998] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:59:51,079 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:59:51,080 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 05:59:51,080 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922306024] [2021-12-16 05:59:51,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:59:51,080 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 05:59:51,080 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:59:51,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 05:59:51,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 05:59:51,081 INFO L87 Difference]: Start difference. First operand 162 states and 172 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:59:51,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:59:51,214 INFO L93 Difference]: Finished difference Result 161 states and 171 transitions. [2021-12-16 05:59:51,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 05:59:51,215 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-12-16 05:59:51,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:59:51,216 INFO L225 Difference]: With dead ends: 161 [2021-12-16 05:59:51,216 INFO L226 Difference]: Without dead ends: 161 [2021-12-16 05:59:51,216 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-16 05:59:51,217 INFO L933 BasicCegarLoop]: 118 mSDtfsCounter, 6 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:59:51,217 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 317 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:59:51,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-12-16 05:59:51,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2021-12-16 05:59:51,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 128 states have (on average 1.3359375) internal successors, (171), 160 states have internal predecessors, (171), 0 states have call successors, (0), 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-16 05:59:51,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 171 transitions. [2021-12-16 05:59:51,220 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 171 transitions. Word has length 28 [2021-12-16 05:59:51,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:59:51,221 INFO L470 AbstractCegarLoop]: Abstraction has 161 states and 171 transitions. [2021-12-16 05:59:51,221 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:59:51,221 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 171 transitions. [2021-12-16 05:59:51,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-16 05:59:51,222 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:59:51,222 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:59:51,222 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-16 05:59:51,222 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2021-12-16 05:59:51,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:59:51,223 INFO L85 PathProgramCache]: Analyzing trace with hash -752171089, now seen corresponding path program 1 times [2021-12-16 05:59:51,223 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:59:51,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225119268] [2021-12-16 05:59:51,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:59:51,223 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:59:51,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:59:51,306 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-16 05:59:51,307 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:59:51,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225119268] [2021-12-16 05:59:51,307 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225119268] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:59:51,307 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:59:51,307 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 05:59:51,308 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477024418] [2021-12-16 05:59:51,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:59:51,308 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 05:59:51,308 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:59:51,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 05:59:51,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 05:59:51,309 INFO L87 Difference]: Start difference. First operand 161 states and 171 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:59:51,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:59:51,428 INFO L93 Difference]: Finished difference Result 160 states and 170 transitions. [2021-12-16 05:59:51,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 05:59:51,429 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-12-16 05:59:51,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:59:51,429 INFO L225 Difference]: With dead ends: 160 [2021-12-16 05:59:51,430 INFO L226 Difference]: Without dead ends: 160 [2021-12-16 05:59:51,430 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-16 05:59:51,430 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 2 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:59:51,431 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 307 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:59:51,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-12-16 05:59:51,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2021-12-16 05:59:51,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 128 states have (on average 1.328125) internal successors, (170), 159 states have internal predecessors, (170), 0 states have call successors, (0), 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-16 05:59:51,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 170 transitions. [2021-12-16 05:59:51,436 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 170 transitions. Word has length 28 [2021-12-16 05:59:51,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:59:51,437 INFO L470 AbstractCegarLoop]: Abstraction has 160 states and 170 transitions. [2021-12-16 05:59:51,437 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:59:51,437 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 170 transitions. [2021-12-16 05:59:51,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-16 05:59:51,438 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:59:51,438 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:59:51,438 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-16 05:59:51,438 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2021-12-16 05:59:51,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:59:51,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1361877815, now seen corresponding path program 1 times [2021-12-16 05:59:51,443 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:59:51,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263600942] [2021-12-16 05:59:51,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:59:51,444 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:59:51,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:59:51,506 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-16 05:59:51,507 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:59:51,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263600942] [2021-12-16 05:59:51,507 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263600942] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:59:51,507 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:59:51,507 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 05:59:51,508 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934710060] [2021-12-16 05:59:51,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:59:51,508 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 05:59:51,510 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:59:51,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 05:59:51,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 05:59:51,510 INFO L87 Difference]: Start difference. First operand 160 states and 170 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:59:51,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:59:51,591 INFO L93 Difference]: Finished difference Result 159 states and 168 transitions. [2021-12-16 05:59:51,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 05:59:51,592 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-16 05:59:51,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:59:51,593 INFO L225 Difference]: With dead ends: 159 [2021-12-16 05:59:51,593 INFO L226 Difference]: Without dead ends: 159 [2021-12-16 05:59:51,593 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-16 05:59:51,593 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 15 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:59:51,594 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 248 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:59:51,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-12-16 05:59:51,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 158. [2021-12-16 05:59:51,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 127 states have (on average 1.31496062992126) internal successors, (167), 157 states have internal predecessors, (167), 0 states have call successors, (0), 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-16 05:59:51,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 167 transitions. [2021-12-16 05:59:51,597 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 167 transitions. Word has length 29 [2021-12-16 05:59:51,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:59:51,597 INFO L470 AbstractCegarLoop]: Abstraction has 158 states and 167 transitions. [2021-12-16 05:59:51,597 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:59:51,598 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 167 transitions. [2021-12-16 05:59:51,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-16 05:59:51,598 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:59:51,598 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:59:51,598 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-16 05:59:51,599 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2021-12-16 05:59:51,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:59:51,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1200575117, now seen corresponding path program 1 times [2021-12-16 05:59:51,599 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:59:51,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356327925] [2021-12-16 05:59:51,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:59:51,600 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:59:51,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:59:51,742 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-16 05:59:51,743 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:59:51,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356327925] [2021-12-16 05:59:51,743 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356327925] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:59:51,743 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:59:51,743 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-16 05:59:51,744 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845763220] [2021-12-16 05:59:51,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:59:51,744 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-16 05:59:51,744 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:59:51,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-16 05:59:51,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-12-16 05:59:51,745 INFO L87 Difference]: Start difference. First operand 158 states and 167 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 0 states have call successors, (0), 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-16 05:59:52,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:59:52,251 INFO L93 Difference]: Finished difference Result 200 states and 209 transitions. [2021-12-16 05:59:52,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-16 05:59:52,251 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-12-16 05:59:52,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:59:52,252 INFO L225 Difference]: With dead ends: 200 [2021-12-16 05:59:52,252 INFO L226 Difference]: Without dead ends: 200 [2021-12-16 05:59:52,253 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=204, Invalid=498, Unknown=0, NotChecked=0, Total=702 [2021-12-16 05:59:52,253 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 268 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 05:59:52,254 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [268 Valid, 340 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 05:59:52,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2021-12-16 05:59:52,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 158. [2021-12-16 05:59:52,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 127 states have (on average 1.3070866141732282) internal successors, (166), 157 states have internal predecessors, (166), 0 states have call successors, (0), 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-16 05:59:52,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 166 transitions. [2021-12-16 05:59:52,257 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 166 transitions. Word has length 31 [2021-12-16 05:59:52,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:59:52,258 INFO L470 AbstractCegarLoop]: Abstraction has 158 states and 166 transitions. [2021-12-16 05:59:52,258 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 0 states have call successors, (0), 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-16 05:59:52,258 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 166 transitions. [2021-12-16 05:59:52,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-16 05:59:52,258 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:59:52,258 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:59:52,258 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-16 05:59:52,259 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2021-12-16 05:59:52,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:59:52,259 INFO L85 PathProgramCache]: Analyzing trace with hash -2047381958, now seen corresponding path program 1 times [2021-12-16 05:59:52,259 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:59:52,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83289221] [2021-12-16 05:59:52,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:59:52,260 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:59:52,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:59:52,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:59:52,337 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:59:52,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83289221] [2021-12-16 05:59:52,338 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83289221] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 05:59:52,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1978791200] [2021-12-16 05:59:52,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:59:52,338 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 05:59:52,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 05:59:52,339 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 05:59:52,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-16 05:59:52,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:59:52,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-16 05:59:52,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:59:52,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-16 05:59:52,520 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 05:59:52,520 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1978791200] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:59:52,520 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 05:59:52,521 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2021-12-16 05:59:52,521 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291699221] [2021-12-16 05:59:52,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:59:52,521 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 05:59:52,521 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:59:52,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 05:59:52,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-12-16 05:59:52,522 INFO L87 Difference]: Start difference. First operand 158 states and 166 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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-16 05:59:52,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:59:52,554 INFO L93 Difference]: Finished difference Result 160 states and 168 transitions. [2021-12-16 05:59:52,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 05:59:52,554 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-12-16 05:59:52,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:59:52,555 INFO L225 Difference]: With dead ends: 160 [2021-12-16 05:59:52,555 INFO L226 Difference]: Without dead ends: 160 [2021-12-16 05:59:52,556 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-12-16 05:59:52,556 INFO L933 BasicCegarLoop]: 105 mSDtfsCounter, 72 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 05:59:52,557 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 121 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 05:59:52,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-12-16 05:59:52,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2021-12-16 05:59:52,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 129 states have (on average 1.302325581395349) internal successors, (168), 159 states have internal predecessors, (168), 0 states have call successors, (0), 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-16 05:59:52,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 168 transitions. [2021-12-16 05:59:52,560 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 168 transitions. Word has length 31 [2021-12-16 05:59:52,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:59:52,560 INFO L470 AbstractCegarLoop]: Abstraction has 160 states and 168 transitions. [2021-12-16 05:59:52,561 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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-16 05:59:52,561 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 168 transitions. [2021-12-16 05:59:52,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-16 05:59:52,561 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:59:52,561 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:59:52,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-16 05:59:52,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2021-12-16 05:59:52,784 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2021-12-16 05:59:52,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:59:52,784 INFO L85 PathProgramCache]: Analyzing trace with hash 739766256, now seen corresponding path program 1 times [2021-12-16 05:59:52,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:59:52,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309995219] [2021-12-16 05:59:52,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:59:52,784 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:59:52,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:59:52,896 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-16 05:59:52,897 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:59:52,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309995219] [2021-12-16 05:59:52,897 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309995219] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:59:52,897 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:59:52,897 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 05:59:52,899 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644360938] [2021-12-16 05:59:52,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:59:52,900 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 05:59:52,900 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:59:52,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 05:59:52,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-16 05:59:52,901 INFO L87 Difference]: Start difference. First operand 160 states and 168 transitions. Second operand has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:59:53,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:59:53,104 INFO L93 Difference]: Finished difference Result 160 states and 168 transitions. [2021-12-16 05:59:53,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-16 05:59:53,105 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-12-16 05:59:53,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:59:53,106 INFO L225 Difference]: With dead ends: 160 [2021-12-16 05:59:53,106 INFO L226 Difference]: Without dead ends: 160 [2021-12-16 05:59:53,106 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2021-12-16 05:59:53,107 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 61 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 05:59:53,107 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 268 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 05:59:53,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-12-16 05:59:53,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 159. [2021-12-16 05:59:53,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 129 states have (on average 1.2945736434108528) internal successors, (167), 158 states have internal predecessors, (167), 0 states have call successors, (0), 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-16 05:59:53,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 167 transitions. [2021-12-16 05:59:53,110 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 167 transitions. Word has length 32 [2021-12-16 05:59:53,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:59:53,110 INFO L470 AbstractCegarLoop]: Abstraction has 159 states and 167 transitions. [2021-12-16 05:59:53,110 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:59:53,110 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 167 transitions. [2021-12-16 05:59:53,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-16 05:59:53,111 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:59:53,111 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:59:53,111 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-16 05:59:53,111 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2021-12-16 05:59:53,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:59:53,112 INFO L85 PathProgramCache]: Analyzing trace with hash 739766257, now seen corresponding path program 1 times [2021-12-16 05:59:53,112 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:59:53,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340051087] [2021-12-16 05:59:53,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:59:53,112 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:59:53,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:59:53,236 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-16 05:59:53,237 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:59:53,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340051087] [2021-12-16 05:59:53,237 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340051087] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:59:53,237 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:59:53,237 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-16 05:59:53,238 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594033641] [2021-12-16 05:59:53,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:59:53,238 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-16 05:59:53,238 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:59:53,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-16 05:59:53,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-16 05:59:53,239 INFO L87 Difference]: Start difference. First operand 159 states and 167 transitions. Second operand has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:59:53,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:59:53,537 INFO L93 Difference]: Finished difference Result 155 states and 163 transitions. [2021-12-16 05:59:53,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-16 05:59:53,538 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-12-16 05:59:53,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:59:53,538 INFO L225 Difference]: With dead ends: 155 [2021-12-16 05:59:53,538 INFO L226 Difference]: Without dead ends: 155 [2021-12-16 05:59:53,539 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2021-12-16 05:59:53,539 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 73 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 05:59:53,540 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 409 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 05:59:53,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-12-16 05:59:53,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 143. [2021-12-16 05:59:53,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 120 states have (on average 1.25) internal successors, (150), 142 states have internal predecessors, (150), 0 states have call successors, (0), 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-16 05:59:53,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 150 transitions. [2021-12-16 05:59:53,542 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 150 transitions. Word has length 32 [2021-12-16 05:59:53,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:59:53,542 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 150 transitions. [2021-12-16 05:59:53,542 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:59:53,542 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 150 transitions. [2021-12-16 05:59:53,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-16 05:59:53,543 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:59:53,543 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:59:53,543 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-16 05:59:53,543 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2021-12-16 05:59:53,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:59:53,543 INFO L85 PathProgramCache]: Analyzing trace with hash -439030339, now seen corresponding path program 1 times [2021-12-16 05:59:53,543 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:59:53,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837205134] [2021-12-16 05:59:53,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:59:53,544 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:59:53,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:59:53,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-16 05:59:53,593 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:59:53,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837205134] [2021-12-16 05:59:53,593 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837205134] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:59:53,593 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:59:53,594 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 05:59:53,594 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348612206] [2021-12-16 05:59:53,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:59:53,594 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 05:59:53,594 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:59:53,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 05:59:53,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 05:59:53,595 INFO L87 Difference]: Start difference. First operand 143 states and 150 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 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-16 05:59:53,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:59:53,662 INFO L93 Difference]: Finished difference Result 152 states and 159 transitions. [2021-12-16 05:59:53,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 05:59:53,662 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2021-12-16 05:59:53,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:59:53,663 INFO L225 Difference]: With dead ends: 152 [2021-12-16 05:59:53,663 INFO L226 Difference]: Without dead ends: 152 [2021-12-16 05:59:53,663 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-16 05:59:53,664 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 6 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:59:53,664 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 266 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:59:53,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-12-16 05:59:53,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 146. [2021-12-16 05:59:53,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 123 states have (on average 1.2439024390243902) internal successors, (153), 145 states have internal predecessors, (153), 0 states have call successors, (0), 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-16 05:59:53,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 153 transitions. [2021-12-16 05:59:53,667 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 153 transitions. Word has length 33 [2021-12-16 05:59:53,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:59:53,667 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 153 transitions. [2021-12-16 05:59:53,668 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 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-16 05:59:53,668 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 153 transitions. [2021-12-16 05:59:53,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-16 05:59:53,668 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:59:53,668 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:59:53,669 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-16 05:59:53,669 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2021-12-16 05:59:53,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:59:53,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1958129913, now seen corresponding path program 1 times [2021-12-16 05:59:53,669 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:59:53,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205249062] [2021-12-16 05:59:53,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:59:53,670 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:59:53,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:59:53,791 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:59:53,791 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:59:53,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205249062] [2021-12-16 05:59:53,791 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205249062] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 05:59:53,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532055309] [2021-12-16 05:59:53,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:59:53,792 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 05:59:53,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 05:59:53,793 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 05:59:53,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-16 05:59:53,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:59:53,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 31 conjunts are in the unsatisfiable core [2021-12-16 05:59:53,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:59:53,970 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-16 05:59:53,973 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-16 05:59:54,011 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-16 05:59:54,011 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2021-12-16 05:59:54,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:59:54,017 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-16 05:59:54,037 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-16 05:59:54,038 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2021-12-16 05:59:54,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:59:54,043 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-16 05:59:54,177 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-16 05:59:54,181 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-16 05:59:54,245 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-16 05:59:54,245 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 05:59:54,384 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-16 05:59:54,384 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1532055309] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 05:59:54,385 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 05:59:54,385 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 14 [2021-12-16 05:59:54,385 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460569786] [2021-12-16 05:59:54,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 05:59:54,386 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-16 05:59:54,386 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:59:54,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-16 05:59:54,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2021-12-16 05:59:54,387 INFO L87 Difference]: Start difference. First operand 146 states and 153 transitions. Second operand has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 0 states have call successors, (0), 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-16 05:59:54,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:59:54,904 INFO L93 Difference]: Finished difference Result 194 states and 204 transitions. [2021-12-16 05:59:54,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-16 05:59:54,904 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-12-16 05:59:54,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:59:54,905 INFO L225 Difference]: With dead ends: 194 [2021-12-16 05:59:54,905 INFO L226 Difference]: Without dead ends: 194 [2021-12-16 05:59:54,906 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2021-12-16 05:59:54,906 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 252 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-16 05:59:54,906 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [252 Valid, 616 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 709 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-16 05:59:54,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-12-16 05:59:54,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 157. [2021-12-16 05:59:54,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 134 states have (on average 1.2388059701492538) internal successors, (166), 156 states have internal predecessors, (166), 0 states have call successors, (0), 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-16 05:59:54,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 166 transitions. [2021-12-16 05:59:54,909 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 166 transitions. Word has length 34 [2021-12-16 05:59:54,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:59:54,909 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 166 transitions. [2021-12-16 05:59:54,909 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 0 states have call successors, (0), 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-16 05:59:54,909 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 166 transitions. [2021-12-16 05:59:54,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-16 05:59:54,910 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:59:54,910 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:59:54,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-16 05:59:55,118 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 05:59:55,118 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2021-12-16 05:59:55,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:59:55,119 INFO L85 PathProgramCache]: Analyzing trace with hash 572484811, now seen corresponding path program 1 times [2021-12-16 05:59:55,119 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:59:55,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603324199] [2021-12-16 05:59:55,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:59:55,119 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:59:55,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 05:59:55,136 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 05:59:55,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 05:59:55,166 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 05:59:55,167 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-16 05:59:55,167 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_LEAK (76 of 77 remaining) [2021-12-16 05:59:55,169 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (75 of 77 remaining) [2021-12-16 05:59:55,169 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (74 of 77 remaining) [2021-12-16 05:59:55,169 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (73 of 77 remaining) [2021-12-16 05:59:55,170 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (72 of 77 remaining) [2021-12-16 05:59:55,170 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (71 of 77 remaining) [2021-12-16 05:59:55,170 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (70 of 77 remaining) [2021-12-16 05:59:55,170 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (69 of 77 remaining) [2021-12-16 05:59:55,170 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION (68 of 77 remaining) [2021-12-16 05:59:55,170 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION (67 of 77 remaining) [2021-12-16 05:59:55,170 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION (66 of 77 remaining) [2021-12-16 05:59:55,171 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION (65 of 77 remaining) [2021-12-16 05:59:55,171 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION (64 of 77 remaining) [2021-12-16 05:59:55,171 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION (63 of 77 remaining) [2021-12-16 05:59:55,171 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION (62 of 77 remaining) [2021-12-16 05:59:55,171 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION (61 of 77 remaining) [2021-12-16 05:59:55,171 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION (60 of 77 remaining) [2021-12-16 05:59:55,172 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION (59 of 77 remaining) [2021-12-16 05:59:55,172 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION (58 of 77 remaining) [2021-12-16 05:59:55,172 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION (57 of 77 remaining) [2021-12-16 05:59:55,172 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATION (56 of 77 remaining) [2021-12-16 05:59:55,172 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION (55 of 77 remaining) [2021-12-16 05:59:55,172 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATION (54 of 77 remaining) [2021-12-16 05:59:55,172 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATION (53 of 77 remaining) [2021-12-16 05:59:55,173 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATION (52 of 77 remaining) [2021-12-16 05:59:55,173 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATION (51 of 77 remaining) [2021-12-16 05:59:55,173 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATION (50 of 77 remaining) [2021-12-16 05:59:55,173 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATION (49 of 77 remaining) [2021-12-16 05:59:55,173 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATION (48 of 77 remaining) [2021-12-16 05:59:55,173 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATION (47 of 77 remaining) [2021-12-16 05:59:55,174 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATION (46 of 77 remaining) [2021-12-16 05:59:55,174 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATION (45 of 77 remaining) [2021-12-16 05:59:55,174 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATION (44 of 77 remaining) [2021-12-16 05:59:55,174 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATION (43 of 77 remaining) [2021-12-16 05:59:55,174 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATION (42 of 77 remaining) [2021-12-16 05:59:55,174 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATION (41 of 77 remaining) [2021-12-16 05:59:55,175 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATION (40 of 77 remaining) [2021-12-16 05:59:55,175 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATION (39 of 77 remaining) [2021-12-16 05:59:55,175 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATION (38 of 77 remaining) [2021-12-16 05:59:55,175 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATION (37 of 77 remaining) [2021-12-16 05:59:55,175 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATION (36 of 77 remaining) [2021-12-16 05:59:55,175 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK (35 of 77 remaining) [2021-12-16 05:59:55,176 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATION (34 of 77 remaining) [2021-12-16 05:59:55,176 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATION (33 of 77 remaining) [2021-12-16 05:59:55,176 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK (32 of 77 remaining) [2021-12-16 05:59:55,176 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK (31 of 77 remaining) [2021-12-16 05:59:55,176 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK (30 of 77 remaining) [2021-12-16 05:59:55,176 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATION (29 of 77 remaining) [2021-12-16 05:59:55,176 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATION (28 of 77 remaining) [2021-12-16 05:59:55,177 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK (27 of 77 remaining) [2021-12-16 05:59:55,177 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATION (26 of 77 remaining) [2021-12-16 05:59:55,177 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATION (25 of 77 remaining) [2021-12-16 05:59:55,177 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATION (24 of 77 remaining) [2021-12-16 05:59:55,177 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATION (23 of 77 remaining) [2021-12-16 05:59:55,177 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK (22 of 77 remaining) [2021-12-16 05:59:55,178 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATION (21 of 77 remaining) [2021-12-16 05:59:55,178 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATION (20 of 77 remaining) [2021-12-16 05:59:55,178 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK (19 of 77 remaining) [2021-12-16 05:59:55,178 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57REQUIRES_VIOLATION (18 of 77 remaining) [2021-12-16 05:59:55,178 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATION (17 of 77 remaining) [2021-12-16 05:59:55,179 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATION (16 of 77 remaining) [2021-12-16 05:59:55,179 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATION (15 of 77 remaining) [2021-12-16 05:59:55,179 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61REQUIRES_VIOLATION (14 of 77 remaining) [2021-12-16 05:59:55,179 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62REQUIRES_VIOLATION (13 of 77 remaining) [2021-12-16 05:59:55,179 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE (12 of 77 remaining) [2021-12-16 05:59:55,179 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE (11 of 77 remaining) [2021-12-16 05:59:55,180 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE (10 of 77 remaining) [2021-12-16 05:59:55,180 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66REQUIRES_VIOLATION (9 of 77 remaining) [2021-12-16 05:59:55,180 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67REQUIRES_VIOLATION (8 of 77 remaining) [2021-12-16 05:59:55,180 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE (7 of 77 remaining) [2021-12-16 05:59:55,180 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE (6 of 77 remaining) [2021-12-16 05:59:55,180 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE (5 of 77 remaining) [2021-12-16 05:59:55,181 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71REQUIRES_VIOLATION (4 of 77 remaining) [2021-12-16 05:59:55,181 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72REQUIRES_VIOLATION (3 of 77 remaining) [2021-12-16 05:59:55,181 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE (2 of 77 remaining) [2021-12-16 05:59:55,181 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE (1 of 77 remaining) [2021-12-16 05:59:55,181 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE (0 of 77 remaining) [2021-12-16 05:59:55,181 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-16 05:59:55,184 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:59:55,187 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-16 05:59:55,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 05:59:55 BoogieIcfgContainer [2021-12-16 05:59:55,236 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-16 05:59:55,236 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-16 05:59:55,236 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-16 05:59:55,236 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-16 05:59:55,237 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 05:59:45" (3/4) ... [2021-12-16 05:59:55,239 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-16 05:59:55,239 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-16 05:59:55,240 INFO L158 Benchmark]: Toolchain (without parser) took 11219.50ms. Allocated memory was 88.1MB in the beginning and 167.8MB in the end (delta: 79.7MB). Free memory was 53.1MB in the beginning and 115.4MB in the end (delta: -62.3MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. [2021-12-16 05:59:55,240 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 88.1MB. Free memory was 59.1MB in the beginning and 59.1MB in the end (delta: 29.9kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-16 05:59:55,240 INFO L158 Benchmark]: CACSL2BoogieTranslator took 467.18ms. Allocated memory was 88.1MB in the beginning and 115.3MB in the end (delta: 27.3MB). Free memory was 53.0MB in the beginning and 83.3MB in the end (delta: -30.3MB). Peak memory consumption was 5.9MB. Max. memory is 16.1GB. [2021-12-16 05:59:55,240 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.02ms. Allocated memory is still 115.3MB. Free memory was 83.3MB in the beginning and 80.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-16 05:59:55,240 INFO L158 Benchmark]: Boogie Preprocessor took 49.20ms. Allocated memory is still 115.3MB. Free memory was 80.8MB in the beginning and 79.1MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-16 05:59:55,241 INFO L158 Benchmark]: RCFGBuilder took 691.53ms. Allocated memory is still 115.3MB. Free memory was 79.1MB in the beginning and 85.6MB in the end (delta: -6.5MB). Peak memory consumption was 23.9MB. Max. memory is 16.1GB. [2021-12-16 05:59:55,241 INFO L158 Benchmark]: TraceAbstraction took 9935.34ms. Allocated memory was 115.3MB in the beginning and 167.8MB in the end (delta: 52.4MB). Free memory was 85.0MB in the beginning and 116.4MB in the end (delta: -31.5MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. [2021-12-16 05:59:55,241 INFO L158 Benchmark]: Witness Printer took 3.11ms. Allocated memory is still 167.8MB. Free memory was 116.4MB in the beginning and 115.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-16 05:59:55,242 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.20ms. Allocated memory is still 88.1MB. Free memory was 59.1MB in the beginning and 59.1MB in the end (delta: 29.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 467.18ms. Allocated memory was 88.1MB in the beginning and 115.3MB in the end (delta: 27.3MB). Free memory was 53.0MB in the beginning and 83.3MB in the end (delta: -30.3MB). Peak memory consumption was 5.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.02ms. Allocated memory is still 115.3MB. Free memory was 83.3MB in the beginning and 80.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.20ms. Allocated memory is still 115.3MB. Free memory was 80.8MB in the beginning and 79.1MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 691.53ms. Allocated memory is still 115.3MB. Free memory was 79.1MB in the beginning and 85.6MB in the end (delta: -6.5MB). Peak memory consumption was 23.9MB. Max. memory is 16.1GB. * TraceAbstraction took 9935.34ms. Allocated memory was 115.3MB in the beginning and 167.8MB in the end (delta: 52.4MB). Free memory was 85.0MB in the beginning and 116.4MB in the end (delta: -31.5MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. * Witness Printer took 3.11ms. Allocated memory is still 167.8MB. Free memory was 116.4MB in the beginning and 115.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 996]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 996. Possible FailurePath: [L998] struct TSLL* null = malloc(sizeof(struct TSLL)); [L999] null->next = ((void*)0) VAL [null={-1:0}] [L1000] null->prev = ((void*)0) VAL [null={-1:0}] [L1001] null->colour = BLACK VAL [null={-1:0}] [L1003] struct TSLL* list = malloc(sizeof(struct TSLL)); [L1004] list->next = null VAL [list={-2:0}, null={-1:0}] [L1005] list->prev = null VAL [list={-2:0}, null={-1:0}] [L1006] list->colour = BLACK VAL [list={-2:0}, null={-1:0}] [L1008] struct TSLL* end = list; VAL [end={-2:0}, list={-2:0}, null={-1:0}] [L1011] COND FALSE !(__VERIFIER_nondet_int()) [L1037] end = null [L1038] end = list VAL [end={-2:0}, list={-2:0}, null={-1:0}] [L1041] COND FALSE !(!(null != end)) VAL [end={-2:0}, list={-2:0}, null={-1:0}] [L1042] EXPR end->colour VAL [end={-2:0}, end->colour=1, list={-2:0}, null={-1:0}] [L1042] COND FALSE !(!(BLACK == end->colour)) [L1043] COND TRUE null != end VAL [end={-2:0}, list={-2:0}, null={-1:0}] [L1045] EXPR end->colour VAL [end={-2:0}, end->colour=1, list={-2:0}, null={-1:0}] [L1045] COND FALSE !(RED == end->colour) [L1052] EXPR end->next VAL [end={-2:0}, end->next={-1:0}, list={-2:0}, null={-1:0}] [L1052] end = end->next [L1043] COND FALSE !(null != end) VAL [end={-1:0}, list={-2:0}, null={-1:0}] [L1056] COND TRUE null != list VAL [end={-1:0}, list={-2:0}, null={-1:0}] [L1058] EXPR list->colour VAL [end={-1:0}, list={-2:0}, list->colour=1, null={-1:0}] [L1058] COND FALSE !(RED == list->colour) [L1067] EXPR list->next VAL [end={-1:0}, list={-2:0}, list->next={-1:0}, null={-1:0}] [L1067] end = list->next [L1068] free(list) VAL [end={-1:0}, list={-2:0}, null={-1:0}] [L1068] free(list) VAL [end={-1:0}, list={-2:0}, null={-1:0}] [L1068] free(list) [L1069] list = end VAL [end={-1:0}, list={-1:0}, null={-1:0}] [L1056] COND FALSE !(null != list) VAL [end={-1:0}, list={-1:0}, null={-1:0}] [L1073] return 0; VAL [\result=0, end={-1:0}, list={-1:0}, null={-1:0}] - UnprovableResult [Line: 999]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 999]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: 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: 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: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: 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: 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 pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1017]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1017]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1021]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1021]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1025]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1025]: 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: 1026]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1027]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1027]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1027]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1027]: 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: 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: 1030]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1030]: 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: 1032]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: 1034]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1042]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1042]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1042]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1047]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1047]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1048]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1049]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1049]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1049]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1052]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1052]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1060]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1060]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1062]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1062]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1067]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1067]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 166 locations, 77 error locations. Started 1 CEGAR loops. OverallTime: 9.8s, OverallIterations: 25, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3097 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3097 mSDsluCounter, 6430 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4198 mSDsCounter, 312 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5938 IncrementalHoareTripleChecker+Invalid, 6250 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 312 mSolverCounterUnsat, 2232 mSDtfsCounter, 5938 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 360 GetRequests, 167 SyntacticMatches, 8 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=166occurred in iteration=0, InterpolantAutomatonStates: 173, 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, 24 MinimizatonAttempts, 348 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 630 NumberOfCodeBlocks, 630 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 625 ConstructedInterpolants, 0 QuantifiedInterpolants, 4188 SizeOfPredicates, 12 NumberOfNonLiveVariables, 622 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 29 InterpolantComputations, 22 PerfectInterpolantSequences, 10/18 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-12-16 05:59:55,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 503e46fe74670dc8b1fd2e8b2c5a408fc01c83cb421ff9aefb8796417315d291 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-16 05:59:57,276 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-16 05:59:57,279 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-16 05:59:57,319 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-16 05:59:57,319 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-16 05:59:57,323 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-16 05:59:57,324 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-16 05:59:57,329 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-16 05:59:57,331 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-16 05:59:57,335 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-16 05:59:57,336 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-16 05:59:57,337 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-16 05:59:57,338 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-16 05:59:57,340 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-16 05:59:57,341 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-16 05:59:57,347 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-16 05:59:57,348 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-16 05:59:57,349 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-16 05:59:57,351 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-16 05:59:57,354 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-16 05:59:57,355 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-16 05:59:57,356 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-16 05:59:57,358 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-16 05:59:57,359 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-16 05:59:57,366 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-16 05:59:57,366 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-16 05:59:57,367 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-16 05:59:57,368 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-16 05:59:57,369 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-16 05:59:57,369 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-16 05:59:57,370 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-16 05:59:57,370 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-16 05:59:57,372 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-16 05:59:57,372 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-16 05:59:57,373 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-16 05:59:57,373 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-16 05:59:57,374 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-16 05:59:57,374 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-16 05:59:57,375 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-16 05:59:57,376 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-16 05:59:57,377 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-16 05:59:57,377 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-12-16 05:59:57,411 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-16 05:59:57,412 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-16 05:59:57,413 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-16 05:59:57,413 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-16 05:59:57,414 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-16 05:59:57,414 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-16 05:59:57,415 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-16 05:59:57,415 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-16 05:59:57,416 INFO L138 SettingsManager]: * Use SBE=true [2021-12-16 05:59:57,416 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-16 05:59:57,417 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-16 05:59:57,417 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-16 05:59:57,417 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-16 05:59:57,417 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-16 05:59:57,417 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-16 05:59:57,417 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-16 05:59:57,418 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-16 05:59:57,418 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-16 05:59:57,418 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-16 05:59:57,418 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-16 05:59:57,418 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-16 05:59:57,419 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-16 05:59:57,419 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-16 05:59:57,419 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-16 05:59:57,424 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-16 05:59:57,424 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-16 05:59:57,424 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-16 05:59:57,424 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 05:59:57,425 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-16 05:59:57,425 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-16 05:59:57,425 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-16 05:59:57,425 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-16 05:59:57,426 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-16 05:59:57,426 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-16 05:59:57,426 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 503e46fe74670dc8b1fd2e8b2c5a408fc01c83cb421ff9aefb8796417315d291 [2021-12-16 05:59:57,769 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 05:59:57,798 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 05:59:57,800 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 05:59:57,802 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 05:59:57,805 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 05:59:57,807 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i [2021-12-16 05:59:57,876 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/863256227/ccbd201a29444dddbe131a30e972daa9/FLAG6f3139039 [2021-12-16 05:59:58,319 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 05:59:58,320 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i [2021-12-16 05:59:58,332 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/863256227/ccbd201a29444dddbe131a30e972daa9/FLAG6f3139039 [2021-12-16 05:59:58,659 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/863256227/ccbd201a29444dddbe131a30e972daa9 [2021-12-16 05:59:58,662 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 05:59:58,663 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 05:59:58,666 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 05:59:58,667 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 05:59:58,670 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 05:59:58,671 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 05:59:58" (1/1) ... [2021-12-16 05:59:58,672 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ef5f7f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:59:58, skipping insertion in model container [2021-12-16 05:59:58,672 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 05:59:58" (1/1) ... [2021-12-16 05:59:58,677 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 05:59:58,727 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 05:59:59,029 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/dll-rb-sentinel-1.i[22665,22678] [2021-12-16 05:59:59,034 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/dll-rb-sentinel-1.i[22735,22748] [2021-12-16 05:59:59,035 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/dll-rb-sentinel-1.i[22799,22812] [2021-12-16 05:59:59,038 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/dll-rb-sentinel-1.i[22894,22907] [2021-12-16 05:59:59,039 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/dll-rb-sentinel-1.i[22966,22979] [2021-12-16 05:59:59,042 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/dll-rb-sentinel-1.i[23105,23118] [2021-12-16 05:59:59,043 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/dll-rb-sentinel-1.i[23179,23192] [2021-12-16 05:59:59,054 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 05:59:59,077 INFO L203 MainTranslator]: Completed pre-run [2021-12-16 05:59:59,127 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/dll-rb-sentinel-1.i[22665,22678] [2021-12-16 05:59:59,129 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/dll-rb-sentinel-1.i[22735,22748] [2021-12-16 05:59:59,129 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/dll-rb-sentinel-1.i[22799,22812] [2021-12-16 05:59:59,131 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/dll-rb-sentinel-1.i[22894,22907] [2021-12-16 05:59:59,133 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/dll-rb-sentinel-1.i[22966,22979] [2021-12-16 05:59:59,137 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/dll-rb-sentinel-1.i[23105,23118] [2021-12-16 05:59:59,139 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/dll-rb-sentinel-1.i[23179,23192] [2021-12-16 05:59:59,145 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 05:59:59,178 INFO L208 MainTranslator]: Completed translation [2021-12-16 05:59:59,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:59:59 WrapperNode [2021-12-16 05:59:59,179 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 05:59:59,180 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-16 05:59:59,181 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-16 05:59:59,181 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-16 05:59:59,187 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:59:59" (1/1) ... [2021-12-16 05:59:59,222 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:59:59" (1/1) ... [2021-12-16 05:59:59,250 INFO L137 Inliner]: procedures = 122, calls = 43, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 164 [2021-12-16 05:59:59,251 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-16 05:59:59,252 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-16 05:59:59,252 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-16 05:59:59,252 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-16 05:59:59,262 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:59:59" (1/1) ... [2021-12-16 05:59:59,265 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:59:59" (1/1) ... [2021-12-16 05:59:59,270 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:59:59" (1/1) ... [2021-12-16 05:59:59,271 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:59:59" (1/1) ... [2021-12-16 05:59:59,286 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:59:59" (1/1) ... [2021-12-16 05:59:59,291 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:59:59" (1/1) ... [2021-12-16 05:59:59,293 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:59:59" (1/1) ... [2021-12-16 05:59:59,295 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-16 05:59:59,299 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-16 05:59:59,299 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-16 05:59:59,299 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-16 05:59:59,300 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:59:59" (1/1) ... [2021-12-16 05:59:59,309 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 05:59:59,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 05:59:59,345 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-16 05:59:59,360 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-16 05:59:59,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-16 05:59:59,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-16 05:59:59,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-16 05:59:59,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-16 05:59:59,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-16 05:59:59,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-16 05:59:59,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-16 05:59:59,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-16 05:59:59,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-16 05:59:59,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-16 05:59:59,528 INFO L236 CfgBuilder]: Building ICFG [2021-12-16 05:59:59,530 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-16 06:00:00,059 INFO L277 CfgBuilder]: Performing block encoding [2021-12-16 06:00:00,064 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-16 06:00:00,065 INFO L301 CfgBuilder]: Removed 17 assume(true) statements. [2021-12-16 06:00:00,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 06:00:00 BoogieIcfgContainer [2021-12-16 06:00:00,066 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-16 06:00:00,068 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-16 06:00:00,068 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-16 06:00:00,070 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-16 06:00:00,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 05:59:58" (1/3) ... [2021-12-16 06:00:00,071 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f2f3b83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 06:00:00, skipping insertion in model container [2021-12-16 06:00:00,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:59:59" (2/3) ... [2021-12-16 06:00:00,072 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f2f3b83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 06:00:00, skipping insertion in model container [2021-12-16 06:00:00,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 06:00:00" (3/3) ... [2021-12-16 06:00:00,073 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel-1.i [2021-12-16 06:00:00,078 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-16 06:00:00,078 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 77 error locations. [2021-12-16 06:00:00,114 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-16 06:00:00,120 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-16 06:00:00,120 INFO L340 AbstractCegarLoop]: Starting to check reachability of 77 error locations. [2021-12-16 06:00:00,134 INFO L276 IsEmpty]: Start isEmpty. Operand has 164 states, 86 states have (on average 2.244186046511628) internal successors, (193), 163 states have internal predecessors, (193), 0 states have call successors, (0), 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-16 06:00:00,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-16 06:00:00,140 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:00,140 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-16 06:00:00,141 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2021-12-16 06:00:00,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:00,146 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-16 06:00:00,155 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 06:00:00,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [684429820] [2021-12-16 06:00:00,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:00,156 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 06:00:00,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 06:00:00,159 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 06:00:00,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-16 06:00:00,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:00,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-16 06:00:00,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:00:00,351 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 06:00:00,361 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-16 06:00:00,361 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 06:00:00,362 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 06:00:00,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [684429820] [2021-12-16 06:00:00,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [684429820] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:00:00,363 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:00:00,363 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 06:00:00,364 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168343034] [2021-12-16 06:00:00,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:00:00,368 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 06:00:00,368 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 06:00:00,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 06:00:00,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 06:00:00,396 INFO L87 Difference]: Start difference. First operand has 164 states, 86 states have (on average 2.244186046511628) internal successors, (193), 163 states have internal predecessors, (193), 0 states have call successors, (0), 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-16 06:00:00,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:00,712 INFO L93 Difference]: Finished difference Result 191 states and 197 transitions. [2021-12-16 06:00:00,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 06:00:00,714 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-16 06:00:00,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:00,730 INFO L225 Difference]: With dead ends: 191 [2021-12-16 06:00:00,732 INFO L226 Difference]: Without dead ends: 187 [2021-12-16 06:00:00,734 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-16 06:00:00,737 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 149 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:00,738 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 110 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 06:00:00,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2021-12-16 06:00:00,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 159. [2021-12-16 06:00:00,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 85 states have (on average 1.9294117647058824) internal successors, (164), 158 states have internal predecessors, (164), 0 states have call successors, (0), 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-16 06:00:00,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 164 transitions. [2021-12-16 06:00:00,773 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 164 transitions. Word has length 3 [2021-12-16 06:00:00,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:00,774 INFO L470 AbstractCegarLoop]: Abstraction has 159 states and 164 transitions. [2021-12-16 06:00:00,774 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-16 06:00:00,774 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 164 transitions. [2021-12-16 06:00:00,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-16 06:00:00,774 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:00,774 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-16 06:00:00,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-12-16 06:00:00,976 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 06:00:00,977 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2021-12-16 06:00:00,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:00,978 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-16 06:00:00,978 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 06:00:00,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [204223425] [2021-12-16 06:00:00,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:00,979 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 06:00:00,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 06:00:00,980 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 06:00:00,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-16 06:00:01,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:01,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-16 06:00:01,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:00:01,067 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 06:00:01,083 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-16 06:00:01,084 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 06:00:01,084 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 06:00:01,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [204223425] [2021-12-16 06:00:01,099 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [204223425] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:00:01,099 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:00:01,100 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 06:00:01,100 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264781114] [2021-12-16 06:00:01,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:00:01,101 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 06:00:01,101 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 06:00:01,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 06:00:01,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 06:00:01,102 INFO L87 Difference]: Start difference. First operand 159 states and 164 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-16 06:00:01,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:01,396 INFO L93 Difference]: Finished difference Result 156 states and 161 transitions. [2021-12-16 06:00:01,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 06:00:01,397 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-16 06:00:01,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:01,398 INFO L225 Difference]: With dead ends: 156 [2021-12-16 06:00:01,398 INFO L226 Difference]: Without dead ends: 156 [2021-12-16 06:00:01,398 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-16 06:00:01,399 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 156 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:01,400 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 89 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 06:00:01,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-12-16 06:00:01,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2021-12-16 06:00:01,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 85 states have (on average 1.8941176470588235) internal successors, (161), 155 states have internal predecessors, (161), 0 states have call successors, (0), 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-16 06:00:01,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 161 transitions. [2021-12-16 06:00:01,417 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 161 transitions. Word has length 3 [2021-12-16 06:00:01,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:01,418 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 161 transitions. [2021-12-16 06:00:01,418 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-16 06:00:01,419 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 161 transitions. [2021-12-16 06:00:01,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-16 06:00:01,419 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:01,420 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:00:01,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-16 06:00:01,627 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 06:00:01,628 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2021-12-16 06:00:01,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:01,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1803026981, now seen corresponding path program 1 times [2021-12-16 06:00:01,629 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 06:00:01,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [758757762] [2021-12-16 06:00:01,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:01,630 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 06:00:01,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 06:00:01,632 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 06:00:01,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-16 06:00:01,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:01,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-16 06:00:01,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:00:01,742 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 06:00:01,748 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-16 06:00:01,748 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 06:00:01,749 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 06:00:01,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [758757762] [2021-12-16 06:00:01,750 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [758757762] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:00:01,750 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:00:01,751 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 06:00:01,751 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55250911] [2021-12-16 06:00:01,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:00:01,751 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 06:00:01,753 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 06:00:01,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 06:00:01,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 06:00:01,754 INFO L87 Difference]: Start difference. First operand 156 states and 161 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:00:01,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:01,969 INFO L93 Difference]: Finished difference Result 155 states and 160 transitions. [2021-12-16 06:00:01,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 06:00:01,969 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-12-16 06:00:01,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:01,970 INFO L225 Difference]: With dead ends: 155 [2021-12-16 06:00:01,971 INFO L226 Difference]: Without dead ends: 155 [2021-12-16 06:00:01,971 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-16 06:00:01,972 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 133 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:01,972 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 95 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 06:00:01,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-12-16 06:00:01,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 151. [2021-12-16 06:00:01,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 87 states have (on average 1.8160919540229885) internal successors, (158), 150 states have internal predecessors, (158), 0 states have call successors, (0), 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-16 06:00:01,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 158 transitions. [2021-12-16 06:00:01,981 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 158 transitions. Word has length 7 [2021-12-16 06:00:01,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:01,981 INFO L470 AbstractCegarLoop]: Abstraction has 151 states and 158 transitions. [2021-12-16 06:00:01,981 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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-16 06:00:01,982 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 158 transitions. [2021-12-16 06:00:01,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-16 06:00:01,982 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:01,982 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:00:01,996 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-16 06:00:02,191 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 06:00:02,192 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2021-12-16 06:00:02,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:02,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1803026982, now seen corresponding path program 1 times [2021-12-16 06:00:02,193 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 06:00:02,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2058070837] [2021-12-16 06:00:02,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:02,193 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 06:00:02,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 06:00:02,195 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 06:00:02,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-16 06:00:02,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:02,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-16 06:00:02,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:00:02,281 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 06:00:02,291 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-16 06:00:02,291 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 06:00:02,292 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 06:00:02,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2058070837] [2021-12-16 06:00:02,292 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2058070837] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:00:02,292 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:00:02,292 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 06:00:02,293 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122167896] [2021-12-16 06:00:02,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:00:02,293 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 06:00:02,294 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 06:00:02,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 06:00:02,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 06:00:02,296 INFO L87 Difference]: Start difference. First operand 151 states and 158 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:00:02,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:02,542 INFO L93 Difference]: Finished difference Result 168 states and 174 transitions. [2021-12-16 06:00:02,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 06:00:02,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-12-16 06:00:02,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:02,544 INFO L225 Difference]: With dead ends: 168 [2021-12-16 06:00:02,545 INFO L226 Difference]: Without dead ends: 168 [2021-12-16 06:00:02,545 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-16 06:00:02,545 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 129 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:02,546 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 102 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 06:00:02,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2021-12-16 06:00:02,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 155. [2021-12-16 06:00:02,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 94 states have (on average 1.7234042553191489) internal successors, (162), 154 states have internal predecessors, (162), 0 states have call successors, (0), 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-16 06:00:02,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 162 transitions. [2021-12-16 06:00:02,563 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 162 transitions. Word has length 7 [2021-12-16 06:00:02,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:02,564 INFO L470 AbstractCegarLoop]: Abstraction has 155 states and 162 transitions. [2021-12-16 06:00:02,564 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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-16 06:00:02,564 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 162 transitions. [2021-12-16 06:00:02,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-16 06:00:02,565 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:02,565 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:00:02,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-16 06:00:02,765 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 06:00:02,766 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2021-12-16 06:00:02,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:02,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1483594255, now seen corresponding path program 1 times [2021-12-16 06:00:02,767 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 06:00:02,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [157437478] [2021-12-16 06:00:02,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:02,767 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 06:00:02,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 06:00:02,768 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 06:00:02,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-16 06:00:02,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:02,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-16 06:00:02,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:00:02,888 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 06:00:02,956 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-12-16 06:00:02,957 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 20 [2021-12-16 06:00:02,973 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-16 06:00:02,974 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 06:00:02,974 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 06:00:02,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [157437478] [2021-12-16 06:00:02,974 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [157437478] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:00:02,974 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:00:02,975 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 06:00:02,975 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156888306] [2021-12-16 06:00:02,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:00:02,975 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 06:00:02,975 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 06:00:02,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 06:00:02,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 06:00:02,976 INFO L87 Difference]: Start difference. First operand 155 states and 162 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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-16 06:00:03,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:03,333 INFO L93 Difference]: Finished difference Result 156 states and 164 transitions. [2021-12-16 06:00:03,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 06:00:03,334 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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-16 06:00:03,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:03,334 INFO L225 Difference]: With dead ends: 156 [2021-12-16 06:00:03,335 INFO L226 Difference]: Without dead ends: 156 [2021-12-16 06:00:03,335 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-16 06:00:03,336 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 211 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:03,336 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [211 Valid, 79 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 06:00:03,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-12-16 06:00:03,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 142. [2021-12-16 06:00:03,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 96 states have (on average 1.5729166666666667) internal successors, (151), 141 states have internal predecessors, (151), 0 states have call successors, (0), 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-16 06:00:03,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 151 transitions. [2021-12-16 06:00:03,342 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 151 transitions. Word has length 12 [2021-12-16 06:00:03,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:03,342 INFO L470 AbstractCegarLoop]: Abstraction has 142 states and 151 transitions. [2021-12-16 06:00:03,342 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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-16 06:00:03,343 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 151 transitions. [2021-12-16 06:00:03,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-16 06:00:03,343 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:03,343 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:00:03,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-12-16 06:00:03,555 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 06:00:03,556 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2021-12-16 06:00:03,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:03,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1483594254, now seen corresponding path program 1 times [2021-12-16 06:00:03,557 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 06:00:03,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [142783295] [2021-12-16 06:00:03,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:03,557 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 06:00:03,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 06:00:03,558 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 06:00:03,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-16 06:00:03,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:03,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-16 06:00:03,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:00:03,700 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 06:00:03,765 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-16 06:00:03,765 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-12-16 06:00:03,778 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-16 06:00:03,778 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 06:00:03,778 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 06:00:03,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [142783295] [2021-12-16 06:00:03,779 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [142783295] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:00:03,779 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:00:03,779 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 06:00:03,779 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274033679] [2021-12-16 06:00:03,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:00:03,780 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 06:00:03,780 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 06:00:03,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 06:00:03,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 06:00:03,781 INFO L87 Difference]: Start difference. First operand 142 states and 151 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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-16 06:00:04,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:04,193 INFO L93 Difference]: Finished difference Result 180 states and 190 transitions. [2021-12-16 06:00:04,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 06:00:04,194 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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-16 06:00:04,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:04,194 INFO L225 Difference]: With dead ends: 180 [2021-12-16 06:00:04,195 INFO L226 Difference]: Without dead ends: 180 [2021-12-16 06:00:04,195 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-16 06:00:04,196 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 175 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:04,196 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [175 Valid, 117 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-16 06:00:04,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2021-12-16 06:00:04,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 151. [2021-12-16 06:00:04,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 106 states have (on average 1.5377358490566038) internal successors, (163), 150 states have internal predecessors, (163), 0 states have call successors, (0), 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-16 06:00:04,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 163 transitions. [2021-12-16 06:00:04,201 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 163 transitions. Word has length 12 [2021-12-16 06:00:04,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:04,201 INFO L470 AbstractCegarLoop]: Abstraction has 151 states and 163 transitions. [2021-12-16 06:00:04,201 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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-16 06:00:04,201 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 163 transitions. [2021-12-16 06:00:04,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-16 06:00:04,202 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:04,202 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:00:04,211 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2021-12-16 06:00:04,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 06:00:04,412 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2021-12-16 06:00:04,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:04,412 INFO L85 PathProgramCache]: Analyzing trace with hash 195115107, now seen corresponding path program 1 times [2021-12-16 06:00:04,412 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 06:00:04,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [392232571] [2021-12-16 06:00:04,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:04,413 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 06:00:04,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 06:00:04,414 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 06:00:04,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-16 06:00:04,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:04,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-16 06:00:04,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:00:04,510 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 06:00:04,540 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-16 06:00:04,541 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2021-12-16 06:00:04,571 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-16 06:00:04,571 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 06:00:04,571 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 06:00:04,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [392232571] [2021-12-16 06:00:04,572 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [392232571] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:00:04,572 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:00:04,572 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-16 06:00:04,572 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254804461] [2021-12-16 06:00:04,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:00:04,573 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 06:00:04,573 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 06:00:04,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 06:00:04,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 06:00:04,574 INFO L87 Difference]: Start difference. First operand 151 states and 163 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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-16 06:00:04,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:04,955 INFO L93 Difference]: Finished difference Result 194 states and 203 transitions. [2021-12-16 06:00:04,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 06:00:04,955 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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-16 06:00:04,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:04,957 INFO L225 Difference]: With dead ends: 194 [2021-12-16 06:00:04,958 INFO L226 Difference]: Without dead ends: 194 [2021-12-16 06:00:04,958 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-16 06:00:04,959 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 296 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:04,959 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [296 Valid, 149 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-16 06:00:04,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-12-16 06:00:04,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 149. [2021-12-16 06:00:04,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 105 states have (on average 1.5142857142857142) internal successors, (159), 148 states have internal predecessors, (159), 0 states have call successors, (0), 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-16 06:00:04,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 159 transitions. [2021-12-16 06:00:04,969 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 159 transitions. Word has length 14 [2021-12-16 06:00:04,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:04,969 INFO L470 AbstractCegarLoop]: Abstraction has 149 states and 159 transitions. [2021-12-16 06:00:04,969 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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-16 06:00:04,969 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 159 transitions. [2021-12-16 06:00:04,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-16 06:00:04,970 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:04,970 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:00:04,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2021-12-16 06:00:05,179 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 06:00:05,180 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2021-12-16 06:00:05,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:05,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1751997431, now seen corresponding path program 1 times [2021-12-16 06:00:05,181 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 06:00:05,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [264177619] [2021-12-16 06:00:05,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:05,181 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 06:00:05,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 06:00:05,182 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 06:00:05,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-16 06:00:05,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:05,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-16 06:00:05,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:00:05,298 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 06:00:05,318 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-16 06:00:05,342 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2021-12-16 06:00:05,350 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-16 06:00:05,350 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 06:00:05,351 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 06:00:05,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [264177619] [2021-12-16 06:00:05,351 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [264177619] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:00:05,351 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:00:05,351 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 06:00:05,351 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145037715] [2021-12-16 06:00:05,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:00:05,352 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 06:00:05,352 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 06:00:05,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 06:00:05,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 06:00:05,353 INFO L87 Difference]: Start difference. First operand 149 states and 159 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 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-16 06:00:05,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:05,709 INFO L93 Difference]: Finished difference Result 148 states and 157 transitions. [2021-12-16 06:00:05,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 06:00:05,710 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2021-12-16 06:00:05,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:05,711 INFO L225 Difference]: With dead ends: 148 [2021-12-16 06:00:05,711 INFO L226 Difference]: Without dead ends: 148 [2021-12-16 06:00:05,711 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 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-16 06:00:05,712 INFO L933 BasicCegarLoop]: 125 mSDtfsCounter, 9 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:05,712 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 334 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 06:00:05,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2021-12-16 06:00:05,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2021-12-16 06:00:05,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 105 states have (on average 1.4952380952380953) internal successors, (157), 147 states have internal predecessors, (157), 0 states have call successors, (0), 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-16 06:00:05,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 157 transitions. [2021-12-16 06:00:05,716 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 157 transitions. Word has length 15 [2021-12-16 06:00:05,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:05,717 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 157 transitions. [2021-12-16 06:00:05,717 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 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-16 06:00:05,717 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 157 transitions. [2021-12-16 06:00:05,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-16 06:00:05,717 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:05,717 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:00:05,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-12-16 06:00:05,918 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 06:00:05,918 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2021-12-16 06:00:05,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:05,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1751997432, now seen corresponding path program 1 times [2021-12-16 06:00:05,919 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 06:00:05,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [788029148] [2021-12-16 06:00:05,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:05,919 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 06:00:05,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 06:00:05,920 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 06:00:05,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-16 06:00:06,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:06,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-16 06:00:06,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:00:06,035 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 06:00:06,057 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-16 06:00:06,063 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-16 06:00:06,096 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-12-16 06:00:06,100 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-16 06:00:06,118 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-16 06:00:06,118 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 06:00:06,118 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 06:00:06,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [788029148] [2021-12-16 06:00:06,119 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [788029148] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:00:06,119 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:00:06,119 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 06:00:06,119 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723811848] [2021-12-16 06:00:06,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:00:06,119 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 06:00:06,119 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 06:00:06,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 06:00:06,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 06:00:06,120 INFO L87 Difference]: Start difference. First operand 148 states and 157 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 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-16 06:00:06,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:06,581 INFO L93 Difference]: Finished difference Result 147 states and 155 transitions. [2021-12-16 06:00:06,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 06:00:06,582 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2021-12-16 06:00:06,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:06,582 INFO L225 Difference]: With dead ends: 147 [2021-12-16 06:00:06,582 INFO L226 Difference]: Without dead ends: 147 [2021-12-16 06:00:06,583 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-16 06:00:06,583 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 4 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:06,584 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 319 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-16 06:00:06,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-12-16 06:00:06,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2021-12-16 06:00:06,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 105 states have (on average 1.4761904761904763) internal successors, (155), 146 states have internal predecessors, (155), 0 states have call successors, (0), 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-16 06:00:06,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 155 transitions. [2021-12-16 06:00:06,588 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 155 transitions. Word has length 15 [2021-12-16 06:00:06,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:06,588 INFO L470 AbstractCegarLoop]: Abstraction has 147 states and 155 transitions. [2021-12-16 06:00:06,588 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 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-16 06:00:06,588 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 155 transitions. [2021-12-16 06:00:06,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-16 06:00:06,589 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:06,589 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:00:06,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-12-16 06:00:06,795 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 06:00:06,796 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2021-12-16 06:00:06,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:06,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1587467776, now seen corresponding path program 1 times [2021-12-16 06:00:06,796 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 06:00:06,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [636231080] [2021-12-16 06:00:06,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:06,796 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 06:00:06,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 06:00:06,797 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 06:00:06,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-12-16 06:00:06,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:06,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-16 06:00:06,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:00:06,914 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-16 06:00:06,995 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-16 06:00:07,005 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-16 06:00:07,005 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 06:00:07,006 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 06:00:07,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [636231080] [2021-12-16 06:00:07,006 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [636231080] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:00:07,006 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:00:07,006 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 06:00:07,006 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846796504] [2021-12-16 06:00:07,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:00:07,007 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 06:00:07,007 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 06:00:07,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 06:00:07,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-16 06:00:07,008 INFO L87 Difference]: Start difference. First operand 147 states and 155 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:00:07,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:07,395 INFO L93 Difference]: Finished difference Result 201 states and 213 transitions. [2021-12-16 06:00:07,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 06:00:07,395 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-12-16 06:00:07,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:07,396 INFO L225 Difference]: With dead ends: 201 [2021-12-16 06:00:07,396 INFO L226 Difference]: Without dead ends: 201 [2021-12-16 06:00:07,396 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-16 06:00:07,397 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 232 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:07,397 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [232 Valid, 347 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 06:00:07,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2021-12-16 06:00:07,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 152. [2021-12-16 06:00:07,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 110 states have (on average 1.4545454545454546) internal successors, (160), 151 states have internal predecessors, (160), 0 states have call successors, (0), 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-16 06:00:07,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 160 transitions. [2021-12-16 06:00:07,401 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 160 transitions. Word has length 17 [2021-12-16 06:00:07,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:07,401 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 160 transitions. [2021-12-16 06:00:07,401 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:00:07,402 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 160 transitions. [2021-12-16 06:00:07,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-16 06:00:07,402 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:07,402 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:00:07,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-12-16 06:00:07,607 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 06:00:07,607 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2021-12-16 06:00:07,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:07,608 INFO L85 PathProgramCache]: Analyzing trace with hash 2045128633, now seen corresponding path program 1 times [2021-12-16 06:00:07,608 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 06:00:07,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [572204901] [2021-12-16 06:00:07,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:07,608 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 06:00:07,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 06:00:07,609 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 06:00:07,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-12-16 06:00:07,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:07,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-16 06:00:07,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:00:07,762 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 06:00:07,808 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-16 06:00:07,808 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2021-12-16 06:00:07,844 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-16 06:00:07,936 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-16 06:00:07,937 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2021-12-16 06:00:07,971 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2021-12-16 06:00:08,030 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-16 06:00:08,030 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 06:00:08,030 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 06:00:08,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [572204901] [2021-12-16 06:00:08,031 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [572204901] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:00:08,031 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:00:08,031 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-16 06:00:08,031 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649262092] [2021-12-16 06:00:08,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:00:08,031 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-16 06:00:08,032 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 06:00:08,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-16 06:00:08,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-12-16 06:00:08,032 INFO L87 Difference]: Start difference. First operand 152 states and 160 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 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-16 06:00:08,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:08,658 INFO L93 Difference]: Finished difference Result 183 states and 195 transitions. [2021-12-16 06:00:08,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-16 06:00:08,659 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2021-12-16 06:00:08,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:08,660 INFO L225 Difference]: With dead ends: 183 [2021-12-16 06:00:08,660 INFO L226 Difference]: Without dead ends: 183 [2021-12-16 06:00:08,661 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2021-12-16 06:00:08,661 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 151 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 109 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:08,662 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 312 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 327 Invalid, 0 Unknown, 109 Unchecked, 0.5s Time] [2021-12-16 06:00:08,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2021-12-16 06:00:08,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 151. [2021-12-16 06:00:08,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 110 states have (on average 1.4454545454545455) internal successors, (159), 150 states have internal predecessors, (159), 0 states have call successors, (0), 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-16 06:00:08,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 159 transitions. [2021-12-16 06:00:08,667 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 159 transitions. Word has length 19 [2021-12-16 06:00:08,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:08,667 INFO L470 AbstractCegarLoop]: Abstraction has 151 states and 159 transitions. [2021-12-16 06:00:08,668 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 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-16 06:00:08,668 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 159 transitions. [2021-12-16 06:00:08,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-16 06:00:08,669 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:08,669 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:00:08,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-12-16 06:00:08,880 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 06:00:08,881 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2021-12-16 06:00:08,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:08,881 INFO L85 PathProgramCache]: Analyzing trace with hash 2045128634, now seen corresponding path program 1 times [2021-12-16 06:00:08,881 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 06:00:08,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1318353187] [2021-12-16 06:00:08,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:08,882 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 06:00:08,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 06:00:08,883 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 06:00:08,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-12-16 06:00:09,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:09,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 22 conjunts are in the unsatisfiable core [2021-12-16 06:00:09,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:00:09,056 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 06:00:09,093 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 06:00:09,102 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-16 06:00:09,103 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2021-12-16 06:00:09,137 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-16 06:00:09,146 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-16 06:00:09,232 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-16 06:00:09,233 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2021-12-16 06:00:09,242 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-16 06:00:09,269 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-16 06:00:09,275 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-16 06:00:09,315 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-16 06:00:09,316 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 06:00:09,316 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 06:00:09,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1318353187] [2021-12-16 06:00:09,316 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1318353187] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:00:09,316 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:00:09,316 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-16 06:00:09,316 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785103251] [2021-12-16 06:00:09,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:00:09,317 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-16 06:00:09,317 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 06:00:09,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-16 06:00:09,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-16 06:00:09,317 INFO L87 Difference]: Start difference. First operand 151 states and 159 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 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-16 06:00:10,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:10,440 INFO L93 Difference]: Finished difference Result 168 states and 177 transitions. [2021-12-16 06:00:10,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-16 06:00:10,440 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2021-12-16 06:00:10,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:10,441 INFO L225 Difference]: With dead ends: 168 [2021-12-16 06:00:10,441 INFO L226 Difference]: Without dead ends: 168 [2021-12-16 06:00:10,442 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2021-12-16 06:00:10,442 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 226 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:10,442 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [226 Valid, 300 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-12-16 06:00:10,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2021-12-16 06:00:10,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 154. [2021-12-16 06:00:10,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 119 states have (on average 1.3949579831932772) internal successors, (166), 153 states have internal predecessors, (166), 0 states have call successors, (0), 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-16 06:00:10,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 166 transitions. [2021-12-16 06:00:10,446 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 166 transitions. Word has length 19 [2021-12-16 06:00:10,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:10,446 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 166 transitions. [2021-12-16 06:00:10,446 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 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-16 06:00:10,446 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 166 transitions. [2021-12-16 06:00:10,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-16 06:00:10,447 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:10,447 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:00:10,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-12-16 06:00:10,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 06:00:10,651 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2021-12-16 06:00:10,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:10,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1915505871, now seen corresponding path program 1 times [2021-12-16 06:00:10,652 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 06:00:10,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [138915257] [2021-12-16 06:00:10,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:10,652 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 06:00:10,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 06:00:10,653 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 06:00:10,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-12-16 06:00:10,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:10,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 22 conjunts are in the unsatisfiable core [2021-12-16 06:00:10,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:00:10,785 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-16 06:00:10,793 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-16 06:00:10,833 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-16 06:00:10,834 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2021-12-16 06:00:10,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 06:00:10,842 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-16 06:00:10,868 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-16 06:00:10,869 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2021-12-16 06:00:10,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 06:00:10,876 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-16 06:00:11,015 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-16 06:00:11,019 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-16 06:00:11,061 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 06:00:11,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 06:00:11,236 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 06:00:11,236 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 06:00:11,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [138915257] [2021-12-16 06:00:11,236 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [138915257] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 06:00:11,236 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 06:00:11,237 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2021-12-16 06:00:11,237 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452838120] [2021-12-16 06:00:11,237 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 06:00:11,237 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-16 06:00:11,237 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 06:00:11,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-16 06:00:11,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-12-16 06:00:11,238 INFO L87 Difference]: Start difference. First operand 154 states and 166 transitions. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 0 states have call successors, (0), 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-16 06:00:12,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:12,086 INFO L93 Difference]: Finished difference Result 205 states and 221 transitions. [2021-12-16 06:00:12,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-16 06:00:12,087 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-12-16 06:00:12,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:12,088 INFO L225 Difference]: With dead ends: 205 [2021-12-16 06:00:12,088 INFO L226 Difference]: Without dead ends: 205 [2021-12-16 06:00:12,088 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2021-12-16 06:00:12,089 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 202 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:12,089 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [202 Valid, 467 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-12-16 06:00:12,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2021-12-16 06:00:12,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 161. [2021-12-16 06:00:12,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 126 states have (on average 1.380952380952381) internal successors, (174), 160 states have internal predecessors, (174), 0 states have call successors, (0), 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-16 06:00:12,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 174 transitions. [2021-12-16 06:00:12,093 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 174 transitions. Word has length 24 [2021-12-16 06:00:12,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:12,093 INFO L470 AbstractCegarLoop]: Abstraction has 161 states and 174 transitions. [2021-12-16 06:00:12,094 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 0 states have call successors, (0), 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-16 06:00:12,094 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 174 transitions. [2021-12-16 06:00:12,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-16 06:00:12,094 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:12,094 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:00:12,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-12-16 06:00:12,295 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 06:00:12,295 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2021-12-16 06:00:12,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:12,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1957524124, now seen corresponding path program 1 times [2021-12-16 06:00:12,296 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 06:00:12,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [132581669] [2021-12-16 06:00:12,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:12,296 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 06:00:12,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 06:00:12,297 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 06:00:12,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-12-16 06:00:12,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:12,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-16 06:00:12,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:00:12,423 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-16 06:00:12,497 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-16 06:00:12,517 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-16 06:00:12,518 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 06:00:12,518 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 06:00:12,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [132581669] [2021-12-16 06:00:12,518 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [132581669] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:00:12,518 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:00:12,518 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 06:00:12,518 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414864893] [2021-12-16 06:00:12,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:00:12,519 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 06:00:12,519 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 06:00:12,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 06:00:12,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-16 06:00:12,520 INFO L87 Difference]: Start difference. First operand 161 states and 174 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:00:12,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:12,947 INFO L93 Difference]: Finished difference Result 184 states and 197 transitions. [2021-12-16 06:00:12,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 06:00:12,948 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-12-16 06:00:12,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:12,949 INFO L225 Difference]: With dead ends: 184 [2021-12-16 06:00:12,949 INFO L226 Difference]: Without dead ends: 184 [2021-12-16 06:00:12,949 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-16 06:00:12,949 INFO L933 BasicCegarLoop]: 98 mSDtfsCounter, 136 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:12,950 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 341 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-16 06:00:12,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2021-12-16 06:00:12,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 161. [2021-12-16 06:00:12,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 126 states have (on average 1.373015873015873) internal successors, (173), 160 states have internal predecessors, (173), 0 states have call successors, (0), 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-16 06:00:12,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 173 transitions. [2021-12-16 06:00:12,953 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 173 transitions. Word has length 24 [2021-12-16 06:00:12,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:12,953 INFO L470 AbstractCegarLoop]: Abstraction has 161 states and 173 transitions. [2021-12-16 06:00:12,954 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:00:12,954 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 173 transitions. [2021-12-16 06:00:12,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-16 06:00:12,954 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:12,954 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:00:12,964 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Ended with exit code 0 [2021-12-16 06:00:13,164 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 06:00:13,164 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2021-12-16 06:00:13,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:13,164 INFO L85 PathProgramCache]: Analyzing trace with hash 915476318, now seen corresponding path program 1 times [2021-12-16 06:00:13,165 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 06:00:13,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [393712173] [2021-12-16 06:00:13,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:13,165 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 06:00:13,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 06:00:13,166 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 06:00:13,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-12-16 06:00:13,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:13,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-16 06:00:13,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:00:13,316 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-16 06:00:13,328 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-16 06:00:13,337 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-16 06:00:13,338 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 06:00:13,338 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 06:00:13,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [393712173] [2021-12-16 06:00:13,338 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [393712173] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:00:13,338 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:00:13,338 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 06:00:13,339 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355590679] [2021-12-16 06:00:13,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:00:13,339 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 06:00:13,339 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 06:00:13,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 06:00:13,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 06:00:13,340 INFO L87 Difference]: Start difference. First operand 161 states and 173 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:00:13,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:13,538 INFO L93 Difference]: Finished difference Result 163 states and 174 transitions. [2021-12-16 06:00:13,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 06:00:13,538 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-12-16 06:00:13,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:13,539 INFO L225 Difference]: With dead ends: 163 [2021-12-16 06:00:13,539 INFO L226 Difference]: Without dead ends: 163 [2021-12-16 06:00:13,540 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 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-16 06:00:13,540 INFO L933 BasicCegarLoop]: 117 mSDtfsCounter, 19 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:13,540 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 280 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 06:00:13,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-12-16 06:00:13,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 159. [2021-12-16 06:00:13,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 125 states have (on average 1.36) internal successors, (170), 158 states have internal predecessors, (170), 0 states have call successors, (0), 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-16 06:00:13,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 170 transitions. [2021-12-16 06:00:13,544 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 170 transitions. Word has length 24 [2021-12-16 06:00:13,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:13,544 INFO L470 AbstractCegarLoop]: Abstraction has 159 states and 170 transitions. [2021-12-16 06:00:13,544 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:00:13,544 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 170 transitions. [2021-12-16 06:00:13,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-16 06:00:13,545 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:13,545 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:00:13,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-12-16 06:00:13,754 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 06:00:13,755 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2021-12-16 06:00:13,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:13,755 INFO L85 PathProgramCache]: Analyzing trace with hash -433833013, now seen corresponding path program 1 times [2021-12-16 06:00:13,755 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 06:00:13,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [313987081] [2021-12-16 06:00:13,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:13,756 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 06:00:13,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 06:00:13,757 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 06:00:13,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-12-16 06:00:13,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:13,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-16 06:00:13,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:00:13,927 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 06:00:13,939 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-16 06:00:13,952 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2021-12-16 06:00:13,959 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-16 06:00:13,960 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 06:00:13,963 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 06:00:13,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [313987081] [2021-12-16 06:00:13,964 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [313987081] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:00:13,964 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:00:13,964 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 06:00:13,964 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175062494] [2021-12-16 06:00:13,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:00:13,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 06:00:13,965 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 06:00:13,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 06:00:13,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 06:00:13,966 INFO L87 Difference]: Start difference. First operand 159 states and 170 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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-16 06:00:14,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:14,243 INFO L93 Difference]: Finished difference Result 158 states and 169 transitions. [2021-12-16 06:00:14,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 06:00:14,244 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-16 06:00:14,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:14,245 INFO L225 Difference]: With dead ends: 158 [2021-12-16 06:00:14,245 INFO L226 Difference]: Without dead ends: 158 [2021-12-16 06:00:14,245 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 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-16 06:00:14,246 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 6 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:14,246 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 309 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 06:00:14,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-12-16 06:00:14,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2021-12-16 06:00:14,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 125 states have (on average 1.352) internal successors, (169), 157 states have internal predecessors, (169), 0 states have call successors, (0), 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-16 06:00:14,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 169 transitions. [2021-12-16 06:00:14,256 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 169 transitions. Word has length 26 [2021-12-16 06:00:14,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:14,256 INFO L470 AbstractCegarLoop]: Abstraction has 158 states and 169 transitions. [2021-12-16 06:00:14,256 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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-16 06:00:14,257 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 169 transitions. [2021-12-16 06:00:14,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-16 06:00:14,257 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:14,257 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:00:14,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-12-16 06:00:14,463 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 06:00:14,463 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2021-12-16 06:00:14,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:14,464 INFO L85 PathProgramCache]: Analyzing trace with hash -433833012, now seen corresponding path program 1 times [2021-12-16 06:00:14,464 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 06:00:14,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [575834834] [2021-12-16 06:00:14,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:14,465 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 06:00:14,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 06:00:14,466 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 06:00:14,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-12-16 06:00:14,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:14,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-16 06:00:14,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:00:14,622 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 06:00:14,636 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-16 06:00:14,641 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-16 06:00:14,675 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-16 06:00:14,678 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-12-16 06:00:14,691 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-16 06:00:14,691 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 06:00:14,691 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 06:00:14,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [575834834] [2021-12-16 06:00:14,691 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [575834834] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:00:14,691 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:00:14,692 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 06:00:14,692 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818990570] [2021-12-16 06:00:14,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:00:14,692 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 06:00:14,692 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 06:00:14,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 06:00:14,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 06:00:14,693 INFO L87 Difference]: Start difference. First operand 158 states and 169 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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-16 06:00:15,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:15,056 INFO L93 Difference]: Finished difference Result 157 states and 168 transitions. [2021-12-16 06:00:15,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 06:00:15,057 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-16 06:00:15,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:15,058 INFO L225 Difference]: With dead ends: 157 [2021-12-16 06:00:15,058 INFO L226 Difference]: Without dead ends: 157 [2021-12-16 06:00:15,058 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 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-16 06:00:15,059 INFO L933 BasicCegarLoop]: 117 mSDtfsCounter, 2 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:15,059 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 299 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 06:00:15,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-12-16 06:00:15,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2021-12-16 06:00:15,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 125 states have (on average 1.344) internal successors, (168), 156 states have internal predecessors, (168), 0 states have call successors, (0), 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-16 06:00:15,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 168 transitions. [2021-12-16 06:00:15,063 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 168 transitions. Word has length 26 [2021-12-16 06:00:15,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:15,063 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 168 transitions. [2021-12-16 06:00:15,063 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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-16 06:00:15,063 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 168 transitions. [2021-12-16 06:00:15,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-16 06:00:15,064 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:15,064 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:00:15,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-12-16 06:00:15,264 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 06:00:15,265 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2021-12-16 06:00:15,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:15,265 INFO L85 PathProgramCache]: Analyzing trace with hash -83332022, now seen corresponding path program 1 times [2021-12-16 06:00:15,265 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 06:00:15,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [645307568] [2021-12-16 06:00:15,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:15,266 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 06:00:15,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 06:00:15,267 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 06:00:15,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-12-16 06:00:15,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:15,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-16 06:00:15,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:00:15,544 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-16 06:00:15,551 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-16 06:00:15,597 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-16 06:00:15,598 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2021-12-16 06:00:15,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 06:00:15,611 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-16 06:00:15,661 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-16 06:00:15,664 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-16 06:00:15,680 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-16 06:00:15,681 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 06:00:15,681 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 06:00:15,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [645307568] [2021-12-16 06:00:15,681 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [645307568] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:00:15,681 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:00:15,681 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-16 06:00:15,682 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353130828] [2021-12-16 06:00:15,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:00:15,682 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 06:00:15,682 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 06:00:15,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 06:00:15,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-16 06:00:15,683 INFO L87 Difference]: Start difference. First operand 157 states and 168 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:00:15,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:15,956 INFO L93 Difference]: Finished difference Result 156 states and 166 transitions. [2021-12-16 06:00:15,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 06:00:15,957 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-16 06:00:15,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:15,957 INFO L225 Difference]: With dead ends: 156 [2021-12-16 06:00:15,958 INFO L226 Difference]: Without dead ends: 156 [2021-12-16 06:00:15,958 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-12-16 06:00:15,958 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 109 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:15,959 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 227 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 06:00:15,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-12-16 06:00:15,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 155. [2021-12-16 06:00:15,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 124 states have (on average 1.3306451612903225) internal successors, (165), 154 states have internal predecessors, (165), 0 states have call successors, (0), 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-16 06:00:15,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 165 transitions. [2021-12-16 06:00:15,967 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 165 transitions. Word has length 27 [2021-12-16 06:00:15,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:15,967 INFO L470 AbstractCegarLoop]: Abstraction has 155 states and 165 transitions. [2021-12-16 06:00:15,968 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:00:15,968 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 165 transitions. [2021-12-16 06:00:15,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-16 06:00:15,971 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:15,972 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:00:15,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2021-12-16 06:00:16,183 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 06:00:16,184 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2021-12-16 06:00:16,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:16,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1522435470, now seen corresponding path program 1 times [2021-12-16 06:00:16,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 06:00:16,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [481296024] [2021-12-16 06:00:16,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:16,185 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 06:00:16,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 06:00:16,186 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 06:00:16,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-12-16 06:00:16,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:16,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-16 06:00:16,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:00:16,402 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 06:00:16,427 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-12-16 06:00:16,428 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 20 [2021-12-16 06:00:16,477 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-12-16 06:00:16,477 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 25 [2021-12-16 06:00:16,495 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-16 06:00:16,545 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-16 06:00:16,546 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2021-12-16 06:00:16,561 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2021-12-16 06:00:16,602 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-16 06:00:16,602 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 06:00:16,603 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 06:00:16,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [481296024] [2021-12-16 06:00:16,603 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [481296024] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:00:16,603 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:00:16,604 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-16 06:00:16,604 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695469362] [2021-12-16 06:00:16,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:00:16,604 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-16 06:00:16,605 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 06:00:16,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-16 06:00:16,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-12-16 06:00:16,605 INFO L87 Difference]: Start difference. First operand 155 states and 165 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:00:17,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:17,411 INFO L93 Difference]: Finished difference Result 169 states and 178 transitions. [2021-12-16 06:00:17,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-16 06:00:17,411 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-16 06:00:17,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:17,412 INFO L225 Difference]: With dead ends: 169 [2021-12-16 06:00:17,412 INFO L226 Difference]: Without dead ends: 169 [2021-12-16 06:00:17,415 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=146, Invalid=360, Unknown=0, NotChecked=0, Total=506 [2021-12-16 06:00:17,416 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 186 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:17,416 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [186 Valid, 287 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-16 06:00:17,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2021-12-16 06:00:17,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 155. [2021-12-16 06:00:17,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 124 states have (on average 1.3225806451612903) internal successors, (164), 154 states have internal predecessors, (164), 0 states have call successors, (0), 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-16 06:00:17,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 164 transitions. [2021-12-16 06:00:17,420 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 164 transitions. Word has length 29 [2021-12-16 06:00:17,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:17,420 INFO L470 AbstractCegarLoop]: Abstraction has 155 states and 164 transitions. [2021-12-16 06:00:17,420 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:00:17,420 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 164 transitions. [2021-12-16 06:00:17,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-16 06:00:17,421 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:17,421 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:00:17,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2021-12-16 06:00:17,632 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 06:00:17,633 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2021-12-16 06:00:17,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:17,633 INFO L85 PathProgramCache]: Analyzing trace with hash -296461252, now seen corresponding path program 1 times [2021-12-16 06:00:17,633 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 06:00:17,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [85213049] [2021-12-16 06:00:17,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:17,634 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 06:00:17,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 06:00:17,635 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 06:00:17,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2021-12-16 06:00:17,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:17,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-16 06:00:17,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:00:17,772 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-16 06:00:17,819 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-16 06:00:17,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-16 06:00:17,831 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 06:00:17,831 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 06:00:17,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [85213049] [2021-12-16 06:00:17,832 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [85213049] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:00:17,832 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:00:17,832 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 06:00:17,832 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427363826] [2021-12-16 06:00:17,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:00:17,832 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 06:00:17,832 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 06:00:17,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 06:00:17,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 06:00:17,833 INFO L87 Difference]: Start difference. First operand 155 states and 164 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 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-16 06:00:17,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:17,978 INFO L93 Difference]: Finished difference Result 165 states and 174 transitions. [2021-12-16 06:00:17,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 06:00:17,979 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-12-16 06:00:17,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:17,979 INFO L225 Difference]: With dead ends: 165 [2021-12-16 06:00:17,979 INFO L226 Difference]: Without dead ends: 165 [2021-12-16 06:00:17,980 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 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-16 06:00:17,980 INFO L933 BasicCegarLoop]: 105 mSDtfsCounter, 7 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:17,980 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 282 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 06:00:17,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2021-12-16 06:00:17,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 158. [2021-12-16 06:00:17,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 127 states have (on average 1.31496062992126) internal successors, (167), 157 states have internal predecessors, (167), 0 states have call successors, (0), 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-16 06:00:17,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 167 transitions. [2021-12-16 06:00:17,984 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 167 transitions. Word has length 30 [2021-12-16 06:00:17,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:17,984 INFO L470 AbstractCegarLoop]: Abstraction has 158 states and 167 transitions. [2021-12-16 06:00:17,984 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 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-16 06:00:17,984 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 167 transitions. [2021-12-16 06:00:17,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-16 06:00:17,985 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:17,985 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:00:17,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2021-12-16 06:00:18,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 06:00:18,188 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2021-12-16 06:00:18,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:18,188 INFO L85 PathProgramCache]: Analyzing trace with hash -275466542, now seen corresponding path program 1 times [2021-12-16 06:00:18,188 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 06:00:18,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [865726029] [2021-12-16 06:00:18,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:18,188 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 06:00:18,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 06:00:18,190 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 06:00:18,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2021-12-16 06:00:18,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:18,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-16 06:00:18,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:00:18,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-16 06:00:18,358 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 06:00:18,358 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 06:00:18,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [865726029] [2021-12-16 06:00:18,358 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [865726029] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:00:18,358 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:00:18,358 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 06:00:18,358 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913327286] [2021-12-16 06:00:18,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:00:18,359 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 06:00:18,359 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 06:00:18,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 06:00:18,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 06:00:18,360 INFO L87 Difference]: Start difference. First operand 158 states and 167 transitions. Second operand has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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-16 06:00:18,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:18,423 INFO L93 Difference]: Finished difference Result 160 states and 169 transitions. [2021-12-16 06:00:18,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 06:00:18,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-12-16 06:00:18,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:18,424 INFO L225 Difference]: With dead ends: 160 [2021-12-16 06:00:18,424 INFO L226 Difference]: Without dead ends: 160 [2021-12-16 06:00:18,424 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 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-16 06:00:18,424 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 70 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:18,425 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 124 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 06:00:18,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-12-16 06:00:18,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2021-12-16 06:00:18,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 129 states have (on average 1.310077519379845) internal successors, (169), 159 states have internal predecessors, (169), 0 states have call successors, (0), 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-16 06:00:18,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 169 transitions. [2021-12-16 06:00:18,428 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 169 transitions. Word has length 30 [2021-12-16 06:00:18,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:18,428 INFO L470 AbstractCegarLoop]: Abstraction has 160 states and 169 transitions. [2021-12-16 06:00:18,428 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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-16 06:00:18,428 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 169 transitions. [2021-12-16 06:00:18,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-16 06:00:18,429 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:18,429 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:00:18,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Ended with exit code 0 [2021-12-16 06:00:18,638 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 06:00:18,639 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2021-12-16 06:00:18,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:18,639 INFO L85 PathProgramCache]: Analyzing trace with hash 2127502605, now seen corresponding path program 1 times [2021-12-16 06:00:18,639 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 06:00:18,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1678999816] [2021-12-16 06:00:18,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:18,640 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 06:00:18,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 06:00:18,641 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 06:00:18,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2021-12-16 06:00:18,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:18,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-16 06:00:18,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:00:18,908 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-16 06:00:18,908 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 26 [2021-12-16 06:00:18,930 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-16 06:00:18,987 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-16 06:00:18,987 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2021-12-16 06:00:19,011 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2021-12-16 06:00:19,048 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-16 06:00:19,048 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 06:00:19,048 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 06:00:19,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1678999816] [2021-12-16 06:00:19,048 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1678999816] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:00:19,048 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:00:19,048 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 06:00:19,049 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871499785] [2021-12-16 06:00:19,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:00:19,049 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 06:00:19,049 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 06:00:19,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 06:00:19,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-12-16 06:00:19,049 INFO L87 Difference]: Start difference. First operand 160 states and 169 transitions. Second operand has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 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-16 06:00:19,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:19,313 INFO L93 Difference]: Finished difference Result 160 states and 169 transitions. [2021-12-16 06:00:19,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-16 06:00:19,314 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-12-16 06:00:19,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:19,314 INFO L225 Difference]: With dead ends: 160 [2021-12-16 06:00:19,314 INFO L226 Difference]: Without dead ends: 160 [2021-12-16 06:00:19,315 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-16 06:00:19,315 INFO L933 BasicCegarLoop]: 88 mSDtfsCounter, 52 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 129 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:19,315 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 260 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 147 Invalid, 0 Unknown, 129 Unchecked, 0.2s Time] [2021-12-16 06:00:19,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-12-16 06:00:19,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 159. [2021-12-16 06:00:19,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 129 states have (on average 1.302325581395349) internal successors, (168), 158 states have internal predecessors, (168), 0 states have call successors, (0), 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-16 06:00:19,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 168 transitions. [2021-12-16 06:00:19,318 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 168 transitions. Word has length 30 [2021-12-16 06:00:19,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:19,319 INFO L470 AbstractCegarLoop]: Abstraction has 159 states and 168 transitions. [2021-12-16 06:00:19,319 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 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-16 06:00:19,319 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 168 transitions. [2021-12-16 06:00:19,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-16 06:00:19,319 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:19,319 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:00:19,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2021-12-16 06:00:19,530 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 06:00:19,530 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2021-12-16 06:00:19,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:19,531 INFO L85 PathProgramCache]: Analyzing trace with hash 2127502606, now seen corresponding path program 1 times [2021-12-16 06:00:19,531 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 06:00:19,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2035746028] [2021-12-16 06:00:19,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:19,531 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 06:00:19,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 06:00:19,532 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 06:00:19,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2021-12-16 06:00:19,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:19,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 19 conjunts are in the unsatisfiable core [2021-12-16 06:00:19,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:00:19,794 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-16 06:00:19,794 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2021-12-16 06:00:19,799 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 06:00:19,815 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-16 06:00:19,819 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-16 06:00:19,880 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-16 06:00:19,880 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2021-12-16 06:00:19,884 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-16 06:00:19,908 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-16 06:00:19,912 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-16 06:00:19,945 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-16 06:00:19,945 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 06:00:19,945 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 06:00:19,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2035746028] [2021-12-16 06:00:19,945 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2035746028] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:00:19,945 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:00:19,945 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 06:00:19,946 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504311924] [2021-12-16 06:00:19,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:00:19,946 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 06:00:19,946 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 06:00:19,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 06:00:19,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-16 06:00:19,947 INFO L87 Difference]: Start difference. First operand 159 states and 168 transitions. Second operand has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 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-16 06:00:20,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:20,512 INFO L93 Difference]: Finished difference Result 155 states and 164 transitions. [2021-12-16 06:00:20,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-16 06:00:20,513 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-12-16 06:00:20,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:20,513 INFO L225 Difference]: With dead ends: 155 [2021-12-16 06:00:20,514 INFO L226 Difference]: Without dead ends: 155 [2021-12-16 06:00:20,514 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2021-12-16 06:00:20,514 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 68 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:20,515 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 335 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-16 06:00:20,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-12-16 06:00:20,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 144. [2021-12-16 06:00:20,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 121 states have (on average 1.256198347107438) internal successors, (152), 143 states have internal predecessors, (152), 0 states have call successors, (0), 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-16 06:00:20,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 152 transitions. [2021-12-16 06:00:20,517 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 152 transitions. Word has length 30 [2021-12-16 06:00:20,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:20,518 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 152 transitions. [2021-12-16 06:00:20,518 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 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-16 06:00:20,518 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 152 transitions. [2021-12-16 06:00:20,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-16 06:00:20,518 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:20,518 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:00:20,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Ended with exit code 0 [2021-12-16 06:00:20,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 06:00:20,727 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2021-12-16 06:00:20,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:20,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1259070453, now seen corresponding path program 1 times [2021-12-16 06:00:20,728 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 06:00:20,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [168229229] [2021-12-16 06:00:20,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:20,728 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 06:00:20,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 06:00:20,729 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 06:00:20,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2021-12-16 06:00:20,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:20,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-16 06:00:20,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:00:21,101 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-16 06:00:21,105 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-16 06:00:21,191 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 06:00:21,192 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 06:00:21,394 INFO L354 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2021-12-16 06:00:21,394 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2021-12-16 06:00:21,406 INFO L354 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2021-12-16 06:00:21,406 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 12 [2021-12-16 06:00:21,480 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 06:00:21,481 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 06:00:21,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [168229229] [2021-12-16 06:00:21,481 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [168229229] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 06:00:21,481 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 06:00:21,481 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2021-12-16 06:00:21,481 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337195061] [2021-12-16 06:00:21,481 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 06:00:21,481 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-16 06:00:21,481 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 06:00:21,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-16 06:00:21,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2021-12-16 06:00:21,482 INFO L87 Difference]: Start difference. First operand 144 states and 152 transitions. Second operand has 17 states, 17 states have (on average 3.764705882352941) internal successors, (64), 17 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:00:22,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:22,862 INFO L93 Difference]: Finished difference Result 196 states and 208 transitions. [2021-12-16 06:00:22,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-16 06:00:22,863 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.764705882352941) internal successors, (64), 17 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-12-16 06:00:22,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:22,864 INFO L225 Difference]: With dead ends: 196 [2021-12-16 06:00:22,864 INFO L226 Difference]: Without dead ends: 196 [2021-12-16 06:00:22,864 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2021-12-16 06:00:22,865 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 246 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 949 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:22,865 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [246 Valid, 651 Invalid, 978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 949 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-12-16 06:00:22,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2021-12-16 06:00:22,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 155. [2021-12-16 06:00:22,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 132 states have (on average 1.25) internal successors, (165), 154 states have internal predecessors, (165), 0 states have call successors, (0), 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-16 06:00:22,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 165 transitions. [2021-12-16 06:00:22,868 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 165 transitions. Word has length 33 [2021-12-16 06:00:22,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:22,868 INFO L470 AbstractCegarLoop]: Abstraction has 155 states and 165 transitions. [2021-12-16 06:00:22,868 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.764705882352941) internal successors, (64), 17 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:00:22,868 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 165 transitions. [2021-12-16 06:00:22,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-16 06:00:22,868 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:22,869 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:00:22,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2021-12-16 06:00:23,069 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 06:00:23,069 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2021-12-16 06:00:23,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:23,070 INFO L85 PathProgramCache]: Analyzing trace with hash 376478029, now seen corresponding path program 1 times [2021-12-16 06:00:23,070 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 06:00:23,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [863522978] [2021-12-16 06:00:23,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:23,070 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 06:00:23,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 06:00:23,071 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 06:00:23,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2021-12-16 06:00:23,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 06:00:23,224 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 06:00:23,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 06:00:23,320 INFO L133 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2021-12-16 06:00:23,320 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-16 06:00:23,321 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_LEAK (76 of 77 remaining) [2021-12-16 06:00:23,323 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (75 of 77 remaining) [2021-12-16 06:00:23,323 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (74 of 77 remaining) [2021-12-16 06:00:23,323 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (73 of 77 remaining) [2021-12-16 06:00:23,324 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (72 of 77 remaining) [2021-12-16 06:00:23,324 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (71 of 77 remaining) [2021-12-16 06:00:23,324 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (70 of 77 remaining) [2021-12-16 06:00:23,324 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (69 of 77 remaining) [2021-12-16 06:00:23,324 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION (68 of 77 remaining) [2021-12-16 06:00:23,325 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION (67 of 77 remaining) [2021-12-16 06:00:23,325 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION (66 of 77 remaining) [2021-12-16 06:00:23,325 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION (65 of 77 remaining) [2021-12-16 06:00:23,325 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION (64 of 77 remaining) [2021-12-16 06:00:23,325 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION (63 of 77 remaining) [2021-12-16 06:00:23,325 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION (62 of 77 remaining) [2021-12-16 06:00:23,326 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION (61 of 77 remaining) [2021-12-16 06:00:23,326 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION (60 of 77 remaining) [2021-12-16 06:00:23,326 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION (59 of 77 remaining) [2021-12-16 06:00:23,326 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION (58 of 77 remaining) [2021-12-16 06:00:23,326 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION (57 of 77 remaining) [2021-12-16 06:00:23,326 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATION (56 of 77 remaining) [2021-12-16 06:00:23,327 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION (55 of 77 remaining) [2021-12-16 06:00:23,327 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATION (54 of 77 remaining) [2021-12-16 06:00:23,327 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATION (53 of 77 remaining) [2021-12-16 06:00:23,327 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATION (52 of 77 remaining) [2021-12-16 06:00:23,327 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATION (51 of 77 remaining) [2021-12-16 06:00:23,327 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATION (50 of 77 remaining) [2021-12-16 06:00:23,328 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATION (49 of 77 remaining) [2021-12-16 06:00:23,328 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATION (48 of 77 remaining) [2021-12-16 06:00:23,328 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATION (47 of 77 remaining) [2021-12-16 06:00:23,328 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATION (46 of 77 remaining) [2021-12-16 06:00:23,328 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATION (45 of 77 remaining) [2021-12-16 06:00:23,328 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATION (44 of 77 remaining) [2021-12-16 06:00:23,329 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATION (43 of 77 remaining) [2021-12-16 06:00:23,329 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATION (42 of 77 remaining) [2021-12-16 06:00:23,329 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATION (41 of 77 remaining) [2021-12-16 06:00:23,329 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATION (40 of 77 remaining) [2021-12-16 06:00:23,329 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATION (39 of 77 remaining) [2021-12-16 06:00:23,329 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATION (38 of 77 remaining) [2021-12-16 06:00:23,329 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATION (37 of 77 remaining) [2021-12-16 06:00:23,330 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATION (36 of 77 remaining) [2021-12-16 06:00:23,330 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK (35 of 77 remaining) [2021-12-16 06:00:23,330 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATION (34 of 77 remaining) [2021-12-16 06:00:23,330 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATION (33 of 77 remaining) [2021-12-16 06:00:23,330 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK (32 of 77 remaining) [2021-12-16 06:00:23,331 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK (31 of 77 remaining) [2021-12-16 06:00:23,331 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK (30 of 77 remaining) [2021-12-16 06:00:23,331 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATION (29 of 77 remaining) [2021-12-16 06:00:23,331 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATION (28 of 77 remaining) [2021-12-16 06:00:23,331 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK (27 of 77 remaining) [2021-12-16 06:00:23,331 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATION (26 of 77 remaining) [2021-12-16 06:00:23,332 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATION (25 of 77 remaining) [2021-12-16 06:00:23,332 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATION (24 of 77 remaining) [2021-12-16 06:00:23,332 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATION (23 of 77 remaining) [2021-12-16 06:00:23,332 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK (22 of 77 remaining) [2021-12-16 06:00:23,332 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATION (21 of 77 remaining) [2021-12-16 06:00:23,332 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATION (20 of 77 remaining) [2021-12-16 06:00:23,333 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK (19 of 77 remaining) [2021-12-16 06:00:23,333 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57REQUIRES_VIOLATION (18 of 77 remaining) [2021-12-16 06:00:23,333 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATION (17 of 77 remaining) [2021-12-16 06:00:23,333 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATION (16 of 77 remaining) [2021-12-16 06:00:23,333 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATION (15 of 77 remaining) [2021-12-16 06:00:23,333 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61REQUIRES_VIOLATION (14 of 77 remaining) [2021-12-16 06:00:23,334 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62REQUIRES_VIOLATION (13 of 77 remaining) [2021-12-16 06:00:23,334 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE (12 of 77 remaining) [2021-12-16 06:00:23,334 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE (11 of 77 remaining) [2021-12-16 06:00:23,334 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE (10 of 77 remaining) [2021-12-16 06:00:23,334 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66REQUIRES_VIOLATION (9 of 77 remaining) [2021-12-16 06:00:23,335 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67REQUIRES_VIOLATION (8 of 77 remaining) [2021-12-16 06:00:23,335 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE (7 of 77 remaining) [2021-12-16 06:00:23,335 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE (6 of 77 remaining) [2021-12-16 06:00:23,335 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE (5 of 77 remaining) [2021-12-16 06:00:23,335 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71REQUIRES_VIOLATION (4 of 77 remaining) [2021-12-16 06:00:23,335 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72REQUIRES_VIOLATION (3 of 77 remaining) [2021-12-16 06:00:23,336 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE (2 of 77 remaining) [2021-12-16 06:00:23,336 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE (1 of 77 remaining) [2021-12-16 06:00:23,336 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE (0 of 77 remaining) [2021-12-16 06:00:23,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2021-12-16 06:00:23,547 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 06:00:23,549 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:00:23,551 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-16 06:00:23,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 06:00:23 BoogieIcfgContainer [2021-12-16 06:00:23,588 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-16 06:00:23,588 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-16 06:00:23,588 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-16 06:00:23,589 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-16 06:00:23,589 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 06:00:00" (3/4) ... [2021-12-16 06:00:23,591 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-16 06:00:23,591 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-16 06:00:23,592 INFO L158 Benchmark]: Toolchain (without parser) took 24928.53ms. Allocated memory was 52.4MB in the beginning and 75.5MB in the end (delta: 23.1MB). Free memory was 28.4MB in the beginning and 51.4MB in the end (delta: -23.0MB). Peak memory consumption was 593.1kB. Max. memory is 16.1GB. [2021-12-16 06:00:23,592 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 52.4MB. Free memory was 34.5MB in the beginning and 34.5MB in the end (delta: 46.3kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-16 06:00:23,592 INFO L158 Benchmark]: CACSL2BoogieTranslator took 513.24ms. Allocated memory was 52.4MB in the beginning and 62.9MB in the end (delta: 10.5MB). Free memory was 28.2MB in the beginning and 37.4MB in the end (delta: -9.2MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. [2021-12-16 06:00:23,592 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.85ms. Allocated memory is still 62.9MB. Free memory was 37.4MB in the beginning and 35.2MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-16 06:00:23,593 INFO L158 Benchmark]: Boogie Preprocessor took 46.22ms. Allocated memory is still 62.9MB. Free memory was 35.1MB in the beginning and 33.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-16 06:00:23,593 INFO L158 Benchmark]: RCFGBuilder took 767.88ms. Allocated memory is still 62.9MB. Free memory was 33.1MB in the beginning and 36.5MB in the end (delta: -3.4MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. [2021-12-16 06:00:23,593 INFO L158 Benchmark]: TraceAbstraction took 23519.86ms. Allocated memory was 62.9MB in the beginning and 75.5MB in the end (delta: 12.6MB). Free memory was 36.0MB in the beginning and 51.4MB in the end (delta: -15.4MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. [2021-12-16 06:00:23,593 INFO L158 Benchmark]: Witness Printer took 3.17ms. Allocated memory is still 75.5MB. Free memory is still 51.4MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-16 06:00:23,594 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.34ms. Allocated memory is still 52.4MB. Free memory was 34.5MB in the beginning and 34.5MB in the end (delta: 46.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 513.24ms. Allocated memory was 52.4MB in the beginning and 62.9MB in the end (delta: 10.5MB). Free memory was 28.2MB in the beginning and 37.4MB in the end (delta: -9.2MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.85ms. Allocated memory is still 62.9MB. Free memory was 37.4MB in the beginning and 35.2MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.22ms. Allocated memory is still 62.9MB. Free memory was 35.1MB in the beginning and 33.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 767.88ms. Allocated memory is still 62.9MB. Free memory was 33.1MB in the beginning and 36.5MB in the end (delta: -3.4MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. * TraceAbstraction took 23519.86ms. Allocated memory was 62.9MB in the beginning and 75.5MB in the end (delta: 12.6MB). Free memory was 36.0MB in the beginning and 51.4MB in the end (delta: -15.4MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. * Witness Printer took 3.17ms. Allocated memory is still 75.5MB. Free memory is still 51.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 996]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 996. Possible FailurePath: [L998] struct TSLL* null = malloc(sizeof(struct TSLL)); [L999] null->next = ((void*)0) VAL [null={5:0}] [L1000] null->prev = ((void*)0) VAL [null={5:0}] [L1001] null->colour = BLACK VAL [null={5:0}] [L1003] struct TSLL* list = malloc(sizeof(struct TSLL)); [L1004] list->next = null VAL [list={6:0}, null={5:0}] [L1005] list->prev = null VAL [list={6:0}, null={5:0}] [L1006] list->colour = BLACK VAL [list={6:0}, null={5:0}] [L1008] struct TSLL* end = list; VAL [end={6:0}, list={6:0}, null={5:0}] [L1011] COND FALSE !(__VERIFIER_nondet_int()) [L1037] end = null [L1038] end = list VAL [end={6:0}, list={6:0}, null={5:0}] [L1041] COND FALSE !(!(null != end)) VAL [end={6:0}, list={6:0}, null={5:0}] [L1042] EXPR end->colour VAL [end={6:0}, end->colour=1, list={6:0}, null={5:0}] [L1042] COND FALSE !(!(BLACK == end->colour)) [L1043] COND TRUE null != end VAL [end={6:0}, list={6:0}, null={5:0}] [L1045] EXPR end->colour VAL [end={6:0}, end->colour=1, list={6:0}, null={5:0}] [L1045] COND FALSE !(RED == end->colour) [L1052] EXPR end->next VAL [end={6:0}, end->next={5:0}, list={6:0}, null={5:0}] [L1052] end = end->next [L1043] COND FALSE !(null != end) VAL [end={5:0}, list={6:0}, null={5:0}] [L1056] COND TRUE null != list VAL [end={5:0}, list={6:0}, null={5:0}] [L1058] EXPR list->colour VAL [end={5:0}, list={6:0}, list->colour=1, null={5:0}] [L1058] COND FALSE !(RED == list->colour) [L1067] EXPR list->next VAL [end={5:0}, list={6:0}, list->next={5:0}, null={5:0}] [L1067] end = list->next [L1068] free(list) VAL [end={5:0}, list={6:0}, null={5:0}] [L1068] free(list) VAL [end={5:0}, list={6:0}, null={5:0}] [L1068] free(list) [L1069] list = end VAL [end={5:0}, list={5:0}, null={5:0}] [L1056] COND FALSE !(null != list) VAL [end={5:0}, list={5:0}, null={5:0}] [L1073] return 0; VAL [\result=0, end={5:0}, list={5:0}, null={5:0}] - UnprovableResult [Line: 999]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 999]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: 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: 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: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: 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: 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 pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1017]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1017]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1021]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1021]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1025]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1025]: 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: 1026]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1027]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1027]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1027]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1027]: 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: 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: 1030]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1030]: 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: 1032]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: 1034]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1042]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1042]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1042]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1047]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1047]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1048]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1049]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1049]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1049]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1052]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1052]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1060]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1060]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1062]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1062]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1067]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1067]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 164 locations, 77 error locations. Started 1 CEGAR loops. OverallTime: 23.4s, OverallIterations: 25, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2974 SdHoareTripleChecker+Valid, 9.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2974 mSDsluCounter, 6215 SdHoareTripleChecker+Invalid, 7.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 238 IncrementalHoareTripleChecker+Unchecked, 4015 mSDsCounter, 288 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5452 IncrementalHoareTripleChecker+Invalid, 5978 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 288 mSolverCounterUnsat, 2200 mSDtfsCounter, 5452 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 582 GetRequests, 408 SyntacticMatches, 4 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=164occurred in iteration=0, InterpolantAutomatonStates: 175, 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, 24 MinimizatonAttempts, 374 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 510 NumberOfCodeBlocks, 510 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 507 ConstructedInterpolants, 4 QuantifiedInterpolants, 3348 SizeOfPredicates, 101 NumberOfNonLiveVariables, 3539 ConjunctsInSsa, 235 ConjunctsInUnsatCore, 26 InterpolantComputations, 22 PerfectInterpolantSequences, 6/12 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-12-16 06:00:23,636 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 Result: UNKNOWN: Overapproximated counterexample