./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 839c364b 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-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 19:45:25,255 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 19:45:25,257 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 19:45:25,290 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 19:45:25,291 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 19:45:25,293 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 19:45:25,294 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 19:45:25,296 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 19:45:25,298 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 19:45:25,301 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 19:45:25,301 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 19:45:25,302 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 19:45:25,302 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 19:45:25,304 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 19:45:25,306 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 19:45:25,308 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 19:45:25,309 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 19:45:25,309 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 19:45:25,311 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 19:45:25,315 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 19:45:25,316 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 19:45:25,317 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 19:45:25,318 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 19:45:25,318 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 19:45:25,323 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 19:45:25,323 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 19:45:25,323 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 19:45:25,324 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 19:45:25,325 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 19:45:25,325 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 19:45:25,326 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 19:45:25,326 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 19:45:25,327 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 19:45:25,328 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 19:45:25,329 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 19:45:25,329 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 19:45:25,330 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 19:45:25,330 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 19:45:25,331 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 19:45:25,331 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 19:45:25,332 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 19:45:25,333 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-14 19:45:25,357 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 19:45:25,358 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 19:45:25,358 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 19:45:25,358 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 19:45:25,359 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 19:45:25,359 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 19:45:25,360 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 19:45:25,360 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 19:45:25,360 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 19:45:25,360 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 19:45:25,361 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 19:45:25,361 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-14 19:45:25,361 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 19:45:25,361 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 19:45:25,362 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 19:45:25,362 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-14 19:45:25,362 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-14 19:45:25,362 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-14 19:45:25,362 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 19:45:25,362 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-14 19:45:25,363 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 19:45:25,363 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 19:45:25,363 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 19:45:25,363 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 19:45:25,363 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 19:45:25,363 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:45:25,364 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 19:45:25,365 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 19:45:25,365 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 19:45:25,365 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 19:45:25,365 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 19:45:25,365 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-14 19:45:25,593 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 19:45:25,612 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 19:45:25,615 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 19:45:25,616 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 19:45:25,616 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 19:45:25,617 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-14 19:45:25,674 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89c314625/5ddf6d9e98104809b649381ce3742876/FLAG772730176 [2021-12-14 19:45:26,205 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 19:45:26,206 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i [2021-12-14 19:45:26,220 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89c314625/5ddf6d9e98104809b649381ce3742876/FLAG772730176 [2021-12-14 19:45:26,437 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89c314625/5ddf6d9e98104809b649381ce3742876 [2021-12-14 19:45:26,439 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 19:45:26,441 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 19:45:26,443 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 19:45:26,443 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 19:45:26,446 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 19:45:26,456 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:45:26" (1/1) ... [2021-12-14 19:45:26,457 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cd46722 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:45:26, skipping insertion in model container [2021-12-14 19:45:26,457 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:45:26" (1/1) ... [2021-12-14 19:45:26,462 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 19:45:26,527 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 19:45:26,901 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-14 19:45:26,918 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-14 19:45:26,919 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-14 19:45:26,921 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-14 19:45:26,921 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-14 19:45:26,923 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[23105,23118] [2021-12-14 19:45:26,924 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-14 19:45:26,931 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:45:26,951 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 19:45:26,997 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-14 19:45:26,998 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-14 19:45:26,999 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-14 19:45:27,003 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-14 19:45:27,004 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-14 19:45:27,005 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-14 19:45:27,007 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-14 19:45:27,012 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:45:27,048 INFO L208 MainTranslator]: Completed translation [2021-12-14 19:45:27,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:45:27 WrapperNode [2021-12-14 19:45:27,049 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 19:45:27,050 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 19:45:27,050 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 19:45:27,050 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 19:45:27,066 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:45:27" (1/1) ... [2021-12-14 19:45:27,075 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:45:27" (1/1) ... [2021-12-14 19:45:27,128 INFO L137 Inliner]: procedures = 119, calls = 43, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 165 [2021-12-14 19:45:27,128 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 19:45:27,129 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 19:45:27,129 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 19:45:27,130 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 19:45:27,153 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:45:27" (1/1) ... [2021-12-14 19:45:27,153 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:45:27" (1/1) ... [2021-12-14 19:45:27,171 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:45:27" (1/1) ... [2021-12-14 19:45:27,173 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:45:27" (1/1) ... [2021-12-14 19:45:27,178 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:45:27" (1/1) ... [2021-12-14 19:45:27,190 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:45:27" (1/1) ... [2021-12-14 19:45:27,202 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:45:27" (1/1) ... [2021-12-14 19:45:27,211 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 19:45:27,212 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 19:45:27,212 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 19:45:27,212 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 19:45:27,213 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:45:27" (1/1) ... [2021-12-14 19:45:27,233 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:45:27,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:45:27,276 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-14 19:45:27,283 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-14 19:45:27,331 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-14 19:45:27,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-14 19:45:27,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-14 19:45:27,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 19:45:27,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-14 19:45:27,348 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-14 19:45:27,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 19:45:27,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 19:45:27,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 19:45:27,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 19:45:27,515 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 19:45:27,528 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 19:45:28,029 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 19:45:28,035 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 19:45:28,038 INFO L301 CfgBuilder]: Removed 17 assume(true) statements. [2021-12-14 19:45:28,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:45:28 BoogieIcfgContainer [2021-12-14 19:45:28,040 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 19:45:28,041 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 19:45:28,042 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 19:45:28,044 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 19:45:28,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 07:45:26" (1/3) ... [2021-12-14 19:45:28,046 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64721fcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:45:28, skipping insertion in model container [2021-12-14 19:45:28,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:45:27" (2/3) ... [2021-12-14 19:45:28,046 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64721fcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:45:28, skipping insertion in model container [2021-12-14 19:45:28,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:45:28" (3/3) ... [2021-12-14 19:45:28,048 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel-1.i [2021-12-14 19:45:28,056 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 19:45:28,057 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 77 error locations. [2021-12-14 19:45:28,104 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 19:45:28,110 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-14 19:45:28,117 INFO L340 AbstractCegarLoop]: Starting to check reachability of 77 error locations. [2021-12-14 19:45:28,147 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-14 19:45:28,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-14 19:45:28,167 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:28,168 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-14 19:45:28,169 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-14 19:45:28,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:28,174 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-14 19:45:28,181 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:28,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294436363] [2021-12-14 19:45:28,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:28,197 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:28,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:28,377 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-14 19:45:28,378 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:28,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294436363] [2021-12-14 19:45:28,379 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294436363] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:28,379 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:28,379 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:45:28,380 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640177434] [2021-12-14 19:45:28,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:28,383 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:45:28,383 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:28,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:45:28,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:45:28,402 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-14 19:45:28,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:28,518 INFO L93 Difference]: Finished difference Result 193 states and 199 transitions. [2021-12-14 19:45:28,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:45:28,520 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-14 19:45:28,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:28,526 INFO L225 Difference]: With dead ends: 193 [2021-12-14 19:45:28,526 INFO L226 Difference]: Without dead ends: 189 [2021-12-14 19:45:28,527 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-14 19:45:28,529 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.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:28,530 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.1s Time] [2021-12-14 19:45:28,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2021-12-14 19:45:28,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 161. [2021-12-14 19:45:28,554 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-14 19:45:28,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 166 transitions. [2021-12-14 19:45:28,557 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 166 transitions. Word has length 3 [2021-12-14 19:45:28,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:28,557 INFO L470 AbstractCegarLoop]: Abstraction has 161 states and 166 transitions. [2021-12-14 19:45:28,557 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-14 19:45:28,558 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 166 transitions. [2021-12-14 19:45:28,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-14 19:45:28,558 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:28,558 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-14 19:45:28,558 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 19:45:28,558 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-14 19:45:28,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:28,559 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-14 19:45:28,559 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:28,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545193129] [2021-12-14 19:45:28,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:28,560 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:28,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:28,590 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-14 19:45:28,590 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:28,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545193129] [2021-12-14 19:45:28,590 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545193129] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:28,590 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:28,591 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:45:28,591 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580146014] [2021-12-14 19:45:28,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:28,592 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:45:28,592 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:28,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:45:28,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:45:28,593 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-14 19:45:28,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:28,744 INFO L93 Difference]: Finished difference Result 158 states and 163 transitions. [2021-12-14 19:45:28,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:45:28,745 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-14 19:45:28,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:28,747 INFO L225 Difference]: With dead ends: 158 [2021-12-14 19:45:28,748 INFO L226 Difference]: Without dead ends: 158 [2021-12-14 19:45:28,748 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-14 19:45:28,749 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-14 19:45:28,750 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-14 19:45:28,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-12-14 19:45:28,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2021-12-14 19:45:28,764 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-14 19:45:28,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 163 transitions. [2021-12-14 19:45:28,766 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 163 transitions. Word has length 3 [2021-12-14 19:45:28,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:28,766 INFO L470 AbstractCegarLoop]: Abstraction has 158 states and 163 transitions. [2021-12-14 19:45:28,767 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-14 19:45:28,767 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 163 transitions. [2021-12-14 19:45:28,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-14 19:45:28,767 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:28,768 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:45:28,768 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 19:45:28,768 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-14 19:45:28,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:28,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1803026981, now seen corresponding path program 1 times [2021-12-14 19:45:28,769 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:28,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216960140] [2021-12-14 19:45:28,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:28,770 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:28,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:28,862 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-14 19:45:28,863 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:28,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216960140] [2021-12-14 19:45:28,863 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216960140] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:28,863 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:28,863 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:45:28,864 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228930275] [2021-12-14 19:45:28,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:28,864 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:45:28,864 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:28,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:45:28,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:45:28,865 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-14 19:45:28,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:28,997 INFO L93 Difference]: Finished difference Result 157 states and 162 transitions. [2021-12-14 19:45:28,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:45:28,998 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-14 19:45:28,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:28,999 INFO L225 Difference]: With dead ends: 157 [2021-12-14 19:45:28,999 INFO L226 Difference]: Without dead ends: 157 [2021-12-14 19:45:28,999 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-14 19:45:29,000 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-14 19:45:29,001 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-14 19:45:29,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-12-14 19:45:29,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 153. [2021-12-14 19:45:29,008 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-14 19:45:29,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 160 transitions. [2021-12-14 19:45:29,008 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 160 transitions. Word has length 7 [2021-12-14 19:45:29,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:29,009 INFO L470 AbstractCegarLoop]: Abstraction has 153 states and 160 transitions. [2021-12-14 19:45:29,009 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-14 19:45:29,009 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 160 transitions. [2021-12-14 19:45:29,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-14 19:45:29,010 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:29,010 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:45:29,010 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-14 19:45:29,010 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-14 19:45:29,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:29,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1803026982, now seen corresponding path program 1 times [2021-12-14 19:45:29,011 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:29,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856192813] [2021-12-14 19:45:29,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:29,011 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:29,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:29,073 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-14 19:45:29,073 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:29,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856192813] [2021-12-14 19:45:29,074 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856192813] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:29,074 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:29,074 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:45:29,074 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991667918] [2021-12-14 19:45:29,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:29,075 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:45:29,075 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:29,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:45:29,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:45:29,076 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-14 19:45:29,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:29,191 INFO L93 Difference]: Finished difference Result 170 states and 176 transitions. [2021-12-14 19:45:29,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:45:29,192 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-14 19:45:29,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:29,193 INFO L225 Difference]: With dead ends: 170 [2021-12-14 19:45:29,193 INFO L226 Difference]: Without dead ends: 170 [2021-12-14 19:45:29,194 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-14 19:45:29,195 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-14 19:45:29,195 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-14 19:45:29,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2021-12-14 19:45:29,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 157. [2021-12-14 19:45:29,201 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-14 19:45:29,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 164 transitions. [2021-12-14 19:45:29,202 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 164 transitions. Word has length 7 [2021-12-14 19:45:29,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:29,203 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 164 transitions. [2021-12-14 19:45:29,203 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-14 19:45:29,203 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 164 transitions. [2021-12-14 19:45:29,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-14 19:45:29,203 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:29,204 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:45:29,204 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-14 19:45:29,204 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-14 19:45:29,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:29,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1253214510, now seen corresponding path program 1 times [2021-12-14 19:45:29,205 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:29,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834121004] [2021-12-14 19:45:29,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:29,206 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:29,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:29,298 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-14 19:45:29,299 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:29,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834121004] [2021-12-14 19:45:29,300 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834121004] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:29,300 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:29,300 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:45:29,300 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233753366] [2021-12-14 19:45:29,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:29,301 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:45:29,301 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:29,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:45:29,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:45:29,302 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-14 19:45:29,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:29,493 INFO L93 Difference]: Finished difference Result 158 states and 166 transitions. [2021-12-14 19:45:29,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 19:45:29,494 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-14 19:45:29,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:29,495 INFO L225 Difference]: With dead ends: 158 [2021-12-14 19:45:29,495 INFO L226 Difference]: Without dead ends: 158 [2021-12-14 19:45:29,496 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-14 19:45:29,497 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.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:29,497 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.2s Time] [2021-12-14 19:45:29,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-12-14 19:45:29,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 144. [2021-12-14 19:45:29,501 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-14 19:45:29,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 153 transitions. [2021-12-14 19:45:29,502 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 153 transitions. Word has length 13 [2021-12-14 19:45:29,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:29,519 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 153 transitions. [2021-12-14 19:45:29,519 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-14 19:45:29,519 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 153 transitions. [2021-12-14 19:45:29,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-14 19:45:29,520 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:29,520 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:45:29,520 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-14 19:45:29,521 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-14 19:45:29,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:29,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1253214511, now seen corresponding path program 1 times [2021-12-14 19:45:29,524 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:29,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34742156] [2021-12-14 19:45:29,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:29,524 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:29,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:29,620 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-14 19:45:29,621 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:29,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34742156] [2021-12-14 19:45:29,621 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34742156] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:29,621 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:29,621 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:45:29,621 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600386536] [2021-12-14 19:45:29,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:29,622 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:45:29,622 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:29,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:45:29,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:45:29,622 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-14 19:45:29,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:29,821 INFO L93 Difference]: Finished difference Result 183 states and 193 transitions. [2021-12-14 19:45:29,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 19:45:29,822 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-14 19:45:29,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:29,823 INFO L225 Difference]: With dead ends: 183 [2021-12-14 19:45:29,823 INFO L226 Difference]: Without dead ends: 183 [2021-12-14 19:45:29,823 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-14 19:45:29,824 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 178 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-14 19:45:29,825 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-14 19:45:29,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2021-12-14 19:45:29,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 154. [2021-12-14 19:45:29,857 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-14 19:45:29,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 166 transitions. [2021-12-14 19:45:29,859 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 166 transitions. Word has length 13 [2021-12-14 19:45:29,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:29,860 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 166 transitions. [2021-12-14 19:45:29,860 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-14 19:45:29,860 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 166 transitions. [2021-12-14 19:45:29,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-14 19:45:29,861 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:29,861 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:45:29,861 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-14 19:45:29,861 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-14 19:45:29,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:29,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1748354145, now seen corresponding path program 1 times [2021-12-14 19:45:29,862 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:29,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706975308] [2021-12-14 19:45:29,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:29,863 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:29,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:29,979 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-14 19:45:29,979 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:29,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706975308] [2021-12-14 19:45:29,980 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706975308] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:29,980 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:29,980 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 19:45:29,980 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395290604] [2021-12-14 19:45:29,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:29,981 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:45:29,981 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:29,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:45:29,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:45:29,984 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-14 19:45:30,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:30,151 INFO L93 Difference]: Finished difference Result 197 states and 206 transitions. [2021-12-14 19:45:30,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 19:45:30,152 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-14 19:45:30,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:30,154 INFO L225 Difference]: With dead ends: 197 [2021-12-14 19:45:30,154 INFO L226 Difference]: Without dead ends: 197 [2021-12-14 19:45:30,155 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-14 19:45:30,156 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-14 19:45:30,156 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-14 19:45:30,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-12-14 19:45:30,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 152. [2021-12-14 19:45:30,161 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-14 19:45:30,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 162 transitions. [2021-12-14 19:45:30,162 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 162 transitions. Word has length 15 [2021-12-14 19:45:30,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:30,162 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 162 transitions. [2021-12-14 19:45:30,162 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-14 19:45:30,162 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 162 transitions. [2021-12-14 19:45:30,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-14 19:45:30,163 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:30,163 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:45:30,163 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-14 19:45:30,164 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-14 19:45:30,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:30,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1637230725, now seen corresponding path program 1 times [2021-12-14 19:45:30,164 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:30,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116800011] [2021-12-14 19:45:30,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:30,165 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:30,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:30,243 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-14 19:45:30,243 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:30,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116800011] [2021-12-14 19:45:30,244 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116800011] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:30,244 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:30,244 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:45:30,244 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609704000] [2021-12-14 19:45:30,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:30,245 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:45:30,245 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:30,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:45:30,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:45:30,247 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-14 19:45:30,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:30,380 INFO L93 Difference]: Finished difference Result 151 states and 160 transitions. [2021-12-14 19:45:30,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:45:30,380 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-14 19:45:30,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:30,381 INFO L225 Difference]: With dead ends: 151 [2021-12-14 19:45:30,382 INFO L226 Difference]: Without dead ends: 151 [2021-12-14 19:45:30,382 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-14 19:45:30,383 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-14 19:45:30,383 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-14 19:45:30,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-12-14 19:45:30,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2021-12-14 19:45:30,386 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-14 19:45:30,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 160 transitions. [2021-12-14 19:45:30,387 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 160 transitions. Word has length 16 [2021-12-14 19:45:30,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:30,388 INFO L470 AbstractCegarLoop]: Abstraction has 151 states and 160 transitions. [2021-12-14 19:45:30,388 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-14 19:45:30,388 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 160 transitions. [2021-12-14 19:45:30,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-14 19:45:30,388 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:30,389 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:45:30,389 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-14 19:45:30,389 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-14 19:45:30,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:30,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1637230724, now seen corresponding path program 1 times [2021-12-14 19:45:30,390 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:30,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625726006] [2021-12-14 19:45:30,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:30,390 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:30,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:30,467 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-14 19:45:30,467 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:30,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625726006] [2021-12-14 19:45:30,467 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625726006] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:30,468 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:30,468 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:45:30,468 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771421954] [2021-12-14 19:45:30,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:30,468 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:45:30,469 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:30,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:45:30,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:45:30,469 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-14 19:45:30,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:30,664 INFO L93 Difference]: Finished difference Result 150 states and 158 transitions. [2021-12-14 19:45:30,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:45:30,665 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-14 19:45:30,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:30,666 INFO L225 Difference]: With dead ends: 150 [2021-12-14 19:45:30,666 INFO L226 Difference]: Without dead ends: 150 [2021-12-14 19:45:30,666 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-14 19:45:30,667 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.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:30,667 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.2s Time] [2021-12-14 19:45:30,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2021-12-14 19:45:30,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2021-12-14 19:45:30,669 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-14 19:45:30,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 158 transitions. [2021-12-14 19:45:30,670 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 158 transitions. Word has length 16 [2021-12-14 19:45:30,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:30,670 INFO L470 AbstractCegarLoop]: Abstraction has 150 states and 158 transitions. [2021-12-14 19:45:30,670 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-14 19:45:30,670 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 158 transitions. [2021-12-14 19:45:30,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-14 19:45:30,670 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:30,670 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-14 19:45:30,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-14 19:45:30,671 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-14 19:45:30,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:30,671 INFO L85 PathProgramCache]: Analyzing trace with hash 154003716, now seen corresponding path program 1 times [2021-12-14 19:45:30,671 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:30,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486224100] [2021-12-14 19:45:30,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:30,671 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:30,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:30,838 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-14 19:45:30,838 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:30,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486224100] [2021-12-14 19:45:30,838 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486224100] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:30,839 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:30,839 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 19:45:30,839 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617356981] [2021-12-14 19:45:30,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:30,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 19:45:30,840 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:30,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 19:45:30,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:45:30,840 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-14 19:45:31,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:31,151 INFO L93 Difference]: Finished difference Result 204 states and 216 transitions. [2021-12-14 19:45:31,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 19:45:31,152 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-14 19:45:31,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:31,152 INFO L225 Difference]: With dead ends: 204 [2021-12-14 19:45:31,152 INFO L226 Difference]: Without dead ends: 204 [2021-12-14 19:45:31,153 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-14 19:45:31,153 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.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:31,154 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.3s Time] [2021-12-14 19:45:31,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2021-12-14 19:45:31,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 155. [2021-12-14 19:45:31,156 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-14 19:45:31,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 163 transitions. [2021-12-14 19:45:31,157 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 163 transitions. Word has length 18 [2021-12-14 19:45:31,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:31,157 INFO L470 AbstractCegarLoop]: Abstraction has 155 states and 163 transitions. [2021-12-14 19:45:31,157 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-14 19:45:31,157 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 163 transitions. [2021-12-14 19:45:31,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-14 19:45:31,157 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:31,157 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-14 19:45:31,157 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-14 19:45:31,158 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-14 19:45:31,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:31,158 INFO L85 PathProgramCache]: Analyzing trace with hash 510771581, now seen corresponding path program 1 times [2021-12-14 19:45:31,158 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:31,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280909691] [2021-12-14 19:45:31,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:31,158 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:31,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:31,255 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-14 19:45:31,255 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:31,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280909691] [2021-12-14 19:45:31,255 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280909691] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:31,256 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:31,256 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 19:45:31,256 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186082344] [2021-12-14 19:45:31,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:31,256 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 19:45:31,257 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:31,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 19:45:31,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-14 19:45:31,257 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-14 19:45:31,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:31,526 INFO L93 Difference]: Finished difference Result 154 states and 162 transitions. [2021-12-14 19:45:31,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 19:45:31,540 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-14 19:45:31,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:31,541 INFO L225 Difference]: With dead ends: 154 [2021-12-14 19:45:31,541 INFO L226 Difference]: Without dead ends: 154 [2021-12-14 19:45:31,541 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2021-12-14 19:45:31,542 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-14 19:45:31,542 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-14 19:45:31,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2021-12-14 19:45:31,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2021-12-14 19:45:31,544 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-14 19:45:31,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 162 transitions. [2021-12-14 19:45:31,544 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 162 transitions. Word has length 20 [2021-12-14 19:45:31,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:31,544 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 162 transitions. [2021-12-14 19:45:31,544 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-14 19:45:31,545 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 162 transitions. [2021-12-14 19:45:31,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-14 19:45:31,545 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:31,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] [2021-12-14 19:45:31,545 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-14 19:45:31,545 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-14 19:45:31,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:31,546 INFO L85 PathProgramCache]: Analyzing trace with hash 510771582, now seen corresponding path program 1 times [2021-12-14 19:45:31,546 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:31,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103472793] [2021-12-14 19:45:31,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:31,546 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:31,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:31,668 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-14 19:45:31,668 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:31,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103472793] [2021-12-14 19:45:31,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103472793] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:31,669 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:31,669 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-14 19:45:31,669 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578662709] [2021-12-14 19:45:31,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:31,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-14 19:45:31,670 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:31,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-14 19:45:31,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:45:31,670 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-14 19:45:32,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:32,184 INFO L93 Difference]: Finished difference Result 172 states and 181 transitions. [2021-12-14 19:45:32,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-14 19:45:32,185 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-14 19:45:32,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:32,186 INFO L225 Difference]: With dead ends: 172 [2021-12-14 19:45:32,186 INFO L226 Difference]: Without dead ends: 172 [2021-12-14 19:45:32,187 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-14 19:45:32,187 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-14 19:45:32,187 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-14 19:45:32,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2021-12-14 19:45:32,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 158. [2021-12-14 19:45:32,190 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-14 19:45:32,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 170 transitions. [2021-12-14 19:45:32,193 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 170 transitions. Word has length 20 [2021-12-14 19:45:32,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:32,193 INFO L470 AbstractCegarLoop]: Abstraction has 158 states and 170 transitions. [2021-12-14 19:45:32,194 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-14 19:45:32,194 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 170 transitions. [2021-12-14 19:45:32,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-14 19:45:32,197 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:32,197 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-14 19:45:32,197 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-14 19:45:32,197 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-14 19:45:32,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:32,198 INFO L85 PathProgramCache]: Analyzing trace with hash 2006006511, now seen corresponding path program 1 times [2021-12-14 19:45:32,198 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:32,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943608006] [2021-12-14 19:45:32,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:32,199 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:32,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:32,355 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-14 19:45:32,356 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:32,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943608006] [2021-12-14 19:45:32,356 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943608006] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:45:32,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612271727] [2021-12-14 19:45:32,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:32,356 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:45:32,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:45:32,362 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-14 19:45:32,368 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-14 19:45:32,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:32,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 33 conjunts are in the unsatisfiable core [2021-12-14 19:45:32,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:45:32,656 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-14 19:45:32,669 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-14 19:45:32,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:45:32,734 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-14 19:45:32,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:45:32,755 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-14 19:45:32,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:45:32,801 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-14 19:45:32,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:45:32,807 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-14 19:45:33,212 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-14 19:45:33,215 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-14 19:45:33,259 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-14 19:45:33,259 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:45:33,383 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-14 19:45:33,383 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612271727] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:45:33,384 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:45:33,384 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 6] total 12 [2021-12-14 19:45:33,384 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336043307] [2021-12-14 19:45:33,384 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:45:33,385 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-14 19:45:33,385 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:33,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-14 19:45:33,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-12-14 19:45:33,386 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-14 19:45:33,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:33,739 INFO L93 Difference]: Finished difference Result 209 states and 225 transitions. [2021-12-14 19:45:33,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 19:45:33,739 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-14 19:45:33,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:33,740 INFO L225 Difference]: With dead ends: 209 [2021-12-14 19:45:33,740 INFO L226 Difference]: Without dead ends: 209 [2021-12-14 19:45:33,740 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2021-12-14 19:45:33,740 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-14 19:45:33,741 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-14 19:45:33,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-12-14 19:45:33,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 165. [2021-12-14 19:45:33,743 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-14 19:45:33,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 178 transitions. [2021-12-14 19:45:33,743 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 178 transitions. Word has length 25 [2021-12-14 19:45:33,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:33,743 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 178 transitions. [2021-12-14 19:45:33,743 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-14 19:45:33,743 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 178 transitions. [2021-12-14 19:45:33,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-14 19:45:33,744 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:33,744 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-14 19:45:33,768 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-14 19:45:33,952 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-14 19:45:33,952 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-14 19:45:33,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:33,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1963988258, now seen corresponding path program 1 times [2021-12-14 19:45:33,953 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:33,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146628523] [2021-12-14 19:45:33,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:33,953 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:33,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:34,041 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-14 19:45:34,041 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:34,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146628523] [2021-12-14 19:45:34,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146628523] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:34,041 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:34,041 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 19:45:34,042 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745659711] [2021-12-14 19:45:34,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:34,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:45:34,042 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:34,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:45:34,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:45:34,043 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-14 19:45:34,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:34,144 INFO L93 Difference]: Finished difference Result 169 states and 180 transitions. [2021-12-14 19:45:34,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 19:45:34,144 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-14 19:45:34,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:34,145 INFO L225 Difference]: With dead ends: 169 [2021-12-14 19:45:34,145 INFO L226 Difference]: Without dead ends: 169 [2021-12-14 19:45:34,145 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-14 19:45:34,146 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-14 19:45:34,146 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-14 19:45:34,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2021-12-14 19:45:34,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 164. [2021-12-14 19:45:34,148 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-14 19:45:34,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 175 transitions. [2021-12-14 19:45:34,148 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 175 transitions. Word has length 25 [2021-12-14 19:45:34,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:34,148 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 175 transitions. [2021-12-14 19:45:34,148 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-14 19:45:34,149 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 175 transitions. [2021-12-14 19:45:34,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-14 19:45:34,149 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:34,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, 1, 1, 1, 1, 1, 1] [2021-12-14 19:45:34,149 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-14 19:45:34,149 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-14 19:45:34,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:34,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1375479745, now seen corresponding path program 1 times [2021-12-14 19:45:34,150 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:34,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486310338] [2021-12-14 19:45:34,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:34,150 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:34,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:34,202 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-14 19:45:34,202 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:34,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486310338] [2021-12-14 19:45:34,202 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486310338] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:34,202 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:34,203 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:45:34,204 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957769015] [2021-12-14 19:45:34,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:34,205 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:45:34,205 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:34,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:45:34,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:45:34,206 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-14 19:45:34,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:34,257 INFO L93 Difference]: Finished difference Result 166 states and 176 transitions. [2021-12-14 19:45:34,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 19:45:34,258 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-14 19:45:34,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:34,258 INFO L225 Difference]: With dead ends: 166 [2021-12-14 19:45:34,258 INFO L226 Difference]: Without dead ends: 166 [2021-12-14 19:45:34,260 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-14 19:45:34,261 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 20 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:34,261 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.0s Time] [2021-12-14 19:45:34,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2021-12-14 19:45:34,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 162. [2021-12-14 19:45:34,265 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-14 19:45:34,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 172 transitions. [2021-12-14 19:45:34,265 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 172 transitions. Word has length 26 [2021-12-14 19:45:34,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:34,266 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 172 transitions. [2021-12-14 19:45:34,266 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-14 19:45:34,266 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 172 transitions. [2021-12-14 19:45:34,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-14 19:45:34,274 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:34,274 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-14 19:45:34,274 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-14 19:45:34,275 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-14 19:45:34,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:34,275 INFO L85 PathProgramCache]: Analyzing trace with hash -752171090, now seen corresponding path program 1 times [2021-12-14 19:45:34,275 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:34,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829319549] [2021-12-14 19:45:34,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:34,276 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:34,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:34,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:45:34,322 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:34,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829319549] [2021-12-14 19:45:34,323 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829319549] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:34,323 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:34,323 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:45:34,323 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995349938] [2021-12-14 19:45:34,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:34,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:45:34,324 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:34,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:45:34,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:45:34,324 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-14 19:45:34,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:34,420 INFO L93 Difference]: Finished difference Result 161 states and 171 transitions. [2021-12-14 19:45:34,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:45:34,420 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-14 19:45:34,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:34,422 INFO L225 Difference]: With dead ends: 161 [2021-12-14 19:45:34,422 INFO L226 Difference]: Without dead ends: 161 [2021-12-14 19:45:34,422 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-14 19:45:34,422 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-14 19:45:34,423 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-14 19:45:34,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-12-14 19:45:34,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2021-12-14 19:45:34,425 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-14 19:45:34,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 171 transitions. [2021-12-14 19:45:34,426 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 171 transitions. Word has length 28 [2021-12-14 19:45:34,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:34,426 INFO L470 AbstractCegarLoop]: Abstraction has 161 states and 171 transitions. [2021-12-14 19:45:34,426 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-14 19:45:34,426 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 171 transitions. [2021-12-14 19:45:34,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-14 19:45:34,428 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:34,428 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-14 19:45:34,428 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-14 19:45:34,429 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-14 19:45:34,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:34,429 INFO L85 PathProgramCache]: Analyzing trace with hash -752171089, now seen corresponding path program 1 times [2021-12-14 19:45:34,429 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:34,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660761266] [2021-12-14 19:45:34,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:34,430 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:34,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:34,519 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-14 19:45:34,519 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:34,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660761266] [2021-12-14 19:45:34,520 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660761266] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:34,520 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:34,520 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:45:34,520 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294113103] [2021-12-14 19:45:34,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:34,520 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:45:34,520 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:34,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:45:34,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:45:34,521 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-14 19:45:34,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:34,601 INFO L93 Difference]: Finished difference Result 160 states and 170 transitions. [2021-12-14 19:45:34,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:45:34,602 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-14 19:45:34,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:34,602 INFO L225 Difference]: With dead ends: 160 [2021-12-14 19:45:34,602 INFO L226 Difference]: Without dead ends: 160 [2021-12-14 19:45:34,602 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-14 19:45:34,603 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-14 19:45:34,603 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-14 19:45:34,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-12-14 19:45:34,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2021-12-14 19:45:34,605 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-14 19:45:34,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 170 transitions. [2021-12-14 19:45:34,605 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 170 transitions. Word has length 28 [2021-12-14 19:45:34,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:34,606 INFO L470 AbstractCegarLoop]: Abstraction has 160 states and 170 transitions. [2021-12-14 19:45:34,606 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-14 19:45:34,606 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 170 transitions. [2021-12-14 19:45:34,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-14 19:45:34,606 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:34,606 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-14 19:45:34,606 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-14 19:45:34,607 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-14 19:45:34,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:34,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1361877815, now seen corresponding path program 1 times [2021-12-14 19:45:34,607 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:34,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699913422] [2021-12-14 19:45:34,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:34,607 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:34,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:34,670 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-14 19:45:34,670 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:34,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699913422] [2021-12-14 19:45:34,670 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699913422] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:34,670 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:34,671 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:45:34,671 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300457915] [2021-12-14 19:45:34,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:34,671 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:45:34,671 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:34,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:45:34,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:45:34,672 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-14 19:45:34,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:34,723 INFO L93 Difference]: Finished difference Result 159 states and 168 transitions. [2021-12-14 19:45:34,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 19:45:34,724 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-14 19:45:34,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:34,724 INFO L225 Difference]: With dead ends: 159 [2021-12-14 19:45:34,724 INFO L226 Difference]: Without dead ends: 159 [2021-12-14 19:45:34,724 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-14 19:45:34,725 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 15 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:34,725 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.0s Time] [2021-12-14 19:45:34,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-12-14 19:45:34,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 158. [2021-12-14 19:45:34,727 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-14 19:45:34,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 167 transitions. [2021-12-14 19:45:34,727 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 167 transitions. Word has length 29 [2021-12-14 19:45:34,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:34,727 INFO L470 AbstractCegarLoop]: Abstraction has 158 states and 167 transitions. [2021-12-14 19:45:34,727 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-14 19:45:34,727 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 167 transitions. [2021-12-14 19:45:34,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-14 19:45:34,728 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:34,728 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-14 19:45:34,728 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-14 19:45:34,728 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-14 19:45:34,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:34,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1200575117, now seen corresponding path program 1 times [2021-12-14 19:45:34,728 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:34,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404609822] [2021-12-14 19:45:34,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:34,728 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:34,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:34,862 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-14 19:45:34,862 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:34,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404609822] [2021-12-14 19:45:34,862 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404609822] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:34,862 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:34,862 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-14 19:45:34,862 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759771049] [2021-12-14 19:45:34,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:34,863 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-14 19:45:34,863 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:34,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-14 19:45:34,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-12-14 19:45:34,863 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-14 19:45:35,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:35,201 INFO L93 Difference]: Finished difference Result 200 states and 209 transitions. [2021-12-14 19:45:35,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-14 19:45:35,201 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-14 19:45:35,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:35,202 INFO L225 Difference]: With dead ends: 200 [2021-12-14 19:45:35,202 INFO L226 Difference]: Without dead ends: 200 [2021-12-14 19:45:35,203 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=204, Invalid=498, Unknown=0, NotChecked=0, Total=702 [2021-12-14 19:45:35,218 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.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:35,218 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.2s Time] [2021-12-14 19:45:35,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2021-12-14 19:45:35,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 158. [2021-12-14 19:45:35,220 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-14 19:45:35,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 166 transitions. [2021-12-14 19:45:35,220 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 166 transitions. Word has length 31 [2021-12-14 19:45:35,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:35,220 INFO L470 AbstractCegarLoop]: Abstraction has 158 states and 166 transitions. [2021-12-14 19:45:35,221 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-14 19:45:35,221 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 166 transitions. [2021-12-14 19:45:35,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-14 19:45:35,221 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:35,221 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-14 19:45:35,221 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-14 19:45:35,221 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-14 19:45:35,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:35,221 INFO L85 PathProgramCache]: Analyzing trace with hash -2047381958, now seen corresponding path program 1 times [2021-12-14 19:45:35,222 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:35,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430884295] [2021-12-14 19:45:35,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:35,222 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:35,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:35,272 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-14 19:45:35,272 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:35,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430884295] [2021-12-14 19:45:35,273 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430884295] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:45:35,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490082704] [2021-12-14 19:45:35,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:35,273 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:45:35,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:45:35,274 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-14 19:45:35,275 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-14 19:45:35,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:35,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 19:45:35,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:45:35,419 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-14 19:45:35,419 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:45:35,420 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490082704] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:35,420 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 19:45:35,420 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2021-12-14 19:45:35,420 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136804100] [2021-12-14 19:45:35,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:35,420 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:45:35,421 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:35,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:45:35,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-12-14 19:45:35,421 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-14 19:45:35,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:35,445 INFO L93 Difference]: Finished difference Result 160 states and 168 transitions. [2021-12-14 19:45:35,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:45:35,446 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-14 19:45:35,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:35,446 INFO L225 Difference]: With dead ends: 160 [2021-12-14 19:45:35,446 INFO L226 Difference]: Without dead ends: 160 [2021-12-14 19:45:35,447 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-14 19:45:35,447 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-14 19:45:35,447 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-14 19:45:35,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-12-14 19:45:35,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2021-12-14 19:45:35,453 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-14 19:45:35,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 168 transitions. [2021-12-14 19:45:35,454 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 168 transitions. Word has length 31 [2021-12-14 19:45:35,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:35,454 INFO L470 AbstractCegarLoop]: Abstraction has 160 states and 168 transitions. [2021-12-14 19:45:35,454 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-14 19:45:35,455 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 168 transitions. [2021-12-14 19:45:35,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-14 19:45:35,456 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:35,456 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-14 19:45:35,489 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-14 19:45:35,675 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-14 19:45:35,675 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-14 19:45:35,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:35,676 INFO L85 PathProgramCache]: Analyzing trace with hash 739766256, now seen corresponding path program 1 times [2021-12-14 19:45:35,676 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:35,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43846539] [2021-12-14 19:45:35,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:35,676 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:35,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:35,795 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-14 19:45:35,795 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:35,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43846539] [2021-12-14 19:45:35,795 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43846539] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:35,795 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:35,796 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 19:45:35,796 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297798679] [2021-12-14 19:45:35,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:35,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 19:45:35,796 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:35,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 19:45:35,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:45:35,797 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-14 19:45:36,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:36,048 INFO L93 Difference]: Finished difference Result 160 states and 168 transitions. [2021-12-14 19:45:36,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 19:45:36,049 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-14 19:45:36,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:36,049 INFO L225 Difference]: With dead ends: 160 [2021-12-14 19:45:36,049 INFO L226 Difference]: Without dead ends: 160 [2021-12-14 19:45:36,049 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2021-12-14 19:45:36,050 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-14 19:45:36,050 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-14 19:45:36,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-12-14 19:45:36,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 159. [2021-12-14 19:45:36,052 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-14 19:45:36,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 167 transitions. [2021-12-14 19:45:36,052 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 167 transitions. Word has length 32 [2021-12-14 19:45:36,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:36,052 INFO L470 AbstractCegarLoop]: Abstraction has 159 states and 167 transitions. [2021-12-14 19:45:36,053 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-14 19:45:36,053 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 167 transitions. [2021-12-14 19:45:36,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-14 19:45:36,053 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:36,053 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-14 19:45:36,053 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-14 19:45:36,053 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-14 19:45:36,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:36,053 INFO L85 PathProgramCache]: Analyzing trace with hash 739766257, now seen corresponding path program 1 times [2021-12-14 19:45:36,053 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:36,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365400527] [2021-12-14 19:45:36,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:36,054 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:36,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:36,167 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-14 19:45:36,168 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:36,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365400527] [2021-12-14 19:45:36,168 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365400527] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:36,168 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:36,168 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 19:45:36,168 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954309805] [2021-12-14 19:45:36,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:36,169 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 19:45:36,169 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:36,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 19:45:36,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-14 19:45:36,170 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-14 19:45:36,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:36,545 INFO L93 Difference]: Finished difference Result 155 states and 163 transitions. [2021-12-14 19:45:36,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 19:45:36,547 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-14 19:45:36,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:36,547 INFO L225 Difference]: With dead ends: 155 [2021-12-14 19:45:36,547 INFO L226 Difference]: Without dead ends: 155 [2021-12-14 19:45:36,548 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-14 19:45:36,548 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.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:36,548 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.3s Time] [2021-12-14 19:45:36,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-12-14 19:45:36,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 143. [2021-12-14 19:45:36,550 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-14 19:45:36,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 150 transitions. [2021-12-14 19:45:36,550 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 150 transitions. Word has length 32 [2021-12-14 19:45:36,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:36,550 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 150 transitions. [2021-12-14 19:45:36,550 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-14 19:45:36,550 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 150 transitions. [2021-12-14 19:45:36,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-14 19:45:36,551 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:36,551 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:45:36,551 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-14 19:45:36,551 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-14 19:45:36,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:36,551 INFO L85 PathProgramCache]: Analyzing trace with hash -439030339, now seen corresponding path program 1 times [2021-12-14 19:45:36,551 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:36,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965048322] [2021-12-14 19:45:36,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:36,551 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:36,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:36,633 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-14 19:45:36,634 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:36,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965048322] [2021-12-14 19:45:36,634 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965048322] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:45:36,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307393854] [2021-12-14 19:45:36,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:36,634 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:45:36,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:45:36,651 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-14 19:45:36,652 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-14 19:45:36,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:36,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-14 19:45:36,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:45:36,824 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-14 19:45:36,880 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-14 19:45:36,893 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-14 19:45:36,893 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:45:36,893 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307393854] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:36,893 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 19:45:36,894 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2021-12-14 19:45:36,894 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023366729] [2021-12-14 19:45:36,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:36,894 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:45:36,894 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:36,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:45:36,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-12-14 19:45:36,895 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-14 19:45:36,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:36,976 INFO L93 Difference]: Finished difference Result 152 states and 159 transitions. [2021-12-14 19:45:36,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 19:45:36,976 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-14 19:45:36,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:36,977 INFO L225 Difference]: With dead ends: 152 [2021-12-14 19:45:36,977 INFO L226 Difference]: Without dead ends: 152 [2021-12-14 19:45:36,977 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:45:36,978 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 6 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-14 19:45:36,978 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-14 19:45:36,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-12-14 19:45:36,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 146. [2021-12-14 19:45:36,980 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-14 19:45:36,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 153 transitions. [2021-12-14 19:45:36,981 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 153 transitions. Word has length 33 [2021-12-14 19:45:36,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:36,981 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 153 transitions. [2021-12-14 19:45:36,981 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-14 19:45:36,981 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 153 transitions. [2021-12-14 19:45:36,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-14 19:45:36,982 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:36,982 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-14 19:45:37,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-14 19:45:37,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:45:37,195 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-14 19:45:37,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:37,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1958129913, now seen corresponding path program 1 times [2021-12-14 19:45:37,196 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:37,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973962529] [2021-12-14 19:45:37,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:37,196 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:37,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:37,337 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-14 19:45:37,338 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:37,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973962529] [2021-12-14 19:45:37,338 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973962529] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:45:37,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755339868] [2021-12-14 19:45:37,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:37,339 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:45:37,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:45:37,363 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:45:37,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-14 19:45:37,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:37,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 31 conjunts are in the unsatisfiable core [2021-12-14 19:45:37,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:45:37,579 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-14 19:45:37,584 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-14 19:45:37,624 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-14 19:45:37,624 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-14 19:45:37,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:45:37,644 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-14 19:45:37,663 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-14 19:45:37,663 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-14 19:45:37,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:45:37,669 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-14 19:45:37,839 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-14 19:45:37,842 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-14 19:45:37,939 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-14 19:45:37,939 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:45:38,135 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-14 19:45:38,136 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1755339868] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:45:38,136 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:45:38,136 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 14 [2021-12-14 19:45:38,136 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374469034] [2021-12-14 19:45:38,136 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:45:38,137 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-14 19:45:38,137 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:38,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-14 19:45:38,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2021-12-14 19:45:38,137 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-14 19:45:38,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:38,643 INFO L93 Difference]: Finished difference Result 194 states and 204 transitions. [2021-12-14 19:45:38,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-14 19:45:38,644 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-14 19:45:38,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:38,644 INFO L225 Difference]: With dead ends: 194 [2021-12-14 19:45:38,645 INFO L226 Difference]: Without dead ends: 194 [2021-12-14 19:45:38,645 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2021-12-14 19:45:38,645 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 264 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:38,645 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [264 Valid, 520 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-14 19:45:38,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-12-14 19:45:38,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 157. [2021-12-14 19:45:38,647 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-14 19:45:38,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 166 transitions. [2021-12-14 19:45:38,648 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 166 transitions. Word has length 34 [2021-12-14 19:45:38,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:38,648 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 166 transitions. [2021-12-14 19:45:38,648 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-14 19:45:38,648 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 166 transitions. [2021-12-14 19:45:38,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-14 19:45:38,648 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:38,648 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-14 19:45:38,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-14 19:45:38,859 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:45:38,859 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-14 19:45:38,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:38,860 INFO L85 PathProgramCache]: Analyzing trace with hash 572484811, now seen corresponding path program 1 times [2021-12-14 19:45:38,860 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:38,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004933870] [2021-12-14 19:45:38,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:38,860 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:38,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 19:45:38,873 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 19:45:38,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 19:45:38,902 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 19:45:38,903 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-14 19:45:38,903 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_LEAK (76 of 77 remaining) [2021-12-14 19:45:38,904 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (75 of 77 remaining) [2021-12-14 19:45:38,905 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (74 of 77 remaining) [2021-12-14 19:45:38,905 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (73 of 77 remaining) [2021-12-14 19:45:38,905 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (72 of 77 remaining) [2021-12-14 19:45:38,905 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (71 of 77 remaining) [2021-12-14 19:45:38,905 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (70 of 77 remaining) [2021-12-14 19:45:38,905 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (69 of 77 remaining) [2021-12-14 19:45:38,905 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION (68 of 77 remaining) [2021-12-14 19:45:38,906 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION (67 of 77 remaining) [2021-12-14 19:45:38,906 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION (66 of 77 remaining) [2021-12-14 19:45:38,906 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION (65 of 77 remaining) [2021-12-14 19:45:38,906 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION (64 of 77 remaining) [2021-12-14 19:45:38,906 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION (63 of 77 remaining) [2021-12-14 19:45:38,906 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION (62 of 77 remaining) [2021-12-14 19:45:38,906 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION (61 of 77 remaining) [2021-12-14 19:45:38,906 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION (60 of 77 remaining) [2021-12-14 19:45:38,907 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION (59 of 77 remaining) [2021-12-14 19:45:38,907 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION (58 of 77 remaining) [2021-12-14 19:45:38,907 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION (57 of 77 remaining) [2021-12-14 19:45:38,907 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATION (56 of 77 remaining) [2021-12-14 19:45:38,907 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION (55 of 77 remaining) [2021-12-14 19:45:38,907 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATION (54 of 77 remaining) [2021-12-14 19:45:38,907 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATION (53 of 77 remaining) [2021-12-14 19:45:38,907 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATION (52 of 77 remaining) [2021-12-14 19:45:38,908 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATION (51 of 77 remaining) [2021-12-14 19:45:38,908 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATION (50 of 77 remaining) [2021-12-14 19:45:38,908 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATION (49 of 77 remaining) [2021-12-14 19:45:38,908 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATION (48 of 77 remaining) [2021-12-14 19:45:38,908 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATION (47 of 77 remaining) [2021-12-14 19:45:38,908 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATION (46 of 77 remaining) [2021-12-14 19:45:38,909 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATION (45 of 77 remaining) [2021-12-14 19:45:38,909 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATION (44 of 77 remaining) [2021-12-14 19:45:38,909 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATION (43 of 77 remaining) [2021-12-14 19:45:38,909 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATION (42 of 77 remaining) [2021-12-14 19:45:38,909 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATION (41 of 77 remaining) [2021-12-14 19:45:38,909 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATION (40 of 77 remaining) [2021-12-14 19:45:38,909 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATION (39 of 77 remaining) [2021-12-14 19:45:38,909 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATION (38 of 77 remaining) [2021-12-14 19:45:38,910 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATION (37 of 77 remaining) [2021-12-14 19:45:38,910 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATION (36 of 77 remaining) [2021-12-14 19:45:38,910 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK (35 of 77 remaining) [2021-12-14 19:45:38,910 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATION (34 of 77 remaining) [2021-12-14 19:45:38,910 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATION (33 of 77 remaining) [2021-12-14 19:45:38,910 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK (32 of 77 remaining) [2021-12-14 19:45:38,910 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK (31 of 77 remaining) [2021-12-14 19:45:38,911 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK (30 of 77 remaining) [2021-12-14 19:45:38,911 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATION (29 of 77 remaining) [2021-12-14 19:45:38,911 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATION (28 of 77 remaining) [2021-12-14 19:45:38,911 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK (27 of 77 remaining) [2021-12-14 19:45:38,911 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATION (26 of 77 remaining) [2021-12-14 19:45:38,911 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATION (25 of 77 remaining) [2021-12-14 19:45:38,911 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATION (24 of 77 remaining) [2021-12-14 19:45:38,911 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATION (23 of 77 remaining) [2021-12-14 19:45:38,912 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK (22 of 77 remaining) [2021-12-14 19:45:38,912 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATION (21 of 77 remaining) [2021-12-14 19:45:38,912 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATION (20 of 77 remaining) [2021-12-14 19:45:38,912 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK (19 of 77 remaining) [2021-12-14 19:45:38,912 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57REQUIRES_VIOLATION (18 of 77 remaining) [2021-12-14 19:45:38,913 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATION (17 of 77 remaining) [2021-12-14 19:45:38,913 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATION (16 of 77 remaining) [2021-12-14 19:45:38,913 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATION (15 of 77 remaining) [2021-12-14 19:45:38,913 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61REQUIRES_VIOLATION (14 of 77 remaining) [2021-12-14 19:45:38,914 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62REQUIRES_VIOLATION (13 of 77 remaining) [2021-12-14 19:45:38,914 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE (12 of 77 remaining) [2021-12-14 19:45:38,914 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE (11 of 77 remaining) [2021-12-14 19:45:38,914 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE (10 of 77 remaining) [2021-12-14 19:45:38,914 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66REQUIRES_VIOLATION (9 of 77 remaining) [2021-12-14 19:45:38,914 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67REQUIRES_VIOLATION (8 of 77 remaining) [2021-12-14 19:45:38,915 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE (7 of 77 remaining) [2021-12-14 19:45:38,915 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE (6 of 77 remaining) [2021-12-14 19:45:38,915 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE (5 of 77 remaining) [2021-12-14 19:45:38,915 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71REQUIRES_VIOLATION (4 of 77 remaining) [2021-12-14 19:45:38,915 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72REQUIRES_VIOLATION (3 of 77 remaining) [2021-12-14 19:45:38,915 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE (2 of 77 remaining) [2021-12-14 19:45:38,915 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE (1 of 77 remaining) [2021-12-14 19:45:38,916 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE (0 of 77 remaining) [2021-12-14 19:45:38,916 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-14 19:45:38,918 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-14 19:45:38,921 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-14 19:45:38,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 07:45:38 BoogieIcfgContainer [2021-12-14 19:45:38,960 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-14 19:45:38,961 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-14 19:45:38,961 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-14 19:45:38,961 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-14 19:45:38,961 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:45:28" (3/4) ... [2021-12-14 19:45:38,963 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-14 19:45:38,963 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-14 19:45:38,964 INFO L158 Benchmark]: Toolchain (without parser) took 12522.65ms. Allocated memory was 83.9MB in the beginning and 169.9MB in the end (delta: 86.0MB). Free memory was 49.4MB in the beginning and 62.4MB in the end (delta: -13.0MB). Peak memory consumption was 74.0MB. Max. memory is 16.1GB. [2021-12-14 19:45:38,965 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 83.9MB. Free memory was 54.9MB in the beginning and 54.9MB in the end (delta: 24.2kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 19:45:38,965 INFO L158 Benchmark]: CACSL2BoogieTranslator took 606.02ms. Allocated memory is still 83.9MB. Free memory was 49.2MB in the beginning and 51.9MB in the end (delta: -2.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-14 19:45:38,966 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.91ms. Allocated memory is still 83.9MB. Free memory was 51.9MB in the beginning and 49.6MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 19:45:38,966 INFO L158 Benchmark]: Boogie Preprocessor took 82.37ms. Allocated memory is still 83.9MB. Free memory was 49.6MB in the beginning and 47.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 19:45:38,966 INFO L158 Benchmark]: RCFGBuilder took 828.16ms. Allocated memory was 83.9MB in the beginning and 109.1MB in the end (delta: 25.2MB). Free memory was 47.8MB in the beginning and 81.4MB in the end (delta: -33.6MB). Peak memory consumption was 24.2MB. Max. memory is 16.1GB. [2021-12-14 19:45:38,970 INFO L158 Benchmark]: TraceAbstraction took 10918.74ms. Allocated memory was 109.1MB in the beginning and 169.9MB in the end (delta: 60.8MB). Free memory was 80.8MB in the beginning and 62.4MB in the end (delta: 18.4MB). Peak memory consumption was 79.4MB. Max. memory is 16.1GB. [2021-12-14 19:45:38,970 INFO L158 Benchmark]: Witness Printer took 2.47ms. Allocated memory is still 169.9MB. Free memory is still 62.4MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 19:45:38,974 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 83.9MB. Free memory was 54.9MB in the beginning and 54.9MB in the end (delta: 24.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 606.02ms. Allocated memory is still 83.9MB. Free memory was 49.2MB in the beginning and 51.9MB in the end (delta: -2.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.91ms. Allocated memory is still 83.9MB. Free memory was 51.9MB in the beginning and 49.6MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 82.37ms. Allocated memory is still 83.9MB. Free memory was 49.6MB in the beginning and 47.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 828.16ms. Allocated memory was 83.9MB in the beginning and 109.1MB in the end (delta: 25.2MB). Free memory was 47.8MB in the beginning and 81.4MB in the end (delta: -33.6MB). Peak memory consumption was 24.2MB. Max. memory is 16.1GB. * TraceAbstraction took 10918.74ms. Allocated memory was 109.1MB in the beginning and 169.9MB in the end (delta: 60.8MB). Free memory was 80.8MB in the beginning and 62.4MB in the end (delta: 18.4MB). Peak memory consumption was 79.4MB. Max. memory is 16.1GB. * Witness Printer took 2.47ms. Allocated memory is still 169.9MB. Free memory is still 62.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={-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: 10.8s, OverallIterations: 25, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3109 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3109 mSDsluCounter, 6334 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4102 mSDsCounter, 309 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5899 IncrementalHoareTripleChecker+Invalid, 6208 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 309 mSolverCounterUnsat, 2232 mSDtfsCounter, 5899 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 396 GetRequests, 202 SyntacticMatches, 4 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 1.4s 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.5s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 663 NumberOfCodeBlocks, 663 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 657 ConstructedInterpolants, 0 QuantifiedInterpolants, 4374 SizeOfPredicates, 15 NumberOfNonLiveVariables, 840 ConjunctsInSsa, 74 ConjunctsInUnsatCore, 30 InterpolantComputations, 22 PerfectInterpolantSequences, 10/19 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-14 19:45:39,021 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-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 19:45:41,263 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 19:45:41,265 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 19:45:41,297 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 19:45:41,297 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 19:45:41,299 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 19:45:41,301 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 19:45:41,304 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 19:45:41,306 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 19:45:41,309 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 19:45:41,310 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 19:45:41,313 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 19:45:41,313 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 19:45:41,315 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 19:45:41,316 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 19:45:41,319 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 19:45:41,319 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 19:45:41,320 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 19:45:41,322 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 19:45:41,326 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 19:45:41,327 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 19:45:41,328 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 19:45:41,329 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 19:45:41,330 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 19:45:41,334 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 19:45:41,335 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 19:45:41,335 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 19:45:41,336 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 19:45:41,336 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 19:45:41,337 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 19:45:41,337 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 19:45:41,337 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 19:45:41,339 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 19:45:41,339 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 19:45:41,340 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 19:45:41,340 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 19:45:41,341 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 19:45:41,341 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 19:45:41,341 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 19:45:41,342 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 19:45:41,342 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 19:45:41,346 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-12-14 19:45:41,374 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 19:45:41,374 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 19:45:41,375 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 19:45:41,375 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 19:45:41,376 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 19:45:41,376 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 19:45:41,377 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 19:45:41,377 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 19:45:41,377 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 19:45:41,377 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 19:45:41,378 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 19:45:41,378 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-14 19:45:41,378 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 19:45:41,379 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 19:45:41,379 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 19:45:41,379 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-14 19:45:41,379 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-14 19:45:41,379 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-14 19:45:41,379 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 19:45:41,380 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-14 19:45:41,380 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-14 19:45:41,380 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-14 19:45:41,380 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 19:45:41,380 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 19:45:41,380 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 19:45:41,387 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 19:45:41,388 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 19:45:41,388 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:45:41,388 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 19:45:41,388 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 19:45:41,388 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-14 19:45:41,389 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-14 19:45:41,389 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 19:45:41,389 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-14 19:45:41,389 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-14 19:45:41,737 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 19:45:41,750 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 19:45:41,769 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 19:45:41,770 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 19:45:41,770 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 19:45:41,771 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-14 19:45:41,854 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/370d86104/42eff2f21c254b6982a8e3ff3663e8fd/FLAG4afe9527d [2021-12-14 19:45:42,500 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 19:45:42,501 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i [2021-12-14 19:45:42,530 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/370d86104/42eff2f21c254b6982a8e3ff3663e8fd/FLAG4afe9527d [2021-12-14 19:45:42,866 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/370d86104/42eff2f21c254b6982a8e3ff3663e8fd [2021-12-14 19:45:42,868 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 19:45:42,870 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 19:45:42,873 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 19:45:42,873 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 19:45:42,875 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 19:45:42,892 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:45:42" (1/1) ... [2021-12-14 19:45:42,893 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d503bf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:45:42, skipping insertion in model container [2021-12-14 19:45:42,893 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:45:42" (1/1) ... [2021-12-14 19:45:42,898 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 19:45:42,953 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 19:45:43,294 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-14 19:45:43,301 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-14 19:45:43,303 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-14 19:45:43,304 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-14 19:45:43,305 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-14 19:45:43,307 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-14 19:45:43,309 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-14 19:45:43,317 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:45:43,354 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 19:45:43,412 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-14 19:45:43,423 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-14 19:45:43,430 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-14 19:45:43,436 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-14 19:45:43,438 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-14 19:45:43,439 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-14 19:45:43,439 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-14 19:45:43,441 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:45:43,500 INFO L208 MainTranslator]: Completed translation [2021-12-14 19:45:43,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:45:43 WrapperNode [2021-12-14 19:45:43,500 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 19:45:43,502 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 19:45:43,513 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 19:45:43,514 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 19:45:43,521 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:45:43" (1/1) ... [2021-12-14 19:45:43,559 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:45:43" (1/1) ... [2021-12-14 19:45:43,603 INFO L137 Inliner]: procedures = 122, calls = 43, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 164 [2021-12-14 19:45:43,610 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 19:45:43,611 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 19:45:43,615 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 19:45:43,616 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 19:45:43,624 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:45:43" (1/1) ... [2021-12-14 19:45:43,626 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:45:43" (1/1) ... [2021-12-14 19:45:43,649 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:45:43" (1/1) ... [2021-12-14 19:45:43,649 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:45:43" (1/1) ... [2021-12-14 19:45:43,688 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:45:43" (1/1) ... [2021-12-14 19:45:43,714 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:45:43" (1/1) ... [2021-12-14 19:45:43,717 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:45:43" (1/1) ... [2021-12-14 19:45:43,720 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 19:45:43,721 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 19:45:43,731 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 19:45:43,731 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 19:45:43,732 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:45:43" (1/1) ... [2021-12-14 19:45:43,746 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:45:43,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:45:43,786 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-14 19:45:43,802 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-14 19:45:43,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-14 19:45:43,854 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-14 19:45:43,854 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 19:45:43,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-14 19:45:43,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-14 19:45:43,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 19:45:43,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-14 19:45:43,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-14 19:45:43,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 19:45:43,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 19:45:44,021 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 19:45:44,032 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 19:45:44,741 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 19:45:44,750 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 19:45:44,751 INFO L301 CfgBuilder]: Removed 17 assume(true) statements. [2021-12-14 19:45:44,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:45:44 BoogieIcfgContainer [2021-12-14 19:45:44,753 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 19:45:44,754 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 19:45:44,755 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 19:45:44,757 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 19:45:44,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 07:45:42" (1/3) ... [2021-12-14 19:45:44,759 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3da72ad9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:45:44, skipping insertion in model container [2021-12-14 19:45:44,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:45:43" (2/3) ... [2021-12-14 19:45:44,759 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3da72ad9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:45:44, skipping insertion in model container [2021-12-14 19:45:44,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:45:44" (3/3) ... [2021-12-14 19:45:44,761 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel-1.i [2021-12-14 19:45:44,765 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 19:45:44,778 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 77 error locations. [2021-12-14 19:45:44,845 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 19:45:44,861 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-14 19:45:44,862 INFO L340 AbstractCegarLoop]: Starting to check reachability of 77 error locations. [2021-12-14 19:45:44,897 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-14 19:45:44,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-14 19:45:44,916 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:44,916 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-14 19:45:44,917 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-14 19:45:44,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:44,921 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-14 19:45:44,947 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:45:44,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [587395840] [2021-12-14 19:45:44,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:44,948 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:45:44,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:45:44,959 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-14 19:45:45,022 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-14 19:45:45,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:45,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 19:45:45,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:45:45,199 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-14 19:45:45,207 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-14 19:45:45,208 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:45:45,208 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:45:45,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [587395840] [2021-12-14 19:45:45,209 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [587395840] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:45,209 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:45,209 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:45:45,210 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758004744] [2021-12-14 19:45:45,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:45,213 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:45:45,214 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:45:45,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:45:45,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:45:45,264 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-14 19:45:45,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:45,558 INFO L93 Difference]: Finished difference Result 191 states and 197 transitions. [2021-12-14 19:45:45,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:45:45,563 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-14 19:45:45,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:45,569 INFO L225 Difference]: With dead ends: 191 [2021-12-14 19:45:45,569 INFO L226 Difference]: Without dead ends: 187 [2021-12-14 19:45:45,570 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-14 19:45:45,572 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-14 19:45:45,573 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-14 19:45:45,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2021-12-14 19:45:45,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 159. [2021-12-14 19:45:45,601 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-14 19:45:45,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 164 transitions. [2021-12-14 19:45:45,604 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 164 transitions. Word has length 3 [2021-12-14 19:45:45,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:45,604 INFO L470 AbstractCegarLoop]: Abstraction has 159 states and 164 transitions. [2021-12-14 19:45:45,604 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-14 19:45:45,604 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 164 transitions. [2021-12-14 19:45:45,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-14 19:45:45,605 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:45,605 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-14 19:45:45,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-14 19:45:45,811 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-14 19:45:45,812 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-14 19:45:45,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:45,813 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-14 19:45:45,813 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:45:45,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [834784067] [2021-12-14 19:45:45,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:45,814 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:45:45,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:45:45,815 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-14 19:45:45,817 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-14 19:45:45,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:45,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 19:45:45,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:45:45,865 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-14 19:45:45,873 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-14 19:45:45,873 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:45:45,873 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:45:45,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [834784067] [2021-12-14 19:45:45,873 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [834784067] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:45,873 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:45,873 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:45:45,873 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319494682] [2021-12-14 19:45:45,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:45,874 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:45:45,874 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:45:45,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:45:45,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:45:45,875 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-14 19:45:46,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:46,142 INFO L93 Difference]: Finished difference Result 156 states and 161 transitions. [2021-12-14 19:45:46,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:45:46,142 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-14 19:45:46,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:46,143 INFO L225 Difference]: With dead ends: 156 [2021-12-14 19:45:46,144 INFO L226 Difference]: Without dead ends: 156 [2021-12-14 19:45:46,144 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-14 19:45:46,145 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-14 19:45:46,145 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-14 19:45:46,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-12-14 19:45:46,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2021-12-14 19:45:46,150 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-14 19:45:46,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 161 transitions. [2021-12-14 19:45:46,152 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 161 transitions. Word has length 3 [2021-12-14 19:45:46,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:46,152 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 161 transitions. [2021-12-14 19:45:46,152 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-14 19:45:46,153 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 161 transitions. [2021-12-14 19:45:46,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-14 19:45:46,153 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:46,153 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:45:46,168 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-14 19:45:46,354 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-14 19:45:46,355 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-14 19:45:46,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:46,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1803026981, now seen corresponding path program 1 times [2021-12-14 19:45:46,356 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:45:46,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [519595917] [2021-12-14 19:45:46,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:46,357 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:45:46,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:45:46,358 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-14 19:45:46,361 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-14 19:45:46,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:46,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 19:45:46,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:45:46,482 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-14 19:45:46,488 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-14 19:45:46,491 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:45:46,492 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:45:46,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [519595917] [2021-12-14 19:45:46,492 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [519595917] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:46,492 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:46,492 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:45:46,493 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312711294] [2021-12-14 19:45:46,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:46,493 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:45:46,493 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:45:46,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:45:46,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:45:46,496 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-14 19:45:46,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:46,682 INFO L93 Difference]: Finished difference Result 155 states and 160 transitions. [2021-12-14 19:45:46,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:45:46,683 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-14 19:45:46,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:46,683 INFO L225 Difference]: With dead ends: 155 [2021-12-14 19:45:46,684 INFO L226 Difference]: Without dead ends: 155 [2021-12-14 19:45:46,684 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-14 19:45:46,685 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 133 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-14 19:45:46,685 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-14 19:45:46,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-12-14 19:45:46,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 151. [2021-12-14 19:45:46,691 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-14 19:45:46,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 158 transitions. [2021-12-14 19:45:46,693 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 158 transitions. Word has length 7 [2021-12-14 19:45:46,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:46,694 INFO L470 AbstractCegarLoop]: Abstraction has 151 states and 158 transitions. [2021-12-14 19:45:46,694 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-14 19:45:46,694 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 158 transitions. [2021-12-14 19:45:46,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-14 19:45:46,694 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:46,695 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:45:46,723 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-14 19:45:46,908 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-14 19:45:46,908 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-14 19:45:46,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:46,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1803026982, now seen corresponding path program 1 times [2021-12-14 19:45:46,909 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:45:46,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [792438598] [2021-12-14 19:45:46,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:46,910 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:45:46,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:45:46,911 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-14 19:45:46,913 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-14 19:45:46,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:46,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 19:45:46,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:45:46,976 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-14 19:45:46,983 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-14 19:45:46,983 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:45:46,984 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:45:46,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [792438598] [2021-12-14 19:45:46,984 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [792438598] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:46,984 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:46,984 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:45:46,984 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98996830] [2021-12-14 19:45:46,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:46,985 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:45:46,985 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:45:46,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:45:46,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:45:46,986 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-14 19:45:47,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:47,189 INFO L93 Difference]: Finished difference Result 168 states and 174 transitions. [2021-12-14 19:45:47,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:45:47,197 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-14 19:45:47,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:47,198 INFO L225 Difference]: With dead ends: 168 [2021-12-14 19:45:47,198 INFO L226 Difference]: Without dead ends: 168 [2021-12-14 19:45:47,198 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-14 19:45:47,199 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-14 19:45:47,199 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-14 19:45:47,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2021-12-14 19:45:47,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 155. [2021-12-14 19:45:47,204 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-14 19:45:47,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 162 transitions. [2021-12-14 19:45:47,206 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 162 transitions. Word has length 7 [2021-12-14 19:45:47,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:47,206 INFO L470 AbstractCegarLoop]: Abstraction has 155 states and 162 transitions. [2021-12-14 19:45:47,206 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-14 19:45:47,206 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 162 transitions. [2021-12-14 19:45:47,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-14 19:45:47,207 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:47,207 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:45:47,214 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-14 19:45:47,413 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-14 19:45:47,414 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-14 19:45:47,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:47,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1483594255, now seen corresponding path program 1 times [2021-12-14 19:45:47,415 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:45:47,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1440864395] [2021-12-14 19:45:47,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:47,415 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:45:47,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:45:47,416 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-14 19:45:47,416 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-14 19:45:47,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:47,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 19:45:47,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:45:47,543 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-14 19:45:47,658 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-12-14 19:45:47,658 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 20 treesize of output 25 [2021-12-14 19:45:47,673 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-14 19:45:47,673 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:45:47,673 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:45:47,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1440864395] [2021-12-14 19:45:47,673 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1440864395] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:47,674 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:47,674 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:45:47,674 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075149030] [2021-12-14 19:45:47,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:47,674 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:45:47,674 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:45:47,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:45:47,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:45:47,675 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-14 19:45:47,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:47,948 INFO L93 Difference]: Finished difference Result 156 states and 164 transitions. [2021-12-14 19:45:47,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 19:45:47,948 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-14 19:45:47,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:47,949 INFO L225 Difference]: With dead ends: 156 [2021-12-14 19:45:47,949 INFO L226 Difference]: Without dead ends: 156 [2021-12-14 19:45:47,949 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:45:47,950 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 211 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-14 19:45:47,950 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-14 19:45:47,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-12-14 19:45:47,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 142. [2021-12-14 19:45:47,963 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-14 19:45:47,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 151 transitions. [2021-12-14 19:45:47,964 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 151 transitions. Word has length 12 [2021-12-14 19:45:47,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:47,964 INFO L470 AbstractCegarLoop]: Abstraction has 142 states and 151 transitions. [2021-12-14 19:45:47,964 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-14 19:45:47,965 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 151 transitions. [2021-12-14 19:45:47,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-14 19:45:47,965 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:47,965 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:45:47,980 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-14 19:45:48,166 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-14 19:45:48,166 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-14 19:45:48,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:48,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1483594254, now seen corresponding path program 1 times [2021-12-14 19:45:48,167 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:45:48,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [260761864] [2021-12-14 19:45:48,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:48,167 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:45:48,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:45:48,169 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-14 19:45:48,170 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-14 19:45:48,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:48,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-14 19:45:48,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:45:48,308 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-14 19:45:48,368 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:45:48,369 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-14 19:45:48,380 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-14 19:45:48,380 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:45:48,380 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:45:48,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [260761864] [2021-12-14 19:45:48,381 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [260761864] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:48,381 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:48,381 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:45:48,381 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889064867] [2021-12-14 19:45:48,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:48,382 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:45:48,382 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:45:48,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:45:48,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:45:48,382 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-14 19:45:48,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:48,695 INFO L93 Difference]: Finished difference Result 180 states and 190 transitions. [2021-12-14 19:45:48,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 19:45:48,695 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-14 19:45:48,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:48,696 INFO L225 Difference]: With dead ends: 180 [2021-12-14 19:45:48,696 INFO L226 Difference]: Without dead ends: 180 [2021-12-14 19:45:48,696 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-14 19:45:48,697 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.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:48,697 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.3s Time] [2021-12-14 19:45:48,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2021-12-14 19:45:48,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 151. [2021-12-14 19:45:48,701 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-14 19:45:48,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 163 transitions. [2021-12-14 19:45:48,702 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 163 transitions. Word has length 12 [2021-12-14 19:45:48,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:48,702 INFO L470 AbstractCegarLoop]: Abstraction has 151 states and 163 transitions. [2021-12-14 19:45:48,702 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-14 19:45:48,703 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 163 transitions. [2021-12-14 19:45:48,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-14 19:45:48,703 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:48,703 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:45:48,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-12-14 19:45:48,912 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-14 19:45:48,913 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-14 19:45:48,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:48,914 INFO L85 PathProgramCache]: Analyzing trace with hash 195115107, now seen corresponding path program 1 times [2021-12-14 19:45:48,914 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:45:48,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [559540281] [2021-12-14 19:45:48,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:48,915 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:45:48,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:45:48,916 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-14 19:45:48,920 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-14 19:45:48,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:48,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-14 19:45:48,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:45:49,001 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-14 19:45:49,025 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:45:49,026 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2021-12-14 19:45:49,050 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-14 19:45:49,051 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:45:49,051 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:45:49,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [559540281] [2021-12-14 19:45:49,051 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [559540281] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:49,051 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:49,052 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 19:45:49,052 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566081869] [2021-12-14 19:45:49,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:49,052 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:45:49,052 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:45:49,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:45:49,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:45:49,061 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-14 19:45:49,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:49,363 INFO L93 Difference]: Finished difference Result 194 states and 203 transitions. [2021-12-14 19:45:49,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 19:45:49,364 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-14 19:45:49,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:49,366 INFO L225 Difference]: With dead ends: 194 [2021-12-14 19:45:49,366 INFO L226 Difference]: Without dead ends: 194 [2021-12-14 19:45:49,366 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-14 19:45:49,366 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 296 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:49,366 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.3s Time] [2021-12-14 19:45:49,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-12-14 19:45:49,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 149. [2021-12-14 19:45:49,369 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-14 19:45:49,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 159 transitions. [2021-12-14 19:45:49,370 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 159 transitions. Word has length 14 [2021-12-14 19:45:49,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:49,370 INFO L470 AbstractCegarLoop]: Abstraction has 149 states and 159 transitions. [2021-12-14 19:45:49,370 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-14 19:45:49,370 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 159 transitions. [2021-12-14 19:45:49,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-14 19:45:49,370 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:49,370 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:45:49,377 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2021-12-14 19:45:49,577 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-14 19:45:49,577 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-14 19:45:49,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:49,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1751997431, now seen corresponding path program 1 times [2021-12-14 19:45:49,578 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:45:49,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [743835155] [2021-12-14 19:45:49,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:49,578 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:45:49,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:45:49,580 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-14 19:45:49,603 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-14 19:45:49,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:49,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-14 19:45:49,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:45:49,683 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-14 19:45:49,697 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-14 19:45:49,709 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-12-14 19:45:49,714 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-14 19:45:49,715 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:45:49,715 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:45:49,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [743835155] [2021-12-14 19:45:49,715 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [743835155] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:49,715 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:49,715 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:45:49,715 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406564130] [2021-12-14 19:45:49,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:49,716 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:45:49,716 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:45:49,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:45:49,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:45:49,717 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-14 19:45:50,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:50,012 INFO L93 Difference]: Finished difference Result 148 states and 157 transitions. [2021-12-14 19:45:50,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:45:50,013 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-14 19:45:50,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:50,013 INFO L225 Difference]: With dead ends: 148 [2021-12-14 19:45:50,013 INFO L226 Difference]: Without dead ends: 148 [2021-12-14 19:45:50,013 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-14 19:45:50,014 INFO L933 BasicCegarLoop]: 125 mSDtfsCounter, 9 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-14 19:45:50,014 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-14 19:45:50,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2021-12-14 19:45:50,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2021-12-14 19:45:50,016 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-14 19:45:50,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 157 transitions. [2021-12-14 19:45:50,016 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 157 transitions. Word has length 15 [2021-12-14 19:45:50,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:50,016 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 157 transitions. [2021-12-14 19:45:50,017 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-14 19:45:50,017 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 157 transitions. [2021-12-14 19:45:50,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-14 19:45:50,017 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:50,017 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:45:50,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2021-12-14 19:45:50,217 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-14 19:45:50,218 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-14 19:45:50,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:50,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1751997432, now seen corresponding path program 1 times [2021-12-14 19:45:50,218 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:45:50,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1450221379] [2021-12-14 19:45:50,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:50,219 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:45:50,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:45:50,220 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-14 19:45:50,221 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-14 19:45:50,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:50,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-14 19:45:50,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:45:50,319 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-14 19:45:50,334 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-14 19:45:50,338 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-14 19:45:50,363 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-14 19:45:50,372 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-14 19:45:50,381 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-14 19:45:50,381 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:45:50,381 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:45:50,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1450221379] [2021-12-14 19:45:50,381 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1450221379] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:50,381 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:50,381 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:45:50,381 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914377826] [2021-12-14 19:45:50,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:50,382 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:45:50,382 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:45:50,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:45:50,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:45:50,382 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-14 19:45:50,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:50,742 INFO L93 Difference]: Finished difference Result 147 states and 155 transitions. [2021-12-14 19:45:50,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:45:50,742 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-14 19:45:50,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:50,743 INFO L225 Difference]: With dead ends: 147 [2021-12-14 19:45:50,743 INFO L226 Difference]: Without dead ends: 147 [2021-12-14 19:45:50,743 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-14 19:45:50,743 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 4 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:50,744 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.3s Time] [2021-12-14 19:45:50,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-12-14 19:45:50,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2021-12-14 19:45:50,745 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-14 19:45:50,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 155 transitions. [2021-12-14 19:45:50,746 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 155 transitions. Word has length 15 [2021-12-14 19:45:50,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:50,746 INFO L470 AbstractCegarLoop]: Abstraction has 147 states and 155 transitions. [2021-12-14 19:45:50,746 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-14 19:45:50,746 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 155 transitions. [2021-12-14 19:45:50,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-14 19:45:50,746 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:50,747 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:45:50,758 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-14 19:45:50,959 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-14 19:45:50,959 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-14 19:45:50,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:50,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1587467776, now seen corresponding path program 1 times [2021-12-14 19:45:50,960 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:45:50,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1696161] [2021-12-14 19:45:50,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:50,960 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:45:50,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:45:50,961 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-14 19:45:50,962 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-14 19:45:51,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:51,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-14 19:45:51,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:45:51,072 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-14 19:45:51,137 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-14 19:45:51,144 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-14 19:45:51,144 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:45:51,145 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:45:51,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1696161] [2021-12-14 19:45:51,145 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1696161] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:51,145 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:51,145 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:45:51,145 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142439014] [2021-12-14 19:45:51,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:51,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:45:51,146 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:45:51,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:45:51,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:45:51,146 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-14 19:45:51,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:51,558 INFO L93 Difference]: Finished difference Result 201 states and 213 transitions. [2021-12-14 19:45:51,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:45:51,558 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-14 19:45:51,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:51,559 INFO L225 Difference]: With dead ends: 201 [2021-12-14 19:45:51,559 INFO L226 Difference]: Without dead ends: 201 [2021-12-14 19:45:51,559 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-14 19:45:51,560 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.4s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:51,560 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.4s Time] [2021-12-14 19:45:51,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2021-12-14 19:45:51,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 152. [2021-12-14 19:45:51,562 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-14 19:45:51,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 160 transitions. [2021-12-14 19:45:51,562 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 160 transitions. Word has length 17 [2021-12-14 19:45:51,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:51,562 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 160 transitions. [2021-12-14 19:45:51,562 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-14 19:45:51,562 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 160 transitions. [2021-12-14 19:45:51,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-14 19:45:51,563 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:51,563 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-14 19:45:51,580 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-14 19:45:51,781 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-14 19:45:51,781 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-14 19:45:51,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:51,781 INFO L85 PathProgramCache]: Analyzing trace with hash 2045128633, now seen corresponding path program 1 times [2021-12-14 19:45:51,781 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:45:51,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1256029601] [2021-12-14 19:45:51,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:51,782 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:45:51,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:45:51,783 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-14 19:45:51,784 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-14 19:45:51,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:51,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-14 19:45:51,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:45:51,936 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-14 19:45:51,981 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-14 19:45:51,981 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 26 treesize of output 33 [2021-12-14 19:45:52,018 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-14 19:45:52,106 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:45:52,106 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 32 treesize of output 33 [2021-12-14 19:45:52,133 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 29 treesize of output 17 [2021-12-14 19:45:52,198 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-14 19:45:52,198 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:45:52,198 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:45:52,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1256029601] [2021-12-14 19:45:52,199 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1256029601] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:52,199 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:52,199 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 19:45:52,199 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675796553] [2021-12-14 19:45:52,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:52,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 19:45:52,199 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:45:52,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 19:45:52,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-12-14 19:45:52,200 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-14 19:45:52,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:52,436 INFO L93 Difference]: Finished difference Result 181 states and 192 transitions. [2021-12-14 19:45:52,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 19:45:52,437 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-14 19:45:52,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:52,437 INFO L225 Difference]: With dead ends: 181 [2021-12-14 19:45:52,438 INFO L226 Difference]: Without dead ends: 181 [2021-12-14 19:45:52,438 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2021-12-14 19:45:52,438 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 123 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 225 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:52,438 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 310 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 145 Invalid, 0 Unknown, 225 Unchecked, 0.2s Time] [2021-12-14 19:45:52,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2021-12-14 19:45:52,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 151. [2021-12-14 19:45:52,440 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-14 19:45:52,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 159 transitions. [2021-12-14 19:45:52,441 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 159 transitions. Word has length 19 [2021-12-14 19:45:52,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:52,441 INFO L470 AbstractCegarLoop]: Abstraction has 151 states and 159 transitions. [2021-12-14 19:45:52,441 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-14 19:45:52,441 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 159 transitions. [2021-12-14 19:45:52,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-14 19:45:52,441 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:52,441 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-14 19:45:52,465 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-14 19:45:52,642 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-14 19:45:52,642 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-14 19:45:52,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:52,642 INFO L85 PathProgramCache]: Analyzing trace with hash 2045128634, now seen corresponding path program 1 times [2021-12-14 19:45:52,643 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:45:52,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [127963986] [2021-12-14 19:45:52,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:52,643 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:45:52,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:45:52,652 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-14 19:45:52,653 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-14 19:45:52,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:52,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 22 conjunts are in the unsatisfiable core [2021-12-14 19:45:52,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:45:52,780 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-14 19:45:52,816 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:45:52,816 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 20 treesize of output 20 [2021-12-14 19:45:52,824 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-14 19:45:52,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-14 19:45:52,853 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-14 19:45:52,916 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:45:52,917 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-14 19:45:52,930 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-14 19:45:52,949 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-14 19:45:52,953 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-14 19:45:52,986 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-14 19:45:52,986 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:45:52,986 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:45:52,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [127963986] [2021-12-14 19:45:52,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [127963986] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:52,988 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:52,988 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 19:45:52,988 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742049819] [2021-12-14 19:45:52,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:52,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 19:45:52,990 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:45:52,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 19:45:52,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-14 19:45:52,990 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-14 19:45:54,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:54,162 INFO L93 Difference]: Finished difference Result 168 states and 177 transitions. [2021-12-14 19:45:54,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-14 19:45:54,162 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-14 19:45:54,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:54,163 INFO L225 Difference]: With dead ends: 168 [2021-12-14 19:45:54,163 INFO L226 Difference]: Without dead ends: 168 [2021-12-14 19:45:54,163 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2021-12-14 19:45:54,164 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 226 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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.8s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:54,164 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.8s Time] [2021-12-14 19:45:54,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2021-12-14 19:45:54,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 154. [2021-12-14 19:45:54,166 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-14 19:45:54,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 166 transitions. [2021-12-14 19:45:54,166 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 166 transitions. Word has length 19 [2021-12-14 19:45:54,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:54,166 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 166 transitions. [2021-12-14 19:45:54,166 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-14 19:45:54,166 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 166 transitions. [2021-12-14 19:45:54,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-14 19:45:54,167 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:54,169 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-14 19:45:54,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Ended with exit code 0 [2021-12-14 19:45:54,376 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-14 19:45:54,376 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-14 19:45:54,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:54,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1915505871, now seen corresponding path program 1 times [2021-12-14 19:45:54,377 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:45:54,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1380278816] [2021-12-14 19:45:54,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:54,377 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:45:54,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:45:54,378 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-14 19:45:54,379 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-14 19:45:54,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:54,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 22 conjunts are in the unsatisfiable core [2021-12-14 19:45:54,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:45:54,490 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-14 19:45:54,493 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-14 19:45:54,522 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-14 19:45:54,523 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-14 19:45:54,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:45:54,528 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-14 19:45:54,548 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-14 19:45:54,549 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-14 19:45:54,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:45:54,561 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-14 19:45:54,666 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-14 19:45:54,668 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-14 19:45:54,707 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-14 19:45:54,707 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:45:54,861 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-14 19:45:54,862 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:45:54,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1380278816] [2021-12-14 19:45:54,862 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1380278816] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:45:54,862 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 19:45:54,862 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2021-12-14 19:45:54,862 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293358193] [2021-12-14 19:45:54,862 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 19:45:54,863 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 19:45:54,863 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:45:54,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 19:45:54,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-12-14 19:45:54,863 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-14 19:45:55,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:55,516 INFO L93 Difference]: Finished difference Result 205 states and 221 transitions. [2021-12-14 19:45:55,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 19:45:55,516 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-14 19:45:55,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:55,517 INFO L225 Difference]: With dead ends: 205 [2021-12-14 19:45:55,517 INFO L226 Difference]: Without dead ends: 205 [2021-12-14 19:45:55,517 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-14 19:45:55,517 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 239 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:55,518 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [239 Valid, 373 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-14 19:45:55,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2021-12-14 19:45:55,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 161. [2021-12-14 19:45:55,520 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-14 19:45:55,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 174 transitions. [2021-12-14 19:45:55,520 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 174 transitions. Word has length 24 [2021-12-14 19:45:55,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:55,520 INFO L470 AbstractCegarLoop]: Abstraction has 161 states and 174 transitions. [2021-12-14 19:45:55,520 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-14 19:45:55,520 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 174 transitions. [2021-12-14 19:45:55,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-14 19:45:55,521 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:55,521 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-14 19:45:55,531 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-14 19:45:55,729 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-14 19:45:55,729 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-14 19:45:55,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:55,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1957524124, now seen corresponding path program 1 times [2021-12-14 19:45:55,730 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:45:55,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [259775314] [2021-12-14 19:45:55,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:55,730 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:45:55,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:45:55,731 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-14 19:45:55,732 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-14 19:45:55,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:55,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-14 19:45:55,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:45:55,837 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-14 19:45:55,893 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-14 19:45:55,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:45:55,904 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:45:55,904 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:45:55,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [259775314] [2021-12-14 19:45:55,905 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [259775314] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:55,905 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:55,905 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:45:55,905 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600601602] [2021-12-14 19:45:55,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:55,905 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:45:55,905 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:45:55,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:45:55,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:45:55,906 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-14 19:45:56,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:56,210 INFO L93 Difference]: Finished difference Result 184 states and 197 transitions. [2021-12-14 19:45:56,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:45:56,210 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-14 19:45:56,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:56,211 INFO L225 Difference]: With dead ends: 184 [2021-12-14 19:45:56,211 INFO L226 Difference]: Without dead ends: 184 [2021-12-14 19:45:56,211 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:45:56,212 INFO L933 BasicCegarLoop]: 98 mSDtfsCounter, 136 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:56,212 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.3s Time] [2021-12-14 19:45:56,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2021-12-14 19:45:56,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 161. [2021-12-14 19:45:56,214 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-14 19:45:56,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 173 transitions. [2021-12-14 19:45:56,214 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 173 transitions. Word has length 24 [2021-12-14 19:45:56,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:56,214 INFO L470 AbstractCegarLoop]: Abstraction has 161 states and 173 transitions. [2021-12-14 19:45:56,215 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-14 19:45:56,215 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 173 transitions. [2021-12-14 19:45:56,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-14 19:45:56,215 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:56,215 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-14 19:45:56,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-12-14 19:45:56,422 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-14 19:45:56,422 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-14 19:45:56,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:56,422 INFO L85 PathProgramCache]: Analyzing trace with hash 915476318, now seen corresponding path program 1 times [2021-12-14 19:45:56,423 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:45:56,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [67275914] [2021-12-14 19:45:56,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:56,423 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:45:56,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:45:56,424 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-14 19:45:56,425 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-14 19:45:56,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:56,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-14 19:45:56,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:45:56,562 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-14 19:45:56,570 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-14 19:45:56,575 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-14 19:45:56,575 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:45:56,576 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:45:56,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [67275914] [2021-12-14 19:45:56,576 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [67275914] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:56,576 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:56,576 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:45:56,576 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378377408] [2021-12-14 19:45:56,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:56,576 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:45:56,577 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:45:56,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:45:56,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:45:56,577 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-14 19:45:56,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:56,757 INFO L93 Difference]: Finished difference Result 163 states and 174 transitions. [2021-12-14 19:45:56,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 19:45:56,757 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-14 19:45:56,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:56,758 INFO L225 Difference]: With dead ends: 163 [2021-12-14 19:45:56,758 INFO L226 Difference]: Without dead ends: 163 [2021-12-14 19:45:56,760 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-14 19:45:56,760 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-14 19:45:56,760 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-14 19:45:56,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-12-14 19:45:56,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 159. [2021-12-14 19:45:56,763 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-14 19:45:56,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 170 transitions. [2021-12-14 19:45:56,763 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 170 transitions. Word has length 24 [2021-12-14 19:45:56,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:56,765 INFO L470 AbstractCegarLoop]: Abstraction has 159 states and 170 transitions. [2021-12-14 19:45:56,765 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-14 19:45:56,765 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 170 transitions. [2021-12-14 19:45:56,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-14 19:45:56,771 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:56,772 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-14 19:45:56,779 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-14 19:45:56,979 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-14 19:45:56,979 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-14 19:45:56,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:56,980 INFO L85 PathProgramCache]: Analyzing trace with hash -433833013, now seen corresponding path program 1 times [2021-12-14 19:45:56,980 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:45:56,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1938442000] [2021-12-14 19:45:56,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:56,980 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:45:56,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:45:56,981 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-14 19:45:56,983 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-14 19:45:57,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:57,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-14 19:45:57,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:45:57,122 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-14 19:45:57,135 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-14 19:45:57,146 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-12-14 19:45:57,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:45:57,152 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:45:57,152 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:45:57,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1938442000] [2021-12-14 19:45:57,152 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1938442000] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:57,152 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:57,152 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:45:57,153 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063725085] [2021-12-14 19:45:57,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:57,153 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:45:57,153 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:45:57,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:45:57,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:45:57,154 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-14 19:45:57,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:57,434 INFO L93 Difference]: Finished difference Result 158 states and 169 transitions. [2021-12-14 19:45:57,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:45:57,434 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-14 19:45:57,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:57,435 INFO L225 Difference]: With dead ends: 158 [2021-12-14 19:45:57,435 INFO L226 Difference]: Without dead ends: 158 [2021-12-14 19:45:57,435 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-14 19:45:57,436 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-14 19:45:57,436 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-14 19:45:57,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-12-14 19:45:57,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2021-12-14 19:45:57,439 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-14 19:45:57,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 169 transitions. [2021-12-14 19:45:57,439 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 169 transitions. Word has length 26 [2021-12-14 19:45:57,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:57,440 INFO L470 AbstractCegarLoop]: Abstraction has 158 states and 169 transitions. [2021-12-14 19:45:57,440 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-14 19:45:57,440 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 169 transitions. [2021-12-14 19:45:57,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-14 19:45:57,443 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:57,443 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-14 19:45:57,461 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-14 19:45:57,663 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-14 19:45:57,663 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-14 19:45:57,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:57,664 INFO L85 PathProgramCache]: Analyzing trace with hash -433833012, now seen corresponding path program 1 times [2021-12-14 19:45:57,664 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:45:57,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [858977049] [2021-12-14 19:45:57,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:57,665 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:45:57,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:45:57,666 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-14 19:45:57,667 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-14 19:45:57,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:57,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-14 19:45:57,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:45:57,842 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-14 19:45:57,857 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-14 19:45:57,862 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-14 19:45:57,887 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-14 19:45:57,890 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-14 19:45:57,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:45:57,904 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:45:57,904 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:45:57,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [858977049] [2021-12-14 19:45:57,905 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [858977049] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:57,905 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:57,905 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:45:57,906 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458635050] [2021-12-14 19:45:57,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:57,906 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:45:57,906 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:45:57,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:45:57,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:45:57,907 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-14 19:45:58,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:58,280 INFO L93 Difference]: Finished difference Result 157 states and 168 transitions. [2021-12-14 19:45:58,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:45:58,280 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-14 19:45:58,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:58,284 INFO L225 Difference]: With dead ends: 157 [2021-12-14 19:45:58,284 INFO L226 Difference]: Without dead ends: 157 [2021-12-14 19:45:58,284 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-14 19:45:58,285 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-14 19:45:58,285 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-14 19:45:58,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-12-14 19:45:58,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2021-12-14 19:45:58,296 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-14 19:45:58,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 168 transitions. [2021-12-14 19:45:58,297 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 168 transitions. Word has length 26 [2021-12-14 19:45:58,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:58,297 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 168 transitions. [2021-12-14 19:45:58,297 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-14 19:45:58,298 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 168 transitions. [2021-12-14 19:45:58,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-14 19:45:58,298 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:58,298 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-14 19:45:58,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Ended with exit code 0 [2021-12-14 19:45:58,509 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-14 19:45:58,510 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-14 19:45:58,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:58,510 INFO L85 PathProgramCache]: Analyzing trace with hash -83332022, now seen corresponding path program 1 times [2021-12-14 19:45:58,510 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:45:58,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [159444306] [2021-12-14 19:45:58,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:58,510 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:45:58,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:45:58,511 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-14 19:45:58,513 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-14 19:45:58,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:58,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-14 19:45:58,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:45:58,850 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-14 19:45:58,878 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-14 19:45:58,992 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-14 19:45:58,992 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-14 19:45:59,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:45:59,002 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-14 19:45:59,034 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-14 19:45:59,036 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-14 19:45:59,049 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-14 19:45:59,049 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:45:59,049 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:45:59,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [159444306] [2021-12-14 19:45:59,050 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [159444306] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:59,050 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:59,050 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 19:45:59,052 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548812467] [2021-12-14 19:45:59,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:59,052 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:45:59,052 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:45:59,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:45:59,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:45:59,053 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-14 19:45:59,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:59,275 INFO L93 Difference]: Finished difference Result 156 states and 166 transitions. [2021-12-14 19:45:59,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 19:45:59,275 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-14 19:45:59,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:59,276 INFO L225 Difference]: With dead ends: 156 [2021-12-14 19:45:59,276 INFO L226 Difference]: Without dead ends: 156 [2021-12-14 19:45:59,276 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-14 19:45:59,276 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 109 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 226 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.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:59,277 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 226 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:45:59,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-12-14 19:45:59,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 155. [2021-12-14 19:45:59,278 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-14 19:45:59,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 165 transitions. [2021-12-14 19:45:59,279 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 165 transitions. Word has length 27 [2021-12-14 19:45:59,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:59,279 INFO L470 AbstractCegarLoop]: Abstraction has 155 states and 165 transitions. [2021-12-14 19:45:59,279 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-14 19:45:59,279 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 165 transitions. [2021-12-14 19:45:59,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-14 19:45:59,279 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:59,279 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-14 19:45:59,289 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-14 19:45:59,487 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-14 19:45:59,487 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-14 19:45:59,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:59,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1522435470, now seen corresponding path program 1 times [2021-12-14 19:45:59,488 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:45:59,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1250918409] [2021-12-14 19:45:59,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:59,488 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:45:59,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:45:59,489 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-14 19:45:59,493 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-14 19:45:59,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:59,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-14 19:45:59,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:45:59,670 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-14 19:45:59,687 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-12-14 19:45:59,687 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 21 [2021-12-14 19:45:59,800 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-12-14 19:45:59,800 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 35 treesize of output 37 [2021-12-14 19:45:59,846 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-14 19:45:59,891 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:45:59,891 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-14 19:45:59,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 24 treesize of output 12 [2021-12-14 19:45:59,935 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-14 19:45:59,936 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:45:59,936 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:45:59,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1250918409] [2021-12-14 19:45:59,936 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1250918409] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:59,936 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:59,936 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-14 19:45:59,936 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586153703] [2021-12-14 19:45:59,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:59,936 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-14 19:45:59,936 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:45:59,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-14 19:45:59,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:45:59,937 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-14 19:46:00,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:46:00,337 INFO L93 Difference]: Finished difference Result 206 states and 219 transitions. [2021-12-14 19:46:00,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 19:46:00,337 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-14 19:46:00,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:46:00,339 INFO L225 Difference]: With dead ends: 206 [2021-12-14 19:46:00,339 INFO L226 Difference]: Without dead ends: 206 [2021-12-14 19:46:00,339 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-12-14 19:46:00,346 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 49 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 178 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 19:46:00,346 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 474 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 343 Invalid, 0 Unknown, 178 Unchecked, 0.4s Time] [2021-12-14 19:46:00,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2021-12-14 19:46:00,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 172. [2021-12-14 19:46:00,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 141 states have (on average 1.297872340425532) internal successors, (183), 171 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:00,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 183 transitions. [2021-12-14 19:46:00,349 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 183 transitions. Word has length 29 [2021-12-14 19:46:00,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:46:00,349 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 183 transitions. [2021-12-14 19:46:00,349 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-14 19:46:00,349 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 183 transitions. [2021-12-14 19:46:00,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-14 19:46:00,350 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:46:00,350 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-14 19:46:00,359 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-14 19:46:00,551 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-14 19:46:00,551 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-14 19:46:00,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:46:00,551 INFO L85 PathProgramCache]: Analyzing trace with hash -296461252, now seen corresponding path program 1 times [2021-12-14 19:46:00,552 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:46:00,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [992854862] [2021-12-14 19:46:00,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:46:00,552 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:46:00,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:46:00,557 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-14 19:46:00,560 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-14 19:46:00,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:46:00,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-14 19:46:00,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:46:00,692 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-14 19:46:00,724 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-14 19:46:00,732 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-14 19:46:00,732 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:46:00,732 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:46:00,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [992854862] [2021-12-14 19:46:00,732 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [992854862] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:46:00,732 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:46:00,732 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:46:00,732 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544299429] [2021-12-14 19:46:00,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:46:00,732 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:46:00,733 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:46:00,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:46:00,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:46:00,733 INFO L87 Difference]: Start difference. First operand 172 states and 183 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-14 19:46:00,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:46:00,851 INFO L93 Difference]: Finished difference Result 181 states and 192 transitions. [2021-12-14 19:46:00,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 19:46:00,851 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-14 19:46:00,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:46:00,852 INFO L225 Difference]: With dead ends: 181 [2021-12-14 19:46:00,852 INFO L226 Difference]: Without dead ends: 181 [2021-12-14 19:46:00,852 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-14 19:46:00,853 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-14 19:46:00,853 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-14 19:46:00,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2021-12-14 19:46:00,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 175. [2021-12-14 19:46:00,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 144 states have (on average 1.2916666666666667) internal successors, (186), 174 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:00,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 186 transitions. [2021-12-14 19:46:00,872 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 186 transitions. Word has length 30 [2021-12-14 19:46:00,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:46:00,873 INFO L470 AbstractCegarLoop]: Abstraction has 175 states and 186 transitions. [2021-12-14 19:46:00,873 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-14 19:46:00,873 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 186 transitions. [2021-12-14 19:46:00,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-14 19:46:00,873 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:46:00,873 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-14 19:46:00,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Ended with exit code 0 [2021-12-14 19:46:01,081 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-14 19:46:01,081 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-14 19:46:01,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:46:01,082 INFO L85 PathProgramCache]: Analyzing trace with hash -275466542, now seen corresponding path program 1 times [2021-12-14 19:46:01,082 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:46:01,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1610159444] [2021-12-14 19:46:01,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:46:01,082 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:46:01,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:46:01,083 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-14 19:46:01,085 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-14 19:46:01,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:46:01,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 19:46:01,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:46:01,246 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-14 19:46:01,246 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:46:01,246 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:46:01,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1610159444] [2021-12-14 19:46:01,246 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1610159444] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:46:01,246 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:46:01,246 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:46:01,247 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556251322] [2021-12-14 19:46:01,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:46:01,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:46:01,247 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:46:01,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:46:01,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:46:01,247 INFO L87 Difference]: Start difference. First operand 175 states and 186 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-14 19:46:01,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:46:01,299 INFO L93 Difference]: Finished difference Result 177 states and 188 transitions. [2021-12-14 19:46:01,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:46:01,300 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-14 19:46:01,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:46:01,300 INFO L225 Difference]: With dead ends: 177 [2021-12-14 19:46:01,300 INFO L226 Difference]: Without dead ends: 177 [2021-12-14 19:46:01,300 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-14 19:46:01,301 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.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:46:01,301 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.0s Time] [2021-12-14 19:46:01,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2021-12-14 19:46:01,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2021-12-14 19:46:01,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 146 states have (on average 1.2876712328767124) internal successors, (188), 176 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:01,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 188 transitions. [2021-12-14 19:46:01,303 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 188 transitions. Word has length 30 [2021-12-14 19:46:01,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:46:01,303 INFO L470 AbstractCegarLoop]: Abstraction has 177 states and 188 transitions. [2021-12-14 19:46:01,303 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-14 19:46:01,303 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 188 transitions. [2021-12-14 19:46:01,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-14 19:46:01,303 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:46:01,304 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-14 19:46:01,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2021-12-14 19:46:01,510 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-14 19:46:01,511 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-14 19:46:01,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:46:01,511 INFO L85 PathProgramCache]: Analyzing trace with hash 2127502605, now seen corresponding path program 1 times [2021-12-14 19:46:01,512 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:46:01,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [107013314] [2021-12-14 19:46:01,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:46:01,512 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:46:01,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:46:01,527 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-14 19:46:01,547 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-14 19:46:01,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:46:01,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-14 19:46:01,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:46:01,780 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-14 19:46:01,781 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 23 treesize of output 30 [2021-12-14 19:46:01,810 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-14 19:46:01,896 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:46:01,897 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 32 treesize of output 33 [2021-12-14 19:46:01,915 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 29 treesize of output 17 [2021-12-14 19:46:01,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-14 19:46:01,973 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:46:01,973 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:46:01,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [107013314] [2021-12-14 19:46:01,974 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [107013314] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:46:01,974 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:46:01,974 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 19:46:01,974 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282273141] [2021-12-14 19:46:01,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:46:01,974 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 19:46:01,975 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:46:01,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 19:46:01,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:46:01,975 INFO L87 Difference]: Start difference. First operand 177 states and 188 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-14 19:46:02,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:46:02,189 INFO L93 Difference]: Finished difference Result 176 states and 187 transitions. [2021-12-14 19:46:02,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 19:46:02,190 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-14 19:46:02,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:46:02,191 INFO L225 Difference]: With dead ends: 176 [2021-12-14 19:46:02,191 INFO L226 Difference]: Without dead ends: 176 [2021-12-14 19:46:02,191 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:46:02,191 INFO L933 BasicCegarLoop]: 88 mSDtfsCounter, 47 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 300 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:46:02,192 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 302 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 64 Invalid, 0 Unknown, 300 Unchecked, 0.2s Time] [2021-12-14 19:46:02,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2021-12-14 19:46:02,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2021-12-14 19:46:02,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 146 states have (on average 1.2808219178082192) internal successors, (187), 175 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:02,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 187 transitions. [2021-12-14 19:46:02,194 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 187 transitions. Word has length 30 [2021-12-14 19:46:02,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:46:02,194 INFO L470 AbstractCegarLoop]: Abstraction has 176 states and 187 transitions. [2021-12-14 19:46:02,194 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-14 19:46:02,194 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 187 transitions. [2021-12-14 19:46:02,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-14 19:46:02,195 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:46:02,195 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:46:02,205 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-14 19:46:02,403 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-14 19:46:02,403 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-14 19:46:02,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:46:02,404 INFO L85 PathProgramCache]: Analyzing trace with hash 2127502606, now seen corresponding path program 1 times [2021-12-14 19:46:02,404 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:46:02,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1151523494] [2021-12-14 19:46:02,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:46:02,404 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:46:02,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:46:02,405 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-14 19:46:02,407 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-14 19:46:02,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:46:02,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 19 conjunts are in the unsatisfiable core [2021-12-14 19:46:02,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:46:02,641 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-14 19:46:02,648 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:46:02,648 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 15 treesize of output 15 [2021-12-14 19:46:02,670 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-14 19:46:02,674 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-14 19:46:02,729 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:46:02,729 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-14 19:46:02,736 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-14 19:46:02,757 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-14 19:46:02,761 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-14 19:46:02,786 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-14 19:46:02,787 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:46:02,787 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:46:02,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1151523494] [2021-12-14 19:46:02,787 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1151523494] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:46:02,787 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:46:02,787 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 19:46:02,787 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022047303] [2021-12-14 19:46:02,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:46:02,787 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 19:46:02,787 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:46:02,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 19:46:02,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:46:02,788 INFO L87 Difference]: Start difference. First operand 176 states and 187 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-14 19:46:03,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:46:03,435 INFO L93 Difference]: Finished difference Result 173 states and 183 transitions. [2021-12-14 19:46:03,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 19:46:03,436 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-14 19:46:03,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:46:03,436 INFO L225 Difference]: With dead ends: 173 [2021-12-14 19:46:03,436 INFO L226 Difference]: Without dead ends: 173 [2021-12-14 19:46:03,436 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-14 19:46:03,437 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 70 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-14 19:46:03,437 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 386 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-14 19:46:03,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2021-12-14 19:46:03,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 154. [2021-12-14 19:46:03,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 131 states have (on average 1.2442748091603053) internal successors, (163), 153 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-14 19:46:03,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 163 transitions. [2021-12-14 19:46:03,439 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 163 transitions. Word has length 30 [2021-12-14 19:46:03,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:46:03,439 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 163 transitions. [2021-12-14 19:46:03,439 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-14 19:46:03,439 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 163 transitions. [2021-12-14 19:46:03,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-14 19:46:03,440 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:46:03,440 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-14 19:46:03,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2021-12-14 19:46:03,651 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-14 19:46:03,652 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-14 19:46:03,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:46:03,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1259070453, now seen corresponding path program 1 times [2021-12-14 19:46:03,653 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:46:03,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1630271712] [2021-12-14 19:46:03,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:46:03,653 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:46:03,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:46:03,654 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-14 19:46:03,655 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-14 19:46:03,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:46:03,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-14 19:46:03,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:46:03,975 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-14 19:46:03,977 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-14 19:46:04,058 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-14 19:46:04,058 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:46:04,276 INFO L354 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2021-12-14 19:46:04,277 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-14 19:46:04,285 INFO L354 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2021-12-14 19:46:04,285 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-14 19:46:04,364 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-14 19:46:04,364 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:46:04,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1630271712] [2021-12-14 19:46:04,365 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1630271712] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:46:04,365 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 19:46:04,365 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2021-12-14 19:46:04,365 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685479806] [2021-12-14 19:46:04,365 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 19:46:04,365 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-14 19:46:04,365 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:46:04,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-14 19:46:04,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2021-12-14 19:46:04,366 INFO L87 Difference]: Start difference. First operand 154 states and 163 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-14 19:46:05,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:46:05,638 INFO L93 Difference]: Finished difference Result 199 states and 212 transitions. [2021-12-14 19:46:05,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-14 19:46:05,638 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-14 19:46:05,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:46:05,639 INFO L225 Difference]: With dead ends: 199 [2021-12-14 19:46:05,639 INFO L226 Difference]: Without dead ends: 199 [2021-12-14 19:46:05,639 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-14 19:46:05,640 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 249 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:46:05,640 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [249 Valid, 637 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 847 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-12-14 19:46:05,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2021-12-14 19:46:05,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 165. [2021-12-14 19:46:05,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 142 states have (on average 1.2394366197183098) internal successors, (176), 164 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:05,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 176 transitions. [2021-12-14 19:46:05,642 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 176 transitions. Word has length 33 [2021-12-14 19:46:05,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:46:05,642 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 176 transitions. [2021-12-14 19:46:05,642 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-14 19:46:05,642 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 176 transitions. [2021-12-14 19:46:05,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-14 19:46:05,642 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:46:05,643 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-14 19:46:05,649 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Ended with exit code 0 [2021-12-14 19:46:05,843 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-14 19:46:05,843 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-14 19:46:05,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:46:05,843 INFO L85 PathProgramCache]: Analyzing trace with hash 376478029, now seen corresponding path program 1 times [2021-12-14 19:46:05,844 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:46:05,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1218047806] [2021-12-14 19:46:05,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:46:05,844 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:46:05,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:46:05,845 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-14 19:46:05,846 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-14 19:46:05,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 19:46:05,995 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 19:46:06,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 19:46:06,078 INFO L133 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2021-12-14 19:46:06,078 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-14 19:46:06,079 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_LEAK (76 of 77 remaining) [2021-12-14 19:46:06,080 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (75 of 77 remaining) [2021-12-14 19:46:06,080 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (74 of 77 remaining) [2021-12-14 19:46:06,080 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (73 of 77 remaining) [2021-12-14 19:46:06,080 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (72 of 77 remaining) [2021-12-14 19:46:06,081 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (71 of 77 remaining) [2021-12-14 19:46:06,081 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (70 of 77 remaining) [2021-12-14 19:46:06,081 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (69 of 77 remaining) [2021-12-14 19:46:06,081 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION (68 of 77 remaining) [2021-12-14 19:46:06,081 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION (67 of 77 remaining) [2021-12-14 19:46:06,081 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION (66 of 77 remaining) [2021-12-14 19:46:06,081 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION (65 of 77 remaining) [2021-12-14 19:46:06,081 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION (64 of 77 remaining) [2021-12-14 19:46:06,082 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION (63 of 77 remaining) [2021-12-14 19:46:06,082 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION (62 of 77 remaining) [2021-12-14 19:46:06,082 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION (61 of 77 remaining) [2021-12-14 19:46:06,082 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION (60 of 77 remaining) [2021-12-14 19:46:06,082 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION (59 of 77 remaining) [2021-12-14 19:46:06,082 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION (58 of 77 remaining) [2021-12-14 19:46:06,082 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION (57 of 77 remaining) [2021-12-14 19:46:06,082 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATION (56 of 77 remaining) [2021-12-14 19:46:06,083 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION (55 of 77 remaining) [2021-12-14 19:46:06,083 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATION (54 of 77 remaining) [2021-12-14 19:46:06,083 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATION (53 of 77 remaining) [2021-12-14 19:46:06,083 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATION (52 of 77 remaining) [2021-12-14 19:46:06,083 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATION (51 of 77 remaining) [2021-12-14 19:46:06,083 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATION (50 of 77 remaining) [2021-12-14 19:46:06,083 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATION (49 of 77 remaining) [2021-12-14 19:46:06,084 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATION (48 of 77 remaining) [2021-12-14 19:46:06,084 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATION (47 of 77 remaining) [2021-12-14 19:46:06,084 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATION (46 of 77 remaining) [2021-12-14 19:46:06,084 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATION (45 of 77 remaining) [2021-12-14 19:46:06,084 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATION (44 of 77 remaining) [2021-12-14 19:46:06,084 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATION (43 of 77 remaining) [2021-12-14 19:46:06,084 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATION (42 of 77 remaining) [2021-12-14 19:46:06,084 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATION (41 of 77 remaining) [2021-12-14 19:46:06,085 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATION (40 of 77 remaining) [2021-12-14 19:46:06,085 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATION (39 of 77 remaining) [2021-12-14 19:46:06,085 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATION (38 of 77 remaining) [2021-12-14 19:46:06,085 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATION (37 of 77 remaining) [2021-12-14 19:46:06,085 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATION (36 of 77 remaining) [2021-12-14 19:46:06,085 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK (35 of 77 remaining) [2021-12-14 19:46:06,085 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATION (34 of 77 remaining) [2021-12-14 19:46:06,085 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATION (33 of 77 remaining) [2021-12-14 19:46:06,086 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK (32 of 77 remaining) [2021-12-14 19:46:06,086 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK (31 of 77 remaining) [2021-12-14 19:46:06,086 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK (30 of 77 remaining) [2021-12-14 19:46:06,086 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATION (29 of 77 remaining) [2021-12-14 19:46:06,086 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATION (28 of 77 remaining) [2021-12-14 19:46:06,086 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK (27 of 77 remaining) [2021-12-14 19:46:06,086 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATION (26 of 77 remaining) [2021-12-14 19:46:06,086 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATION (25 of 77 remaining) [2021-12-14 19:46:06,087 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATION (24 of 77 remaining) [2021-12-14 19:46:06,087 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATION (23 of 77 remaining) [2021-12-14 19:46:06,087 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK (22 of 77 remaining) [2021-12-14 19:46:06,087 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATION (21 of 77 remaining) [2021-12-14 19:46:06,087 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATION (20 of 77 remaining) [2021-12-14 19:46:06,087 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK (19 of 77 remaining) [2021-12-14 19:46:06,087 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57REQUIRES_VIOLATION (18 of 77 remaining) [2021-12-14 19:46:06,088 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATION (17 of 77 remaining) [2021-12-14 19:46:06,088 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATION (16 of 77 remaining) [2021-12-14 19:46:06,088 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATION (15 of 77 remaining) [2021-12-14 19:46:06,088 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61REQUIRES_VIOLATION (14 of 77 remaining) [2021-12-14 19:46:06,088 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62REQUIRES_VIOLATION (13 of 77 remaining) [2021-12-14 19:46:06,088 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE (12 of 77 remaining) [2021-12-14 19:46:06,088 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE (11 of 77 remaining) [2021-12-14 19:46:06,088 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE (10 of 77 remaining) [2021-12-14 19:46:06,089 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66REQUIRES_VIOLATION (9 of 77 remaining) [2021-12-14 19:46:06,089 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67REQUIRES_VIOLATION (8 of 77 remaining) [2021-12-14 19:46:06,089 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE (7 of 77 remaining) [2021-12-14 19:46:06,089 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE (6 of 77 remaining) [2021-12-14 19:46:06,089 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE (5 of 77 remaining) [2021-12-14 19:46:06,089 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71REQUIRES_VIOLATION (4 of 77 remaining) [2021-12-14 19:46:06,089 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72REQUIRES_VIOLATION (3 of 77 remaining) [2021-12-14 19:46:06,089 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE (2 of 77 remaining) [2021-12-14 19:46:06,090 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE (1 of 77 remaining) [2021-12-14 19:46:06,090 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE (0 of 77 remaining) [2021-12-14 19:46:06,119 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-14 19:46:06,290 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-14 19:46:06,293 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-14 19:46:06,295 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-14 19:46:06,323 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 07:46:06 BoogieIcfgContainer [2021-12-14 19:46:06,323 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-14 19:46:06,324 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-14 19:46:06,324 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-14 19:46:06,324 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-14 19:46:06,324 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:45:44" (3/4) ... [2021-12-14 19:46:06,326 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-14 19:46:06,326 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-14 19:46:06,327 INFO L158 Benchmark]: Toolchain (without parser) took 23456.22ms. Allocated memory was 54.5MB in the beginning and 83.9MB in the end (delta: 29.4MB). Free memory was 31.8MB in the beginning and 23.2MB in the end (delta: 8.6MB). Peak memory consumption was 36.0MB. Max. memory is 16.1GB. [2021-12-14 19:46:06,327 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 54.5MB. Free memory was 36.6MB in the beginning and 36.5MB in the end (delta: 44.5kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 19:46:06,327 INFO L158 Benchmark]: CACSL2BoogieTranslator took 628.77ms. Allocated memory was 54.5MB in the beginning and 69.2MB in the end (delta: 14.7MB). Free memory was 31.7MB in the beginning and 43.4MB in the end (delta: -11.7MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. [2021-12-14 19:46:06,328 INFO L158 Benchmark]: Boogie Procedure Inliner took 108.22ms. Allocated memory is still 69.2MB. Free memory was 43.4MB in the beginning and 41.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 19:46:06,328 INFO L158 Benchmark]: Boogie Preprocessor took 108.91ms. Allocated memory is still 69.2MB. Free memory was 41.0MB in the beginning and 38.9MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 19:46:06,328 INFO L158 Benchmark]: RCFGBuilder took 1032.50ms. Allocated memory is still 69.2MB. Free memory was 38.9MB in the beginning and 32.5MB in the end (delta: 6.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-12-14 19:46:06,328 INFO L158 Benchmark]: TraceAbstraction took 21568.72ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 32.2MB in the beginning and 23.7MB in the end (delta: 8.5MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. [2021-12-14 19:46:06,329 INFO L158 Benchmark]: Witness Printer took 2.50ms. Allocated memory is still 83.9MB. Free memory was 23.7MB in the beginning and 23.2MB in the end (delta: 485.8kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 19:46:06,338 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.14ms. Allocated memory is still 54.5MB. Free memory was 36.6MB in the beginning and 36.5MB in the end (delta: 44.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 628.77ms. Allocated memory was 54.5MB in the beginning and 69.2MB in the end (delta: 14.7MB). Free memory was 31.7MB in the beginning and 43.4MB in the end (delta: -11.7MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 108.22ms. Allocated memory is still 69.2MB. Free memory was 43.4MB in the beginning and 41.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 108.91ms. Allocated memory is still 69.2MB. Free memory was 41.0MB in the beginning and 38.9MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1032.50ms. Allocated memory is still 69.2MB. Free memory was 38.9MB in the beginning and 32.5MB in the end (delta: 6.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 21568.72ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 32.2MB in the beginning and 23.7MB in the end (delta: 8.5MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. * Witness Printer took 2.50ms. Allocated memory is still 83.9MB. Free memory was 23.7MB in the beginning and 23.2MB in the end (delta: 485.8kB). 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={-2147483647:0}] [L1000] null->prev = ((void*)0) VAL [null={-2147483647:0}] [L1001] null->colour = BLACK VAL [null={-2147483647:0}] [L1003] struct TSLL* list = malloc(sizeof(struct TSLL)); [L1004] list->next = null VAL [list={3:0}, null={-2147483647:0}] [L1005] list->prev = null VAL [list={3:0}, null={-2147483647:0}] [L1006] list->colour = BLACK VAL [list={3:0}, null={-2147483647:0}] [L1008] struct TSLL* end = list; VAL [end={3:0}, list={3:0}, null={-2147483647:0}] [L1011] COND FALSE !(__VERIFIER_nondet_int()) [L1037] end = null [L1038] end = list VAL [end={3:0}, list={3:0}, null={-2147483647:0}] [L1041] COND FALSE !(!(null != end)) VAL [end={3:0}, list={3:0}, null={-2147483647:0}] [L1042] EXPR end->colour VAL [end={3:0}, end->colour=1, list={3:0}, null={-2147483647:0}] [L1042] COND FALSE !(!(BLACK == end->colour)) [L1043] COND TRUE null != end VAL [end={3:0}, list={3:0}, null={-2147483647:0}] [L1045] EXPR end->colour VAL [end={3:0}, end->colour=1, list={3:0}, null={-2147483647:0}] [L1045] COND FALSE !(RED == end->colour) [L1052] EXPR end->next VAL [end={3:0}, end->next={-2147483647:0}, list={3:0}, null={-2147483647:0}] [L1052] end = end->next [L1043] COND FALSE !(null != end) VAL [end={-2147483647:0}, list={3:0}, null={-2147483647:0}] [L1056] COND TRUE null != list VAL [end={-2147483647:0}, list={3:0}, null={-2147483647:0}] [L1058] EXPR list->colour VAL [end={-2147483647:0}, list={3:0}, list->colour=1, null={-2147483647:0}] [L1058] COND FALSE !(RED == list->colour) [L1067] EXPR list->next VAL [end={-2147483647:0}, list={3:0}, list->next={-2147483647:0}, null={-2147483647:0}] [L1067] end = list->next [L1068] free(list) VAL [end={-2147483647:0}, list={3:0}, null={-2147483647:0}] [L1068] free(list) VAL [end={-2147483647:0}, list={3:0}, null={-2147483647:0}] [L1068] free(list) [L1069] list = end VAL [end={-2147483647:0}, list={-2147483647:0}, null={-2147483647:0}] [L1056] COND FALSE !(null != list) VAL [end={-2147483647:0}, list={-2147483647:0}, null={-2147483647:0}] [L1073] return 0; VAL [\result=0, end={-2147483647:0}, list={-2147483647:0}, null={-2147483647: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: 21.5s, OverallIterations: 25, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2846 SdHoareTripleChecker+Valid, 8.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2846 mSDsluCounter, 6384 SdHoareTripleChecker+Invalid, 6.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 703 IncrementalHoareTripleChecker+Unchecked, 4157 mSDsCounter, 257 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5019 IncrementalHoareTripleChecker+Invalid, 5979 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 257 mSolverCounterUnsat, 2227 mSDtfsCounter, 5019 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 562 GetRequests, 396 SyntacticMatches, 16 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=177occurred in iteration=21, InterpolantAutomatonStates: 162, 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, 391 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 510 NumberOfCodeBlocks, 510 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 507 ConstructedInterpolants, 21 QuantifiedInterpolants, 3701 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-14 19:46:06,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample