./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/forester-heap/dll-sorted-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/dll-sorted-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 635ef9d2e243ceee348a174080644f4e80f3ae61 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup) --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 04:26:11,072 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 04:26:11,074 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 04:26:11,115 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 04:26:11,116 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 04:26:11,119 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 04:26:11,120 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 04:26:11,125 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 04:26:11,126 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 04:26:11,131 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 04:26:11,131 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 04:26:11,133 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 04:26:11,133 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 04:26:11,135 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 04:26:11,136 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 04:26:11,141 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 04:26:11,142 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 04:26:11,143 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 04:26:11,144 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 04:26:11,147 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 04:26:11,149 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 04:26:11,150 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 04:26:11,153 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 04:26:11,154 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 04:26:11,157 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 04:26:11,158 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 04:26:11,158 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 04:26:11,159 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 04:26:11,160 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 04:26:11,161 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 04:26:11,161 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 04:26:11,161 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 04:26:11,162 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 04:26:11,163 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 04:26:11,164 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 04:26:11,164 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 04:26:11,165 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 04:26:11,165 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 04:26:11,166 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 04:26:11,167 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 04:26:11,167 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 04:26:11,171 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2021-08-27 04:26:11,190 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 04:26:11,191 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 04:26:11,191 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 04:26:11,192 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 04:26:11,193 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 04:26:11,193 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 04:26:11,193 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 04:26:11,193 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 04:26:11,194 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 04:26:11,194 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 04:26:11,195 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 04:26:11,195 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 04:26:11,195 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 04:26:11,195 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-08-27 04:26:11,195 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-08-27 04:26:11,195 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-27 04:26:11,195 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-08-27 04:26:11,201 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 04:26:11,201 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 04:26:11,201 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 04:26:11,201 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 04:26:11,201 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-27 04:26:11,201 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 04:26:11,202 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 04:26:11,202 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-27 04:26:11,202 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 04:26:11,202 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-27 04:26:11,202 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 04:26:11,202 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 635ef9d2e243ceee348a174080644f4e80f3ae61 [2021-08-27 04:26:11,513 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 04:26:11,525 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 04:26:11,527 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 04:26:11,528 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 04:26:11,528 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 04:26:11,529 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-sorted-1.i [2021-08-27 04:26:11,567 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c180cb46a/bed2242ce1f247338b481126232013c6/FLAGe730d62f2 [2021-08-27 04:26:11,966 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 04:26:11,968 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-1.i [2021-08-27 04:26:11,978 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c180cb46a/bed2242ce1f247338b481126232013c6/FLAGe730d62f2 [2021-08-27 04:26:11,991 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c180cb46a/bed2242ce1f247338b481126232013c6 [2021-08-27 04:26:11,993 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 04:26:11,994 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-27 04:26:11,995 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 04:26:11,996 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 04:26:11,998 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 04:26:11,998 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 04:26:11" (1/1) ... [2021-08-27 04:26:11,999 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@153502db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:11, skipping insertion in model container [2021-08-27 04:26:11,999 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 04:26:11" (1/1) ... [2021-08-27 04:26:12,004 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 04:26:12,050 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 04:26:12,408 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-1.i[22384,22397] [2021-08-27 04:26:12,415 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-1.i[22614,22627] [2021-08-27 04:26:12,420 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-1.i[22989,23002] [2021-08-27 04:26:12,427 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-1.i[23053,23066] [2021-08-27 04:26:12,429 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-1.i[23184,23197] [2021-08-27 04:26:12,430 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-1.i[23248,23261] [2021-08-27 04:26:12,436 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 04:26:12,461 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 04:26:12,513 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-1.i[22384,22397] [2021-08-27 04:26:12,517 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-1.i[22614,22627] [2021-08-27 04:26:12,521 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-1.i[22989,23002] [2021-08-27 04:26:12,522 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-1.i[23053,23066] [2021-08-27 04:26:12,523 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-1.i[23184,23197] [2021-08-27 04:26:12,525 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-1.i[23248,23261] [2021-08-27 04:26:12,530 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 04:26:12,565 INFO L208 MainTranslator]: Completed translation [2021-08-27 04:26:12,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:12 WrapperNode [2021-08-27 04:26:12,577 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 04:26:12,578 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 04:26:12,578 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 04:26:12,578 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 04:26:12,585 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:12" (1/1) ... [2021-08-27 04:26:12,586 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:12" (1/1) ... [2021-08-27 04:26:12,629 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:12" (1/1) ... [2021-08-27 04:26:12,630 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:12" (1/1) ... [2021-08-27 04:26:12,647 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:12" (1/1) ... [2021-08-27 04:26:12,657 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:12" (1/1) ... [2021-08-27 04:26:12,662 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:12" (1/1) ... [2021-08-27 04:26:12,669 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 04:26:12,674 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 04:26:12,674 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 04:26:12,674 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 04:26:12,675 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:12" (1/1) ... [2021-08-27 04:26:12,679 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 04:26:12,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 04:26:12,691 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-27 04:26:12,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-27 04:26:12,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-08-27 04:26:12,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 04:26:12,722 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-08-27 04:26:12,723 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-08-27 04:26:12,723 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-08-27 04:26:12,723 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-08-27 04:26:12,723 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-08-27 04:26:12,723 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-08-27 04:26:12,723 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-08-27 04:26:12,723 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-08-27 04:26:12,723 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-08-27 04:26:12,724 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-08-27 04:26:12,724 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-08-27 04:26:12,724 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-08-27 04:26:12,724 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-08-27 04:26:12,724 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-08-27 04:26:12,724 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-08-27 04:26:12,724 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-08-27 04:26:12,725 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-08-27 04:26:12,725 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-08-27 04:26:12,725 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-08-27 04:26:12,725 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-08-27 04:26:12,725 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-08-27 04:26:12,725 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-08-27 04:26:12,725 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-08-27 04:26:12,725 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-08-27 04:26:12,726 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-08-27 04:26:12,726 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-08-27 04:26:12,726 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-08-27 04:26:12,726 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-08-27 04:26:12,726 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-08-27 04:26:12,726 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-08-27 04:26:12,727 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-08-27 04:26:12,727 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-08-27 04:26:12,727 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-08-27 04:26:12,727 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-08-27 04:26:12,727 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-08-27 04:26:12,728 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-08-27 04:26:12,728 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-08-27 04:26:12,728 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-08-27 04:26:12,728 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-08-27 04:26:12,728 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-08-27 04:26:12,729 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-08-27 04:26:12,735 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-08-27 04:26:12,736 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-08-27 04:26:12,736 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-08-27 04:26:12,736 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-08-27 04:26:12,736 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-08-27 04:26:12,736 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-08-27 04:26:12,736 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-08-27 04:26:12,736 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-08-27 04:26:12,737 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-08-27 04:26:12,737 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-08-27 04:26:12,737 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-08-27 04:26:12,737 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-08-27 04:26:12,737 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-08-27 04:26:12,738 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-08-27 04:26:12,738 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-08-27 04:26:12,738 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2021-08-27 04:26:12,739 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-08-27 04:26:12,739 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-08-27 04:26:12,740 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-08-27 04:26:12,740 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2021-08-27 04:26:12,740 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-08-27 04:26:12,740 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-08-27 04:26:12,740 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2021-08-27 04:26:12,740 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-08-27 04:26:12,740 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-08-27 04:26:12,740 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2021-08-27 04:26:12,741 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-08-27 04:26:12,741 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-08-27 04:26:12,741 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-08-27 04:26:12,741 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-08-27 04:26:12,741 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-08-27 04:26:12,741 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-08-27 04:26:12,741 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-08-27 04:26:12,741 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-08-27 04:26:12,742 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-08-27 04:26:12,742 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-08-27 04:26:12,742 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-08-27 04:26:12,742 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-08-27 04:26:12,742 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-08-27 04:26:12,742 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-08-27 04:26:12,742 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-08-27 04:26:12,742 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-08-27 04:26:12,743 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-08-27 04:26:12,743 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-08-27 04:26:12,743 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-08-27 04:26:12,743 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-08-27 04:26:12,743 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-08-27 04:26:12,743 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-08-27 04:26:12,743 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-08-27 04:26:12,743 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-08-27 04:26:12,743 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-08-27 04:26:12,744 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-08-27 04:26:12,744 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-08-27 04:26:12,744 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-08-27 04:26:12,744 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-08-27 04:26:12,744 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-08-27 04:26:12,744 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-08-27 04:26:12,745 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-08-27 04:26:12,745 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-08-27 04:26:12,745 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-08-27 04:26:12,745 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-08-27 04:26:12,745 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-08-27 04:26:12,745 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-08-27 04:26:12,745 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-08-27 04:26:12,745 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-08-27 04:26:12,746 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-08-27 04:26:12,746 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-08-27 04:26:12,746 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-08-27 04:26:12,746 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-08-27 04:26:12,746 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 04:26:12,746 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-08-27 04:26:12,746 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-27 04:26:12,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-27 04:26:12,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-27 04:26:12,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-27 04:26:12,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-27 04:26:12,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 04:26:12,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-08-27 04:26:12,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-27 04:26:12,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 04:26:13,391 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 04:26:13,392 INFO L299 CfgBuilder]: Removed 18 assume(true) statements. [2021-08-27 04:26:13,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 04:26:13 BoogieIcfgContainer [2021-08-27 04:26:13,393 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 04:26:13,395 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-27 04:26:13,395 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-27 04:26:13,397 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-27 04:26:13,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 04:26:11" (1/3) ... [2021-08-27 04:26:13,398 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@142dd230 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 04:26:13, skipping insertion in model container [2021-08-27 04:26:13,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:12" (2/3) ... [2021-08-27 04:26:13,398 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@142dd230 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 04:26:13, skipping insertion in model container [2021-08-27 04:26:13,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 04:26:13" (3/3) ... [2021-08-27 04:26:13,399 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-sorted-1.i [2021-08-27 04:26:13,403 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-27 04:26:13,403 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 80 error locations. [2021-08-27 04:26:13,434 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-27 04:26:13,441 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-27 04:26:13,441 INFO L340 AbstractCegarLoop]: Starting to check reachability of 80 error locations. [2021-08-27 04:26:13,458 INFO L276 IsEmpty]: Start isEmpty. Operand has 184 states, 99 states have (on average 2.1717171717171717) internal successors, (215), 179 states have internal predecessors, (215), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 04:26:13,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-08-27 04:26:13,463 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:13,463 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:13,464 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-27 04:26:13,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:13,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1404346321, now seen corresponding path program 1 times [2021-08-27 04:26:13,472 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:13,473 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064631321] [2021-08-27 04:26:13,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:13,473 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:13,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:13,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:13,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:13,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:13,667 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:13,668 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064631321] [2021-08-27 04:26:13,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064631321] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:13,668 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:13,669 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 04:26:13,675 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862452205] [2021-08-27 04:26:13,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 04:26:13,680 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:13,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 04:26:13,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 04:26:13,691 INFO L87 Difference]: Start difference. First operand has 184 states, 99 states have (on average 2.1717171717171717) internal successors, (215), 179 states have internal predecessors, (215), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:14,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:14,012 INFO L93 Difference]: Finished difference Result 186 states and 198 transitions. [2021-08-27 04:26:14,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 04:26:14,013 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 7 [2021-08-27 04:26:14,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:14,021 INFO L225 Difference]: With dead ends: 186 [2021-08-27 04:26:14,021 INFO L226 Difference]: Without dead ends: 182 [2021-08-27 04:26:14,022 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 36.5ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 04:26:14,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-08-27 04:26:14,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 178. [2021-08-27 04:26:14,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 98 states have (on average 1.8979591836734695) internal successors, (186), 174 states have internal predecessors, (186), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:14,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 189 transitions. [2021-08-27 04:26:14,051 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 189 transitions. Word has length 7 [2021-08-27 04:26:14,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:14,051 INFO L470 AbstractCegarLoop]: Abstraction has 178 states and 189 transitions. [2021-08-27 04:26:14,051 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:14,051 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 189 transitions. [2021-08-27 04:26:14,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-08-27 04:26:14,052 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:14,052 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:14,052 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-27 04:26:14,052 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr1REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-27 04:26:14,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:14,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1404346320, now seen corresponding path program 1 times [2021-08-27 04:26:14,053 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:14,053 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533832099] [2021-08-27 04:26:14,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:14,053 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:14,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:14,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:14,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:14,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:14,105 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:14,105 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533832099] [2021-08-27 04:26:14,105 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533832099] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:14,106 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:14,106 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 04:26:14,106 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257887883] [2021-08-27 04:26:14,107 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 04:26:14,107 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:14,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 04:26:14,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 04:26:14,108 INFO L87 Difference]: Start difference. First operand 178 states and 189 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:14,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:14,341 INFO L93 Difference]: Finished difference Result 179 states and 190 transitions. [2021-08-27 04:26:14,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 04:26:14,342 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 7 [2021-08-27 04:26:14,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:14,343 INFO L225 Difference]: With dead ends: 179 [2021-08-27 04:26:14,343 INFO L226 Difference]: Without dead ends: 179 [2021-08-27 04:26:14,343 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.3ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 04:26:14,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2021-08-27 04:26:14,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 175. [2021-08-27 04:26:14,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 98 states have (on average 1.8673469387755102) internal successors, (183), 171 states have internal predecessors, (183), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:14,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 186 transitions. [2021-08-27 04:26:14,349 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 186 transitions. Word has length 7 [2021-08-27 04:26:14,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:14,349 INFO L470 AbstractCegarLoop]: Abstraction has 175 states and 186 transitions. [2021-08-27 04:26:14,349 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:14,350 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 186 transitions. [2021-08-27 04:26:14,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-27 04:26:14,350 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:14,350 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:14,350 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-27 04:26:14,351 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr7REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-27 04:26:14,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:14,351 INFO L82 PathProgramCache]: Analyzing trace with hash -155484519, now seen corresponding path program 1 times [2021-08-27 04:26:14,351 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:14,351 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502563263] [2021-08-27 04:26:14,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:14,352 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:14,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:14,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:14,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:14,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:14,429 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:14,429 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502563263] [2021-08-27 04:26:14,429 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502563263] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:14,430 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:14,430 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 04:26:14,430 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807974366] [2021-08-27 04:26:14,430 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 04:26:14,430 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:14,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 04:26:14,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 04:26:14,431 INFO L87 Difference]: Start difference. First operand 175 states and 186 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:14,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:14,775 INFO L93 Difference]: Finished difference Result 289 states and 309 transitions. [2021-08-27 04:26:14,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 04:26:14,775 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2021-08-27 04:26:14,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:14,777 INFO L225 Difference]: With dead ends: 289 [2021-08-27 04:26:14,777 INFO L226 Difference]: Without dead ends: 289 [2021-08-27 04:26:14,777 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 27.6ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-27 04:26:14,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2021-08-27 04:26:14,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 234. [2021-08-27 04:26:14,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 157 states have (on average 1.8535031847133758) internal successors, (291), 230 states have internal predecessors, (291), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:14,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 294 transitions. [2021-08-27 04:26:14,785 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 294 transitions. Word has length 13 [2021-08-27 04:26:14,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:14,785 INFO L470 AbstractCegarLoop]: Abstraction has 234 states and 294 transitions. [2021-08-27 04:26:14,785 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:14,785 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 294 transitions. [2021-08-27 04:26:14,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-27 04:26:14,786 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:14,786 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:14,786 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-27 04:26:14,786 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr6REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-27 04:26:14,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:14,787 INFO L82 PathProgramCache]: Analyzing trace with hash -155484520, now seen corresponding path program 1 times [2021-08-27 04:26:14,787 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:14,787 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229954462] [2021-08-27 04:26:14,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:14,787 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:14,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:14,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:14,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:14,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-08-27 04:26:14,839 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:14,839 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229954462] [2021-08-27 04:26:14,839 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229954462] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:14,839 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:14,839 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 04:26:14,839 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63801976] [2021-08-27 04:26:14,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 04:26:14,840 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:14,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 04:26:14,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 04:26:14,840 INFO L87 Difference]: Start difference. First operand 234 states and 294 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:15,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:15,087 INFO L93 Difference]: Finished difference Result 232 states and 272 transitions. [2021-08-27 04:26:15,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 04:26:15,087 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2021-08-27 04:26:15,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:15,089 INFO L225 Difference]: With dead ends: 232 [2021-08-27 04:26:15,089 INFO L226 Difference]: Without dead ends: 232 [2021-08-27 04:26:15,089 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.1ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-27 04:26:15,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2021-08-27 04:26:15,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 224. [2021-08-27 04:26:15,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 165 states have (on average 1.612121212121212) internal successors, (266), 220 states have internal predecessors, (266), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:15,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 269 transitions. [2021-08-27 04:26:15,096 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 269 transitions. Word has length 13 [2021-08-27 04:26:15,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:15,096 INFO L470 AbstractCegarLoop]: Abstraction has 224 states and 269 transitions. [2021-08-27 04:26:15,096 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:15,097 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 269 transitions. [2021-08-27 04:26:15,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-27 04:26:15,097 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:15,097 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:15,097 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-27 04:26:15,097 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr20ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-27 04:26:15,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:15,098 INFO L82 PathProgramCache]: Analyzing trace with hash 903211970, now seen corresponding path program 1 times [2021-08-27 04:26:15,098 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:15,098 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110738366] [2021-08-27 04:26:15,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:15,099 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:15,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:15,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:15,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:15,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:15,145 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:15,145 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110738366] [2021-08-27 04:26:15,145 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110738366] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:15,145 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:15,146 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 04:26:15,146 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843068271] [2021-08-27 04:26:15,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 04:26:15,146 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:15,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 04:26:15,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 04:26:15,147 INFO L87 Difference]: Start difference. First operand 224 states and 269 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:15,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:15,309 INFO L93 Difference]: Finished difference Result 270 states and 319 transitions. [2021-08-27 04:26:15,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 04:26:15,309 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2021-08-27 04:26:15,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:15,310 INFO L225 Difference]: With dead ends: 270 [2021-08-27 04:26:15,310 INFO L226 Difference]: Without dead ends: 270 [2021-08-27 04:26:15,311 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.5ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 04:26:15,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2021-08-27 04:26:15,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 237. [2021-08-27 04:26:15,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 178 states have (on average 1.6067415730337078) internal successors, (286), 233 states have internal predecessors, (286), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:15,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 289 transitions. [2021-08-27 04:26:15,316 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 289 transitions. Word has length 15 [2021-08-27 04:26:15,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:15,316 INFO L470 AbstractCegarLoop]: Abstraction has 237 states and 289 transitions. [2021-08-27 04:26:15,317 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:15,317 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 289 transitions. [2021-08-27 04:26:15,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-27 04:26:15,317 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:15,317 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:15,317 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-27 04:26:15,317 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr10REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-27 04:26:15,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:15,318 INFO L82 PathProgramCache]: Analyzing trace with hash -2064587218, now seen corresponding path program 1 times [2021-08-27 04:26:15,318 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:15,318 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578823287] [2021-08-27 04:26:15,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:15,318 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:15,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:15,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:15,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:15,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:15,365 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:15,365 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578823287] [2021-08-27 04:26:15,365 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578823287] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:15,365 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:15,365 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 04:26:15,366 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677205912] [2021-08-27 04:26:15,366 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 04:26:15,366 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:15,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 04:26:15,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 04:26:15,367 INFO L87 Difference]: Start difference. First operand 237 states and 289 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:15,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:15,610 INFO L93 Difference]: Finished difference Result 236 states and 286 transitions. [2021-08-27 04:26:15,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 04:26:15,611 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2021-08-27 04:26:15,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:15,612 INFO L225 Difference]: With dead ends: 236 [2021-08-27 04:26:15,612 INFO L226 Difference]: Without dead ends: 236 [2021-08-27 04:26:15,612 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 30.1ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-08-27 04:26:15,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2021-08-27 04:26:15,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2021-08-27 04:26:15,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 178 states have (on average 1.5898876404494382) internal successors, (283), 232 states have internal predecessors, (283), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:15,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 286 transitions. [2021-08-27 04:26:15,616 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 286 transitions. Word has length 16 [2021-08-27 04:26:15,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:15,617 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 286 transitions. [2021-08-27 04:26:15,617 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:15,617 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 286 transitions. [2021-08-27 04:26:15,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-27 04:26:15,617 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:15,617 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:15,618 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-27 04:26:15,618 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr11REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-27 04:26:15,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:15,618 INFO L82 PathProgramCache]: Analyzing trace with hash -2064587217, now seen corresponding path program 1 times [2021-08-27 04:26:15,618 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:15,618 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333289992] [2021-08-27 04:26:15,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:15,619 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:15,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:15,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:15,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:15,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:15,677 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:15,677 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333289992] [2021-08-27 04:26:15,677 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333289992] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:15,677 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:15,677 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 04:26:15,678 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532517456] [2021-08-27 04:26:15,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 04:26:15,678 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:15,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 04:26:15,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 04:26:15,679 INFO L87 Difference]: Start difference. First operand 236 states and 286 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:15,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:15,925 INFO L93 Difference]: Finished difference Result 235 states and 283 transitions. [2021-08-27 04:26:15,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 04:26:15,926 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2021-08-27 04:26:15,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:15,927 INFO L225 Difference]: With dead ends: 235 [2021-08-27 04:26:15,927 INFO L226 Difference]: Without dead ends: 235 [2021-08-27 04:26:15,927 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 46.7ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-08-27 04:26:15,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2021-08-27 04:26:15,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2021-08-27 04:26:15,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 178 states have (on average 1.5730337078651686) internal successors, (280), 231 states have internal predecessors, (280), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:15,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 283 transitions. [2021-08-27 04:26:15,931 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 283 transitions. Word has length 16 [2021-08-27 04:26:15,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:15,931 INFO L470 AbstractCegarLoop]: Abstraction has 235 states and 283 transitions. [2021-08-27 04:26:15,931 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:15,931 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 283 transitions. [2021-08-27 04:26:15,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-27 04:26:15,932 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:15,932 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:15,932 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-27 04:26:15,932 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr14REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-27 04:26:15,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:15,932 INFO L82 PathProgramCache]: Analyzing trace with hash 949671408, now seen corresponding path program 1 times [2021-08-27 04:26:15,933 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:15,933 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509941705] [2021-08-27 04:26:15,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:15,933 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:15,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:16,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:16,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:16,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:16,033 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:16,033 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509941705] [2021-08-27 04:26:16,033 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509941705] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:16,033 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:16,033 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-27 04:26:16,033 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285125388] [2021-08-27 04:26:16,034 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-27 04:26:16,034 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:16,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 04:26:16,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-08-27 04:26:16,034 INFO L87 Difference]: Start difference. First operand 235 states and 283 transitions. Second operand has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:16,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:16,460 INFO L93 Difference]: Finished difference Result 242 states and 284 transitions. [2021-08-27 04:26:16,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 04:26:16,461 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2021-08-27 04:26:16,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:16,462 INFO L225 Difference]: With dead ends: 242 [2021-08-27 04:26:16,462 INFO L226 Difference]: Without dead ends: 242 [2021-08-27 04:26:16,462 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 98.7ms TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2021-08-27 04:26:16,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2021-08-27 04:26:16,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 234. [2021-08-27 04:26:16,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 178 states have (on average 1.5617977528089888) internal successors, (278), 230 states have internal predecessors, (278), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:16,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 281 transitions. [2021-08-27 04:26:16,466 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 281 transitions. Word has length 20 [2021-08-27 04:26:16,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:16,466 INFO L470 AbstractCegarLoop]: Abstraction has 234 states and 281 transitions. [2021-08-27 04:26:16,466 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:16,466 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 281 transitions. [2021-08-27 04:26:16,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-27 04:26:16,467 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:16,467 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:16,467 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-27 04:26:16,467 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr15REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-27 04:26:16,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:16,468 INFO L82 PathProgramCache]: Analyzing trace with hash 949671409, now seen corresponding path program 1 times [2021-08-27 04:26:16,468 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:16,468 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730537521] [2021-08-27 04:26:16,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:16,468 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:16,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:16,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:16,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:16,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:16,609 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:16,610 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730537521] [2021-08-27 04:26:16,610 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730537521] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:16,610 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:16,610 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-27 04:26:16,612 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558073942] [2021-08-27 04:26:16,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-27 04:26:16,612 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:16,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 04:26:16,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-08-27 04:26:16,613 INFO L87 Difference]: Start difference. First operand 234 states and 281 transitions. Second operand has 11 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:17,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:17,219 INFO L93 Difference]: Finished difference Result 237 states and 275 transitions. [2021-08-27 04:26:17,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-08-27 04:26:17,220 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2021-08-27 04:26:17,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:17,221 INFO L225 Difference]: With dead ends: 237 [2021-08-27 04:26:17,221 INFO L226 Difference]: Without dead ends: 237 [2021-08-27 04:26:17,221 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 283.3ms TimeCoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2021-08-27 04:26:17,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2021-08-27 04:26:17,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 220. [2021-08-27 04:26:17,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 170 states have (on average 1.5294117647058822) internal successors, (260), 216 states have internal predecessors, (260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:17,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 263 transitions. [2021-08-27 04:26:17,224 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 263 transitions. Word has length 20 [2021-08-27 04:26:17,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:17,225 INFO L470 AbstractCegarLoop]: Abstraction has 220 states and 263 transitions. [2021-08-27 04:26:17,225 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:17,225 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 263 transitions. [2021-08-27 04:26:17,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-08-27 04:26:17,225 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:17,226 INFO L512 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] [2021-08-27 04:26:17,226 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-27 04:26:17,226 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr20ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-27 04:26:17,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:17,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1432225935, now seen corresponding path program 1 times [2021-08-27 04:26:17,226 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:17,226 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303458724] [2021-08-27 04:26:17,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:17,227 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:17,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:17,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:17,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:17,268 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-27 04:26:17,269 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:17,269 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303458724] [2021-08-27 04:26:17,269 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303458724] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:17,269 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:17,269 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 04:26:17,269 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254509566] [2021-08-27 04:26:17,269 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 04:26:17,270 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:17,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 04:26:17,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 04:26:17,270 INFO L87 Difference]: Start difference. First operand 220 states and 263 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:17,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:17,470 INFO L93 Difference]: Finished difference Result 258 states and 281 transitions. [2021-08-27 04:26:17,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 04:26:17,470 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2021-08-27 04:26:17,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:17,471 INFO L225 Difference]: With dead ends: 258 [2021-08-27 04:26:17,471 INFO L226 Difference]: Without dead ends: 258 [2021-08-27 04:26:17,471 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.4ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-27 04:26:17,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2021-08-27 04:26:17,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 218. [2021-08-27 04:26:17,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 169 states have (on average 1.514792899408284) internal successors, (256), 214 states have internal predecessors, (256), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:17,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 259 transitions. [2021-08-27 04:26:17,475 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 259 transitions. Word has length 29 [2021-08-27 04:26:17,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:17,475 INFO L470 AbstractCegarLoop]: Abstraction has 218 states and 259 transitions. [2021-08-27 04:26:17,475 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:17,475 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 259 transitions. [2021-08-27 04:26:17,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-08-27 04:26:17,476 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:17,476 INFO L512 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, 1] [2021-08-27 04:26:17,476 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-27 04:26:17,476 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr25REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-27 04:26:17,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:17,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1716077152, now seen corresponding path program 1 times [2021-08-27 04:26:17,477 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:17,477 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850328629] [2021-08-27 04:26:17,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:17,477 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:17,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:17,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:17,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:17,671 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:17,671 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:17,672 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850328629] [2021-08-27 04:26:17,672 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850328629] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 04:26:17,672 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911621430] [2021-08-27 04:26:17,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:17,672 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 04:26:17,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 04:26:17,673 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 04:26:17,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-08-27 04:26:17,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:17,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 27 conjunts are in the unsatisfiable core [2021-08-27 04:26:17,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 04:26:17,855 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 04:26:17,993 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-08-27 04:26:18,001 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 17 treesize of output 21 [2021-08-27 04:26:18,092 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 21 treesize of output 17 [2021-08-27 04:26:18,227 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-08-27 04:26:18,227 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 39 treesize of output 29 [2021-08-27 04:26:18,464 INFO L354 Elim1Store]: treesize reduction 62, result has 27.1 percent of original size [2021-08-27 04:26:18,464 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 48 [2021-08-27 04:26:18,588 INFO L354 Elim1Store]: treesize reduction 72, result has 17.2 percent of original size [2021-08-27 04:26:18,589 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 45 [2021-08-27 04:26:18,849 INFO L354 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2021-08-27 04:26:18,849 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 33 [2021-08-27 04:26:18,880 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:18,880 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [911621430] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 04:26:18,880 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 04:26:18,880 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2021-08-27 04:26:18,880 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435742472] [2021-08-27 04:26:18,881 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-08-27 04:26:18,881 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:18,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-08-27 04:26:18,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=588, Unknown=0, NotChecked=0, Total=702 [2021-08-27 04:26:18,882 INFO L87 Difference]: Start difference. First operand 218 states and 259 transitions. Second operand has 27 states, 26 states have (on average 2.423076923076923) internal successors, (63), 26 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:20,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:20,428 INFO L93 Difference]: Finished difference Result 423 states and 480 transitions. [2021-08-27 04:26:20,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-08-27 04:26:20,429 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.423076923076923) internal successors, (63), 26 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2021-08-27 04:26:20,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:20,430 INFO L225 Difference]: With dead ends: 423 [2021-08-27 04:26:20,430 INFO L226 Difference]: Without dead ends: 423 [2021-08-27 04:26:20,431 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 1019.2ms TimeCoverageRelationStatistics Valid=376, Invalid=1786, Unknown=0, NotChecked=0, Total=2162 [2021-08-27 04:26:20,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2021-08-27 04:26:20,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 243. [2021-08-27 04:26:20,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 194 states have (on average 1.4690721649484537) internal successors, (285), 239 states have internal predecessors, (285), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:20,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 288 transitions. [2021-08-27 04:26:20,435 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 288 transitions. Word has length 35 [2021-08-27 04:26:20,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:20,435 INFO L470 AbstractCegarLoop]: Abstraction has 243 states and 288 transitions. [2021-08-27 04:26:20,436 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.423076923076923) internal successors, (63), 26 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:20,436 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 288 transitions. [2021-08-27 04:26:20,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-08-27 04:26:20,436 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:20,436 INFO L512 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, 1] [2021-08-27 04:26:20,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-08-27 04:26:20,657 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,SelfDestructingSolverStorable10 [2021-08-27 04:26:20,657 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr26REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-27 04:26:20,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:20,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1716077151, now seen corresponding path program 1 times [2021-08-27 04:26:20,657 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:20,657 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68711459] [2021-08-27 04:26:20,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:20,657 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:20,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:20,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:20,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:20,987 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:20,987 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:20,987 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68711459] [2021-08-27 04:26:20,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68711459] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 04:26:20,988 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772739298] [2021-08-27 04:26:20,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:20,988 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 04:26:20,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 04:26:20,989 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 04:26:20,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-08-27 04:26:21,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:21,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 35 conjunts are in the unsatisfiable core [2021-08-27 04:26:21,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 04:26:21,402 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 04:26:21,403 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 19 treesize of output 18 [2021-08-27 04:26:21,426 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-08-27 04:26:21,426 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 19 treesize of output 26 [2021-08-27 04:26:21,600 INFO L354 Elim1Store]: treesize reduction 64, result has 19.0 percent of original size [2021-08-27 04:26:21,600 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 90 [2021-08-27 04:26:21,618 INFO L354 Elim1Store]: treesize reduction 112, result has 14.5 percent of original size [2021-08-27 04:26:21,618 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 66 [2021-08-27 04:26:22,239 INFO L354 Elim1Store]: treesize reduction 24, result has 41.5 percent of original size [2021-08-27 04:26:22,240 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 81 [2021-08-27 04:26:22,252 INFO L354 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2021-08-27 04:26:22,253 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 47 [2021-08-27 04:26:22,297 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:22,297 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772739298] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 04:26:22,297 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 04:26:22,297 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 24 [2021-08-27 04:26:22,298 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687299941] [2021-08-27 04:26:22,298 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-08-27 04:26:22,298 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:22,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-08-27 04:26:22,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=536, Unknown=0, NotChecked=0, Total=600 [2021-08-27 04:26:22,299 INFO L87 Difference]: Start difference. First operand 243 states and 288 transitions. Second operand has 25 states, 24 states have (on average 2.625) internal successors, (63), 24 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:24,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:24,783 INFO L93 Difference]: Finished difference Result 435 states and 488 transitions. [2021-08-27 04:26:24,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-08-27 04:26:24,783 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.625) internal successors, (63), 24 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2021-08-27 04:26:24,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:24,785 INFO L225 Difference]: With dead ends: 435 [2021-08-27 04:26:24,785 INFO L226 Difference]: Without dead ends: 435 [2021-08-27 04:26:24,786 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 1797.4ms TimeCoverageRelationStatistics Valid=484, Invalid=1966, Unknown=0, NotChecked=0, Total=2450 [2021-08-27 04:26:24,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2021-08-27 04:26:24,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 244. [2021-08-27 04:26:24,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 195 states have (on average 1.4615384615384615) internal successors, (285), 240 states have internal predecessors, (285), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:24,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 288 transitions. [2021-08-27 04:26:24,790 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 288 transitions. Word has length 35 [2021-08-27 04:26:24,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:24,790 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 288 transitions. [2021-08-27 04:26:24,790 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.625) internal successors, (63), 24 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:24,790 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 288 transitions. [2021-08-27 04:26:24,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-08-27 04:26:24,791 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:24,791 INFO L512 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, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:24,810 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-08-27 04:26:25,000 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,SelfDestructingSolverStorable11 [2021-08-27 04:26:25,001 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr22REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-27 04:26:25,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:25,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1587295850, now seen corresponding path program 1 times [2021-08-27 04:26:25,001 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:25,001 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781289046] [2021-08-27 04:26:25,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:25,001 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:25,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:25,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:25,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:25,274 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:25,274 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:25,274 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781289046] [2021-08-27 04:26:25,274 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781289046] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 04:26:25,274 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024353263] [2021-08-27 04:26:25,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:25,274 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 04:26:25,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 04:26:25,275 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 04:26:25,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-08-27 04:26:25,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:25,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 42 conjunts are in the unsatisfiable core [2021-08-27 04:26:25,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 04:26:25,547 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 04:26:25,648 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 04:26:25,649 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-08-27 04:26:25,684 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 16 treesize of output 12 [2021-08-27 04:26:25,688 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-08-27 04:26:25,792 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-08-27 04:26:25,792 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 58 treesize of output 44 [2021-08-27 04:26:25,802 INFO L354 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2021-08-27 04:26:25,802 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 50 treesize of output 45 [2021-08-27 04:26:25,884 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-08-27 04:26:25,884 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 23 [2021-08-27 04:26:25,976 INFO L354 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2021-08-27 04:26:25,977 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2021-08-27 04:26:28,121 INFO L354 Elim1Store]: treesize reduction 122, result has 19.7 percent of original size [2021-08-27 04:26:28,122 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 43 [2021-08-27 04:26:28,586 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 54 treesize of output 46 [2021-08-27 04:26:28,597 INFO L354 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2021-08-27 04:26:28,597 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 30 [2021-08-27 04:26:28,657 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:28,657 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2024353263] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 04:26:28,657 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 04:26:28,657 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 32 [2021-08-27 04:26:28,658 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435409184] [2021-08-27 04:26:28,658 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-08-27 04:26:28,658 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:28,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-08-27 04:26:28,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=938, Unknown=0, NotChecked=0, Total=1056 [2021-08-27 04:26:28,659 INFO L87 Difference]: Start difference. First operand 244 states and 288 transitions. Second operand has 33 states, 32 states have (on average 2.28125) internal successors, (73), 32 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:51,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:51,370 INFO L93 Difference]: Finished difference Result 460 states and 516 transitions. [2021-08-27 04:26:51,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-08-27 04:26:51,371 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.28125) internal successors, (73), 32 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2021-08-27 04:26:51,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:51,372 INFO L225 Difference]: With dead ends: 460 [2021-08-27 04:26:51,372 INFO L226 Difference]: Without dead ends: 460 [2021-08-27 04:26:51,373 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1117 ImplicationChecksByTransitivity, 13583.2ms TimeCoverageRelationStatistics Valid=613, Invalid=3415, Unknown=4, NotChecked=0, Total=4032 [2021-08-27 04:26:51,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2021-08-27 04:26:51,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 249. [2021-08-27 04:26:51,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 200 states have (on average 1.46) internal successors, (292), 245 states have internal predecessors, (292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:51,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 295 transitions. [2021-08-27 04:26:51,377 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 295 transitions. Word has length 40 [2021-08-27 04:26:51,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:51,378 INFO L470 AbstractCegarLoop]: Abstraction has 249 states and 295 transitions. [2021-08-27 04:26:51,378 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.28125) internal successors, (73), 32 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:51,378 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 295 transitions. [2021-08-27 04:26:51,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-08-27 04:26:51,379 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:51,379 INFO L512 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, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:51,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-08-27 04:26:51,588 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 04:26:51,589 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr21REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-27 04:26:51,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:51,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1587295851, now seen corresponding path program 1 times [2021-08-27 04:26:51,589 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:51,589 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021680525] [2021-08-27 04:26:51,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:51,589 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:51,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:51,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:51,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:51,646 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-27 04:26:51,646 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:51,646 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021680525] [2021-08-27 04:26:51,646 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021680525] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:51,646 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:51,647 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 04:26:51,647 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415994949] [2021-08-27 04:26:51,647 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 04:26:51,647 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:51,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 04:26:51,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-27 04:26:51,648 INFO L87 Difference]: Start difference. First operand 249 states and 295 transitions. Second operand has 7 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:52,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:52,075 INFO L93 Difference]: Finished difference Result 283 states and 335 transitions. [2021-08-27 04:26:52,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 04:26:52,076 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2021-08-27 04:26:52,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:52,077 INFO L225 Difference]: With dead ends: 283 [2021-08-27 04:26:52,077 INFO L226 Difference]: Without dead ends: 283 [2021-08-27 04:26:52,077 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 58.8ms TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-08-27 04:26:52,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2021-08-27 04:26:52,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 254. [2021-08-27 04:26:52,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 205 states have (on average 1.4634146341463414) internal successors, (300), 250 states have internal predecessors, (300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:52,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 303 transitions. [2021-08-27 04:26:52,081 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 303 transitions. Word has length 40 [2021-08-27 04:26:52,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:52,081 INFO L470 AbstractCegarLoop]: Abstraction has 254 states and 303 transitions. [2021-08-27 04:26:52,081 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:52,081 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 303 transitions. [2021-08-27 04:26:52,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-08-27 04:26:52,082 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:52,082 INFO L512 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, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:52,082 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-27 04:26:52,082 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr36REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-27 04:26:52,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:52,083 INFO L82 PathProgramCache]: Analyzing trace with hash -371074441, now seen corresponding path program 1 times [2021-08-27 04:26:52,083 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:52,083 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474882444] [2021-08-27 04:26:52,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:52,083 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:52,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:52,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:52,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:52,181 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-27 04:26:52,181 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:52,181 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474882444] [2021-08-27 04:26:52,181 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474882444] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:52,181 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:52,181 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 04:26:52,182 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067326275] [2021-08-27 04:26:52,182 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 04:26:52,182 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:52,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 04:26:52,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-08-27 04:26:52,183 INFO L87 Difference]: Start difference. First operand 254 states and 303 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:52,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:52,542 INFO L93 Difference]: Finished difference Result 272 states and 322 transitions. [2021-08-27 04:26:52,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 04:26:52,542 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2021-08-27 04:26:52,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:52,543 INFO L225 Difference]: With dead ends: 272 [2021-08-27 04:26:52,543 INFO L226 Difference]: Without dead ends: 272 [2021-08-27 04:26:52,546 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 83.2ms TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-08-27 04:26:52,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2021-08-27 04:26:52,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 262. [2021-08-27 04:26:52,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 213 states have (on average 1.4507042253521127) internal successors, (309), 258 states have internal predecessors, (309), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:52,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 312 transitions. [2021-08-27 04:26:52,551 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 312 transitions. Word has length 40 [2021-08-27 04:26:52,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:52,551 INFO L470 AbstractCegarLoop]: Abstraction has 262 states and 312 transitions. [2021-08-27 04:26:52,551 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:52,551 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 312 transitions. [2021-08-27 04:26:52,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-08-27 04:26:52,553 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:52,553 INFO L512 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, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:52,553 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-27 04:26:52,553 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr36REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-27 04:26:52,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:52,554 INFO L82 PathProgramCache]: Analyzing trace with hash -371014859, now seen corresponding path program 1 times [2021-08-27 04:26:52,554 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:52,554 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195413463] [2021-08-27 04:26:52,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:52,554 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:52,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:52,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:52,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:52,615 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-27 04:26:52,615 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:52,615 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195413463] [2021-08-27 04:26:52,615 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195413463] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:52,616 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:52,616 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 04:26:52,616 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622654323] [2021-08-27 04:26:52,617 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 04:26:52,618 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:52,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 04:26:52,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 04:26:52,620 INFO L87 Difference]: Start difference. First operand 262 states and 312 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:52,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:52,801 INFO L93 Difference]: Finished difference Result 259 states and 304 transitions. [2021-08-27 04:26:52,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 04:26:52,802 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2021-08-27 04:26:52,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:52,803 INFO L225 Difference]: With dead ends: 259 [2021-08-27 04:26:52,803 INFO L226 Difference]: Without dead ends: 259 [2021-08-27 04:26:52,803 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.7ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 04:26:52,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2021-08-27 04:26:52,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 258. [2021-08-27 04:26:52,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 213 states have (on average 1.4131455399061033) internal successors, (301), 254 states have internal predecessors, (301), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:52,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 304 transitions. [2021-08-27 04:26:52,807 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 304 transitions. Word has length 40 [2021-08-27 04:26:52,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:52,807 INFO L470 AbstractCegarLoop]: Abstraction has 258 states and 304 transitions. [2021-08-27 04:26:52,807 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:52,807 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 304 transitions. [2021-08-27 04:26:52,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-08-27 04:26:52,807 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:52,808 INFO L512 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, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:52,808 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-27 04:26:52,808 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr37REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-27 04:26:52,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:52,808 INFO L82 PathProgramCache]: Analyzing trace with hash -371014858, now seen corresponding path program 1 times [2021-08-27 04:26:52,808 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:52,808 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784073639] [2021-08-27 04:26:52,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:52,809 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:52,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:52,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:52,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:52,847 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-27 04:26:52,847 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:52,847 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784073639] [2021-08-27 04:26:52,847 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784073639] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:52,847 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:52,847 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 04:26:52,848 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268493527] [2021-08-27 04:26:52,848 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 04:26:52,848 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:52,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 04:26:52,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 04:26:52,848 INFO L87 Difference]: Start difference. First operand 258 states and 304 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:53,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:53,046 INFO L93 Difference]: Finished difference Result 254 states and 296 transitions. [2021-08-27 04:26:53,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 04:26:53,047 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2021-08-27 04:26:53,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:53,048 INFO L225 Difference]: With dead ends: 254 [2021-08-27 04:26:53,048 INFO L226 Difference]: Without dead ends: 254 [2021-08-27 04:26:53,049 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.4ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 04:26:53,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2021-08-27 04:26:53,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2021-08-27 04:26:53,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 213 states have (on average 1.375586854460094) internal successors, (293), 250 states have internal predecessors, (293), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:53,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 296 transitions. [2021-08-27 04:26:53,052 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 296 transitions. Word has length 40 [2021-08-27 04:26:53,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:53,052 INFO L470 AbstractCegarLoop]: Abstraction has 254 states and 296 transitions. [2021-08-27 04:26:53,052 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:53,052 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 296 transitions. [2021-08-27 04:26:53,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-08-27 04:26:53,053 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:53,053 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:53,053 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-27 04:26:53,053 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr33REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-27 04:26:53,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:53,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1524461310, now seen corresponding path program 1 times [2021-08-27 04:26:53,054 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:53,054 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458056474] [2021-08-27 04:26:53,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:53,054 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:53,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:53,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:53,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:53,107 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-27 04:26:53,107 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:53,107 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458056474] [2021-08-27 04:26:53,107 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458056474] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:53,107 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:53,107 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 04:26:53,107 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039133274] [2021-08-27 04:26:53,108 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 04:26:53,108 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:53,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 04:26:53,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-27 04:26:53,108 INFO L87 Difference]: Start difference. First operand 254 states and 296 transitions. Second operand has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:53,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:53,491 INFO L93 Difference]: Finished difference Result 278 states and 320 transitions. [2021-08-27 04:26:53,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 04:26:53,492 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2021-08-27 04:26:53,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:53,493 INFO L225 Difference]: With dead ends: 278 [2021-08-27 04:26:53,493 INFO L226 Difference]: Without dead ends: 278 [2021-08-27 04:26:53,493 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 55.8ms TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-08-27 04:26:53,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2021-08-27 04:26:53,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 261. [2021-08-27 04:26:53,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 220 states have (on average 1.3863636363636365) internal successors, (305), 257 states have internal predecessors, (305), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:53,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 308 transitions. [2021-08-27 04:26:53,496 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 308 transitions. Word has length 44 [2021-08-27 04:26:53,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:53,497 INFO L470 AbstractCegarLoop]: Abstraction has 261 states and 308 transitions. [2021-08-27 04:26:53,497 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:53,497 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 308 transitions. [2021-08-27 04:26:53,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-08-27 04:26:53,497 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:53,497 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:53,498 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-27 04:26:53,498 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr34REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-27 04:26:53,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:53,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1524461309, now seen corresponding path program 1 times [2021-08-27 04:26:53,498 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:53,498 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505300136] [2021-08-27 04:26:53,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:53,498 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:53,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:53,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:53,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:53,790 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:53,790 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:53,790 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505300136] [2021-08-27 04:26:53,790 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505300136] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 04:26:53,790 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908791590] [2021-08-27 04:26:53,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:53,791 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 04:26:53,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 04:26:53,792 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 04:26:53,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-08-27 04:26:54,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:54,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 15 conjunts are in the unsatisfiable core [2021-08-27 04:26:54,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 04:26:54,297 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 39 treesize of output 31 [2021-08-27 04:26:54,299 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2021-08-27 04:26:54,348 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-27 04:26:54,348 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1908791590] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:54,348 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-27 04:26:54,348 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [16] total 20 [2021-08-27 04:26:54,349 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691982956] [2021-08-27 04:26:54,350 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 04:26:54,350 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:54,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 04:26:54,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2021-08-27 04:26:54,351 INFO L87 Difference]: Start difference. First operand 261 states and 308 transitions. Second operand has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:54,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:54,623 INFO L93 Difference]: Finished difference Result 274 states and 315 transitions. [2021-08-27 04:26:54,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 04:26:54,624 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2021-08-27 04:26:54,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:54,624 INFO L225 Difference]: With dead ends: 274 [2021-08-27 04:26:54,624 INFO L226 Difference]: Without dead ends: 274 [2021-08-27 04:26:54,625 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 282.9ms TimeCoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2021-08-27 04:26:54,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2021-08-27 04:26:54,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 259. [2021-08-27 04:26:54,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 220 states have (on average 1.3636363636363635) internal successors, (300), 255 states have internal predecessors, (300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:54,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 303 transitions. [2021-08-27 04:26:54,628 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 303 transitions. Word has length 44 [2021-08-27 04:26:54,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:54,628 INFO L470 AbstractCegarLoop]: Abstraction has 259 states and 303 transitions. [2021-08-27 04:26:54,628 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:54,628 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 303 transitions. [2021-08-27 04:26:54,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-08-27 04:26:54,628 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:54,629 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:54,653 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-08-27 04:26:54,829 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 04:26:54,830 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr25REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-27 04:26:54,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:54,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1353350043, now seen corresponding path program 1 times [2021-08-27 04:26:54,830 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:54,830 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774216615] [2021-08-27 04:26:54,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:54,831 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:54,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:55,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:55,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:55,157 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:55,157 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:55,157 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774216615] [2021-08-27 04:26:55,157 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774216615] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 04:26:55,157 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083771883] [2021-08-27 04:26:55,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:55,158 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 04:26:55,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 04:26:55,158 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 04:26:55,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-08-27 04:26:55,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:55,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 50 conjunts are in the unsatisfiable core [2021-08-27 04:26:55,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 04:26:55,504 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 04:26:55,589 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 04:26:55,590 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-08-27 04:26:55,626 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-08-27 04:26:55,634 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 16 treesize of output 12 [2021-08-27 04:26:55,733 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-08-27 04:26:55,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, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 44 [2021-08-27 04:26:55,743 INFO L354 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2021-08-27 04:26:55,744 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 50 treesize of output 45 [2021-08-27 04:26:55,964 INFO L354 Elim1Store]: treesize reduction 62, result has 27.1 percent of original size [2021-08-27 04:26:55,964 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 77 [2021-08-27 04:26:55,983 INFO L354 Elim1Store]: treesize reduction 84, result has 20.0 percent of original size [2021-08-27 04:26:55,983 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 78 [2021-08-27 04:26:56,124 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-08-27 04:26:56,124 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 65 [2021-08-27 04:26:56,141 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 04:26:56,142 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 44 [2021-08-27 04:26:56,657 INFO L354 Elim1Store]: treesize reduction 70, result has 9.1 percent of original size [2021-08-27 04:26:56,658 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 54 [2021-08-27 04:26:56,674 INFO L354 Elim1Store]: treesize reduction 54, result has 11.5 percent of original size [2021-08-27 04:26:56,674 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 32 [2021-08-27 04:26:56,690 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:56,690 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083771883] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 04:26:56,690 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 04:26:56,690 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 32 [2021-08-27 04:26:56,690 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239336722] [2021-08-27 04:26:56,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-08-27 04:26:56,691 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:56,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-08-27 04:26:56,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=900, Unknown=0, NotChecked=0, Total=992 [2021-08-27 04:26:56,691 INFO L87 Difference]: Start difference. First operand 259 states and 303 transitions. Second operand has 32 states, 32 states have (on average 2.40625) internal successors, (77), 31 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:59,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:59,097 INFO L93 Difference]: Finished difference Result 419 states and 473 transitions. [2021-08-27 04:26:59,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-08-27 04:26:59,098 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.40625) internal successors, (77), 31 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2021-08-27 04:26:59,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:59,099 INFO L225 Difference]: With dead ends: 419 [2021-08-27 04:26:59,099 INFO L226 Difference]: Without dead ends: 419 [2021-08-27 04:26:59,100 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 812 ImplicationChecksByTransitivity, 1544.6ms TimeCoverageRelationStatistics Valid=420, Invalid=2886, Unknown=0, NotChecked=0, Total=3306 [2021-08-27 04:26:59,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2021-08-27 04:26:59,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 256. [2021-08-27 04:26:59,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 218 states have (on average 1.3440366972477065) internal successors, (293), 252 states have internal predecessors, (293), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:59,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 296 transitions. [2021-08-27 04:26:59,103 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 296 transitions. Word has length 44 [2021-08-27 04:26:59,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:59,103 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 296 transitions. [2021-08-27 04:26:59,103 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.40625) internal successors, (77), 31 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:59,104 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 296 transitions. [2021-08-27 04:26:59,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-08-27 04:26:59,104 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:59,104 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:59,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-08-27 04:26:59,312 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 04:26:59,313 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr35ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-27 04:26:59,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:59,313 INFO L82 PathProgramCache]: Analyzing trace with hash -423467038, now seen corresponding path program 1 times [2021-08-27 04:26:59,313 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:59,313 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502317741] [2021-08-27 04:26:59,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:59,313 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:59,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 04:26:59,335 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 04:26:59,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 04:26:59,378 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 04:26:59,380 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-27 04:26:59,381 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location mainErr35ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 04:26:59,382 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr0REQUIRES_VIOLATION [2021-08-27 04:26:59,382 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr1REQUIRES_VIOLATION [2021-08-27 04:26:59,382 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr2REQUIRES_VIOLATION [2021-08-27 04:26:59,382 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr3REQUIRES_VIOLATION [2021-08-27 04:26:59,382 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr4REQUIRES_VIOLATION [2021-08-27 04:26:59,382 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr5REQUIRES_VIOLATION [2021-08-27 04:26:59,382 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr6REQUIRES_VIOLATION [2021-08-27 04:26:59,383 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr7REQUIRES_VIOLATION [2021-08-27 04:26:59,383 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr8REQUIRES_VIOLATION [2021-08-27 04:26:59,383 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr9REQUIRES_VIOLATION [2021-08-27 04:26:59,383 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr10REQUIRES_VIOLATION [2021-08-27 04:26:59,383 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr11REQUIRES_VIOLATION [2021-08-27 04:26:59,383 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr12REQUIRES_VIOLATION [2021-08-27 04:26:59,383 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr13REQUIRES_VIOLATION [2021-08-27 04:26:59,383 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr14REQUIRES_VIOLATION [2021-08-27 04:26:59,383 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr15REQUIRES_VIOLATION [2021-08-27 04:26:59,384 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr16REQUIRES_VIOLATION [2021-08-27 04:26:59,384 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr17REQUIRES_VIOLATION [2021-08-27 04:26:59,384 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr18REQUIRES_VIOLATION [2021-08-27 04:26:59,384 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr19REQUIRES_VIOLATION [2021-08-27 04:26:59,384 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr20ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 04:26:59,384 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr21REQUIRES_VIOLATION [2021-08-27 04:26:59,384 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr22REQUIRES_VIOLATION [2021-08-27 04:26:59,384 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr23REQUIRES_VIOLATION [2021-08-27 04:26:59,384 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr24REQUIRES_VIOLATION [2021-08-27 04:26:59,384 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr25REQUIRES_VIOLATION [2021-08-27 04:26:59,385 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr26REQUIRES_VIOLATION [2021-08-27 04:26:59,385 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr27REQUIRES_VIOLATION [2021-08-27 04:26:59,385 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr28REQUIRES_VIOLATION [2021-08-27 04:26:59,385 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr29REQUIRES_VIOLATION [2021-08-27 04:26:59,385 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr30REQUIRES_VIOLATION [2021-08-27 04:26:59,385 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr31REQUIRES_VIOLATION [2021-08-27 04:26:59,385 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr32REQUIRES_VIOLATION [2021-08-27 04:26:59,385 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr33REQUIRES_VIOLATION [2021-08-27 04:26:59,385 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr34REQUIRES_VIOLATION [2021-08-27 04:26:59,386 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr36REQUIRES_VIOLATION [2021-08-27 04:26:59,386 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr37REQUIRES_VIOLATION [2021-08-27 04:26:59,386 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr38REQUIRES_VIOLATION [2021-08-27 04:26:59,386 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr39REQUIRES_VIOLATION [2021-08-27 04:26:59,386 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr40REQUIRES_VIOLATION [2021-08-27 04:26:59,386 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr41REQUIRES_VIOLATION [2021-08-27 04:26:59,386 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr42REQUIRES_VIOLATION [2021-08-27 04:26:59,386 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr43REQUIRES_VIOLATION [2021-08-27 04:26:59,386 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr44REQUIRES_VIOLATION [2021-08-27 04:26:59,387 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr45REQUIRES_VIOLATION [2021-08-27 04:26:59,387 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr46REQUIRES_VIOLATION [2021-08-27 04:26:59,387 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr47REQUIRES_VIOLATION [2021-08-27 04:26:59,387 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr48REQUIRES_VIOLATION [2021-08-27 04:26:59,387 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr49REQUIRES_VIOLATION [2021-08-27 04:26:59,387 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr50REQUIRES_VIOLATION [2021-08-27 04:26:59,387 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr51REQUIRES_VIOLATION [2021-08-27 04:26:59,387 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr52REQUIRES_VIOLATION [2021-08-27 04:26:59,387 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr53REQUIRES_VIOLATION [2021-08-27 04:26:59,388 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr54REQUIRES_VIOLATION [2021-08-27 04:26:59,388 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr55REQUIRES_VIOLATION [2021-08-27 04:26:59,388 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr56REQUIRES_VIOLATION [2021-08-27 04:26:59,388 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr57REQUIRES_VIOLATION [2021-08-27 04:26:59,388 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr58REQUIRES_VIOLATION [2021-08-27 04:26:59,388 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr59REQUIRES_VIOLATION [2021-08-27 04:26:59,388 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr60REQUIRES_VIOLATION [2021-08-27 04:26:59,388 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr61REQUIRES_VIOLATION [2021-08-27 04:26:59,388 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr62ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 04:26:59,389 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr63ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 04:26:59,389 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr64REQUIRES_VIOLATION [2021-08-27 04:26:59,389 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr65REQUIRES_VIOLATION [2021-08-27 04:26:59,389 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr66REQUIRES_VIOLATION [2021-08-27 04:26:59,389 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr67REQUIRES_VIOLATION [2021-08-27 04:26:59,389 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr68REQUIRES_VIOLATION [2021-08-27 04:26:59,389 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr69REQUIRES_VIOLATION [2021-08-27 04:26:59,389 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr70ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 04:26:59,390 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr71ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 04:26:59,390 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr72REQUIRES_VIOLATION [2021-08-27 04:26:59,390 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr73REQUIRES_VIOLATION [2021-08-27 04:26:59,390 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr74REQUIRES_VIOLATION [2021-08-27 04:26:59,390 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr75REQUIRES_VIOLATION [2021-08-27 04:26:59,390 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr76ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 04:26:59,390 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr77ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 04:26:59,390 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr78ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 04:26:59,390 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr79ENSURES_VIOLATIONMEMORY_LEAK [2021-08-27 04:26:59,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-08-27 04:26:59,396 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-27 04:26:59,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 04:26:59 BoogieIcfgContainer [2021-08-27 04:26:59,433 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-27 04:26:59,434 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 04:26:59,434 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 04:26:59,434 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 04:26:59,434 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 04:26:13" (3/4) ... [2021-08-27 04:26:59,436 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-08-27 04:26:59,471 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-27 04:26:59,471 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 04:26:59,472 INFO L168 Benchmark]: Toolchain (without parser) took 47477.74 ms. Allocated memory was 50.3 MB in the beginning and 318.8 MB in the end (delta: 268.4 MB). Free memory was 26.1 MB in the beginning and 177.8 MB in the end (delta: -151.7 MB). Peak memory consumption was 116.2 MB. Max. memory is 16.1 GB. [2021-08-27 04:26:59,472 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 50.3 MB. Free memory was 32.5 MB in the beginning and 32.5 MB in the end (delta: 38.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 04:26:59,473 INFO L168 Benchmark]: CACSL2BoogieTranslator took 582.26 ms. Allocated memory was 50.3 MB in the beginning and 60.8 MB in the end (delta: 10.5 MB). Free memory was 25.8 MB in the beginning and 35.9 MB in the end (delta: -10.1 MB). Peak memory consumption was 5.5 MB. Max. memory is 16.1 GB. [2021-08-27 04:26:59,473 INFO L168 Benchmark]: Boogie Preprocessor took 95.13 ms. Allocated memory is still 60.8 MB. Free memory was 35.9 MB in the beginning and 32.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 04:26:59,473 INFO L168 Benchmark]: RCFGBuilder took 719.71 ms. Allocated memory was 60.8 MB in the beginning and 73.4 MB in the end (delta: 12.6 MB). Free memory was 32.6 MB in the beginning and 46.3 MB in the end (delta: -13.7 MB). Peak memory consumption was 16.5 MB. Max. memory is 16.1 GB. [2021-08-27 04:26:59,473 INFO L168 Benchmark]: TraceAbstraction took 46038.10 ms. Allocated memory was 73.4 MB in the beginning and 318.8 MB in the end (delta: 245.4 MB). Free memory was 45.4 MB in the beginning and 180.9 MB in the end (delta: -135.5 MB). Peak memory consumption was 110.5 MB. Max. memory is 16.1 GB. [2021-08-27 04:26:59,474 INFO L168 Benchmark]: Witness Printer took 37.91 ms. Allocated memory is still 318.8 MB. Free memory was 180.9 MB in the beginning and 177.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 04:26:59,475 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.13 ms. Allocated memory is still 50.3 MB. Free memory was 32.5 MB in the beginning and 32.5 MB in the end (delta: 38.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 582.26 ms. Allocated memory was 50.3 MB in the beginning and 60.8 MB in the end (delta: 10.5 MB). Free memory was 25.8 MB in the beginning and 35.9 MB in the end (delta: -10.1 MB). Peak memory consumption was 5.5 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 95.13 ms. Allocated memory is still 60.8 MB. Free memory was 35.9 MB in the beginning and 32.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 719.71 ms. Allocated memory was 60.8 MB in the beginning and 73.4 MB in the end (delta: 12.6 MB). Free memory was 32.6 MB in the beginning and 46.3 MB in the end (delta: -13.7 MB). Peak memory consumption was 16.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 46038.10 ms. Allocated memory was 73.4 MB in the beginning and 318.8 MB in the end (delta: 245.4 MB). Free memory was 45.4 MB in the beginning and 180.9 MB in the end (delta: -135.5 MB). Peak memory consumption was 110.5 MB. Max. memory is 16.1 GB. * Witness Printer took 37.91 ms. Allocated memory is still 318.8 MB. Free memory was 180.9 MB in the beginning and 177.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1038]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L997] SLL* head = malloc(sizeof(SLL)); [L998] head->next = ((void*)0) VAL [head={-1:0}] [L999] head->prev = ((void*)0) VAL [head={-1:0}] [L1000] head->data = 0 VAL [head={-1:0}] [L1002] SLL* x = head; [L1003] int marked = 0; VAL [head={-1:0}, marked=0, x={-1:0}] [L1006] COND TRUE __VERIFIER_nondet_int() || !marked [L1009] x->next = malloc(sizeof(SLL)) VAL [head={-1:0}, malloc(sizeof(SLL))={-2:0}, marked=0, x={-1:0}] [L1010] EXPR x->next VAL [head={-1:0}, marked=0, x={-1:0}, x->next={-2:0}] [L1010] x->next->prev = x VAL [head={-1:0}, marked=0, x={-1:0}, x->next={-2:0}] [L1011] EXPR x->next VAL [head={-1:0}, marked=0, x={-1:0}, x->next={-2:0}] [L1011] x = x->next [L1012] x->next = ((void*)0) VAL [head={-1:0}, marked=0, x={-2:0}] [L1014] COND TRUE __VERIFIER_nondet_int() [L1016] marked = 1 VAL [head={-1:0}, marked=1, x={-2:0}] [L1019] COND TRUE \read(marked) VAL [head={-1:0}, marked=1, x={-2:0}] [L1020] x->data = 1 VAL [head={-1:0}, marked=1, x={-2:0}] [L1006] COND FALSE !(__VERIFIER_nondet_int() || !marked) [L1025] x = head VAL [head={-1:0}, marked=1, x={-1:0}] [L1027] COND FALSE !(!(((void*)0) != x)) VAL [head={-1:0}, marked=1, x={-1:0}] [L1028] marked = 0 VAL [head={-1:0}, marked=0, x={-1:0}] [L1030] EXPR x->next VAL [head={-1:0}, marked=0, x={-1:0}, x->next={-2:0}] [L1030] x->next != ((void*)0) && x->next->data == 0 VAL [head={-1:0}, marked=0, x={-1:0}, x->next={-2:0}, x->next != ((void*)0) && x->next->data == 0=1] [L1030] EXPR x->next VAL [head={-1:0}, marked=0, x={-1:0}, x->next={-2:0}, x->next={-2:0}, x->next != ((void*)0) && x->next->data == 0=1] [L1030] EXPR x->next->data VAL [head={-1:0}, marked=0, x={-1:0}, x->next={-2:0}, x->next={-2:0}, x->next != ((void*)0) && x->next->data == 0=1, x->next->data=1] [L1030] x->next != ((void*)0) && x->next->data == 0 VAL [head={-1:0}, marked=0, x={-1:0}, x->next={-2:0}, x->next={-2:0}, x->next != ((void*)0) && x->next->data == 0=0, x->next->data=1] [L1030] COND FALSE !(x->next != ((void*)0) && x->next->data == 0) [L1035] EXPR x->next VAL [head={-1:0}, marked=0, x={-1:0}, x->next={-2:0}] [L1035] x->next != ((void*)0) && __VERIFIER_nondet_int() [L1035] x->next != ((void*)0) && __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-3, head={-1:0}, marked=0, x={-1:0}, x->next={-2:0}, x->next != ((void*)0) && __VERIFIER_nondet_int()=1] [L1035] COND TRUE x->next != ((void*)0) && __VERIFIER_nondet_int() [L1037] EXPR x->next VAL [head={-1:0}, marked=0, x={-1:0}, x->next={-2:0}] [L1037] x = x->next [L1038] EXPR x->data VAL [head={-1:0}, marked=0, x={-2:0}, x->data=1] [L1038] COND TRUE !(x->data != 1) [L1038] reach_error() VAL [head={-1:0}, marked=0, x={-2:0}] - UnprovableResult [Line: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 998]: 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: 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: 1009]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1009]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1010]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1010]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1010]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1010]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1011]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1011]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1012]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1012]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1020]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1020]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1022]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1022]: 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 all allocated memory was freed Unable to prove that all allocated memory was freed 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: 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: 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: 1035]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1035]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1037]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1037]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1038]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1038]: 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 pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1043]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1043]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that 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: 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: 1051]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1051]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1051]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1051]: 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: 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: 1052]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1053]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1053]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1059]: 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 pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: 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: 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 all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1064]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1064]: 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 pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1069]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1069]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1069]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1070]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1071]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1071]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1078]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1078]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1079]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1079]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1079]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 994]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 187 locations, 80 error locations. Started 1 CEGAR loops. OverallTime: 45961.4ms, OverallIterations: 21, TraceHistogramMax: 2, EmptinessCheckTime: 18.2ms, AutomataDifference: 34069.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 13.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 2304 SDtfs, 7038 SDslu, 7930 SDs, 0 SdLazy, 14446 SolverSat, 799 SolverUnsat, 7 SolverUnknown, 0 SolverNotchecked, 17314.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 527 GetRequests, 189 SyntacticMatches, 8 SemanticMatches, 330 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3031 ImplicationChecksByTransitivity, 19053.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=262occurred in iteration=15, InterpolantAutomatonStates: 238, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 99.6ms AutomataMinimizationTime, 20 MinimizatonAttempts, 986 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 74.6ms SsaConstructionTime, 310.9ms SatisfiabilityAnalysisTime, 9002.4ms InterpolantComputationTime, 802 NumberOfCodeBlocks, 802 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 731 ConstructedInterpolants, 43 QuantifiedInterpolants, 8977 SizeOfPredicates, 68 NumberOfNonLiveVariables, 1097 ConjunctsInSsa, 169 ConjunctsInUnsatCore, 25 InterpolantComputations, 16 PerfectInterpolantSequences, 19/45 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-08-27 04:26:59,524 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...