./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/lockfree-3.3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f4b24e32 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/memsafety/lockfree-3.3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1db117ae3c729419255b5da4a7f4ecd64b2d99a167d11f22266a773c4ff13cdb --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 06:15:00,068 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 06:15:00,069 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 06:15:00,093 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 06:15:00,094 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 06:15:00,095 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 06:15:00,096 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 06:15:00,097 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 06:15:00,098 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 06:15:00,098 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 06:15:00,099 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 06:15:00,100 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 06:15:00,100 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 06:15:00,101 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 06:15:00,102 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 06:15:00,102 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 06:15:00,103 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 06:15:00,103 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 06:15:00,104 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 06:15:00,107 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 06:15:00,108 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 06:15:00,124 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 06:15:00,125 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 06:15:00,125 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 06:15:00,126 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 06:15:00,135 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 06:15:00,135 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 06:15:00,136 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 06:15:00,137 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 06:15:00,137 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 06:15:00,138 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 06:15:00,138 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 06:15:00,140 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 06:15:00,140 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 06:15:00,141 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 06:15:00,142 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 06:15:00,142 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 06:15:00,142 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 06:15:00,142 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 06:15:00,143 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 06:15:00,143 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 06:15:00,145 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 06:15:00,146 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-14 06:15:00,174 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 06:15:00,175 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 06:15:00,175 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 06:15:00,175 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 06:15:00,176 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 06:15:00,176 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 06:15:00,177 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 06:15:00,177 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 06:15:00,177 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 06:15:00,178 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 06:15:00,178 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 06:15:00,178 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 06:15:00,178 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 06:15:00,178 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 06:15:00,178 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 06:15:00,178 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-14 06:15:00,179 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-14 06:15:00,179 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-14 06:15:00,179 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 06:15:00,180 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 06:15:00,180 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 06:15:00,180 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 06:15:00,180 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 06:15:00,180 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 06:15:00,181 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 06:15:00,181 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 06:15:00,181 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 06:15:00,181 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 06:15:00,181 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 06:15:00,181 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 06:15:00,182 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1db117ae3c729419255b5da4a7f4ecd64b2d99a167d11f22266a773c4ff13cdb [2022-07-14 06:15:00,416 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 06:15:00,442 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 06:15:00,444 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 06:15:00,445 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 06:15:00,446 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 06:15:00,447 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/lockfree-3.3.i [2022-07-14 06:15:00,509 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b7b7a650/1cce43acb1024e9da28cdb8f1c3221f2/FLAG2990331f6 [2022-07-14 06:15:00,931 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 06:15:00,933 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/lockfree-3.3.i [2022-07-14 06:15:00,951 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b7b7a650/1cce43acb1024e9da28cdb8f1c3221f2/FLAG2990331f6 [2022-07-14 06:15:00,961 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b7b7a650/1cce43acb1024e9da28cdb8f1c3221f2 [2022-07-14 06:15:00,962 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 06:15:00,963 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 06:15:00,966 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 06:15:00,966 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 06:15:00,968 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 06:15:00,969 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 06:15:00" (1/1) ... [2022-07-14 06:15:00,969 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@494f9819 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:15:00, skipping insertion in model container [2022-07-14 06:15:00,970 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 06:15:00" (1/1) ... [2022-07-14 06:15:00,974 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 06:15:01,007 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 06:15:01,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 06:15:01,267 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 06:15:01,294 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 06:15:01,313 INFO L208 MainTranslator]: Completed translation [2022-07-14 06:15:01,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:15:01 WrapperNode [2022-07-14 06:15:01,314 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 06:15:01,314 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 06:15:01,314 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 06:15:01,314 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 06:15:01,319 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:15:01" (1/1) ... [2022-07-14 06:15:01,329 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:15:01" (1/1) ... [2022-07-14 06:15:01,352 INFO L137 Inliner]: procedures = 125, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 125 [2022-07-14 06:15:01,353 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 06:15:01,355 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 06:15:01,355 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 06:15:01,355 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 06:15:01,360 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:15:01" (1/1) ... [2022-07-14 06:15:01,361 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:15:01" (1/1) ... [2022-07-14 06:15:01,372 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:15:01" (1/1) ... [2022-07-14 06:15:01,373 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:15:01" (1/1) ... [2022-07-14 06:15:01,377 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:15:01" (1/1) ... [2022-07-14 06:15:01,381 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:15:01" (1/1) ... [2022-07-14 06:15:01,389 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:15:01" (1/1) ... [2022-07-14 06:15:01,392 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 06:15:01,394 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 06:15:01,394 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 06:15:01,395 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 06:15:01,395 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:15:01" (1/1) ... [2022-07-14 06:15:01,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 06:15:01,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:15:01,432 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) [2022-07-14 06:15:01,449 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 [2022-07-14 06:15:01,463 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 06:15:01,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 06:15:01,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 06:15:01,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 06:15:01,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 06:15:01,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 06:15:01,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 06:15:01,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 06:15:01,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 06:15:01,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 06:15:01,568 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 06:15:01,569 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 06:15:01,791 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 06:15:01,796 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 06:15:01,796 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-14 06:15:01,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 06:15:01 BoogieIcfgContainer [2022-07-14 06:15:01,798 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 06:15:01,799 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 06:15:01,800 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 06:15:01,802 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 06:15:01,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 06:15:00" (1/3) ... [2022-07-14 06:15:01,804 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@356e249d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 06:15:01, skipping insertion in model container [2022-07-14 06:15:01,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:15:01" (2/3) ... [2022-07-14 06:15:01,804 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@356e249d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 06:15:01, skipping insertion in model container [2022-07-14 06:15:01,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 06:15:01" (3/3) ... [2022-07-14 06:15:01,806 INFO L111 eAbstractionObserver]: Analyzing ICFG lockfree-3.3.i [2022-07-14 06:15:01,817 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 06:15:01,817 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2022-07-14 06:15:01,861 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 06:15:01,866 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@72149a86, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@39a41879 [2022-07-14 06:15:01,866 INFO L358 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2022-07-14 06:15:01,871 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 43 states have (on average 1.930232558139535) internal successors, (83), 63 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:01,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-14 06:15:01,887 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:15:01,887 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-14 06:15:01,889 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:15:01,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:15:01,894 INFO L85 PathProgramCache]: Analyzing trace with hash 28819106, now seen corresponding path program 1 times [2022-07-14 06:15:01,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:15:01,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193898221] [2022-07-14 06:15:01,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:15:01,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:15:01,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:15:02,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:15:02,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:15:02,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193898221] [2022-07-14 06:15:02,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193898221] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:15:02,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:15:02,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:15:02,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600497060] [2022-07-14 06:15:02,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:15:02,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-14 06:15:02,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:15:02,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-14 06:15:02,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-14 06:15:02,068 INFO L87 Difference]: Start difference. First operand has 64 states, 43 states have (on average 1.930232558139535) internal successors, (83), 63 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:02,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:15:02,084 INFO L93 Difference]: Finished difference Result 64 states and 81 transitions. [2022-07-14 06:15:02,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-14 06:15:02,087 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-14 06:15:02,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:15:02,093 INFO L225 Difference]: With dead ends: 64 [2022-07-14 06:15:02,094 INFO L226 Difference]: Without dead ends: 62 [2022-07-14 06:15:02,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-14 06:15:02,099 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:15:02,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:15:02,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-07-14 06:15:02,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-07-14 06:15:02,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 42 states have (on average 1.880952380952381) internal successors, (79), 61 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:02,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2022-07-14 06:15:02,131 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 79 transitions. Word has length 5 [2022-07-14 06:15:02,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:15:02,132 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 79 transitions. [2022-07-14 06:15:02,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:02,132 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2022-07-14 06:15:02,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-14 06:15:02,133 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:15:02,133 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:15:02,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 06:15:02,134 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:15:02,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:15:02,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1806851052, now seen corresponding path program 1 times [2022-07-14 06:15:02,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:15:02,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100384101] [2022-07-14 06:15:02,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:15:02,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:15:02,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:15:02,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:15:02,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:15:02,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100384101] [2022-07-14 06:15:02,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100384101] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:15:02,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:15:02,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:15:02,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235297667] [2022-07-14 06:15:02,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:15:02,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:15:02,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:15:02,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:15:02,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:15:02,237 INFO L87 Difference]: Start difference. First operand 62 states and 79 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:02,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:15:02,266 INFO L93 Difference]: Finished difference Result 63 states and 80 transitions. [2022-07-14 06:15:02,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:15:02,267 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-14 06:15:02,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:15:02,269 INFO L225 Difference]: With dead ends: 63 [2022-07-14 06:15:02,270 INFO L226 Difference]: Without dead ends: 63 [2022-07-14 06:15:02,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:15:02,275 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:15:02,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 151 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:15:02,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-14 06:15:02,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-07-14 06:15:02,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 43 states have (on average 1.8604651162790697) internal successors, (80), 62 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:02,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 80 transitions. [2022-07-14 06:15:02,287 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 80 transitions. Word has length 7 [2022-07-14 06:15:02,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:15:02,288 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 80 transitions. [2022-07-14 06:15:02,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:02,289 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2022-07-14 06:15:02,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-14 06:15:02,290 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:15:02,292 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:15:02,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 06:15:02,292 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:15:02,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:15:02,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1806910634, now seen corresponding path program 1 times [2022-07-14 06:15:02,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:15:02,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845455127] [2022-07-14 06:15:02,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:15:02,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:15:02,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:15:02,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:15:02,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:15:02,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845455127] [2022-07-14 06:15:02,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845455127] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:15:02,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:15:02,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:15:02,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956978497] [2022-07-14 06:15:02,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:15:02,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:15:02,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:15:02,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:15:02,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:15:02,352 INFO L87 Difference]: Start difference. First operand 63 states and 80 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:02,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:15:02,391 INFO L93 Difference]: Finished difference Result 111 states and 145 transitions. [2022-07-14 06:15:02,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:15:02,392 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-14 06:15:02,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:15:02,395 INFO L225 Difference]: With dead ends: 111 [2022-07-14 06:15:02,395 INFO L226 Difference]: Without dead ends: 111 [2022-07-14 06:15:02,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:15:02,398 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 62 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:15:02,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 138 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:15:02,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-07-14 06:15:02,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 93. [2022-07-14 06:15:02,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 73 states have (on average 1.8767123287671232) internal successors, (137), 92 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:02,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 137 transitions. [2022-07-14 06:15:02,411 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 137 transitions. Word has length 7 [2022-07-14 06:15:02,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:15:02,411 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 137 transitions. [2022-07-14 06:15:02,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:02,412 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 137 transitions. [2022-07-14 06:15:02,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-14 06:15:02,412 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:15:02,412 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:15:02,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 06:15:02,413 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:15:02,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:15:02,413 INFO L85 PathProgramCache]: Analyzing trace with hash 177749355, now seen corresponding path program 1 times [2022-07-14 06:15:02,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:15:02,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959170892] [2022-07-14 06:15:02,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:15:02,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:15:02,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:15:02,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:15:02,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:15:02,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959170892] [2022-07-14 06:15:02,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959170892] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:15:02,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:15:02,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:15:02,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707339887] [2022-07-14 06:15:02,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:15:02,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:15:02,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:15:02,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:15:02,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:15:02,451 INFO L87 Difference]: Start difference. First operand 93 states and 137 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:02,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:15:02,511 INFO L93 Difference]: Finished difference Result 148 states and 212 transitions. [2022-07-14 06:15:02,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:15:02,512 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-14 06:15:02,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:15:02,513 INFO L225 Difference]: With dead ends: 148 [2022-07-14 06:15:02,514 INFO L226 Difference]: Without dead ends: 148 [2022-07-14 06:15:02,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:15:02,515 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 44 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:15:02,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 209 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:15:02,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-07-14 06:15:02,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 127. [2022-07-14 06:15:02,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 107 states have (on average 1.841121495327103) internal successors, (197), 126 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:02,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 197 transitions. [2022-07-14 06:15:02,529 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 197 transitions. Word has length 8 [2022-07-14 06:15:02,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:15:02,529 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 197 transitions. [2022-07-14 06:15:02,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:02,529 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 197 transitions. [2022-07-14 06:15:02,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-14 06:15:02,530 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:15:02,530 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:15:02,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-14 06:15:02,530 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:15:02,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:15:02,531 INFO L85 PathProgramCache]: Analyzing trace with hash 179653412, now seen corresponding path program 1 times [2022-07-14 06:15:02,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:15:02,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134188293] [2022-07-14 06:15:02,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:15:02,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:15:02,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:15:02,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:15:02,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:15:02,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134188293] [2022-07-14 06:15:02,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134188293] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:15:02,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:15:02,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:15:02,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434930499] [2022-07-14 06:15:02,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:15:02,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:15:02,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:15:02,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:15:02,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:15:02,571 INFO L87 Difference]: Start difference. First operand 127 states and 197 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:02,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:15:02,627 INFO L93 Difference]: Finished difference Result 209 states and 319 transitions. [2022-07-14 06:15:02,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:15:02,628 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-14 06:15:02,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:15:02,630 INFO L225 Difference]: With dead ends: 209 [2022-07-14 06:15:02,630 INFO L226 Difference]: Without dead ends: 206 [2022-07-14 06:15:02,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:15:02,631 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 63 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:15:02,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 121 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:15:02,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-07-14 06:15:02,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 185. [2022-07-14 06:15:02,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 165 states have (on average 1.8363636363636364) internal successors, (303), 184 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:02,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 303 transitions. [2022-07-14 06:15:02,649 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 303 transitions. Word has length 8 [2022-07-14 06:15:02,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:15:02,649 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 303 transitions. [2022-07-14 06:15:02,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:02,650 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 303 transitions. [2022-07-14 06:15:02,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-14 06:15:02,650 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:15:02,650 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:15:02,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-14 06:15:02,651 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:15:02,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:15:02,651 INFO L85 PathProgramCache]: Analyzing trace with hash 179596397, now seen corresponding path program 1 times [2022-07-14 06:15:02,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:15:02,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173145703] [2022-07-14 06:15:02,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:15:02,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:15:02,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:15:02,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:15:02,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:15:02,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173145703] [2022-07-14 06:15:02,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173145703] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:15:02,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:15:02,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:15:02,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366718155] [2022-07-14 06:15:02,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:15:02,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:15:02,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:15:02,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:15:02,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:15:02,682 INFO L87 Difference]: Start difference. First operand 185 states and 303 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:02,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:15:02,737 INFO L93 Difference]: Finished difference Result 261 states and 411 transitions. [2022-07-14 06:15:02,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:15:02,738 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-14 06:15:02,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:15:02,740 INFO L225 Difference]: With dead ends: 261 [2022-07-14 06:15:02,740 INFO L226 Difference]: Without dead ends: 261 [2022-07-14 06:15:02,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:15:02,741 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 67 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:15:02,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 171 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:15:02,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-07-14 06:15:02,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 240. [2022-07-14 06:15:02,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 222 states have (on average 1.7882882882882882) internal successors, (397), 239 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:02,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 397 transitions. [2022-07-14 06:15:02,772 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 397 transitions. Word has length 8 [2022-07-14 06:15:02,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:15:02,772 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 397 transitions. [2022-07-14 06:15:02,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:02,772 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 397 transitions. [2022-07-14 06:15:02,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-14 06:15:02,773 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:15:02,773 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:15:02,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-14 06:15:02,773 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:15:02,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:15:02,774 INFO L85 PathProgramCache]: Analyzing trace with hash 179596398, now seen corresponding path program 1 times [2022-07-14 06:15:02,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:15:02,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148653539] [2022-07-14 06:15:02,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:15:02,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:15:02,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:15:02,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:15:02,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:15:02,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148653539] [2022-07-14 06:15:02,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148653539] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:15:02,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:15:02,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:15:02,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656386685] [2022-07-14 06:15:02,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:15:02,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:15:02,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:15:02,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:15:02,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:15:02,824 INFO L87 Difference]: Start difference. First operand 240 states and 397 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:02,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:15:02,888 INFO L93 Difference]: Finished difference Result 256 states and 402 transitions. [2022-07-14 06:15:02,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:15:02,889 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-14 06:15:02,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:15:02,890 INFO L225 Difference]: With dead ends: 256 [2022-07-14 06:15:02,890 INFO L226 Difference]: Without dead ends: 256 [2022-07-14 06:15:02,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:15:02,891 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 66 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:15:02,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 179 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:15:02,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-07-14 06:15:02,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 238. [2022-07-14 06:15:02,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 222 states have (on average 1.7522522522522523) internal successors, (389), 237 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:02,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 389 transitions. [2022-07-14 06:15:02,909 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 389 transitions. Word has length 8 [2022-07-14 06:15:02,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:15:02,910 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 389 transitions. [2022-07-14 06:15:02,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:02,911 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 389 transitions. [2022-07-14 06:15:02,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-14 06:15:02,912 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:15:02,912 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:15:02,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-14 06:15:02,913 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:15:02,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:15:02,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1272529015, now seen corresponding path program 1 times [2022-07-14 06:15:02,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:15:02,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381538397] [2022-07-14 06:15:02,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:15:02,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:15:02,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:15:02,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:15:02,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:15:02,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381538397] [2022-07-14 06:15:02,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381538397] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:15:02,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:15:02,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:15:02,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355789788] [2022-07-14 06:15:02,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:15:02,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:15:02,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:15:02,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:15:02,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:15:02,966 INFO L87 Difference]: Start difference. First operand 238 states and 389 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:02,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:15:02,993 INFO L93 Difference]: Finished difference Result 297 states and 423 transitions. [2022-07-14 06:15:02,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:15:02,994 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-14 06:15:02,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:15:02,995 INFO L225 Difference]: With dead ends: 297 [2022-07-14 06:15:02,995 INFO L226 Difference]: Without dead ends: 297 [2022-07-14 06:15:02,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:15:02,996 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 105 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:15:02,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 279 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:15:02,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2022-07-14 06:15:03,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 195. [2022-07-14 06:15:03,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 183 states have (on average 1.6994535519125684) internal successors, (311), 194 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:03,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 311 transitions. [2022-07-14 06:15:03,004 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 311 transitions. Word has length 9 [2022-07-14 06:15:03,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:15:03,005 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 311 transitions. [2022-07-14 06:15:03,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:03,005 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 311 transitions. [2022-07-14 06:15:03,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-14 06:15:03,005 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:15:03,006 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:15:03,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-14 06:15:03,006 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:15:03,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:15:03,006 INFO L85 PathProgramCache]: Analyzing trace with hash 845049582, now seen corresponding path program 1 times [2022-07-14 06:15:03,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:15:03,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208130671] [2022-07-14 06:15:03,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:15:03,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:15:03,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:15:03,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:15:03,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:15:03,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208130671] [2022-07-14 06:15:03,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208130671] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:15:03,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:15:03,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:15:03,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404870304] [2022-07-14 06:15:03,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:15:03,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:15:03,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:15:03,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:15:03,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:15:03,043 INFO L87 Difference]: Start difference. First operand 195 states and 311 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:03,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:15:03,068 INFO L93 Difference]: Finished difference Result 418 states and 615 transitions. [2022-07-14 06:15:03,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:15:03,068 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-14 06:15:03,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:15:03,070 INFO L225 Difference]: With dead ends: 418 [2022-07-14 06:15:03,070 INFO L226 Difference]: Without dead ends: 418 [2022-07-14 06:15:03,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:15:03,071 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 107 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:15:03,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 236 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:15:03,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2022-07-14 06:15:03,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 278. [2022-07-14 06:15:03,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 266 states have (on average 1.6090225563909775) internal successors, (428), 277 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:03,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 428 transitions. [2022-07-14 06:15:03,077 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 428 transitions. Word has length 10 [2022-07-14 06:15:03,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:15:03,078 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 428 transitions. [2022-07-14 06:15:03,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:03,078 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 428 transitions. [2022-07-14 06:15:03,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-14 06:15:03,079 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:15:03,079 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:15:03,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-14 06:15:03,087 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:15:03,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:15:03,088 INFO L85 PathProgramCache]: Analyzing trace with hash 22246394, now seen corresponding path program 1 times [2022-07-14 06:15:03,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:15:03,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601042876] [2022-07-14 06:15:03,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:15:03,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:15:03,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:15:03,143 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:15:03,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:15:03,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601042876] [2022-07-14 06:15:03,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601042876] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:15:03,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153472117] [2022-07-14 06:15:03,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:15:03,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:15:03,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:15:03,146 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) [2022-07-14 06:15:03,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-14 06:15:03,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:15:03,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 06:15:03,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:15:03,290 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:15:03,290 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:15:03,316 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:15:03,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [153472117] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:15:03,317 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:15:03,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-07-14 06:15:03,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397257150] [2022-07-14 06:15:03,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:15:03,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 06:15:03,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:15:03,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 06:15:03,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:15:03,319 INFO L87 Difference]: Start difference. First operand 278 states and 428 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:03,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:15:03,365 INFO L93 Difference]: Finished difference Result 282 states and 418 transitions. [2022-07-14 06:15:03,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:15:03,365 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-14 06:15:03,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:15:03,366 INFO L225 Difference]: With dead ends: 282 [2022-07-14 06:15:03,366 INFO L226 Difference]: Without dead ends: 282 [2022-07-14 06:15:03,367 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:15:03,368 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 231 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:15:03,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 289 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:15:03,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-07-14 06:15:03,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 274. [2022-07-14 06:15:03,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 262 states have (on average 1.5877862595419847) internal successors, (416), 273 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:03,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 416 transitions. [2022-07-14 06:15:03,375 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 416 transitions. Word has length 16 [2022-07-14 06:15:03,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:15:03,375 INFO L495 AbstractCegarLoop]: Abstraction has 274 states and 416 transitions. [2022-07-14 06:15:03,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:03,375 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 416 transitions. [2022-07-14 06:15:03,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-14 06:15:03,376 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:15:03,376 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:15:03,395 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-14 06:15:03,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-14 06:15:03,592 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:15:03,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:15:03,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1902356162, now seen corresponding path program 1 times [2022-07-14 06:15:03,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:15:03,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752695528] [2022-07-14 06:15:03,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:15:03,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:15:03,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:15:03,639 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:15:03,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:15:03,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752695528] [2022-07-14 06:15:03,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752695528] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:15:03,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001814832] [2022-07-14 06:15:03,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:15:03,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:15:03,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:15:03,642 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) [2022-07-14 06:15:03,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-14 06:15:03,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:15:03,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-14 06:15:03,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:15:03,754 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:15:03,755 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:15:03,802 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:15:03,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001814832] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:15:03,802 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:15:03,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2022-07-14 06:15:03,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921223329] [2022-07-14 06:15:03,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:15:03,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 06:15:03,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:15:03,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 06:15:03,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:15:03,804 INFO L87 Difference]: Start difference. First operand 274 states and 416 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:03,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:15:03,865 INFO L93 Difference]: Finished difference Result 613 states and 869 transitions. [2022-07-14 06:15:03,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 06:15:03,866 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-14 06:15:03,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:15:03,870 INFO L225 Difference]: With dead ends: 613 [2022-07-14 06:15:03,870 INFO L226 Difference]: Without dead ends: 613 [2022-07-14 06:15:03,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-14 06:15:03,871 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 295 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:15:03,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 472 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:15:03,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2022-07-14 06:15:03,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 387. [2022-07-14 06:15:03,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 375 states have (on average 1.5333333333333334) internal successors, (575), 386 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:03,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 575 transitions. [2022-07-14 06:15:03,880 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 575 transitions. Word has length 16 [2022-07-14 06:15:03,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:15:03,880 INFO L495 AbstractCegarLoop]: Abstraction has 387 states and 575 transitions. [2022-07-14 06:15:03,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:03,881 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 575 transitions. [2022-07-14 06:15:03,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-14 06:15:03,885 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:15:03,885 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-14 06:15:03,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-14 06:15:04,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-14 06:15:04,095 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:15:04,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:15:04,095 INFO L85 PathProgramCache]: Analyzing trace with hash 53823374, now seen corresponding path program 2 times [2022-07-14 06:15:04,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:15:04,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665876318] [2022-07-14 06:15:04,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:15:04,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:15:04,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:15:04,132 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:15:04,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:15:04,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665876318] [2022-07-14 06:15:04,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665876318] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:15:04,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306123554] [2022-07-14 06:15:04,133 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 06:15:04,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:15:04,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:15:04,135 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) [2022-07-14 06:15:04,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-14 06:15:04,186 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 06:15:04,187 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:15:04,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-14 06:15:04,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:15:04,271 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-14 06:15:04,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:15:04,295 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-14 06:15:04,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1306123554] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:15:04,296 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:15:04,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 9 [2022-07-14 06:15:04,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190700711] [2022-07-14 06:15:04,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:15:04,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 06:15:04,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:15:04,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 06:15:04,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:15:04,298 INFO L87 Difference]: Start difference. First operand 387 states and 575 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:04,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:15:04,369 INFO L93 Difference]: Finished difference Result 831 states and 1155 transitions. [2022-07-14 06:15:04,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-14 06:15:04,370 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-14 06:15:04,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:15:04,372 INFO L225 Difference]: With dead ends: 831 [2022-07-14 06:15:04,372 INFO L226 Difference]: Without dead ends: 831 [2022-07-14 06:15:04,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2022-07-14 06:15:04,373 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 446 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:15:04,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 601 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:15:04,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2022-07-14 06:15:04,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 468. [2022-07-14 06:15:04,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 456 states have (on average 1.5043859649122806) internal successors, (686), 467 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:04,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 686 transitions. [2022-07-14 06:15:04,382 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 686 transitions. Word has length 22 [2022-07-14 06:15:04,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:15:04,383 INFO L495 AbstractCegarLoop]: Abstraction has 468 states and 686 transitions. [2022-07-14 06:15:04,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:04,383 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 686 transitions. [2022-07-14 06:15:04,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-14 06:15:04,384 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:15:04,384 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:15:04,401 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-14 06:15:04,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:15:04,606 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:15:04,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:15:04,606 INFO L85 PathProgramCache]: Analyzing trace with hash -2107196217, now seen corresponding path program 1 times [2022-07-14 06:15:04,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:15:04,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246187318] [2022-07-14 06:15:04,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:15:04,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:15:04,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:15:04,633 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:15:04,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:15:04,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246187318] [2022-07-14 06:15:04,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246187318] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:15:04,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123933187] [2022-07-14 06:15:04,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:15:04,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:15:04,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:15:04,648 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) [2022-07-14 06:15:04,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-14 06:15:04,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:15:04,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-14 06:15:04,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:15:04,738 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:15:04,738 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:15:04,770 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:15:04,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123933187] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:15:04,771 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:15:04,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2022-07-14 06:15:04,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853806643] [2022-07-14 06:15:04,771 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:15:04,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:15:04,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:15:04,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:15:04,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:15:04,772 INFO L87 Difference]: Start difference. First operand 468 states and 686 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:04,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:15:04,821 INFO L93 Difference]: Finished difference Result 1116 states and 1618 transitions. [2022-07-14 06:15:04,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:15:04,822 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-14 06:15:04,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:15:04,825 INFO L225 Difference]: With dead ends: 1116 [2022-07-14 06:15:04,825 INFO L226 Difference]: Without dead ends: 1116 [2022-07-14 06:15:04,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:15:04,826 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 173 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:15:04,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 163 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:15:04,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2022-07-14 06:15:04,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 995. [2022-07-14 06:15:04,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 995 states, 983 states have (on average 1.4933875890132249) internal successors, (1468), 994 states have internal predecessors, (1468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:04,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1468 transitions. [2022-07-14 06:15:04,842 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1468 transitions. Word has length 24 [2022-07-14 06:15:04,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:15:04,842 INFO L495 AbstractCegarLoop]: Abstraction has 995 states and 1468 transitions. [2022-07-14 06:15:04,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:04,843 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1468 transitions. [2022-07-14 06:15:04,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-14 06:15:04,843 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:15:04,843 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:15:04,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-14 06:15:05,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:15:05,060 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:15:05,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:15:05,060 INFO L85 PathProgramCache]: Analyzing trace with hash -6965384, now seen corresponding path program 1 times [2022-07-14 06:15:05,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:15:05,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834265640] [2022-07-14 06:15:05,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:15:05,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:15:05,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:15:05,131 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:15:05,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:15:05,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834265640] [2022-07-14 06:15:05,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834265640] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:15:05,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509910729] [2022-07-14 06:15:05,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:15:05,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:15:05,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:15:05,133 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) [2022-07-14 06:15:05,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-14 06:15:05,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:15:05,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-14 06:15:05,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:15:05,223 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:15:05,224 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:15:05,268 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:15:05,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509910729] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:15:05,268 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:15:05,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-07-14 06:15:05,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865755919] [2022-07-14 06:15:05,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:15:05,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 06:15:05,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:15:05,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 06:15:05,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-07-14 06:15:05,272 INFO L87 Difference]: Start difference. First operand 995 states and 1468 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:05,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:15:05,391 INFO L93 Difference]: Finished difference Result 3487 states and 4850 transitions. [2022-07-14 06:15:05,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-14 06:15:05,392 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-14 06:15:05,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:15:05,401 INFO L225 Difference]: With dead ends: 3487 [2022-07-14 06:15:05,401 INFO L226 Difference]: Without dead ends: 3487 [2022-07-14 06:15:05,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-07-14 06:15:05,402 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 441 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:15:05,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 554 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:15:05,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3487 states. [2022-07-14 06:15:05,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3487 to 2363. [2022-07-14 06:15:05,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2363 states, 2351 states have (on average 1.4427903019991493) internal successors, (3392), 2362 states have internal predecessors, (3392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:05,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2363 states to 2363 states and 3392 transitions. [2022-07-14 06:15:05,445 INFO L78 Accepts]: Start accepts. Automaton has 2363 states and 3392 transitions. Word has length 27 [2022-07-14 06:15:05,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:15:05,445 INFO L495 AbstractCegarLoop]: Abstraction has 2363 states and 3392 transitions. [2022-07-14 06:15:05,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:05,445 INFO L276 IsEmpty]: Start isEmpty. Operand 2363 states and 3392 transitions. [2022-07-14 06:15:05,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-14 06:15:05,446 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:15:05,446 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:15:05,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-14 06:15:05,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-14 06:15:05,660 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:15:05,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:15:05,660 INFO L85 PathProgramCache]: Analyzing trace with hash 334990594, now seen corresponding path program 1 times [2022-07-14 06:15:05,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:15:05,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876046838] [2022-07-14 06:15:05,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:15:05,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:15:05,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:15:05,711 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 06:15:05,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:15:05,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876046838] [2022-07-14 06:15:05,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876046838] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:15:05,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417715222] [2022-07-14 06:15:05,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:15:05,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:15:05,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:15:05,716 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:15:05,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-14 06:15:05,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:15:05,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-14 06:15:05,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:15:05,820 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 06:15:05,820 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:15:05,851 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 06:15:05,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1417715222] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:15:05,852 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:15:05,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2022-07-14 06:15:05,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146476117] [2022-07-14 06:15:05,852 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:15:05,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:15:05,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:15:05,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:15:05,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:15:05,853 INFO L87 Difference]: Start difference. First operand 2363 states and 3392 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:05,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:15:05,901 INFO L93 Difference]: Finished difference Result 1756 states and 2405 transitions. [2022-07-14 06:15:05,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 06:15:05,902 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-14 06:15:05,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:15:05,907 INFO L225 Difference]: With dead ends: 1756 [2022-07-14 06:15:05,907 INFO L226 Difference]: Without dead ends: 1756 [2022-07-14 06:15:05,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-07-14 06:15:05,909 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 346 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:15:05,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 532 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:15:05,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1756 states. [2022-07-14 06:15:05,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1756 to 1081. [2022-07-14 06:15:05,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1081 states, 1069 states have (on average 1.4069223573433116) internal successors, (1504), 1080 states have internal predecessors, (1504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:05,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 1504 transitions. [2022-07-14 06:15:05,927 INFO L78 Accepts]: Start accepts. Automaton has 1081 states and 1504 transitions. Word has length 27 [2022-07-14 06:15:05,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:15:05,928 INFO L495 AbstractCegarLoop]: Abstraction has 1081 states and 1504 transitions. [2022-07-14 06:15:05,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:05,928 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 1504 transitions. [2022-07-14 06:15:05,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-14 06:15:05,930 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:15:05,931 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:15:05,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-14 06:15:06,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-14 06:15:06,148 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:15:06,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:15:06,148 INFO L85 PathProgramCache]: Analyzing trace with hash 2001409998, now seen corresponding path program 1 times [2022-07-14 06:15:06,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:15:06,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304917415] [2022-07-14 06:15:06,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:15:06,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:15:06,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:15:06,202 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 50 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-07-14 06:15:06,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:15:06,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304917415] [2022-07-14 06:15:06,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304917415] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:15:06,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667647034] [2022-07-14 06:15:06,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:15:06,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:15:06,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:15:06,205 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:15:06,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-14 06:15:06,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:15:06,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-14 06:15:06,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:15:06,368 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 19 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:15:06,368 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:15:06,421 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 19 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:15:06,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667647034] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:15:06,421 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:15:06,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 13 [2022-07-14 06:15:06,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706306533] [2022-07-14 06:15:06,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:15:06,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-14 06:15:06,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:15:06,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-14 06:15:06,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-07-14 06:15:06,423 INFO L87 Difference]: Start difference. First operand 1081 states and 1504 transitions. Second operand has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 13 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:06,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:15:06,675 INFO L93 Difference]: Finished difference Result 3000 states and 3991 transitions. [2022-07-14 06:15:06,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-14 06:15:06,676 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 13 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-07-14 06:15:06,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:15:06,684 INFO L225 Difference]: With dead ends: 3000 [2022-07-14 06:15:06,684 INFO L226 Difference]: Without dead ends: 3000 [2022-07-14 06:15:06,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=252, Invalid=618, Unknown=0, NotChecked=0, Total=870 [2022-07-14 06:15:06,686 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 1176 mSDsluCounter, 892 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1176 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:15:06,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1176 Valid, 1056 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:15:06,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3000 states. [2022-07-14 06:15:06,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3000 to 1204. [2022-07-14 06:15:06,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1204 states, 1192 states have (on average 1.4236577181208054) internal successors, (1697), 1203 states have internal predecessors, (1697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:06,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 1697 transitions. [2022-07-14 06:15:06,717 INFO L78 Accepts]: Start accepts. Automaton has 1204 states and 1697 transitions. Word has length 51 [2022-07-14 06:15:06,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:15:06,717 INFO L495 AbstractCegarLoop]: Abstraction has 1204 states and 1697 transitions. [2022-07-14 06:15:06,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 13 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:06,718 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 1697 transitions. [2022-07-14 06:15:06,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-14 06:15:06,718 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:15:06,719 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:15:06,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-14 06:15:06,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:15:06,938 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:15:06,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:15:06,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1426339750, now seen corresponding path program 1 times [2022-07-14 06:15:06,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:15:06,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570515144] [2022-07-14 06:15:06,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:15:06,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:15:06,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:15:07,004 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 65 proven. 3 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-07-14 06:15:07,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:15:07,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570515144] [2022-07-14 06:15:07,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570515144] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:15:07,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122832893] [2022-07-14 06:15:07,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:15:07,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:15:07,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:15:07,007 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:15:07,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-14 06:15:07,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:15:07,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-14 06:15:07,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:15:07,128 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 92 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-14 06:15:07,128 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:15:07,160 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-14 06:15:07,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [122832893] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-14 06:15:07,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:15:07,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 13 [2022-07-14 06:15:07,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080881093] [2022-07-14 06:15:07,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:15:07,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 06:15:07,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:15:07,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 06:15:07,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-07-14 06:15:07,163 INFO L87 Difference]: Start difference. First operand 1204 states and 1697 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:07,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:15:07,236 INFO L93 Difference]: Finished difference Result 2838 states and 3879 transitions. [2022-07-14 06:15:07,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 06:15:07,236 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2022-07-14 06:15:07,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:15:07,243 INFO L225 Difference]: With dead ends: 2838 [2022-07-14 06:15:07,244 INFO L226 Difference]: Without dead ends: 2838 [2022-07-14 06:15:07,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-07-14 06:15:07,244 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 269 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:15:07,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 385 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:15:07,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2838 states. [2022-07-14 06:15:07,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2838 to 2004. [2022-07-14 06:15:07,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2004 states, 1992 states have (on average 1.3995983935742973) internal successors, (2788), 2003 states have internal predecessors, (2788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:07,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2004 states to 2004 states and 2788 transitions. [2022-07-14 06:15:07,274 INFO L78 Accepts]: Start accepts. Automaton has 2004 states and 2788 transitions. Word has length 59 [2022-07-14 06:15:07,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:15:07,274 INFO L495 AbstractCegarLoop]: Abstraction has 2004 states and 2788 transitions. [2022-07-14 06:15:07,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:07,275 INFO L276 IsEmpty]: Start isEmpty. Operand 2004 states and 2788 transitions. [2022-07-14 06:15:07,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-14 06:15:07,276 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:15:07,276 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:15:07,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-07-14 06:15:07,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-14 06:15:07,494 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:15:07,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:15:07,495 INFO L85 PathProgramCache]: Analyzing trace with hash -443713253, now seen corresponding path program 1 times [2022-07-14 06:15:07,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:15:07,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312304084] [2022-07-14 06:15:07,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:15:07,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:15:07,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:15:07,535 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 27 proven. 49 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-14 06:15:07,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:15:07,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312304084] [2022-07-14 06:15:07,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312304084] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:15:07,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537040701] [2022-07-14 06:15:07,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:15:07,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:15:07,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:15:07,537 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:15:07,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-14 06:15:07,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:15:07,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-14 06:15:07,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:15:07,660 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 71 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-14 06:15:07,660 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:15:07,692 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 71 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-14 06:15:07,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1537040701] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:15:07,693 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:15:07,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 12 [2022-07-14 06:15:07,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046358021] [2022-07-14 06:15:07,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:15:07,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-14 06:15:07,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:15:07,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-14 06:15:07,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-07-14 06:15:07,694 INFO L87 Difference]: Start difference. First operand 2004 states and 2788 transitions. Second operand has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:08,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:15:08,611 INFO L93 Difference]: Finished difference Result 11354 states and 15589 transitions. [2022-07-14 06:15:08,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-07-14 06:15:08,611 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2022-07-14 06:15:08,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:15:08,650 INFO L225 Difference]: With dead ends: 11354 [2022-07-14 06:15:08,650 INFO L226 Difference]: Without dead ends: 11354 [2022-07-14 06:15:08,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 140 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 726 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=631, Invalid=2021, Unknown=0, NotChecked=0, Total=2652 [2022-07-14 06:15:08,652 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 1148 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1148 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 06:15:08,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1148 Valid, 801 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 829 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-14 06:15:08,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11354 states. [2022-07-14 06:15:08,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11354 to 5913. [2022-07-14 06:15:08,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5913 states, 5902 states have (on average 1.423246357167062) internal successors, (8400), 5912 states have internal predecessors, (8400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:08,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5913 states to 5913 states and 8400 transitions. [2022-07-14 06:15:08,825 INFO L78 Accepts]: Start accepts. Automaton has 5913 states and 8400 transitions. Word has length 59 [2022-07-14 06:15:08,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:15:08,825 INFO L495 AbstractCegarLoop]: Abstraction has 5913 states and 8400 transitions. [2022-07-14 06:15:08,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:08,825 INFO L276 IsEmpty]: Start isEmpty. Operand 5913 states and 8400 transitions. [2022-07-14 06:15:08,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-14 06:15:08,827 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:15:08,827 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:15:08,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-14 06:15:09,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-14 06:15:09,048 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:15:09,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:15:09,048 INFO L85 PathProgramCache]: Analyzing trace with hash -791217300, now seen corresponding path program 1 times [2022-07-14 06:15:09,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:15:09,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408915132] [2022-07-14 06:15:09,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:15:09,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:15:09,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:15:09,129 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 68 proven. 4 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-07-14 06:15:09,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:15:09,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408915132] [2022-07-14 06:15:09,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408915132] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:15:09,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316914159] [2022-07-14 06:15:09,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:15:09,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:15:09,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:15:09,132 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:15:09,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-14 06:15:09,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:15:09,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-14 06:15:09,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:15:09,282 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 101 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-14 06:15:09,282 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:15:09,332 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 103 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-14 06:15:09,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [316914159] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:15:09,332 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:15:09,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 14 [2022-07-14 06:15:09,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194168901] [2022-07-14 06:15:09,333 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:15:09,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-14 06:15:09,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:15:09,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-14 06:15:09,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-07-14 06:15:09,334 INFO L87 Difference]: Start difference. First operand 5913 states and 8400 transitions. Second operand has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:09,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:15:09,904 INFO L93 Difference]: Finished difference Result 13135 states and 18181 transitions. [2022-07-14 06:15:09,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-14 06:15:09,905 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2022-07-14 06:15:09,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:15:09,946 INFO L225 Difference]: With dead ends: 13135 [2022-07-14 06:15:09,947 INFO L226 Difference]: Without dead ends: 13135 [2022-07-14 06:15:09,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=407, Invalid=1233, Unknown=0, NotChecked=0, Total=1640 [2022-07-14 06:15:09,948 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 1173 mSDsluCounter, 1002 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1173 SdHoareTripleChecker+Valid, 1196 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:15:09,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1173 Valid, 1196 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:15:09,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13135 states. [2022-07-14 06:15:10,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13135 to 5663. [2022-07-14 06:15:10,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5663 states, 5652 states have (on average 1.3982661004953998) internal successors, (7903), 5662 states have internal predecessors, (7903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:10,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5663 states to 5663 states and 7903 transitions. [2022-07-14 06:15:10,098 INFO L78 Accepts]: Start accepts. Automaton has 5663 states and 7903 transitions. Word has length 63 [2022-07-14 06:15:10,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:15:10,099 INFO L495 AbstractCegarLoop]: Abstraction has 5663 states and 7903 transitions. [2022-07-14 06:15:10,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:10,099 INFO L276 IsEmpty]: Start isEmpty. Operand 5663 states and 7903 transitions. [2022-07-14 06:15:10,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-14 06:15:10,100 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:15:10,100 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:15:10,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-14 06:15:10,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:15:10,316 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:15:10,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:15:10,316 INFO L85 PathProgramCache]: Analyzing trace with hash 767429099, now seen corresponding path program 1 times [2022-07-14 06:15:10,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:15:10,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110252870] [2022-07-14 06:15:10,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:15:10,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:15:10,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:15:10,371 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 72 proven. 14 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-14 06:15:10,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:15:10,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110252870] [2022-07-14 06:15:10,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110252870] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:15:10,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401058761] [2022-07-14 06:15:10,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:15:10,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:15:10,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:15:10,374 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:15:10,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-14 06:15:10,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:15:10,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-14 06:15:10,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:15:10,539 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 52 proven. 38 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-14 06:15:10,539 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:15:10,634 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 52 proven. 38 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-14 06:15:10,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401058761] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:15:10,635 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:15:10,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-07-14 06:15:10,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147110753] [2022-07-14 06:15:10,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:15:10,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-14 06:15:10,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:15:10,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-14 06:15:10,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-07-14 06:15:10,637 INFO L87 Difference]: Start difference. First operand 5663 states and 7903 transitions. Second operand has 14 states, 14 states have (on average 6.428571428571429) internal successors, (90), 14 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:10,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:15:10,868 INFO L93 Difference]: Finished difference Result 4879 states and 6428 transitions. [2022-07-14 06:15:10,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-14 06:15:10,869 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.428571428571429) internal successors, (90), 14 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2022-07-14 06:15:10,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:15:10,878 INFO L225 Difference]: With dead ends: 4879 [2022-07-14 06:15:10,879 INFO L226 Difference]: Without dead ends: 4879 [2022-07-14 06:15:10,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 128 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=602, Unknown=0, NotChecked=0, Total=756 [2022-07-14 06:15:10,880 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 929 mSDsluCounter, 1242 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 929 SdHoareTripleChecker+Valid, 1479 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:15:10,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [929 Valid, 1479 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:15:10,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4879 states. [2022-07-14 06:15:10,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4879 to 3657. [2022-07-14 06:15:10,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3657 states, 3646 states have (on average 1.3167855183763029) internal successors, (4801), 3656 states have internal predecessors, (4801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:10,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3657 states to 3657 states and 4801 transitions. [2022-07-14 06:15:10,940 INFO L78 Accepts]: Start accepts. Automaton has 3657 states and 4801 transitions. Word has length 63 [2022-07-14 06:15:10,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:15:10,940 INFO L495 AbstractCegarLoop]: Abstraction has 3657 states and 4801 transitions. [2022-07-14 06:15:10,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.428571428571429) internal successors, (90), 14 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:10,940 INFO L276 IsEmpty]: Start isEmpty. Operand 3657 states and 4801 transitions. [2022-07-14 06:15:10,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-14 06:15:10,941 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:15:10,941 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:15:10,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-14 06:15:11,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:15:11,155 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:15:11,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:15:11,155 INFO L85 PathProgramCache]: Analyzing trace with hash 965172541, now seen corresponding path program 1 times [2022-07-14 06:15:11,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:15:11,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078138972] [2022-07-14 06:15:11,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:15:11,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:15:11,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:15:11,201 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 33 proven. 47 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-07-14 06:15:11,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:15:11,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078138972] [2022-07-14 06:15:11,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078138972] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:15:11,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585246272] [2022-07-14 06:15:11,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:15:11,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:15:11,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:15:11,204 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:15:11,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-14 06:15:11,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:15:11,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 06:15:11,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:15:11,385 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 33 proven. 47 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-07-14 06:15:11,386 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:15:11,462 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 33 proven. 47 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-07-14 06:15:11,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1585246272] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:15:11,462 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:15:11,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2022-07-14 06:15:11,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322109931] [2022-07-14 06:15:11,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:15:11,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:15:11,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:15:11,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:15:11,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:15:11,464 INFO L87 Difference]: Start difference. First operand 3657 states and 4801 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:11,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:15:11,530 INFO L93 Difference]: Finished difference Result 3649 states and 4758 transitions. [2022-07-14 06:15:11,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:15:11,531 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-07-14 06:15:11,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:15:11,537 INFO L225 Difference]: With dead ends: 3649 [2022-07-14 06:15:11,537 INFO L226 Difference]: Without dead ends: 3649 [2022-07-14 06:15:11,538 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:15:11,538 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 107 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:15:11,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 253 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:15:11,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3649 states. [2022-07-14 06:15:11,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3649 to 3642. [2022-07-14 06:15:11,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3642 states, 3631 states have (on average 1.3098320022032497) internal successors, (4756), 3641 states have internal predecessors, (4756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:11,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3642 states to 3642 states and 4756 transitions. [2022-07-14 06:15:11,586 INFO L78 Accepts]: Start accepts. Automaton has 3642 states and 4756 transitions. Word has length 64 [2022-07-14 06:15:11,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:15:11,586 INFO L495 AbstractCegarLoop]: Abstraction has 3642 states and 4756 transitions. [2022-07-14 06:15:11,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:11,586 INFO L276 IsEmpty]: Start isEmpty. Operand 3642 states and 4756 transitions. [2022-07-14 06:15:11,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-14 06:15:11,587 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:15:11,587 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:15:11,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-14 06:15:11,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-07-14 06:15:11,812 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:15:11,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:15:11,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1737502264, now seen corresponding path program 1 times [2022-07-14 06:15:11,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:15:11,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42137844] [2022-07-14 06:15:11,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:15:11,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:15:11,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:15:11,888 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 89 proven. 4 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-07-14 06:15:11,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:15:11,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42137844] [2022-07-14 06:15:11,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42137844] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:15:11,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170804722] [2022-07-14 06:15:11,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:15:11,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:15:11,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:15:11,892 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:15:11,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-14 06:15:11,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:15:11,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-14 06:15:11,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:15:12,092 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 95 proven. 15 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-14 06:15:12,092 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:15:12,171 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 97 proven. 13 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-14 06:15:12,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [170804722] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:15:12,171 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:15:12,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 11 [2022-07-14 06:15:12,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500580395] [2022-07-14 06:15:12,172 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:15:12,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-14 06:15:12,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:15:12,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-14 06:15:12,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-07-14 06:15:12,174 INFO L87 Difference]: Start difference. First operand 3642 states and 4756 transitions. Second operand has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:12,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:15:12,430 INFO L93 Difference]: Finished difference Result 5049 states and 6651 transitions. [2022-07-14 06:15:12,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-14 06:15:12,431 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-07-14 06:15:12,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:15:12,439 INFO L225 Difference]: With dead ends: 5049 [2022-07-14 06:15:12,439 INFO L226 Difference]: Without dead ends: 5049 [2022-07-14 06:15:12,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 128 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2022-07-14 06:15:12,441 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 439 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:15:12,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 621 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:15:12,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5049 states. [2022-07-14 06:15:12,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5049 to 2736. [2022-07-14 06:15:12,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2736 states, 2725 states have (on average 1.3056880733944953) internal successors, (3558), 2735 states have internal predecessors, (3558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:12,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2736 states to 2736 states and 3558 transitions. [2022-07-14 06:15:12,506 INFO L78 Accepts]: Start accepts. Automaton has 2736 states and 3558 transitions. Word has length 65 [2022-07-14 06:15:12,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:15:12,506 INFO L495 AbstractCegarLoop]: Abstraction has 2736 states and 3558 transitions. [2022-07-14 06:15:12,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:12,507 INFO L276 IsEmpty]: Start isEmpty. Operand 2736 states and 3558 transitions. [2022-07-14 06:15:12,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-14 06:15:12,513 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:15:12,513 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 5, 5, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:15:12,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-14 06:15:12,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-07-14 06:15:12,740 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:15:12,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:15:12,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1937207539, now seen corresponding path program 1 times [2022-07-14 06:15:12,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:15:12,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336211474] [2022-07-14 06:15:12,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:15:12,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:15:12,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:15:12,826 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 32 proven. 62 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-07-14 06:15:12,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:15:12,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336211474] [2022-07-14 06:15:12,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336211474] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:15:12,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850192680] [2022-07-14 06:15:12,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:15:12,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:15:12,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:15:12,829 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:15:12,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-14 06:15:12,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:15:12,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-14 06:15:12,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:15:12,962 INFO L390 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 [2022-07-14 06:15:13,120 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 32 proven. 62 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-07-14 06:15:13,121 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:15:13,308 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 32 proven. 62 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-07-14 06:15:13,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850192680] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:15:13,309 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:15:13,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-07-14 06:15:13,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082540134] [2022-07-14 06:15:13,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:15:13,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-14 06:15:13,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:15:13,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-14 06:15:13,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-07-14 06:15:13,311 INFO L87 Difference]: Start difference. First operand 2736 states and 3558 transitions. Second operand has 11 states, 10 states have (on average 11.4) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:13,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:15:13,577 INFO L93 Difference]: Finished difference Result 4740 states and 6100 transitions. [2022-07-14 06:15:13,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 06:15:13,577 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.4) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2022-07-14 06:15:13,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:15:13,589 INFO L225 Difference]: With dead ends: 4740 [2022-07-14 06:15:13,589 INFO L226 Difference]: Without dead ends: 4740 [2022-07-14 06:15:13,590 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2022-07-14 06:15:13,594 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 726 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:15:13,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [726 Valid, 465 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:15:13,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4740 states. [2022-07-14 06:15:13,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4740 to 3702. [2022-07-14 06:15:13,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3702 states, 3691 states have (on average 1.3270116499593607) internal successors, (4898), 3701 states have internal predecessors, (4898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:13,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3702 states to 3702 states and 4898 transitions. [2022-07-14 06:15:13,650 INFO L78 Accepts]: Start accepts. Automaton has 3702 states and 4898 transitions. Word has length 69 [2022-07-14 06:15:13,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:15:13,650 INFO L495 AbstractCegarLoop]: Abstraction has 3702 states and 4898 transitions. [2022-07-14 06:15:13,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.4) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:13,651 INFO L276 IsEmpty]: Start isEmpty. Operand 3702 states and 4898 transitions. [2022-07-14 06:15:13,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-14 06:15:13,652 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:15:13,653 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 8, 6, 6, 5, 4, 3, 3, 3, 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] [2022-07-14 06:15:13,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-14 06:15:13,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:15:13,876 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:15:13,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:15:13,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1779624174, now seen corresponding path program 1 times [2022-07-14 06:15:13,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:15:13,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544263421] [2022-07-14 06:15:13,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:15:13,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:15:13,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:15:13,933 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 64 proven. 2 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2022-07-14 06:15:13,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:15:13,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544263421] [2022-07-14 06:15:13,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544263421] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:15:13,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67602734] [2022-07-14 06:15:13,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:15:13,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:15:13,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:15:13,936 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:15:13,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-14 06:15:14,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:15:14,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-14 06:15:14,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:15:14,184 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 29 proven. 65 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2022-07-14 06:15:14,185 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:15:14,271 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 29 proven. 65 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2022-07-14 06:15:14,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [67602734] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:15:14,272 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:15:14,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2022-07-14 06:15:14,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102260267] [2022-07-14 06:15:14,272 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:15:14,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-14 06:15:14,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:15:14,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-14 06:15:14,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-07-14 06:15:14,274 INFO L87 Difference]: Start difference. First operand 3702 states and 4898 transitions. Second operand has 12 states, 12 states have (on average 7.583333333333333) internal successors, (91), 12 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:14,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:15:14,550 INFO L93 Difference]: Finished difference Result 11141 states and 13886 transitions. [2022-07-14 06:15:14,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-14 06:15:14,551 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.583333333333333) internal successors, (91), 12 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2022-07-14 06:15:14,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:15:14,568 INFO L225 Difference]: With dead ends: 11141 [2022-07-14 06:15:14,569 INFO L226 Difference]: Without dead ends: 11141 [2022-07-14 06:15:14,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 182 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=200, Invalid=670, Unknown=0, NotChecked=0, Total=870 [2022-07-14 06:15:14,570 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 1204 mSDsluCounter, 1047 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1204 SdHoareTripleChecker+Valid, 1292 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:15:14,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1204 Valid, 1292 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:15:14,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11141 states. [2022-07-14 06:15:14,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11141 to 5772. [2022-07-14 06:15:14,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5772 states, 5761 states have (on average 1.3070647457038709) internal successors, (7530), 5771 states have internal predecessors, (7530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:14,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5772 states to 5772 states and 7530 transitions. [2022-07-14 06:15:14,676 INFO L78 Accepts]: Start accepts. Automaton has 5772 states and 7530 transitions. Word has length 88 [2022-07-14 06:15:14,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:15:14,677 INFO L495 AbstractCegarLoop]: Abstraction has 5772 states and 7530 transitions. [2022-07-14 06:15:14,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.583333333333333) internal successors, (91), 12 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:14,677 INFO L276 IsEmpty]: Start isEmpty. Operand 5772 states and 7530 transitions. [2022-07-14 06:15:14,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-14 06:15:14,679 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:15:14,679 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 9, 6, 6, 5, 4, 4, 4, 3, 3, 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] [2022-07-14 06:15:14,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-14 06:15:14,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:15:14,900 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:15:14,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:15:14,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1011471400, now seen corresponding path program 1 times [2022-07-14 06:15:14,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:15:14,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435093286] [2022-07-14 06:15:14,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:15:14,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:15:14,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 06:15:14,947 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 06:15:14,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 06:15:15,005 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 06:15:15,006 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-14 06:15:15,007 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK (19 of 20 remaining) [2022-07-14 06:15:15,009 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 20 remaining) [2022-07-14 06:15:15,010 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 20 remaining) [2022-07-14 06:15:15,010 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 20 remaining) [2022-07-14 06:15:15,010 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 20 remaining) [2022-07-14 06:15:15,010 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 20 remaining) [2022-07-14 06:15:15,010 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 20 remaining) [2022-07-14 06:15:15,011 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 20 remaining) [2022-07-14 06:15:15,011 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 20 remaining) [2022-07-14 06:15:15,011 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 20 remaining) [2022-07-14 06:15:15,011 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 20 remaining) [2022-07-14 06:15:15,011 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 20 remaining) [2022-07-14 06:15:15,013 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 20 remaining) [2022-07-14 06:15:15,013 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 20 remaining) [2022-07-14 06:15:15,013 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 20 remaining) [2022-07-14 06:15:15,013 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 20 remaining) [2022-07-14 06:15:15,013 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 20 remaining) [2022-07-14 06:15:15,013 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (2 of 20 remaining) [2022-07-14 06:15:15,013 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (1 of 20 remaining) [2022-07-14 06:15:15,013 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (0 of 20 remaining) [2022-07-14 06:15:15,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-14 06:15:15,017 INFO L356 BasicCegarLoop]: Path program 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] [2022-07-14 06:15:15,020 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-14 06:15:15,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.07 06:15:15 BoogieIcfgContainer [2022-07-14 06:15:15,096 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-14 06:15:15,096 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-14 06:15:15,096 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-14 06:15:15,097 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-14 06:15:15,097 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 06:15:01" (3/4) ... [2022-07-14 06:15:15,099 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-14 06:15:15,099 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-14 06:15:15,100 INFO L158 Benchmark]: Toolchain (without parser) took 14136.62ms. Allocated memory was 125.8MB in the beginning and 268.4MB in the end (delta: 142.6MB). Free memory was 85.9MB in the beginning and 121.7MB in the end (delta: -35.9MB). Peak memory consumption was 106.6MB. Max. memory is 16.1GB. [2022-07-14 06:15:15,100 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 125.8MB. Free memory was 104.1MB in the beginning and 104.0MB in the end (delta: 118.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 06:15:15,100 INFO L158 Benchmark]: CACSL2BoogieTranslator took 348.22ms. Allocated memory is still 125.8MB. Free memory was 85.7MB in the beginning and 91.4MB in the end (delta: -5.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-14 06:15:15,100 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.32ms. Allocated memory is still 125.8MB. Free memory was 91.4MB in the beginning and 89.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 06:15:15,101 INFO L158 Benchmark]: Boogie Preprocessor took 38.84ms. Allocated memory is still 125.8MB. Free memory was 89.3MB in the beginning and 87.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 06:15:15,101 INFO L158 Benchmark]: RCFGBuilder took 403.92ms. Allocated memory is still 125.8MB. Free memory was 87.8MB in the beginning and 72.0MB in the end (delta: 15.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-14 06:15:15,101 INFO L158 Benchmark]: TraceAbstraction took 13296.35ms. Allocated memory was 125.8MB in the beginning and 268.4MB in the end (delta: 142.6MB). Free memory was 71.5MB in the beginning and 121.7MB in the end (delta: -50.2MB). Peak memory consumption was 93.9MB. Max. memory is 16.1GB. [2022-07-14 06:15:15,101 INFO L158 Benchmark]: Witness Printer took 3.23ms. Allocated memory is still 268.4MB. Free memory is still 121.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 06:15:15,102 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.18ms. Allocated memory is still 125.8MB. Free memory was 104.1MB in the beginning and 104.0MB in the end (delta: 118.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 348.22ms. Allocated memory is still 125.8MB. Free memory was 85.7MB in the beginning and 91.4MB in the end (delta: -5.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.32ms. Allocated memory is still 125.8MB. Free memory was 91.4MB in the beginning and 89.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.84ms. Allocated memory is still 125.8MB. Free memory was 89.3MB in the beginning and 87.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 403.92ms. Allocated memory is still 125.8MB. Free memory was 87.8MB in the beginning and 72.0MB in the end (delta: 15.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 13296.35ms. Allocated memory was 125.8MB in the beginning and 268.4MB in the end (delta: 142.6MB). Free memory was 71.5MB in the beginning and 121.7MB in the end (delta: -50.2MB). Peak memory consumption was 93.9MB. Max. memory is 16.1GB. * Witness Printer took 3.23ms. Allocated memory is still 268.4MB. Free memory is still 121.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 592]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 592. Possible FailurePath: [L528] struct cell *S; [L529] int pc1 = 1; [L530] int pc4 = 1; [L531] static struct cell *t1 = ((void *)0); [L532] static struct cell *x1 = ((void *)0); [L561] struct cell* garbage; [L562] static struct cell *t4 = ((void *)0); [L563] static struct cell *x4 = ((void *)0); [L566] static int res4; VAL [garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L594] S || 1 != pc1 || __VERIFIER_nondet_int() [L594] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-1, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L537] x1 = malloc(sizeof(*x1)) [L538] x1->data = 0 VAL [garbage={0:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L539] x1->next = ((void *)0) VAL [garbage={0:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L596] RET push() [L594] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L541] case 2: VAL [garbage={0:0}, pc1=3, pc1++=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L542] x1->data = 4 VAL [garbage={0:0}, pc1=3, pc1++=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L596] RET push() [L594] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L545] t1 = S VAL [garbage={0:0}, pc1=4, pc1++=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L596] RET push() [L594] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L547] case 4: VAL [garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L548] x1->next = t1 VAL [garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L596] RET push() [L594] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L547] case 4: [L550] case 5: VAL [garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L551] COND TRUE S == t1 [L552] S = x1 VAL [garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={-2:0}, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L596] RET push() [L594] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [garbage={0:0}, pc1=6, pc4=1, res4=0, S={-2:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L547] case 4: [L550] case 5: [L556] case 6: [L557] pc1 = 1 VAL [garbage={0:0}, pc1=1, pc1++=6, pc4=1, res4=0, S={-2:0}, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L596] RET push() [L594] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [garbage={0:0}, pc1=1, pc4=1, res4=0, S={-2:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND FALSE !(__VERIFIER_nondet_int()) [L598] CALL pop() [L567] pc4++ [L568] case 1: [L569] t4 = S VAL [garbage={0:0}, pc1=1, pc4=2, pc4++=1, res4=0, S={-2:0}, t1={0:0}, t4={-2:0}, x1={-2:0}, x4={0:0}] [L598] RET pop() [L594] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [garbage={0:0}, pc1=1, pc4=2, res4=0, S={-2:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={-2:0}, x1={-2:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND FALSE !(__VERIFIER_nondet_int()) [L598] CALL pop() [L567] pc4++ [L568] case 1: [L571] case 2: VAL [garbage={0:0}, pc1=1, pc4=3, pc4++=2, res4=0, S={-2:0}, t1={0:0}, t4={-2:0}, x1={-2:0}, x4={0:0}] [L572] COND FALSE !(t4 == ((void *)0)) VAL [garbage={0:0}, pc1=1, pc4=3, pc4++=2, res4=0, S={-2:0}, t1={0:0}, t4={-2:0}, x1={-2:0}, x4={0:0}] [L598] RET pop() [L594] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [garbage={0:0}, pc1=1, pc4=3, res4=0, S={-2:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={-2:0}, x1={-2:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND FALSE !(__VERIFIER_nondet_int()) [L598] CALL pop() [L567] pc4++ [L568] case 1: [L571] case 2: [L575] case 3: VAL [garbage={0:0}, pc1=1, pc4=4, pc4++=3, res4=0, S={-2:0}, t1={0:0}, t4={-2:0}, x1={-2:0}, x4={0:0}] [L576] EXPR t4->next VAL [garbage={0:0}, pc1=1, pc4=4, pc4++=3, res4=0, S={-2:0}, t1={0:0}, t4={-2:0}, t4->next={0:0}, x1={-2:0}, x4={0:0}] [L576] x4 = t4->next [L598] RET pop() [L594] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [garbage={0:0}, pc1=1, pc4=4, res4=0, S={-2:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={-2:0}, x1={-2:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND FALSE !(__VERIFIER_nondet_int()) [L598] CALL pop() [L567] pc4++ [L568] case 1: [L571] case 2: [L575] case 3: [L578] case 4: VAL [garbage={0:0}, pc1=1, pc4=5, pc4++=4, res4=0, S={-2:0}, t1={0:0}, t4={-2:0}, x1={-2:0}, x4={0:0}] [L579] COND TRUE S == t4 [L580] S = x4 VAL [garbage={0:0}, pc1=1, pc4=5, pc4++=4, res4=0, S={0:0}, t1={0:0}, t4={-2:0}, x1={-2:0}, x4={0:0}] [L598] RET pop() [L594] S || 1 != pc1 || __VERIFIER_nondet_int() [L594] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, garbage={0:0}, pc1=1, pc4=5, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=0, t1={0:0}, t4={-2:0}, x1={-2:0}, x4={0:0}] [L594] COND FALSE !(S || 1 != pc1 || __VERIFIER_nondet_int()) [L600] COND FALSE !(\read(*garbage)) VAL [garbage={0:0}, pc1=1, pc4=5, res4=0, S={0:0}, t1={0:0}, t4={-2:0}, x1={-2:0}, x4={0:0}] [L605] S = ((void *)0) [L606] t1 = ((void *)0) [L607] x1 = ((void *)0) [L608] t4 = ((void *)0) [L609] x4 = ((void *)0) [L610] return !!garbage; VAL [\result=0, garbage={0:0}, pc1=1, pc4=5, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 64 locations, 20 error locations. Started 1 CEGAR loops. OverallTime: 13.2s, OverallIterations: 25, TraceHistogramMax: 11, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9617 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9617 mSDsluCounter, 11724 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8742 mSDsCounter, 578 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2393 IncrementalHoareTripleChecker+Invalid, 2971 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 578 mSolverCounterUnsat, 2982 mSDtfsCounter, 2393 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1768 GetRequests, 1451 SyntacticMatches, 21 SemanticMatches, 296 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1892 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5913occurred in iteration=18, InterpolantAutomatonStates: 265, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 24 MinimizatonAttempts, 28350 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 1594 NumberOfCodeBlocks, 1594 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 2155 ConstructedInterpolants, 0 QuantifiedInterpolants, 7063 SizeOfPredicates, 64 NumberOfNonLiveVariables, 3269 ConjunctsInSsa, 147 ConjunctsInUnsatCore, 54 InterpolantComputations, 10 PerfectInterpolantSequences, 2888/3753 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-07-14 06:15:15,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/lockfree-3.3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1db117ae3c729419255b5da4a7f4ecd64b2d99a167d11f22266a773c4ff13cdb --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 06:15:17,223 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 06:15:17,226 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 06:15:17,267 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 06:15:17,268 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 06:15:17,269 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 06:15:17,273 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 06:15:17,277 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 06:15:17,279 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 06:15:17,289 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 06:15:17,291 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 06:15:17,295 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 06:15:17,296 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 06:15:17,298 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 06:15:17,299 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 06:15:17,302 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 06:15:17,303 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 06:15:17,304 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 06:15:17,306 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 06:15:17,311 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 06:15:17,313 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 06:15:17,314 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 06:15:17,316 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 06:15:17,317 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 06:15:17,318 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 06:15:17,325 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 06:15:17,325 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 06:15:17,326 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 06:15:17,327 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 06:15:17,327 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 06:15:17,328 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 06:15:17,328 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 06:15:17,330 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 06:15:17,331 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 06:15:17,332 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 06:15:17,333 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 06:15:17,333 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 06:15:17,333 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 06:15:17,334 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 06:15:17,334 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 06:15:17,334 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 06:15:17,336 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 06:15:17,339 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-14 06:15:17,371 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 06:15:17,372 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 06:15:17,372 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 06:15:17,372 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 06:15:17,373 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 06:15:17,373 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 06:15:17,374 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 06:15:17,374 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 06:15:17,374 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 06:15:17,375 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 06:15:17,375 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 06:15:17,376 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 06:15:17,376 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 06:15:17,376 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 06:15:17,376 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 06:15:17,376 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-14 06:15:17,376 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-14 06:15:17,377 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-14 06:15:17,377 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 06:15:17,377 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 06:15:17,377 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-14 06:15:17,377 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-14 06:15:17,378 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 06:15:17,378 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 06:15:17,378 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 06:15:17,378 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 06:15:17,378 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 06:15:17,378 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 06:15:17,379 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 06:15:17,379 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 06:15:17,379 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-14 06:15:17,380 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-14 06:15:17,380 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-14 06:15:17,380 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1db117ae3c729419255b5da4a7f4ecd64b2d99a167d11f22266a773c4ff13cdb [2022-07-14 06:15:17,699 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 06:15:17,721 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 06:15:17,723 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 06:15:17,724 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 06:15:17,725 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 06:15:17,726 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/lockfree-3.3.i [2022-07-14 06:15:17,792 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a37d2f658/2e19c88817fc41508f6172c84e7c097f/FLAG1dea7743d [2022-07-14 06:15:18,256 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 06:15:18,256 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/lockfree-3.3.i [2022-07-14 06:15:18,268 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a37d2f658/2e19c88817fc41508f6172c84e7c097f/FLAG1dea7743d [2022-07-14 06:15:18,599 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a37d2f658/2e19c88817fc41508f6172c84e7c097f [2022-07-14 06:15:18,601 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 06:15:18,602 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 06:15:18,604 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 06:15:18,604 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 06:15:18,609 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 06:15:18,610 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 06:15:18" (1/1) ... [2022-07-14 06:15:18,611 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@262b2458 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:15:18, skipping insertion in model container [2022-07-14 06:15:18,611 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 06:15:18" (1/1) ... [2022-07-14 06:15:18,624 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 06:15:18,649 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 06:15:18,976 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 06:15:18,990 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 06:15:19,037 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 06:15:19,058 INFO L208 MainTranslator]: Completed translation [2022-07-14 06:15:19,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:15:19 WrapperNode [2022-07-14 06:15:19,058 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 06:15:19,059 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 06:15:19,060 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 06:15:19,060 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 06:15:19,065 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:15:19" (1/1) ... [2022-07-14 06:15:19,089 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:15:19" (1/1) ... [2022-07-14 06:15:19,117 INFO L137 Inliner]: procedures = 128, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 119 [2022-07-14 06:15:19,118 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 06:15:19,119 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 06:15:19,119 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 06:15:19,119 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 06:15:19,125 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:15:19" (1/1) ... [2022-07-14 06:15:19,126 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:15:19" (1/1) ... [2022-07-14 06:15:19,139 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:15:19" (1/1) ... [2022-07-14 06:15:19,140 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:15:19" (1/1) ... [2022-07-14 06:15:19,150 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:15:19" (1/1) ... [2022-07-14 06:15:19,157 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:15:19" (1/1) ... [2022-07-14 06:15:19,158 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:15:19" (1/1) ... [2022-07-14 06:15:19,160 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 06:15:19,161 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 06:15:19,161 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 06:15:19,161 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 06:15:19,162 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:15:19" (1/1) ... [2022-07-14 06:15:19,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 06:15:19,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:15:19,192 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) [2022-07-14 06:15:19,224 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 [2022-07-14 06:15:19,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-14 06:15:19,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 06:15:19,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 06:15:19,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 06:15:19,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 06:15:19,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 06:15:19,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-14 06:15:19,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-14 06:15:19,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 06:15:19,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 06:15:19,370 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 06:15:19,372 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 06:15:19,635 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 06:15:19,640 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 06:15:19,640 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-14 06:15:19,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 06:15:19 BoogieIcfgContainer [2022-07-14 06:15:19,642 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 06:15:19,648 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 06:15:19,649 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 06:15:19,651 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 06:15:19,651 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 06:15:18" (1/3) ... [2022-07-14 06:15:19,652 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@555a4a88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 06:15:19, skipping insertion in model container [2022-07-14 06:15:19,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:15:19" (2/3) ... [2022-07-14 06:15:19,652 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@555a4a88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 06:15:19, skipping insertion in model container [2022-07-14 06:15:19,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 06:15:19" (3/3) ... [2022-07-14 06:15:19,653 INFO L111 eAbstractionObserver]: Analyzing ICFG lockfree-3.3.i [2022-07-14 06:15:19,664 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 06:15:19,664 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2022-07-14 06:15:19,709 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 06:15:19,715 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1f913f99, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@45915855 [2022-07-14 06:15:19,716 INFO L358 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2022-07-14 06:15:19,719 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 41 states have (on average 1.951219512195122) internal successors, (80), 61 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:19,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-14 06:15:19,723 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:15:19,724 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-14 06:15:19,724 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:15:19,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:15:19,728 INFO L85 PathProgramCache]: Analyzing trace with hash 28701640, now seen corresponding path program 1 times [2022-07-14 06:15:19,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:15:19,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1939447754] [2022-07-14 06:15:19,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:15:19,739 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:15:19,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:15:19,742 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:15:19,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-14 06:15:19,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:15:19,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 06:15:19,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:15:19,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:15:19,877 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:15:19,878 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:15:19,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1939447754] [2022-07-14 06:15:19,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1939447754] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:15:19,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:15:19,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:15:19,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665445033] [2022-07-14 06:15:19,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:15:19,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:15:19,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:15:19,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:15:19,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:15:19,919 INFO L87 Difference]: Start difference. First operand has 62 states, 41 states have (on average 1.951219512195122) internal successors, (80), 61 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:19,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:15:19,991 INFO L93 Difference]: Finished difference Result 107 states and 139 transitions. [2022-07-14 06:15:19,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:15:19,994 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-14 06:15:19,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:15:20,002 INFO L225 Difference]: With dead ends: 107 [2022-07-14 06:15:20,002 INFO L226 Difference]: Without dead ends: 105 [2022-07-14 06:15:20,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:15:20,007 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 63 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:15:20,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 134 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:15:20,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-07-14 06:15:20,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 87. [2022-07-14 06:15:20,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 67 states have (on average 1.9253731343283582) internal successors, (129), 86 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:20,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 129 transitions. [2022-07-14 06:15:20,042 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 129 transitions. Word has length 5 [2022-07-14 06:15:20,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:15:20,043 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 129 transitions. [2022-07-14 06:15:20,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:20,043 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 129 transitions. [2022-07-14 06:15:20,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-14 06:15:20,043 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:15:20,043 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-14 06:15:20,050 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-14 06:15:20,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:15:20,245 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:15:20,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:15:20,245 INFO L85 PathProgramCache]: Analyzing trace with hash 889749439, now seen corresponding path program 1 times [2022-07-14 06:15:20,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:15:20,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1762419514] [2022-07-14 06:15:20,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:15:20,248 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:15:20,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:15:20,250 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:15:20,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-14 06:15:20,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:15:20,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 06:15:20,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:15:20,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:15:20,323 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:15:20,324 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:15:20,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1762419514] [2022-07-14 06:15:20,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1762419514] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:15:20,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:15:20,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:15:20,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669936303] [2022-07-14 06:15:20,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:15:20,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:15:20,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:15:20,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:15:20,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:15:20,327 INFO L87 Difference]: Start difference. First operand 87 states and 129 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:20,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:15:20,452 INFO L93 Difference]: Finished difference Result 163 states and 243 transitions. [2022-07-14 06:15:20,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:15:20,453 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-14 06:15:20,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:15:20,454 INFO L225 Difference]: With dead ends: 163 [2022-07-14 06:15:20,454 INFO L226 Difference]: Without dead ends: 160 [2022-07-14 06:15:20,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:15:20,455 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 62 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:15:20,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 116 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:15:20,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-07-14 06:15:20,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 140. [2022-07-14 06:15:20,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 120 states have (on average 1.9083333333333334) internal successors, (229), 139 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:20,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 229 transitions. [2022-07-14 06:15:20,469 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 229 transitions. Word has length 6 [2022-07-14 06:15:20,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:15:20,469 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 229 transitions. [2022-07-14 06:15:20,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:20,469 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 229 transitions. [2022-07-14 06:15:20,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-14 06:15:20,470 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:15:20,470 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-14 06:15:20,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-14 06:15:20,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:15:20,675 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:15:20,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:15:20,676 INFO L85 PathProgramCache]: Analyzing trace with hash 889692424, now seen corresponding path program 1 times [2022-07-14 06:15:20,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:15:20,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [716387016] [2022-07-14 06:15:20,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:15:20,677 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:15:20,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:15:20,678 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:15:20,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-14 06:15:20,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:15:20,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 06:15:20,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:15:20,758 INFO L390 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 [2022-07-14 06:15:20,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:15:20,765 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:15:20,766 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:15:20,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [716387016] [2022-07-14 06:15:20,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [716387016] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:15:20,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:15:20,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:15:20,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085973368] [2022-07-14 06:15:20,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:15:20,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:15:20,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:15:20,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:15:20,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:15:20,770 INFO L87 Difference]: Start difference. First operand 140 states and 229 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:20,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:15:20,902 INFO L93 Difference]: Finished difference Result 211 states and 330 transitions. [2022-07-14 06:15:20,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:15:20,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-14 06:15:20,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:15:20,903 INFO L225 Difference]: With dead ends: 211 [2022-07-14 06:15:20,904 INFO L226 Difference]: Without dead ends: 211 [2022-07-14 06:15:20,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:15:20,905 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 64 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:15:20,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 163 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:15:20,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-07-14 06:15:20,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 190. [2022-07-14 06:15:20,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 172 states have (on average 1.8372093023255813) internal successors, (316), 189 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:20,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 316 transitions. [2022-07-14 06:15:20,917 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 316 transitions. Word has length 6 [2022-07-14 06:15:20,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:15:20,917 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 316 transitions. [2022-07-14 06:15:20,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:20,917 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 316 transitions. [2022-07-14 06:15:20,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-14 06:15:20,918 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:15:20,918 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-14 06:15:20,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-14 06:15:21,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:15:21,125 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:15:21,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:15:21,126 INFO L85 PathProgramCache]: Analyzing trace with hash 889692425, now seen corresponding path program 1 times [2022-07-14 06:15:21,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:15:21,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1921492698] [2022-07-14 06:15:21,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:15:21,127 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:15:21,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:15:21,128 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:15:21,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-14 06:15:21,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:15:21,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 06:15:21,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:15:21,178 INFO L390 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 [2022-07-14 06:15:21,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:15:21,185 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:15:21,185 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:15:21,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1921492698] [2022-07-14 06:15:21,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1921492698] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:15:21,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:15:21,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:15:21,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688820625] [2022-07-14 06:15:21,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:15:21,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:15:21,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:15:21,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:15:21,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:15:21,188 INFO L87 Difference]: Start difference. First operand 190 states and 316 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:21,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:15:21,291 INFO L93 Difference]: Finished difference Result 206 states and 321 transitions. [2022-07-14 06:15:21,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:15:21,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-14 06:15:21,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:15:21,293 INFO L225 Difference]: With dead ends: 206 [2022-07-14 06:15:21,293 INFO L226 Difference]: Without dead ends: 206 [2022-07-14 06:15:21,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:15:21,294 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 63 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:15:21,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 169 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:15:21,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-07-14 06:15:21,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 188. [2022-07-14 06:15:21,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 172 states have (on average 1.7906976744186047) internal successors, (308), 187 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:21,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 308 transitions. [2022-07-14 06:15:21,301 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 308 transitions. Word has length 6 [2022-07-14 06:15:21,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:15:21,301 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 308 transitions. [2022-07-14 06:15:21,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:21,302 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 308 transitions. [2022-07-14 06:15:21,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-14 06:15:21,302 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:15:21,302 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:15:21,310 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-07-14 06:15:21,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:15:21,507 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:15:21,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:15:21,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1810669365, now seen corresponding path program 1 times [2022-07-14 06:15:21,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:15:21,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1832024074] [2022-07-14 06:15:21,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:15:21,508 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:15:21,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:15:21,510 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:15:21,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-14 06:15:21,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:15:21,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 06:15:21,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:15:21,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:15:21,575 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:15:21,576 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:15:21,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1832024074] [2022-07-14 06:15:21,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1832024074] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:15:21,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:15:21,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:15:21,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763757470] [2022-07-14 06:15:21,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:15:21,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:15:21,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:15:21,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:15:21,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:15:21,578 INFO L87 Difference]: Start difference. First operand 188 states and 308 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:21,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:15:21,614 INFO L93 Difference]: Finished difference Result 211 states and 304 transitions. [2022-07-14 06:15:21,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:15:21,614 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-14 06:15:21,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:15:21,615 INFO L225 Difference]: With dead ends: 211 [2022-07-14 06:15:21,616 INFO L226 Difference]: Without dead ends: 211 [2022-07-14 06:15:21,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:15:21,617 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 101 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:15:21,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 229 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:15:21,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-07-14 06:15:21,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 144. [2022-07-14 06:15:21,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 132 states have (on average 1.7348484848484849) internal successors, (229), 143 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:21,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 229 transitions. [2022-07-14 06:15:21,623 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 229 transitions. Word has length 7 [2022-07-14 06:15:21,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:15:21,623 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 229 transitions. [2022-07-14 06:15:21,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:21,623 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 229 transitions. [2022-07-14 06:15:21,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-14 06:15:21,624 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:15:21,624 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:15:21,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-14 06:15:21,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:15:21,831 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:15:21,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:15:21,832 INFO L85 PathProgramCache]: Analyzing trace with hash 347531241, now seen corresponding path program 1 times [2022-07-14 06:15:21,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:15:21,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [723250941] [2022-07-14 06:15:21,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:15:21,833 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:15:21,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:15:21,834 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:15:21,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-14 06:15:21,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:15:21,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 06:15:21,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:15:21,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:15:21,888 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:15:21,888 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:15:21,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [723250941] [2022-07-14 06:15:21,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [723250941] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:15:21,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:15:21,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:15:21,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092471373] [2022-07-14 06:15:21,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:15:21,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:15:21,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:15:21,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:15:21,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:15:21,890 INFO L87 Difference]: Start difference. First operand 144 states and 229 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:21,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:15:21,913 INFO L93 Difference]: Finished difference Result 303 states and 449 transitions. [2022-07-14 06:15:21,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:15:21,913 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-14 06:15:21,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:15:21,915 INFO L225 Difference]: With dead ends: 303 [2022-07-14 06:15:21,915 INFO L226 Difference]: Without dead ends: 303 [2022-07-14 06:15:21,915 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:15:21,916 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 103 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:15:21,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 221 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:15:21,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-07-14 06:15:21,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 198. [2022-07-14 06:15:21,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 186 states have (on average 1.6559139784946237) internal successors, (308), 197 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:21,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 308 transitions. [2022-07-14 06:15:21,922 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 308 transitions. Word has length 8 [2022-07-14 06:15:21,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:15:21,922 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 308 transitions. [2022-07-14 06:15:21,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:21,922 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 308 transitions. [2022-07-14 06:15:21,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-14 06:15:21,923 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:15:21,927 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:15:21,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-14 06:15:22,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:15:22,141 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:15:22,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:15:22,142 INFO L85 PathProgramCache]: Analyzing trace with hash -527615340, now seen corresponding path program 1 times [2022-07-14 06:15:22,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:15:22,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [694578727] [2022-07-14 06:15:22,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:15:22,143 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:15:22,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:15:22,144 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:15:22,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-14 06:15:22,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:15:22,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 06:15:22,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:15:22,212 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:15:22,212 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:15:22,240 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:15:22,241 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:15:22,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [694578727] [2022-07-14 06:15:22,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [694578727] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:15:22,241 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:15:22,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2022-07-14 06:15:22,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165931469] [2022-07-14 06:15:22,242 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:15:22,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:15:22,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:15:22,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:15:22,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:15:22,243 INFO L87 Difference]: Start difference. First operand 198 states and 308 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:22,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:15:22,304 INFO L93 Difference]: Finished difference Result 513 states and 746 transitions. [2022-07-14 06:15:22,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 06:15:22,306 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-14 06:15:22,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:15:22,308 INFO L225 Difference]: With dead ends: 513 [2022-07-14 06:15:22,308 INFO L226 Difference]: Without dead ends: 513 [2022-07-14 06:15:22,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-07-14 06:15:22,311 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 262 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:15:22,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 578 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:15:22,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2022-07-14 06:15:22,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 258. [2022-07-14 06:15:22,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 246 states have (on average 1.6219512195121952) internal successors, (399), 257 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:22,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 399 transitions. [2022-07-14 06:15:22,322 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 399 transitions. Word has length 12 [2022-07-14 06:15:22,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:15:22,322 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 399 transitions. [2022-07-14 06:15:22,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:22,323 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 399 transitions. [2022-07-14 06:15:22,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-14 06:15:22,324 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:15:22,324 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:15:22,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-14 06:15:22,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:15:22,540 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:15:22,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:15:22,540 INFO L85 PathProgramCache]: Analyzing trace with hash 2027186576, now seen corresponding path program 1 times [2022-07-14 06:15:22,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:15:22,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1845105] [2022-07-14 06:15:22,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:15:22,540 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:15:22,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:15:22,542 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:15:22,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-14 06:15:22,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:15:22,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 06:15:22,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:15:22,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:15:22,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:15:22,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:15:22,656 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:15:22,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1845105] [2022-07-14 06:15:22,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1845105] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:15:22,657 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:15:22,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2022-07-14 06:15:22,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570532976] [2022-07-14 06:15:22,657 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:15:22,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:15:22,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:15:22,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:15:22,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:15:22,658 INFO L87 Difference]: Start difference. First operand 258 states and 399 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:22,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:15:22,698 INFO L93 Difference]: Finished difference Result 600 states and 891 transitions. [2022-07-14 06:15:22,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:15:22,699 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-14 06:15:22,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:15:22,701 INFO L225 Difference]: With dead ends: 600 [2022-07-14 06:15:22,701 INFO L226 Difference]: Without dead ends: 600 [2022-07-14 06:15:22,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:15:22,702 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 244 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:15:22,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 298 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:15:22,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2022-07-14 06:15:22,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 576. [2022-07-14 06:15:22,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 564 states have (on average 1.5797872340425532) internal successors, (891), 575 states have internal predecessors, (891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:22,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 891 transitions. [2022-07-14 06:15:22,711 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 891 transitions. Word has length 12 [2022-07-14 06:15:22,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:15:22,712 INFO L495 AbstractCegarLoop]: Abstraction has 576 states and 891 transitions. [2022-07-14 06:15:22,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:22,712 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 891 transitions. [2022-07-14 06:15:22,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-14 06:15:22,713 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:15:22,713 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-14 06:15:22,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-14 06:15:22,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:15:22,932 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:15:22,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:15:22,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1582579647, now seen corresponding path program 2 times [2022-07-14 06:15:22,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:15:22,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2022279240] [2022-07-14 06:15:22,932 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 06:15:22,932 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:15:22,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:15:22,933 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:15:22,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-14 06:15:22,975 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 06:15:22,975 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:15:22,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 06:15:22,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:15:22,998 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:15:22,998 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:15:23,023 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:15:23,023 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:15:23,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2022279240] [2022-07-14 06:15:23,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2022279240] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:15:23,024 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:15:23,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-07-14 06:15:23,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546348016] [2022-07-14 06:15:23,024 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:15:23,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 06:15:23,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:15:23,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 06:15:23,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:15:23,025 INFO L87 Difference]: Start difference. First operand 576 states and 891 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:23,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:15:23,079 INFO L93 Difference]: Finished difference Result 1062 states and 1609 transitions. [2022-07-14 06:15:23,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 06:15:23,079 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-14 06:15:23,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:15:23,083 INFO L225 Difference]: With dead ends: 1062 [2022-07-14 06:15:23,083 INFO L226 Difference]: Without dead ends: 1062 [2022-07-14 06:15:23,083 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-14 06:15:23,084 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 246 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:15:23,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 442 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:15:23,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2022-07-14 06:15:23,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 968. [2022-07-14 06:15:23,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 968 states, 956 states have (on average 1.5658995815899581) internal successors, (1497), 967 states have internal predecessors, (1497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:23,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1497 transitions. [2022-07-14 06:15:23,104 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1497 transitions. Word has length 16 [2022-07-14 06:15:23,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:15:23,104 INFO L495 AbstractCegarLoop]: Abstraction has 968 states and 1497 transitions. [2022-07-14 06:15:23,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:23,104 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1497 transitions. [2022-07-14 06:15:23,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-14 06:15:23,105 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:15:23,105 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:15:23,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-14 06:15:23,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:15:23,312 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:15:23,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:15:23,312 INFO L85 PathProgramCache]: Analyzing trace with hash -480845608, now seen corresponding path program 1 times [2022-07-14 06:15:23,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:15:23,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [635142310] [2022-07-14 06:15:23,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:15:23,313 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:15:23,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:15:23,314 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:15:23,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-14 06:15:23,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:15:23,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 06:15:23,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:15:23,401 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:15:23,401 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:15:23,431 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:15:23,431 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:15:23,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [635142310] [2022-07-14 06:15:23,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [635142310] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:15:23,431 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:15:23,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2022-07-14 06:15:23,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736343765] [2022-07-14 06:15:23,432 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:15:23,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:15:23,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:15:23,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:15:23,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:15:23,433 INFO L87 Difference]: Start difference. First operand 968 states and 1497 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:23,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:15:23,502 INFO L93 Difference]: Finished difference Result 1241 states and 1858 transitions. [2022-07-14 06:15:23,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:15:23,502 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-14 06:15:23,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:15:23,506 INFO L225 Difference]: With dead ends: 1241 [2022-07-14 06:15:23,506 INFO L226 Difference]: Without dead ends: 1241 [2022-07-14 06:15:23,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:15:23,507 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 98 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:15:23,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 165 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:15:23,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2022-07-14 06:15:23,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 1100. [2022-07-14 06:15:23,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1100 states, 1088 states have (on average 1.525735294117647) internal successors, (1660), 1099 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:23,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1100 states to 1100 states and 1660 transitions. [2022-07-14 06:15:23,535 INFO L78 Accepts]: Start accepts. Automaton has 1100 states and 1660 transitions. Word has length 18 [2022-07-14 06:15:23,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:15:23,535 INFO L495 AbstractCegarLoop]: Abstraction has 1100 states and 1660 transitions. [2022-07-14 06:15:23,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:23,536 INFO L276 IsEmpty]: Start isEmpty. Operand 1100 states and 1660 transitions. [2022-07-14 06:15:23,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-14 06:15:23,540 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:15:23,540 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:15:23,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-14 06:15:23,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:15:23,750 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:15:23,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:15:23,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1323238580, now seen corresponding path program 1 times [2022-07-14 06:15:23,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:15:23,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1013692151] [2022-07-14 06:15:23,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:15:23,751 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:15:23,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:15:23,753 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:15:23,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-14 06:15:23,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:15:23,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 06:15:23,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:15:23,859 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:15:23,859 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:15:23,886 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:15:23,886 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:15:23,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1013692151] [2022-07-14 06:15:23,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1013692151] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:15:23,886 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:15:23,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2022-07-14 06:15:23,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441477208] [2022-07-14 06:15:23,887 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:15:23,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:15:23,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:15:23,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:15:23,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:15:23,888 INFO L87 Difference]: Start difference. First operand 1100 states and 1660 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:23,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:15:23,980 INFO L93 Difference]: Finished difference Result 1384 states and 2014 transitions. [2022-07-14 06:15:23,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 06:15:23,989 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-14 06:15:23,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:15:23,994 INFO L225 Difference]: With dead ends: 1384 [2022-07-14 06:15:23,994 INFO L226 Difference]: Without dead ends: 1384 [2022-07-14 06:15:23,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:15:23,995 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 201 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:15:23,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 539 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:15:23,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2022-07-14 06:15:24,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 1009. [2022-07-14 06:15:24,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 997 states have (on average 1.4954864593781345) internal successors, (1491), 1008 states have internal predecessors, (1491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:24,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1491 transitions. [2022-07-14 06:15:24,017 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1491 transitions. Word has length 21 [2022-07-14 06:15:24,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:15:24,017 INFO L495 AbstractCegarLoop]: Abstraction has 1009 states and 1491 transitions. [2022-07-14 06:15:24,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:24,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1491 transitions. [2022-07-14 06:15:24,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-14 06:15:24,018 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:15:24,018 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:15:24,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-14 06:15:24,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:15:24,231 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:15:24,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:15:24,232 INFO L85 PathProgramCache]: Analyzing trace with hash -2034622781, now seen corresponding path program 2 times [2022-07-14 06:15:24,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:15:24,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1062601847] [2022-07-14 06:15:24,232 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 06:15:24,232 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:15:24,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:15:24,233 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:15:24,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-14 06:15:24,313 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 06:15:24,313 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:15:24,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 06:15:24,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:15:24,348 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-14 06:15:24,348 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:15:24,384 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-14 06:15:24,384 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:15:24,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1062601847] [2022-07-14 06:15:24,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1062601847] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:15:24,384 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:15:24,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-07-14 06:15:24,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869670563] [2022-07-14 06:15:24,385 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:15:24,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 06:15:24,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:15:24,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 06:15:24,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:15:24,385 INFO L87 Difference]: Start difference. First operand 1009 states and 1491 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:24,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:15:24,448 INFO L93 Difference]: Finished difference Result 994 states and 1426 transitions. [2022-07-14 06:15:24,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 06:15:24,449 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-14 06:15:24,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:15:24,451 INFO L225 Difference]: With dead ends: 994 [2022-07-14 06:15:24,451 INFO L226 Difference]: Without dead ends: 994 [2022-07-14 06:15:24,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-14 06:15:24,452 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 172 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:15:24,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 522 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:15:24,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2022-07-14 06:15:24,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 970. [2022-07-14 06:15:24,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 958 states have (on average 1.488517745302714) internal successors, (1426), 969 states have internal predecessors, (1426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:24,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1426 transitions. [2022-07-14 06:15:24,467 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1426 transitions. Word has length 27 [2022-07-14 06:15:24,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:15:24,467 INFO L495 AbstractCegarLoop]: Abstraction has 970 states and 1426 transitions. [2022-07-14 06:15:24,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:24,468 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1426 transitions. [2022-07-14 06:15:24,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-14 06:15:24,468 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:15:24,468 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:15:24,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-14 06:15:24,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:15:24,682 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:15:24,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:15:24,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1432941687, now seen corresponding path program 1 times [2022-07-14 06:15:24,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:15:24,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1770582147] [2022-07-14 06:15:24,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:15:24,683 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:15:24,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:15:24,684 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:15:24,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-14 06:15:24,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:15:24,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-14 06:15:24,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:15:24,806 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:15:24,806 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:15:24,841 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:15:24,841 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:15:24,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1770582147] [2022-07-14 06:15:24,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1770582147] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:15:24,841 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:15:24,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2022-07-14 06:15:24,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698467025] [2022-07-14 06:15:24,842 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:15:24,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 06:15:24,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:15:24,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 06:15:24,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:15:24,843 INFO L87 Difference]: Start difference. First operand 970 states and 1426 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:24,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:15:24,958 INFO L93 Difference]: Finished difference Result 1049 states and 1476 transitions. [2022-07-14 06:15:24,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 06:15:24,959 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-14 06:15:24,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:15:24,964 INFO L225 Difference]: With dead ends: 1049 [2022-07-14 06:15:24,964 INFO L226 Difference]: Without dead ends: 1049 [2022-07-14 06:15:24,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-07-14 06:15:24,965 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 233 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:15:24,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 808 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:15:24,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2022-07-14 06:15:24,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 892. [2022-07-14 06:15:24,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 892 states, 880 states have (on average 1.4579545454545455) internal successors, (1283), 891 states have internal predecessors, (1283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:24,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1283 transitions. [2022-07-14 06:15:24,984 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1283 transitions. Word has length 27 [2022-07-14 06:15:24,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:15:24,985 INFO L495 AbstractCegarLoop]: Abstraction has 892 states and 1283 transitions. [2022-07-14 06:15:24,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:24,985 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1283 transitions. [2022-07-14 06:15:24,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-14 06:15:24,986 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:15:24,986 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:15:24,996 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-14 06:15:25,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:15:25,194 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:15:25,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:15:25,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1945741357, now seen corresponding path program 1 times [2022-07-14 06:15:25,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:15:25,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1012803676] [2022-07-14 06:15:25,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:15:25,195 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:15:25,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:15:25,196 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:15:25,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-14 06:15:25,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:15:25,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-14 06:15:25,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:15:25,339 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:15:25,339 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:15:25,567 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:15:25,567 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:15:25,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1012803676] [2022-07-14 06:15:25,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1012803676] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:15:25,567 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:15:25,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2022-07-14 06:15:25,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846341300] [2022-07-14 06:15:25,568 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:15:25,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-14 06:15:25,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:15:25,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-14 06:15:25,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-07-14 06:15:25,569 INFO L87 Difference]: Start difference. First operand 892 states and 1283 transitions. Second operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 13 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:25,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:15:25,995 INFO L93 Difference]: Finished difference Result 1882 states and 2645 transitions. [2022-07-14 06:15:25,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-14 06:15:25,996 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 13 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-07-14 06:15:25,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:15:26,001 INFO L225 Difference]: With dead ends: 1882 [2022-07-14 06:15:26,002 INFO L226 Difference]: Without dead ends: 1882 [2022-07-14 06:15:26,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=530, Unknown=0, NotChecked=0, Total=702 [2022-07-14 06:15:26,003 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 603 mSDsluCounter, 1277 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 1455 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:15:26,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 1455 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:15:26,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1882 states. [2022-07-14 06:15:26,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1882 to 1834. [2022-07-14 06:15:26,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1834 states, 1822 states have (on average 1.451701427003293) internal successors, (2645), 1833 states have internal predecessors, (2645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:26,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1834 states to 1834 states and 2645 transitions. [2022-07-14 06:15:26,033 INFO L78 Accepts]: Start accepts. Automaton has 1834 states and 2645 transitions. Word has length 30 [2022-07-14 06:15:26,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:15:26,034 INFO L495 AbstractCegarLoop]: Abstraction has 1834 states and 2645 transitions. [2022-07-14 06:15:26,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 13 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:26,034 INFO L276 IsEmpty]: Start isEmpty. Operand 1834 states and 2645 transitions. [2022-07-14 06:15:26,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-14 06:15:26,036 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:15:26,036 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:15:26,050 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-14 06:15:26,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:15:26,244 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:15:26,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:15:26,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1575281728, now seen corresponding path program 1 times [2022-07-14 06:15:26,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:15:26,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1334624220] [2022-07-14 06:15:26,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:15:26,246 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:15:26,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:15:26,248 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:15:26,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-14 06:15:26,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:15:26,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-14 06:15:26,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:15:26,372 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:15:26,373 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:15:26,417 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:15:26,417 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:15:26,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1334624220] [2022-07-14 06:15:26,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1334624220] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:15:26,418 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:15:26,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2022-07-14 06:15:26,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112191741] [2022-07-14 06:15:26,418 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:15:26,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 06:15:26,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:15:26,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 06:15:26,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:15:26,420 INFO L87 Difference]: Start difference. First operand 1834 states and 2645 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:26,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:15:26,531 INFO L93 Difference]: Finished difference Result 2281 states and 3229 transitions. [2022-07-14 06:15:26,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-14 06:15:26,532 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-07-14 06:15:26,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:15:26,544 INFO L225 Difference]: With dead ends: 2281 [2022-07-14 06:15:26,544 INFO L226 Difference]: Without dead ends: 2281 [2022-07-14 06:15:26,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-07-14 06:15:26,546 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 274 mSDsluCounter, 923 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 1139 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:15:26,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 1139 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:15:26,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2281 states. [2022-07-14 06:15:26,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2281 to 1782. [2022-07-14 06:15:26,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1782 states, 1770 states have (on average 1.435593220338983) internal successors, (2541), 1781 states have internal predecessors, (2541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:26,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1782 states to 1782 states and 2541 transitions. [2022-07-14 06:15:26,573 INFO L78 Accepts]: Start accepts. Automaton has 1782 states and 2541 transitions. Word has length 33 [2022-07-14 06:15:26,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:15:26,574 INFO L495 AbstractCegarLoop]: Abstraction has 1782 states and 2541 transitions. [2022-07-14 06:15:26,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:26,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1782 states and 2541 transitions. [2022-07-14 06:15:26,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-14 06:15:26,575 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:15:26,575 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:15:26,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-14 06:15:26,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:15:26,783 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:15:26,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:15:26,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1822753242, now seen corresponding path program 1 times [2022-07-14 06:15:26,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:15:26,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [630223479] [2022-07-14 06:15:26,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:15:26,785 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:15:26,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:15:26,786 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:15:26,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-14 06:15:26,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:15:26,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-14 06:15:26,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:15:26,936 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:15:26,936 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:15:26,984 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:15:26,985 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:15:26,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [630223479] [2022-07-14 06:15:26,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [630223479] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:15:26,985 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:15:26,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-07-14 06:15:26,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406855797] [2022-07-14 06:15:26,985 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:15:26,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 06:15:26,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:15:26,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 06:15:26,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:15:26,986 INFO L87 Difference]: Start difference. First operand 1782 states and 2541 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:27,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:15:27,147 INFO L93 Difference]: Finished difference Result 2267 states and 3177 transitions. [2022-07-14 06:15:27,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-14 06:15:27,147 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-07-14 06:15:27,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:15:27,153 INFO L225 Difference]: With dead ends: 2267 [2022-07-14 06:15:27,153 INFO L226 Difference]: Without dead ends: 2267 [2022-07-14 06:15:27,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 69 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-07-14 06:15:27,154 INFO L413 NwaCegarLoop]: 257 mSDtfsCounter, 340 mSDsluCounter, 1304 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 1561 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:15:27,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 1561 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:15:27,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2267 states. [2022-07-14 06:15:27,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2267 to 1756. [2022-07-14 06:15:27,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1756 states, 1744 states have (on average 1.427178899082569) internal successors, (2489), 1755 states have internal predecessors, (2489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:27,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1756 states to 1756 states and 2489 transitions. [2022-07-14 06:15:27,185 INFO L78 Accepts]: Start accepts. Automaton has 1756 states and 2489 transitions. Word has length 41 [2022-07-14 06:15:27,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:15:27,185 INFO L495 AbstractCegarLoop]: Abstraction has 1756 states and 2489 transitions. [2022-07-14 06:15:27,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:27,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1756 states and 2489 transitions. [2022-07-14 06:15:27,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-14 06:15:27,186 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:15:27,186 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:15:27,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-07-14 06:15:27,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:15:27,394 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:15:27,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:15:27,394 INFO L85 PathProgramCache]: Analyzing trace with hash 685518324, now seen corresponding path program 2 times [2022-07-14 06:15:27,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:15:27,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [251632546] [2022-07-14 06:15:27,395 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 06:15:27,395 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:15:27,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:15:27,396 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:15:27,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-14 06:15:27,484 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 06:15:27,485 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:15:27,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-14 06:15:27,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:15:27,561 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 38 proven. 46 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-14 06:15:27,561 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:15:27,895 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 38 proven. 46 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-14 06:15:27,895 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:15:27,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [251632546] [2022-07-14 06:15:27,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [251632546] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:15:27,896 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:15:27,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2022-07-14 06:15:27,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605362858] [2022-07-14 06:15:27,896 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:15:27,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-14 06:15:27,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:15:27,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-14 06:15:27,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2022-07-14 06:15:27,897 INFO L87 Difference]: Start difference. First operand 1756 states and 2489 transitions. Second operand has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 16 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:28,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:15:28,564 INFO L93 Difference]: Finished difference Result 2042 states and 2804 transitions. [2022-07-14 06:15:28,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-14 06:15:28,564 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 16 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-07-14 06:15:28,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:15:28,570 INFO L225 Difference]: With dead ends: 2042 [2022-07-14 06:15:28,570 INFO L226 Difference]: Without dead ends: 2042 [2022-07-14 06:15:28,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=237, Invalid=819, Unknown=0, NotChecked=0, Total=1056 [2022-07-14 06:15:28,571 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 738 mSDsluCounter, 1839 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 738 SdHoareTripleChecker+Valid, 2048 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:15:28,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [738 Valid, 2048 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:15:28,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2042 states. [2022-07-14 06:15:28,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2042 to 1982. [2022-07-14 06:15:28,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1982 states, 1970 states have (on average 1.4233502538071066) internal successors, (2804), 1981 states have internal predecessors, (2804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:28,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1982 states to 1982 states and 2804 transitions. [2022-07-14 06:15:28,606 INFO L78 Accepts]: Start accepts. Automaton has 1982 states and 2804 transitions. Word has length 49 [2022-07-14 06:15:28,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:15:28,607 INFO L495 AbstractCegarLoop]: Abstraction has 1982 states and 2804 transitions. [2022-07-14 06:15:28,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 16 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:28,607 INFO L276 IsEmpty]: Start isEmpty. Operand 1982 states and 2804 transitions. [2022-07-14 06:15:28,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-14 06:15:28,608 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:15:28,608 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:15:28,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-07-14 06:15:28,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:15:28,820 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:15:28,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:15:28,820 INFO L85 PathProgramCache]: Analyzing trace with hash 34201258, now seen corresponding path program 1 times [2022-07-14 06:15:28,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:15:28,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1814428121] [2022-07-14 06:15:28,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:15:28,821 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:15:28,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:15:28,822 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:15:28,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-14 06:15:28,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:15:28,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 06:15:28,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:15:28,938 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 16 proven. 34 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-07-14 06:15:28,938 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:15:28,981 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 16 proven. 34 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-07-14 06:15:28,982 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:15:28,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1814428121] [2022-07-14 06:15:28,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1814428121] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:15:28,982 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:15:28,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2022-07-14 06:15:28,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2400679] [2022-07-14 06:15:28,987 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:15:28,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:15:28,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:15:28,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:15:28,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:15:28,988 INFO L87 Difference]: Start difference. First operand 1982 states and 2804 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:29,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:15:29,092 INFO L93 Difference]: Finished difference Result 3702 states and 5276 transitions. [2022-07-14 06:15:29,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:15:29,092 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-07-14 06:15:29,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:15:29,102 INFO L225 Difference]: With dead ends: 3702 [2022-07-14 06:15:29,102 INFO L226 Difference]: Without dead ends: 3702 [2022-07-14 06:15:29,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:15:29,103 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 114 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:15:29,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 155 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:15:29,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3702 states. [2022-07-14 06:15:29,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3702 to 3060. [2022-07-14 06:15:29,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3060 states, 3048 states have (on average 1.4337270341207349) internal successors, (4370), 3059 states have internal predecessors, (4370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:29,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3060 states to 3060 states and 4370 transitions. [2022-07-14 06:15:29,140 INFO L78 Accepts]: Start accepts. Automaton has 3060 states and 4370 transitions. Word has length 50 [2022-07-14 06:15:29,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:15:29,141 INFO L495 AbstractCegarLoop]: Abstraction has 3060 states and 4370 transitions. [2022-07-14 06:15:29,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:29,141 INFO L276 IsEmpty]: Start isEmpty. Operand 3060 states and 4370 transitions. [2022-07-14 06:15:29,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-14 06:15:29,141 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:15:29,142 INFO L195 NwaCegarLoop]: trace histogram [8, 5, 5, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:15:29,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-07-14 06:15:29,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:15:29,349 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:15:29,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:15:29,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1339034765, now seen corresponding path program 1 times [2022-07-14 06:15:29,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:15:29,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2081837806] [2022-07-14 06:15:29,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:15:29,351 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:15:29,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:15:29,352 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:15:29,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-07-14 06:15:29,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:15:29,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 06:15:29,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:15:29,440 INFO L390 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 [2022-07-14 06:15:29,507 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 18 proven. 34 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-14 06:15:29,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:15:29,556 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 18 proven. 34 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-14 06:15:29,557 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:15:29,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2081837806] [2022-07-14 06:15:29,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2081837806] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:15:29,557 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:15:29,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2022-07-14 06:15:29,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508206047] [2022-07-14 06:15:29,557 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:15:29,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:15:29,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:15:29,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:15:29,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:15:29,558 INFO L87 Difference]: Start difference. First operand 3060 states and 4370 transitions. Second operand has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:29,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:15:29,840 INFO L93 Difference]: Finished difference Result 6279 states and 8905 transitions. [2022-07-14 06:15:29,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:15:29,841 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-07-14 06:15:29,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:15:29,860 INFO L225 Difference]: With dead ends: 6279 [2022-07-14 06:15:29,860 INFO L226 Difference]: Without dead ends: 6279 [2022-07-14 06:15:29,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:15:29,861 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 245 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:15:29,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 219 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:15:29,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6279 states. [2022-07-14 06:15:29,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6279 to 5707. [2022-07-14 06:15:29,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5707 states, 5696 states have (on average 1.4332865168539326) internal successors, (8164), 5706 states have internal predecessors, (8164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:29,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5707 states to 5707 states and 8164 transitions. [2022-07-14 06:15:29,960 INFO L78 Accepts]: Start accepts. Automaton has 5707 states and 8164 transitions. Word has length 53 [2022-07-14 06:15:29,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:15:29,961 INFO L495 AbstractCegarLoop]: Abstraction has 5707 states and 8164 transitions. [2022-07-14 06:15:29,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:29,961 INFO L276 IsEmpty]: Start isEmpty. Operand 5707 states and 8164 transitions. [2022-07-14 06:15:29,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-14 06:15:29,962 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:15:29,962 INFO L195 NwaCegarLoop]: trace histogram [8, 5, 5, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:15:29,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-07-14 06:15:30,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:15:30,169 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:15:30,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:15:30,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1339034764, now seen corresponding path program 1 times [2022-07-14 06:15:30,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:15:30,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [658081637] [2022-07-14 06:15:30,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:15:30,170 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:15:30,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:15:30,171 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:15:30,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-07-14 06:15:30,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:15:30,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-14 06:15:30,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:15:30,258 INFO L390 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 [2022-07-14 06:15:30,431 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 18 proven. 34 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-14 06:15:30,432 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:15:30,821 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 18 proven. 34 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-14 06:15:30,822 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:15:30,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [658081637] [2022-07-14 06:15:30,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [658081637] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:15:30,822 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:15:30,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2022-07-14 06:15:30,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933542634] [2022-07-14 06:15:30,822 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:15:30,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 06:15:30,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:15:30,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 06:15:30,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:15:30,823 INFO L87 Difference]: Start difference. First operand 5707 states and 8164 transitions. Second operand has 8 states, 7 states have (on average 9.142857142857142) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:31,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:15:31,526 INFO L93 Difference]: Finished difference Result 9231 states and 12960 transitions. [2022-07-14 06:15:31,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 06:15:31,528 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.142857142857142) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-07-14 06:15:31,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:15:31,547 INFO L225 Difference]: With dead ends: 9231 [2022-07-14 06:15:31,548 INFO L226 Difference]: Without dead ends: 9231 [2022-07-14 06:15:31,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2022-07-14 06:15:31,548 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 289 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-14 06:15:31,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 439 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-14 06:15:31,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9231 states. [2022-07-14 06:15:31,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9231 to 8090. [2022-07-14 06:15:31,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8090 states, 8079 states have (on average 1.4227008293105583) internal successors, (11494), 8089 states have internal predecessors, (11494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:31,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8090 states to 8090 states and 11494 transitions. [2022-07-14 06:15:31,684 INFO L78 Accepts]: Start accepts. Automaton has 8090 states and 11494 transitions. Word has length 53 [2022-07-14 06:15:31,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:15:31,685 INFO L495 AbstractCegarLoop]: Abstraction has 8090 states and 11494 transitions. [2022-07-14 06:15:31,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.142857142857142) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:31,685 INFO L276 IsEmpty]: Start isEmpty. Operand 8090 states and 11494 transitions. [2022-07-14 06:15:31,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-14 06:15:31,687 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:15:31,687 INFO L195 NwaCegarLoop]: trace histogram [9, 6, 6, 5, 4, 3, 3, 3, 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] [2022-07-14 06:15:31,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-07-14 06:15:31,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:15:31,903 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:15:31,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:15:31,904 INFO L85 PathProgramCache]: Analyzing trace with hash -137690402, now seen corresponding path program 1 times [2022-07-14 06:15:31,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:15:31,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [663669871] [2022-07-14 06:15:31,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:15:31,904 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:15:31,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:15:31,906 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:15:31,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-07-14 06:15:31,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:15:31,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-14 06:15:31,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:15:32,067 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 46 proven. 31 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-07-14 06:15:32,068 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:15:32,158 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 46 proven. 31 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-07-14 06:15:32,158 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:15:32,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [663669871] [2022-07-14 06:15:32,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [663669871] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:15:32,158 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:15:32,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2022-07-14 06:15:32,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92195168] [2022-07-14 06:15:32,159 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:15:32,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 06:15:32,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:15:32,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 06:15:32,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:15:32,165 INFO L87 Difference]: Start difference. First operand 8090 states and 11494 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:32,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:15:32,256 INFO L93 Difference]: Finished difference Result 9947 states and 13704 transitions. [2022-07-14 06:15:32,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 06:15:32,257 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2022-07-14 06:15:32,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:15:32,273 INFO L225 Difference]: With dead ends: 9947 [2022-07-14 06:15:32,273 INFO L226 Difference]: Without dead ends: 9947 [2022-07-14 06:15:32,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-07-14 06:15:32,275 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 337 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 995 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:15:32,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 995 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:15:32,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9947 states. [2022-07-14 06:15:32,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9947 to 7602. [2022-07-14 06:15:32,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7602 states, 7591 states have (on average 1.4090370175207483) internal successors, (10696), 7601 states have internal predecessors, (10696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:32,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7602 states to 7602 states and 10696 transitions. [2022-07-14 06:15:32,502 INFO L78 Accepts]: Start accepts. Automaton has 7602 states and 10696 transitions. Word has length 68 [2022-07-14 06:15:32,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:15:32,502 INFO L495 AbstractCegarLoop]: Abstraction has 7602 states and 10696 transitions. [2022-07-14 06:15:32,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:32,503 INFO L276 IsEmpty]: Start isEmpty. Operand 7602 states and 10696 transitions. [2022-07-14 06:15:32,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-14 06:15:32,504 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:15:32,504 INFO L195 NwaCegarLoop]: trace histogram [11, 6, 5, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:15:32,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-07-14 06:15:32,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:15:32,711 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:15:32,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:15:32,712 INFO L85 PathProgramCache]: Analyzing trace with hash -231185729, now seen corresponding path program 1 times [2022-07-14 06:15:32,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:15:32,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [160304263] [2022-07-14 06:15:32,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:15:32,713 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:15:32,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:15:32,714 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:15:32,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-07-14 06:15:32,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:15:32,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-14 06:15:32,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:15:32,886 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 68 proven. 31 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-07-14 06:15:32,886 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:15:33,076 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 68 proven. 31 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-07-14 06:15:33,077 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:15:33,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [160304263] [2022-07-14 06:15:33,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [160304263] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:15:33,077 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:15:33,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-07-14 06:15:33,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888946521] [2022-07-14 06:15:33,077 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:15:33,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-14 06:15:33,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:15:33,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-14 06:15:33,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-07-14 06:15:33,079 INFO L87 Difference]: Start difference. First operand 7602 states and 10696 transitions. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:33,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:15:33,275 INFO L93 Difference]: Finished difference Result 11869 states and 16395 transitions. [2022-07-14 06:15:33,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-14 06:15:33,276 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2022-07-14 06:15:33,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:15:33,291 INFO L225 Difference]: With dead ends: 11869 [2022-07-14 06:15:33,291 INFO L226 Difference]: Without dead ends: 11869 [2022-07-14 06:15:33,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-07-14 06:15:33,293 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 517 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:15:33,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 853 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:15:33,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11869 states. [2022-07-14 06:15:33,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11869 to 11460. [2022-07-14 06:15:33,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11460 states, 11449 states have (on average 1.3871953882435146) internal successors, (15882), 11459 states have internal predecessors, (15882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:33,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11460 states to 11460 states and 15882 transitions. [2022-07-14 06:15:33,434 INFO L78 Accepts]: Start accepts. Automaton has 11460 states and 15882 transitions. Word has length 71 [2022-07-14 06:15:33,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:15:33,435 INFO L495 AbstractCegarLoop]: Abstraction has 11460 states and 15882 transitions. [2022-07-14 06:15:33,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:15:33,435 INFO L276 IsEmpty]: Start isEmpty. Operand 11460 states and 15882 transitions. [2022-07-14 06:15:33,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-14 06:15:33,438 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:15:33,438 INFO L195 NwaCegarLoop]: trace histogram [10, 6, 6, 5, 4, 4, 4, 3, 3, 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] [2022-07-14 06:15:33,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-07-14 06:15:33,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:15:33,647 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-14 06:15:33,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:15:33,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1631832859, now seen corresponding path program 1 times [2022-07-14 06:15:33,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:15:33,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1204188953] [2022-07-14 06:15:33,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:15:33,648 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:15:33,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:15:33,649 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:15:33,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-07-14 06:15:33,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 06:15:33,786 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 06:15:33,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 06:15:33,936 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-07-14 06:15:33,936 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-14 06:15:33,937 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK (19 of 20 remaining) [2022-07-14 06:15:33,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 20 remaining) [2022-07-14 06:15:33,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 20 remaining) [2022-07-14 06:15:33,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 20 remaining) [2022-07-14 06:15:33,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 20 remaining) [2022-07-14 06:15:33,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 20 remaining) [2022-07-14 06:15:33,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 20 remaining) [2022-07-14 06:15:33,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 20 remaining) [2022-07-14 06:15:33,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 20 remaining) [2022-07-14 06:15:33,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 20 remaining) [2022-07-14 06:15:33,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 20 remaining) [2022-07-14 06:15:33,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 20 remaining) [2022-07-14 06:15:33,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 20 remaining) [2022-07-14 06:15:33,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 20 remaining) [2022-07-14 06:15:33,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 20 remaining) [2022-07-14 06:15:33,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 20 remaining) [2022-07-14 06:15:33,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 20 remaining) [2022-07-14 06:15:33,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (2 of 20 remaining) [2022-07-14 06:15:33,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (1 of 20 remaining) [2022-07-14 06:15:33,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (0 of 20 remaining) [2022-07-14 06:15:33,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2022-07-14 06:15:34,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:15:34,167 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:15:34,170 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-14 06:15:34,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.07 06:15:34 BoogieIcfgContainer [2022-07-14 06:15:34,228 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-14 06:15:34,229 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-14 06:15:34,229 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-14 06:15:34,229 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-14 06:15:34,231 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 06:15:19" (3/4) ... [2022-07-14 06:15:34,233 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-14 06:15:34,234 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-14 06:15:34,234 INFO L158 Benchmark]: Toolchain (without parser) took 15632.11ms. Allocated memory was 58.7MB in the beginning and 234.9MB in the end (delta: 176.2MB). Free memory was 42.0MB in the beginning and 107.2MB in the end (delta: -65.2MB). Peak memory consumption was 110.8MB. Max. memory is 16.1GB. [2022-07-14 06:15:34,235 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 46.1MB. Free memory was 28.0MB in the beginning and 27.9MB in the end (delta: 31.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 06:15:34,235 INFO L158 Benchmark]: CACSL2BoogieTranslator took 454.53ms. Allocated memory is still 58.7MB. Free memory was 41.7MB in the beginning and 34.3MB in the end (delta: 7.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-14 06:15:34,235 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.44ms. Allocated memory is still 58.7MB. Free memory was 34.3MB in the beginning and 32.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 06:15:34,235 INFO L158 Benchmark]: Boogie Preprocessor took 41.38ms. Allocated memory is still 58.7MB. Free memory was 32.2MB in the beginning and 30.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 06:15:34,236 INFO L158 Benchmark]: RCFGBuilder took 481.10ms. Allocated memory is still 58.7MB. Free memory was 30.3MB in the beginning and 27.0MB in the end (delta: 3.3MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. [2022-07-14 06:15:34,236 INFO L158 Benchmark]: TraceAbstraction took 14580.04ms. Allocated memory was 58.7MB in the beginning and 234.9MB in the end (delta: 176.2MB). Free memory was 39.8MB in the beginning and 108.3MB in the end (delta: -68.4MB). Peak memory consumption was 107.2MB. Max. memory is 16.1GB. [2022-07-14 06:15:34,236 INFO L158 Benchmark]: Witness Printer took 5.24ms. Allocated memory is still 234.9MB. Free memory was 108.3MB in the beginning and 107.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 06:15:34,237 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 46.1MB. Free memory was 28.0MB in the beginning and 27.9MB in the end (delta: 31.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 454.53ms. Allocated memory is still 58.7MB. Free memory was 41.7MB in the beginning and 34.3MB in the end (delta: 7.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.44ms. Allocated memory is still 58.7MB. Free memory was 34.3MB in the beginning and 32.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.38ms. Allocated memory is still 58.7MB. Free memory was 32.2MB in the beginning and 30.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 481.10ms. Allocated memory is still 58.7MB. Free memory was 30.3MB in the beginning and 27.0MB in the end (delta: 3.3MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. * TraceAbstraction took 14580.04ms. Allocated memory was 58.7MB in the beginning and 234.9MB in the end (delta: 176.2MB). Free memory was 39.8MB in the beginning and 108.3MB in the end (delta: -68.4MB). Peak memory consumption was 107.2MB. Max. memory is 16.1GB. * Witness Printer took 5.24ms. Allocated memory is still 234.9MB. Free memory was 108.3MB in the beginning and 107.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 592]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 592. Possible FailurePath: [L528] struct cell *S; [L529] int pc1 = 1; [L530] int pc4 = 1; [L531] static struct cell *t1 = ((void *)0); [L532] static struct cell *x1 = ((void *)0); [L561] struct cell* garbage; [L562] static struct cell *t4 = ((void *)0); [L563] static struct cell *x4 = ((void *)0); [L566] static int res4; VAL [garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L537] x1 = malloc(sizeof(*x1)) [L538] x1->data = 0 VAL [garbage={0:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L539] x1->next = ((void *)0) VAL [garbage={0:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L596] RET push() [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L541] case 2: VAL [garbage={0:0}, pc1=3, pc1++=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L542] x1->data = 4 VAL [garbage={0:0}, pc1=3, pc1++=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L596] RET push() [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L545] t1 = S VAL [garbage={0:0}, pc1=4, pc1++=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L596] RET push() [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L547] case 4: VAL [garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L548] x1->next = t1 VAL [garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L596] RET push() [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L547] case 4: [L550] case 5: VAL [garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L551] COND TRUE S == t1 [L552] S = x1 VAL [garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={6:0}, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L596] RET push() [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND FALSE !(__VERIFIER_nondet_int()) [L598] CALL pop() [L567] pc4++ [L568] case 1: [L569] t4 = S VAL [garbage={0:0}, pc1=6, pc4=2, pc4++=1, res4=0, S={6:0}, t1={0:0}, t4={6:0}, x1={6:0}, x4={0:0}] [L598] RET pop() [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND FALSE !(__VERIFIER_nondet_int()) [L598] CALL pop() [L567] pc4++ [L568] case 1: [L571] case 2: VAL [garbage={0:0}, pc1=6, pc4=3, pc4++=2, res4=0, S={6:0}, t1={0:0}, t4={6:0}, x1={6:0}, x4={0:0}] [L572] COND FALSE !(t4 == ((void *)0)) VAL [garbage={0:0}, pc1=6, pc4=3, pc4++=2, res4=0, S={6:0}, t1={0:0}, t4={6:0}, x1={6:0}, x4={0:0}] [L598] RET pop() [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND FALSE !(__VERIFIER_nondet_int()) [L598] CALL pop() [L567] pc4++ [L568] case 1: [L571] case 2: [L575] case 3: VAL [garbage={0:0}, pc1=6, pc4=4, pc4++=3, res4=0, S={6:0}, t1={0:0}, t4={6:0}, x1={6:0}, x4={0:0}] [L576] EXPR t4->next VAL [garbage={0:0}, pc1=6, pc4=4, pc4++=3, res4=0, S={6:0}, t1={0:0}, t4={6:0}, t4->next={0:0}, x1={6:0}, x4={0:0}] [L576] x4 = t4->next [L598] RET pop() [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND FALSE !(__VERIFIER_nondet_int()) [L598] CALL pop() [L567] pc4++ [L568] case 1: [L571] case 2: [L575] case 3: [L578] case 4: VAL [garbage={0:0}, pc1=6, pc4=5, pc4++=4, res4=0, S={6:0}, t1={0:0}, t4={6:0}, x1={6:0}, x4={0:0}] [L579] COND TRUE S == t4 [L580] S = x4 VAL [garbage={0:0}, pc1=6, pc4=5, pc4++=4, res4=0, S={0:0}, t1={0:0}, t4={6:0}, x1={6:0}, x4={0:0}] [L598] RET pop() [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L547] case 4: [L550] case 5: [L556] case 6: [L557] pc1 = 1 VAL [garbage={0:0}, pc1=1, pc1++=6, pc4=5, res4=0, S={0:0}, t1={0:0}, t4={6:0}, x1={6:0}, x4={0:0}] [L596] RET push() [L594] COND FALSE !(S || 1 != pc1 || __VERIFIER_nondet_int()) [L600] COND FALSE !(\read(*garbage)) VAL [garbage={0:0}, pc1=1, pc4=5, res4=0, S={0:0}, t1={0:0}, t4={6:0}, x1={6:0}, x4={0:0}] [L605] S = ((void *)0) [L606] t1 = ((void *)0) [L607] x1 = ((void *)0) [L608] t4 = ((void *)0) [L609] x4 = ((void *)0) [L610] return !!garbage; VAL [\result=0, garbage={0:0}, pc1=1, pc4=5, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 62 locations, 20 error locations. Started 1 CEGAR loops. OverallTime: 14.5s, OverallIterations: 23, TraceHistogramMax: 11, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5369 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5369 mSDsluCounter, 13248 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10179 mSDsCounter, 412 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1698 IncrementalHoareTripleChecker+Invalid, 2110 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 412 mSolverCounterUnsat, 3069 mSDtfsCounter, 1698 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1255 GetRequests, 1057 SyntacticMatches, 12 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11460occurred in iteration=22, InterpolantAutomatonStates: 198, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 22 MinimizatonAttempts, 7546 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 695 NumberOfCodeBlocks, 695 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1162 ConstructedInterpolants, 0 QuantifiedInterpolants, 5578 SizeOfPredicates, 53 NumberOfNonLiveVariables, 2504 ConjunctsInSsa, 143 ConjunctsInUnsatCore, 38 InterpolantComputations, 6 PerfectInterpolantSequences, 1030/1696 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-07-14 06:15:34,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample