./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread/stack-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread/stack-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1c5d098180a5596f0a60d3177354c69a5ee6da68b8191dc75b6c33b291ef0421 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-26 00:38:48,039 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-26 00:38:48,042 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-26 00:38:48,079 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-26 00:38:48,081 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-26 00:38:48,083 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-26 00:38:48,086 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-26 00:38:48,089 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-26 00:38:48,092 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-26 00:38:48,097 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-26 00:38:48,098 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-26 00:38:48,100 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-26 00:38:48,100 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-26 00:38:48,101 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-26 00:38:48,103 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-26 00:38:48,105 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-26 00:38:48,106 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-26 00:38:48,107 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-26 00:38:48,109 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-26 00:38:48,119 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-26 00:38:48,121 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-26 00:38:48,123 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-26 00:38:48,125 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-26 00:38:48,126 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-26 00:38:48,131 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-26 00:38:48,132 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-26 00:38:48,132 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-26 00:38:48,134 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-26 00:38:48,135 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-26 00:38:48,136 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-26 00:38:48,137 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-26 00:38:48,138 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-26 00:38:48,140 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-26 00:38:48,141 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-26 00:38:48,142 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-26 00:38:48,143 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-26 00:38:48,144 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-26 00:38:48,145 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-26 00:38:48,145 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-26 00:38:48,147 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-26 00:38:48,148 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-26 00:38:48,149 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-26 00:38:48,215 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-26 00:38:48,215 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-26 00:38:48,216 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-26 00:38:48,216 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-26 00:38:48,217 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-26 00:38:48,217 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-26 00:38:48,218 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-26 00:38:48,218 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-26 00:38:48,218 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-26 00:38:48,224 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-26 00:38:48,225 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-26 00:38:48,226 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-26 00:38:48,226 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-26 00:38:48,226 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-26 00:38:48,226 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-26 00:38:48,227 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-26 00:38:48,227 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-26 00:38:48,227 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-26 00:38:48,229 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-26 00:38:48,229 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-26 00:38:48,230 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-26 00:38:48,230 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-26 00:38:48,230 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-26 00:38:48,231 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-26 00:38:48,232 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-26 00:38:48,232 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-26 00:38:48,232 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-26 00:38:48,233 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-26 00:38:48,233 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-26 00:38:48,233 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-26 00:38:48,255 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-26 00:38:48,255 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-26 00:38:48,256 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-26 00:38:48,256 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-26 00:38:48,256 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-26 00:38:48,256 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:38:48,257 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-26 00:38:48,257 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-26 00:38:48,257 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-26 00:38:48,257 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-26 00:38:48,258 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-26 00:38:48,258 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-26 00:38:48,258 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur 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 -> Taipan 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 -> 1c5d098180a5596f0a60d3177354c69a5ee6da68b8191dc75b6c33b291ef0421 [2022-11-26 00:38:48,649 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-26 00:38:48,694 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-26 00:38:48,697 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-26 00:38:48,699 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-26 00:38:48,699 INFO L275 PluginConnector]: CDTParser initialized [2022-11-26 00:38:48,701 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/pthread/stack-2.i [2022-11-26 00:38:52,161 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-26 00:38:52,572 INFO L351 CDTParser]: Found 1 translation units. [2022-11-26 00:38:52,573 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/sv-benchmarks/c/pthread/stack-2.i [2022-11-26 00:38:52,592 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/data/caf7ff03d/505ab0782ee74b7c8596e87e4b40d6f3/FLAGbbb8ff6d5 [2022-11-26 00:38:52,612 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/data/caf7ff03d/505ab0782ee74b7c8596e87e4b40d6f3 [2022-11-26 00:38:52,615 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-26 00:38:52,617 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-26 00:38:52,619 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-26 00:38:52,619 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-26 00:38:52,624 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-26 00:38:52,625 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:38:52" (1/1) ... [2022-11-26 00:38:52,626 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e4ad7ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:38:52, skipping insertion in model container [2022-11-26 00:38:52,627 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:38:52" (1/1) ... [2022-11-26 00:38:52,636 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-26 00:38:52,698 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-26 00:38:53,305 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/sv-benchmarks/c/pthread/stack-2.i[41520,41533] [2022-11-26 00:38:53,346 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:38:53,366 INFO L203 MainTranslator]: Completed pre-run [2022-11-26 00:38:53,446 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/sv-benchmarks/c/pthread/stack-2.i[41520,41533] [2022-11-26 00:38:53,462 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:38:53,536 INFO L208 MainTranslator]: Completed translation [2022-11-26 00:38:53,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:38:53 WrapperNode [2022-11-26 00:38:53,537 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-26 00:38:53,538 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-26 00:38:53,539 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-26 00:38:53,539 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-26 00:38:53,549 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:38:53" (1/1) ... [2022-11-26 00:38:53,584 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:38:53" (1/1) ... [2022-11-26 00:38:53,623 INFO L138 Inliner]: procedures = 277, calls = 44, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 159 [2022-11-26 00:38:53,624 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-26 00:38:53,625 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-26 00:38:53,625 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-26 00:38:53,625 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-26 00:38:53,635 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:38:53" (1/1) ... [2022-11-26 00:38:53,636 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:38:53" (1/1) ... [2022-11-26 00:38:53,641 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:38:53" (1/1) ... [2022-11-26 00:38:53,647 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:38:53" (1/1) ... [2022-11-26 00:38:53,656 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:38:53" (1/1) ... [2022-11-26 00:38:53,673 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:38:53" (1/1) ... [2022-11-26 00:38:53,681 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:38:53" (1/1) ... [2022-11-26 00:38:53,683 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:38:53" (1/1) ... [2022-11-26 00:38:53,687 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-26 00:38:53,688 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-26 00:38:53,689 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-26 00:38:53,689 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-26 00:38:53,690 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:38:53" (1/1) ... [2022-11-26 00:38:53,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:38:53,714 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:38:53,729 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-26 00:38:53,763 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-26 00:38:53,793 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-26 00:38:53,793 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-26 00:38:53,793 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-26 00:38:53,794 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-26 00:38:53,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-26 00:38:53,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-26 00:38:53,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-26 00:38:53,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-26 00:38:53,795 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-26 00:38:53,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-26 00:38:53,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-26 00:38:53,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-26 00:38:53,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-26 00:38:53,797 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-26 00:38:54,054 INFO L235 CfgBuilder]: Building ICFG [2022-11-26 00:38:54,071 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-26 00:38:54,508 INFO L276 CfgBuilder]: Performing block encoding [2022-11-26 00:38:54,518 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-26 00:38:54,528 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-26 00:38:54,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:38:54 BoogieIcfgContainer [2022-11-26 00:38:54,564 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-26 00:38:54,568 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-26 00:38:54,568 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-26 00:38:54,572 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-26 00:38:54,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 12:38:52" (1/3) ... [2022-11-26 00:38:54,574 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a46e47f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:38:54, skipping insertion in model container [2022-11-26 00:38:54,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:38:53" (2/3) ... [2022-11-26 00:38:54,574 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a46e47f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:38:54, skipping insertion in model container [2022-11-26 00:38:54,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:38:54" (3/3) ... [2022-11-26 00:38:54,604 INFO L112 eAbstractionObserver]: Analyzing ICFG stack-2.i [2022-11-26 00:38:54,628 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-26 00:38:54,628 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 15 error locations. [2022-11-26 00:38:54,628 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-26 00:38:54,773 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-26 00:38:54,831 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-26 00:38:54,854 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 196 places, 199 transitions, 414 flow [2022-11-26 00:38:54,858 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 196 places, 199 transitions, 414 flow [2022-11-26 00:38:54,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 196 places, 199 transitions, 414 flow [2022-11-26 00:38:54,980 INFO L130 PetriNetUnfolder]: 10/197 cut-off events. [2022-11-26 00:38:54,980 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-26 00:38:54,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206 conditions, 197 events. 10/197 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 504 event pairs, 0 based on Foata normal form. 0/172 useless extension candidates. Maximal degree in co-relation 143. Up to 3 conditions per place. [2022-11-26 00:38:54,999 INFO L119 LiptonReduction]: Number of co-enabled transitions 11140 [2022-11-26 00:39:03,484 INFO L134 LiptonReduction]: Checked pairs total: 15845 [2022-11-26 00:39:03,485 INFO L136 LiptonReduction]: Total number of compositions: 208 [2022-11-26 00:39:03,493 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 51 places, 49 transitions, 114 flow [2022-11-26 00:39:03,559 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 786 states, 720 states have (on average 3.1125) internal successors, (2241), 785 states have internal predecessors, (2241), 0 states have call successors, (0), 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-11-26 00:39:03,578 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-26 00:39:03,585 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@733d93e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-26 00:39:03,585 INFO L358 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2022-11-26 00:39:03,589 INFO L276 IsEmpty]: Start isEmpty. Operand has 786 states, 720 states have (on average 3.1125) internal successors, (2241), 785 states have internal predecessors, (2241), 0 states have call successors, (0), 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-11-26 00:39:03,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-26 00:39:03,595 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:39:03,595 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-26 00:39:03,596 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-26 00:39:03,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:39:03,601 INFO L85 PathProgramCache]: Analyzing trace with hash 817, now seen corresponding path program 1 times [2022-11-26 00:39:03,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:39:03,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138693614] [2022-11-26 00:39:03,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:39:03,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:39:03,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:39:03,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:39:03,723 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:39:03,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138693614] [2022-11-26 00:39:03,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138693614] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:39:03,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:39:03,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-26 00:39:03,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273588021] [2022-11-26 00:39:03,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:39:03,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-26 00:39:03,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:39:03,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-26 00:39:03,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-26 00:39:03,762 INFO L87 Difference]: Start difference. First operand has 786 states, 720 states have (on average 3.1125) internal successors, (2241), 785 states have internal predecessors, (2241), 0 states have call successors, (0), 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, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 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-11-26 00:39:03,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:39:03,925 INFO L93 Difference]: Finished difference Result 784 states and 2239 transitions. [2022-11-26 00:39:03,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-26 00:39:03,928 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 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 1 [2022-11-26 00:39:03,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:39:03,960 INFO L225 Difference]: With dead ends: 784 [2022-11-26 00:39:03,960 INFO L226 Difference]: Without dead ends: 784 [2022-11-26 00:39:03,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 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-11-26 00:39:03,970 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:39:03,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:39:03,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2022-11-26 00:39:04,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 784. [2022-11-26 00:39:04,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 784 states, 720 states have (on average 3.109722222222222) internal successors, (2239), 783 states have internal predecessors, (2239), 0 states have call successors, (0), 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-11-26 00:39:04,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 2239 transitions. [2022-11-26 00:39:04,092 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 2239 transitions. Word has length 1 [2022-11-26 00:39:04,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:39:04,093 INFO L495 AbstractCegarLoop]: Abstraction has 784 states and 2239 transitions. [2022-11-26 00:39:04,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 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-11-26 00:39:04,096 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 2239 transitions. [2022-11-26 00:39:04,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-26 00:39:04,096 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:39:04,097 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-26 00:39:04,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-26 00:39:04,098 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-26 00:39:04,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:39:04,100 INFO L85 PathProgramCache]: Analyzing trace with hash 804694, now seen corresponding path program 1 times [2022-11-26 00:39:04,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:39:04,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989478696] [2022-11-26 00:39:04,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:39:04,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:39:04,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:39:04,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:39:04,443 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:39:04,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989478696] [2022-11-26 00:39:04,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989478696] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:39:04,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:39:04,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-26 00:39:04,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378338505] [2022-11-26 00:39:04,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:39:04,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:39:04,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:39:04,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:39:04,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:39:04,447 INFO L87 Difference]: Start difference. First operand 784 states and 2239 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:39:04,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:39:04,535 INFO L93 Difference]: Finished difference Result 758 states and 2184 transitions. [2022-11-26 00:39:04,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:39:04,536 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-26 00:39:04,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:39:04,542 INFO L225 Difference]: With dead ends: 758 [2022-11-26 00:39:04,542 INFO L226 Difference]: Without dead ends: 758 [2022-11-26 00:39:04,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-11-26 00:39:04,544 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 39 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:39:04,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 0 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:39:04,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2022-11-26 00:39:04,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 758. [2022-11-26 00:39:04,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 758 states, 702 states have (on average 3.111111111111111) internal successors, (2184), 757 states have internal predecessors, (2184), 0 states have call successors, (0), 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-11-26 00:39:04,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 2184 transitions. [2022-11-26 00:39:04,589 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 2184 transitions. Word has length 3 [2022-11-26 00:39:04,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:39:04,589 INFO L495 AbstractCegarLoop]: Abstraction has 758 states and 2184 transitions. [2022-11-26 00:39:04,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:39:04,594 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 2184 transitions. [2022-11-26 00:39:04,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-26 00:39:04,594 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:39:04,594 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-26 00:39:04,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-26 00:39:04,596 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-26 00:39:04,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:39:04,597 INFO L85 PathProgramCache]: Analyzing trace with hash 804695, now seen corresponding path program 1 times [2022-11-26 00:39:04,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:39:04,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106232549] [2022-11-26 00:39:04,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:39:04,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:39:04,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:39:04,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:39:04,695 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:39:04,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106232549] [2022-11-26 00:39:04,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106232549] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:39:04,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:39:04,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-26 00:39:04,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880320067] [2022-11-26 00:39:04,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:39:04,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:39:04,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:39:04,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:39:04,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:39:04,699 INFO L87 Difference]: Start difference. First operand 758 states and 2184 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:39:04,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:39:04,787 INFO L93 Difference]: Finished difference Result 732 states and 2129 transitions. [2022-11-26 00:39:04,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:39:04,788 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-26 00:39:04,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:39:04,811 INFO L225 Difference]: With dead ends: 732 [2022-11-26 00:39:04,811 INFO L226 Difference]: Without dead ends: 732 [2022-11-26 00:39:04,813 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-11-26 00:39:04,816 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 37 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:39:04,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 0 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:39:04,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2022-11-26 00:39:04,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 732. [2022-11-26 00:39:04,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 732 states, 684 states have (on average 3.1125730994152048) internal successors, (2129), 731 states have internal predecessors, (2129), 0 states have call successors, (0), 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-11-26 00:39:04,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 2129 transitions. [2022-11-26 00:39:04,851 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 2129 transitions. Word has length 3 [2022-11-26 00:39:04,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:39:04,851 INFO L495 AbstractCegarLoop]: Abstraction has 732 states and 2129 transitions. [2022-11-26 00:39:04,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:39:04,854 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 2129 transitions. [2022-11-26 00:39:04,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-26 00:39:04,854 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:39:04,855 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-26 00:39:04,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-26 00:39:04,855 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-26 00:39:04,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:39:04,856 INFO L85 PathProgramCache]: Analyzing trace with hash 773328585, now seen corresponding path program 1 times [2022-11-26 00:39:04,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:39:04,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189658114] [2022-11-26 00:39:04,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:39:04,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:39:04,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:39:05,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:39:05,100 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:39:05,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189658114] [2022-11-26 00:39:05,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189658114] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:39:05,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:39:05,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-26 00:39:05,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540451060] [2022-11-26 00:39:05,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:39:05,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:39:05,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:39:05,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:39:05,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:39:05,110 INFO L87 Difference]: Start difference. First operand 732 states and 2129 transitions. Second operand has 3 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-11-26 00:39:05,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:39:05,194 INFO L93 Difference]: Finished difference Result 563 states and 1583 transitions. [2022-11-26 00:39:05,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:39:05,194 INFO L78 Accepts]: Start accepts. Automaton has has 3 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-11-26 00:39:05,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:39:05,199 INFO L225 Difference]: With dead ends: 563 [2022-11-26 00:39:05,199 INFO L226 Difference]: Without dead ends: 563 [2022-11-26 00:39:05,199 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-11-26 00:39:05,202 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 34 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:39:05,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 0 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:39:05,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2022-11-26 00:39:05,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 563. [2022-11-26 00:39:05,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 531 states have (on average 2.981167608286252) internal successors, (1583), 562 states have internal predecessors, (1583), 0 states have call successors, (0), 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-11-26 00:39:05,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 1583 transitions. [2022-11-26 00:39:05,228 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 1583 transitions. Word has length 5 [2022-11-26 00:39:05,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:39:05,229 INFO L495 AbstractCegarLoop]: Abstraction has 563 states and 1583 transitions. [2022-11-26 00:39:05,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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-11-26 00:39:05,230 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 1583 transitions. [2022-11-26 00:39:05,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-26 00:39:05,231 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:39:05,231 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-26 00:39:05,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-26 00:39:05,231 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-26 00:39:05,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:39:05,233 INFO L85 PathProgramCache]: Analyzing trace with hash 773328587, now seen corresponding path program 1 times [2022-11-26 00:39:05,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:39:05,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651206788] [2022-11-26 00:39:05,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:39:05,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:39:05,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:39:05,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:39:05,402 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:39:05,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651206788] [2022-11-26 00:39:05,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651206788] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:39:05,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:39:05,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:39:05,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929462292] [2022-11-26 00:39:05,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:39:05,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:39:05,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:39:05,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:39:05,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:39:05,405 INFO L87 Difference]: Start difference. First operand 563 states and 1583 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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-11-26 00:39:05,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:39:05,479 INFO L93 Difference]: Finished difference Result 394 states and 1037 transitions. [2022-11-26 00:39:05,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:39:05,480 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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-11-26 00:39:05,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:39:05,483 INFO L225 Difference]: With dead ends: 394 [2022-11-26 00:39:05,483 INFO L226 Difference]: Without dead ends: 394 [2022-11-26 00:39:05,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:39:05,484 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 34 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:39:05,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 0 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:39:05,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2022-11-26 00:39:05,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2022-11-26 00:39:05,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 378 states have (on average 2.7433862433862433) internal successors, (1037), 393 states have internal predecessors, (1037), 0 states have call successors, (0), 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-11-26 00:39:05,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1037 transitions. [2022-11-26 00:39:05,501 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1037 transitions. Word has length 5 [2022-11-26 00:39:05,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:39:05,502 INFO L495 AbstractCegarLoop]: Abstraction has 394 states and 1037 transitions. [2022-11-26 00:39:05,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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-11-26 00:39:05,502 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1037 transitions. [2022-11-26 00:39:05,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-26 00:39:05,503 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:39:05,503 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-26 00:39:05,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-26 00:39:05,504 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-26 00:39:05,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:39:05,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1797219932, now seen corresponding path program 1 times [2022-11-26 00:39:05,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:39:05,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746191783] [2022-11-26 00:39:05,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:39:05,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:39:05,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:39:05,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:39:05,568 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:39:05,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746191783] [2022-11-26 00:39:05,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746191783] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:39:05,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:39:05,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:39:05,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024883942] [2022-11-26 00:39:05,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:39:05,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:39:05,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:39:05,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:39:05,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:39:05,572 INFO L87 Difference]: Start difference. First operand 394 states and 1037 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 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-11-26 00:39:05,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:39:05,713 INFO L93 Difference]: Finished difference Result 578 states and 1502 transitions. [2022-11-26 00:39:05,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:39:05,714 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 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-11-26 00:39:05,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:39:05,718 INFO L225 Difference]: With dead ends: 578 [2022-11-26 00:39:05,718 INFO L226 Difference]: Without dead ends: 578 [2022-11-26 00:39:05,718 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-11-26 00:39:05,719 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 25 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:39:05,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 0 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:39:05,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2022-11-26 00:39:05,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 540. [2022-11-26 00:39:05,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 524 states have (on average 2.7786259541984735) internal successors, (1456), 539 states have internal predecessors, (1456), 0 states have call successors, (0), 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-11-26 00:39:05,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 1456 transitions. [2022-11-26 00:39:05,744 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 1456 transitions. Word has length 6 [2022-11-26 00:39:05,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:39:05,744 INFO L495 AbstractCegarLoop]: Abstraction has 540 states and 1456 transitions. [2022-11-26 00:39:05,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 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-11-26 00:39:05,745 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 1456 transitions. [2022-11-26 00:39:05,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-26 00:39:05,745 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:39:05,746 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-26 00:39:05,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-26 00:39:05,746 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-26 00:39:05,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:39:05,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1797221632, now seen corresponding path program 1 times [2022-11-26 00:39:05,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:39:05,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209367229] [2022-11-26 00:39:05,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:39:05,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:39:05,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:39:06,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:39:06,154 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:39:06,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209367229] [2022-11-26 00:39:06,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209367229] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:39:06,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:39:06,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:39:06,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974238421] [2022-11-26 00:39:06,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:39:06,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 00:39:06,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:39:06,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 00:39:06,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:39:06,157 INFO L87 Difference]: Start difference. First operand 540 states and 1456 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 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-11-26 00:39:06,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:39:06,457 INFO L93 Difference]: Finished difference Result 646 states and 1731 transitions. [2022-11-26 00:39:06,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 00:39:06,460 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 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-11-26 00:39:06,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:39:06,464 INFO L225 Difference]: With dead ends: 646 [2022-11-26 00:39:06,464 INFO L226 Difference]: Without dead ends: 646 [2022-11-26 00:39:06,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-26 00:39:06,466 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 53 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:39:06,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 0 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 00:39:06,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2022-11-26 00:39:06,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 572. [2022-11-26 00:39:06,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 556 states have (on average 2.818345323741007) internal successors, (1567), 571 states have internal predecessors, (1567), 0 states have call successors, (0), 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-11-26 00:39:06,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 1567 transitions. [2022-11-26 00:39:06,494 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 1567 transitions. Word has length 6 [2022-11-26 00:39:06,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:39:06,495 INFO L495 AbstractCegarLoop]: Abstraction has 572 states and 1567 transitions. [2022-11-26 00:39:06,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 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-11-26 00:39:06,495 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 1567 transitions. [2022-11-26 00:39:06,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-26 00:39:06,497 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:39:06,497 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-26 00:39:06,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-26 00:39:06,497 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-26 00:39:06,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:39:06,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1797221631, now seen corresponding path program 1 times [2022-11-26 00:39:06,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:39:06,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133362037] [2022-11-26 00:39:06,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:39:06,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:39:06,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:39:06,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:39:06,729 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:39:06,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133362037] [2022-11-26 00:39:06,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133362037] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:39:06,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:39:06,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:39:06,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667765252] [2022-11-26 00:39:06,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:39:06,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 00:39:06,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:39:06,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 00:39:06,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:39:06,739 INFO L87 Difference]: Start difference. First operand 572 states and 1567 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 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-11-26 00:39:06,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:39:06,899 INFO L93 Difference]: Finished difference Result 557 states and 1495 transitions. [2022-11-26 00:39:06,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 00:39:06,900 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 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-11-26 00:39:06,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:39:06,904 INFO L225 Difference]: With dead ends: 557 [2022-11-26 00:39:06,904 INFO L226 Difference]: Without dead ends: 557 [2022-11-26 00:39:06,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 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-11-26 00:39:06,907 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 96 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:39:06,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 0 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:39:06,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2022-11-26 00:39:06,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 532. [2022-11-26 00:39:06,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 520 states have (on average 2.7826923076923076) internal successors, (1447), 531 states have internal predecessors, (1447), 0 states have call successors, (0), 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-11-26 00:39:06,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 1447 transitions. [2022-11-26 00:39:06,929 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 1447 transitions. Word has length 6 [2022-11-26 00:39:06,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:39:06,930 INFO L495 AbstractCegarLoop]: Abstraction has 532 states and 1447 transitions. [2022-11-26 00:39:06,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 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-11-26 00:39:06,930 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 1447 transitions. [2022-11-26 00:39:06,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-26 00:39:06,933 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:39:06,933 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:39:06,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-26 00:39:06,934 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-26 00:39:06,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:39:06,935 INFO L85 PathProgramCache]: Analyzing trace with hash 27398910, now seen corresponding path program 1 times [2022-11-26 00:39:06,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:39:06,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801253682] [2022-11-26 00:39:06,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:39:06,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:39:06,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:39:07,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-11-26 00:39:07,040 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:39:07,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801253682] [2022-11-26 00:39:07,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801253682] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:39:07,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:39:07,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:39:07,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719402854] [2022-11-26 00:39:07,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:39:07,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:39:07,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:39:07,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:39:07,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:39:07,044 INFO L87 Difference]: Start difference. First operand 532 states and 1447 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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-11-26 00:39:07,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:39:07,147 INFO L93 Difference]: Finished difference Result 582 states and 1543 transitions. [2022-11-26 00:39:07,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:39:07,148 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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-11-26 00:39:07,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:39:07,152 INFO L225 Difference]: With dead ends: 582 [2022-11-26 00:39:07,152 INFO L226 Difference]: Without dead ends: 578 [2022-11-26 00:39:07,152 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-11-26 00:39:07,154 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 17 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:39:07,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 0 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:39:07,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2022-11-26 00:39:07,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 562. [2022-11-26 00:39:07,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 549 states have (on average 2.757741347905282) internal successors, (1514), 561 states have internal predecessors, (1514), 0 states have call successors, (0), 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-11-26 00:39:07,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 1514 transitions. [2022-11-26 00:39:07,177 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 1514 transitions. Word has length 8 [2022-11-26 00:39:07,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:39:07,178 INFO L495 AbstractCegarLoop]: Abstraction has 562 states and 1514 transitions. [2022-11-26 00:39:07,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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-11-26 00:39:07,178 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 1514 transitions. [2022-11-26 00:39:07,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-26 00:39:07,182 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:39:07,182 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:39:07,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-26 00:39:07,183 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-26 00:39:07,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:39:07,183 INFO L85 PathProgramCache]: Analyzing trace with hash 984971657, now seen corresponding path program 1 times [2022-11-26 00:39:07,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:39:07,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092321671] [2022-11-26 00:39:07,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:39:07,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:39:07,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:39:07,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:39:07,243 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:39:07,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092321671] [2022-11-26 00:39:07,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092321671] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:39:07,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:39:07,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:39:07,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030231262] [2022-11-26 00:39:07,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:39:07,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:39:07,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:39:07,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:39:07,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:39:07,246 INFO L87 Difference]: Start difference. First operand 562 states and 1514 transitions. Second operand has 3 states, 2 states have (on average 5.0) 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-11-26 00:39:07,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:39:07,347 INFO L93 Difference]: Finished difference Result 592 states and 1593 transitions. [2022-11-26 00:39:07,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:39:07,347 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) 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-11-26 00:39:07,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:39:07,351 INFO L225 Difference]: With dead ends: 592 [2022-11-26 00:39:07,351 INFO L226 Difference]: Without dead ends: 592 [2022-11-26 00:39:07,352 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-11-26 00:39:07,352 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 18 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:39:07,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 0 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:39:07,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2022-11-26 00:39:07,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2022-11-26 00:39:07,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 580 states have (on average 2.746551724137931) internal successors, (1593), 591 states have internal predecessors, (1593), 0 states have call successors, (0), 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-11-26 00:39:07,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 1593 transitions. [2022-11-26 00:39:07,374 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 1593 transitions. Word has length 10 [2022-11-26 00:39:07,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:39:07,374 INFO L495 AbstractCegarLoop]: Abstraction has 592 states and 1593 transitions. [2022-11-26 00:39:07,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) 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-11-26 00:39:07,374 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 1593 transitions. [2022-11-26 00:39:07,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-26 00:39:07,379 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:39:07,379 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:39:07,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-26 00:39:07,380 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-26 00:39:07,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:39:07,381 INFO L85 PathProgramCache]: Analyzing trace with hash -559412155, now seen corresponding path program 1 times [2022-11-26 00:39:07,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:39:07,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302714641] [2022-11-26 00:39:07,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:39:07,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:39:07,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:39:07,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:39:07,441 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:39:07,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302714641] [2022-11-26 00:39:07,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302714641] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:39:07,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:39:07,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:39:07,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671724059] [2022-11-26 00:39:07,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:39:07,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:39:07,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:39:07,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:39:07,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:39:07,444 INFO L87 Difference]: Start difference. First operand 592 states and 1593 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:39:07,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:39:07,549 INFO L93 Difference]: Finished difference Result 626 states and 1673 transitions. [2022-11-26 00:39:07,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:39:07,550 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-26 00:39:07,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:39:07,554 INFO L225 Difference]: With dead ends: 626 [2022-11-26 00:39:07,554 INFO L226 Difference]: Without dead ends: 626 [2022-11-26 00:39:07,555 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-11-26 00:39:07,556 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 25 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:39:07,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 0 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:39:07,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2022-11-26 00:39:07,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 578. [2022-11-26 00:39:07,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 566 states have (on average 2.7491166077738516) internal successors, (1556), 577 states have internal predecessors, (1556), 0 states have call successors, (0), 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-11-26 00:39:07,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 1556 transitions. [2022-11-26 00:39:07,593 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 1556 transitions. Word has length 13 [2022-11-26 00:39:07,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:39:07,593 INFO L495 AbstractCegarLoop]: Abstraction has 578 states and 1556 transitions. [2022-11-26 00:39:07,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:39:07,594 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 1556 transitions. [2022-11-26 00:39:07,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-26 00:39:07,595 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:39:07,595 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:39:07,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-26 00:39:07,596 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-26 00:39:07,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:39:07,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1940929464, now seen corresponding path program 1 times [2022-11-26 00:39:07,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:39:07,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383882428] [2022-11-26 00:39:07,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:39:07,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:39:07,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:39:07,684 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:39:07,685 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:39:07,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383882428] [2022-11-26 00:39:07,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383882428] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:39:07,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970756015] [2022-11-26 00:39:07,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:39:07,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:39:07,686 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:39:07,691 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:39:07,725 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-26 00:39:07,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:39:07,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-26 00:39:07,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:39:07,922 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:39:07,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:39:08,008 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:39:08,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1970756015] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:39:08,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1105280708] [2022-11-26 00:39:08,016 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-26 00:39:08,019 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:39:08,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-11-26 00:39:08,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165160052] [2022-11-26 00:39:08,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:39:08,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-26 00:39:08,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:39:08,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-26 00:39:08,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-26 00:39:08,022 INFO L87 Difference]: Start difference. First operand 578 states and 1556 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 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-11-26 00:39:08,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:39:08,472 INFO L93 Difference]: Finished difference Result 1184 states and 3075 transitions. [2022-11-26 00:39:08,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-26 00:39:08,473 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 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 14 [2022-11-26 00:39:08,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:39:08,479 INFO L225 Difference]: With dead ends: 1184 [2022-11-26 00:39:08,479 INFO L226 Difference]: Without dead ends: 1184 [2022-11-26 00:39:08,480 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-11-26 00:39:08,480 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 151 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-26 00:39:08,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 0 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-26 00:39:08,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2022-11-26 00:39:08,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 886. [2022-11-26 00:39:08,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 874 states have (on average 2.7814645308924484) internal successors, (2431), 885 states have internal predecessors, (2431), 0 states have call successors, (0), 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-11-26 00:39:08,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 2431 transitions. [2022-11-26 00:39:08,517 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 2431 transitions. Word has length 14 [2022-11-26 00:39:08,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:39:08,518 INFO L495 AbstractCegarLoop]: Abstraction has 886 states and 2431 transitions. [2022-11-26 00:39:08,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 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-11-26 00:39:08,518 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 2431 transitions. [2022-11-26 00:39:08,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-26 00:39:08,519 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:39:08,519 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:39:08,535 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-26 00:39:08,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-26 00:39:08,726 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-26 00:39:08,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:39:08,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1940931164, now seen corresponding path program 1 times [2022-11-26 00:39:08,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:39:08,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143179054] [2022-11-26 00:39:08,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:39:08,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:39:08,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:39:09,216 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:39:09,217 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:39:09,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143179054] [2022-11-26 00:39:09,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143179054] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:39:09,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429549886] [2022-11-26 00:39:09,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:39:09,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:39:09,218 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:39:09,224 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:39:09,247 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-26 00:39:09,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:39:09,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-26 00:39:09,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:39:09,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:39:09,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:39:09,433 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-26 00:39:09,434 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 23 [2022-11-26 00:39:09,473 INFO L321 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-11-26 00:39:09,473 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2022-11-26 00:39:09,793 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:39:09,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:39:10,050 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:39:10,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1429549886] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:39:10,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [44741110] [2022-11-26 00:39:10,051 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-26 00:39:10,052 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:39:10,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 5] total 19 [2022-11-26 00:39:10,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772195459] [2022-11-26 00:39:10,053 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:39:10,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-26 00:39:10,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:39:10,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-26 00:39:10,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2022-11-26 00:39:10,055 INFO L87 Difference]: Start difference. First operand 886 states and 2431 transitions. Second operand has 21 states, 20 states have (on average 2.1) internal successors, (42), 20 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-11-26 00:39:11,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:39:11,633 INFO L93 Difference]: Finished difference Result 1568 states and 4214 transitions. [2022-11-26 00:39:11,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-26 00:39:11,634 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.1) internal successors, (42), 20 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 14 [2022-11-26 00:39:11,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:39:11,642 INFO L225 Difference]: With dead ends: 1568 [2022-11-26 00:39:11,642 INFO L226 Difference]: Without dead ends: 1568 [2022-11-26 00:39:11,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=175, Invalid=695, Unknown=0, NotChecked=0, Total=870 [2022-11-26 00:39:11,644 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 339 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1371 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:39:11,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 0 Invalid, 1374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1371 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-26 00:39:11,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1568 states. [2022-11-26 00:39:11,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1568 to 1206. [2022-11-26 00:39:11,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1206 states, 1194 states have (on average 2.7763819095477387) internal successors, (3315), 1205 states have internal predecessors, (3315), 0 states have call successors, (0), 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-11-26 00:39:11,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1206 states to 1206 states and 3315 transitions. [2022-11-26 00:39:11,694 INFO L78 Accepts]: Start accepts. Automaton has 1206 states and 3315 transitions. Word has length 14 [2022-11-26 00:39:11,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:39:11,694 INFO L495 AbstractCegarLoop]: Abstraction has 1206 states and 3315 transitions. [2022-11-26 00:39:11,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.1) internal successors, (42), 20 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-11-26 00:39:11,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1206 states and 3315 transitions. [2022-11-26 00:39:11,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-26 00:39:11,696 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:39:11,696 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:39:11,711 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-26 00:39:11,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:39:11,903 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-26 00:39:11,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:39:11,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1269929738, now seen corresponding path program 1 times [2022-11-26 00:39:11,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:39:11,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590764160] [2022-11-26 00:39:11,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:39:11,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:39:11,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:39:11,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:39:11,993 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:39:11,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590764160] [2022-11-26 00:39:11,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590764160] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:39:11,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:39:11,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:39:11,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603867336] [2022-11-26 00:39:11,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:39:11,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:39:11,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:39:11,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:39:11,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:39:11,996 INFO L87 Difference]: Start difference. First operand 1206 states and 3315 transitions. Second operand has 3 states, 3 states have (on average 6.0) 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-11-26 00:39:12,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:39:12,090 INFO L93 Difference]: Finished difference Result 502 states and 1163 transitions. [2022-11-26 00:39:12,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:39:12,091 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) 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-11-26 00:39:12,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:39:12,094 INFO L225 Difference]: With dead ends: 502 [2022-11-26 00:39:12,095 INFO L226 Difference]: Without dead ends: 498 [2022-11-26 00:39:12,095 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-11-26 00:39:12,096 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 27 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:39:12,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 0 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:39:12,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2022-11-26 00:39:12,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 472. [2022-11-26 00:39:12,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 466 states have (on average 2.3433476394849784) internal successors, (1092), 471 states have internal predecessors, (1092), 0 states have call successors, (0), 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-11-26 00:39:12,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 1092 transitions. [2022-11-26 00:39:12,114 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 1092 transitions. Word has length 18 [2022-11-26 00:39:12,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:39:12,115 INFO L495 AbstractCegarLoop]: Abstraction has 472 states and 1092 transitions. [2022-11-26 00:39:12,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) 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-11-26 00:39:12,115 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 1092 transitions. [2022-11-26 00:39:12,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-26 00:39:12,116 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:39:12,116 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:39:12,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-26 00:39:12,117 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-26 00:39:12,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:39:12,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1157852942, now seen corresponding path program 1 times [2022-11-26 00:39:12,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:39:12,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938149337] [2022-11-26 00:39:12,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:39:12,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:39:12,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:39:12,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:39:12,236 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:39:12,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938149337] [2022-11-26 00:39:12,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938149337] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:39:12,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:39:12,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-26 00:39:12,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97296609] [2022-11-26 00:39:12,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:39:12,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-26 00:39:12,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:39:12,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-26 00:39:12,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-26 00:39:12,239 INFO L87 Difference]: Start difference. First operand 472 states and 1092 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:39:12,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:39:12,447 INFO L93 Difference]: Finished difference Result 531 states and 1230 transitions. [2022-11-26 00:39:12,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-26 00:39:12,448 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-26 00:39:12,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:39:12,451 INFO L225 Difference]: With dead ends: 531 [2022-11-26 00:39:12,451 INFO L226 Difference]: Without dead ends: 531 [2022-11-26 00:39:12,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-26 00:39:12,452 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 126 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:39:12,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 0 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 00:39:12,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2022-11-26 00:39:12,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 466. [2022-11-26 00:39:12,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 461 states have (on average 2.3427331887201737) internal successors, (1080), 465 states have internal predecessors, (1080), 0 states have call successors, (0), 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-11-26 00:39:12,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 1080 transitions. [2022-11-26 00:39:12,470 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 1080 transitions. Word has length 19 [2022-11-26 00:39:12,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:39:12,471 INFO L495 AbstractCegarLoop]: Abstraction has 466 states and 1080 transitions. [2022-11-26 00:39:12,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:39:12,471 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 1080 transitions. [2022-11-26 00:39:12,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-26 00:39:12,472 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:39:12,472 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:39:12,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-26 00:39:12,473 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-26 00:39:12,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:39:12,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1157852943, now seen corresponding path program 1 times [2022-11-26 00:39:12,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:39:12,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664623793] [2022-11-26 00:39:12,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:39:12,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:39:12,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:39:12,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:39:12,933 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:39:12,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664623793] [2022-11-26 00:39:12,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664623793] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:39:12,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:39:12,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-26 00:39:12,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227613829] [2022-11-26 00:39:12,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:39:12,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-26 00:39:12,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:39:12,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-26 00:39:12,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-11-26 00:39:12,937 INFO L87 Difference]: Start difference. First operand 466 states and 1080 transitions. Second operand has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:39:13,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:39:13,981 INFO L93 Difference]: Finished difference Result 620 states and 1411 transitions. [2022-11-26 00:39:13,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-26 00:39:13,982 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-26 00:39:13,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:39:13,986 INFO L225 Difference]: With dead ends: 620 [2022-11-26 00:39:13,986 INFO L226 Difference]: Without dead ends: 620 [2022-11-26 00:39:13,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2022-11-26 00:39:13,988 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 111 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 948 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-26 00:39:13,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 0 Invalid, 951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 948 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-26 00:39:13,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2022-11-26 00:39:14,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 516. [2022-11-26 00:39:14,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 511 states have (on average 2.3737769080234834) internal successors, (1213), 515 states have internal predecessors, (1213), 0 states have call successors, (0), 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-11-26 00:39:14,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 1213 transitions. [2022-11-26 00:39:14,009 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 1213 transitions. Word has length 19 [2022-11-26 00:39:14,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:39:14,009 INFO L495 AbstractCegarLoop]: Abstraction has 516 states and 1213 transitions. [2022-11-26 00:39:14,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:39:14,010 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 1213 transitions. [2022-11-26 00:39:14,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-26 00:39:14,011 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:39:14,011 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:39:14,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-26 00:39:14,012 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-26 00:39:14,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:39:14,013 INFO L85 PathProgramCache]: Analyzing trace with hash -627782521, now seen corresponding path program 1 times [2022-11-26 00:39:14,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:39:14,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596478071] [2022-11-26 00:39:14,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:39:14,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:39:14,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:39:14,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:39:14,070 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:39:14,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596478071] [2022-11-26 00:39:14,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596478071] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:39:14,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:39:14,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:39:14,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036016803] [2022-11-26 00:39:14,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:39:14,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:39:14,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:39:14,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:39:14,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:39:14,073 INFO L87 Difference]: Start difference. First operand 516 states and 1213 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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-11-26 00:39:14,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:39:14,191 INFO L93 Difference]: Finished difference Result 690 states and 1583 transitions. [2022-11-26 00:39:14,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:39:14,191 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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-11-26 00:39:14,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:39:14,196 INFO L225 Difference]: With dead ends: 690 [2022-11-26 00:39:14,196 INFO L226 Difference]: Without dead ends: 690 [2022-11-26 00:39:14,196 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-11-26 00:39:14,197 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 23 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:39:14,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 0 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:39:14,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2022-11-26 00:39:14,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 586. [2022-11-26 00:39:14,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 579 states have (on average 2.3350604490500864) internal successors, (1352), 585 states have internal predecessors, (1352), 0 states have call successors, (0), 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-11-26 00:39:14,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 1352 transitions. [2022-11-26 00:39:14,220 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 1352 transitions. Word has length 21 [2022-11-26 00:39:14,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:39:14,221 INFO L495 AbstractCegarLoop]: Abstraction has 586 states and 1352 transitions. [2022-11-26 00:39:14,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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-11-26 00:39:14,221 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 1352 transitions. [2022-11-26 00:39:14,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-26 00:39:14,222 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:39:14,223 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:39:14,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-26 00:39:14,223 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-26 00:39:14,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:39:14,224 INFO L85 PathProgramCache]: Analyzing trace with hash 300125896, now seen corresponding path program 1 times [2022-11-26 00:39:14,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:39:14,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241570172] [2022-11-26 00:39:14,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:39:14,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:39:14,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:39:15,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:39:15,406 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:39:15,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241570172] [2022-11-26 00:39:15,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241570172] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:39:15,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:39:15,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-26 00:39:15,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151220891] [2022-11-26 00:39:15,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:39:15,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-26 00:39:15,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:39:15,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-26 00:39:15,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-11-26 00:39:15,409 INFO L87 Difference]: Start difference. First operand 586 states and 1352 transitions. Second operand has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 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-11-26 00:39:17,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:39:17,255 INFO L93 Difference]: Finished difference Result 903 states and 2051 transitions. [2022-11-26 00:39:17,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-26 00:39:17,256 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 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-11-26 00:39:17,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:39:17,261 INFO L225 Difference]: With dead ends: 903 [2022-11-26 00:39:17,261 INFO L226 Difference]: Without dead ends: 903 [2022-11-26 00:39:17,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=199, Invalid=731, Unknown=0, NotChecked=0, Total=930 [2022-11-26 00:39:17,262 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 155 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1130 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:39:17,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 0 Invalid, 1143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1130 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-26 00:39:17,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2022-11-26 00:39:17,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 730. [2022-11-26 00:39:17,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 730 states, 723 states have (on average 2.3775933609958506) internal successors, (1719), 729 states have internal predecessors, (1719), 0 states have call successors, (0), 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-11-26 00:39:17,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 1719 transitions. [2022-11-26 00:39:17,293 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 1719 transitions. Word has length 21 [2022-11-26 00:39:17,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:39:17,293 INFO L495 AbstractCegarLoop]: Abstraction has 730 states and 1719 transitions. [2022-11-26 00:39:17,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 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-11-26 00:39:17,294 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 1719 transitions. [2022-11-26 00:39:17,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-26 00:39:17,295 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:39:17,295 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:39:17,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-26 00:39:17,296 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-26 00:39:17,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:39:17,297 INFO L85 PathProgramCache]: Analyzing trace with hash 217915036, now seen corresponding path program 2 times [2022-11-26 00:39:17,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:39:17,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187327582] [2022-11-26 00:39:17,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:39:17,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:39:17,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:39:18,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:39:18,628 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:39:18,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187327582] [2022-11-26 00:39:18,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187327582] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:39:18,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:39:18,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-26 00:39:18,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846318110] [2022-11-26 00:39:18,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:39:18,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-26 00:39:18,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:39:18,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-26 00:39:18,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2022-11-26 00:39:18,631 INFO L87 Difference]: Start difference. First operand 730 states and 1719 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-11-26 00:39:20,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:39:20,088 INFO L93 Difference]: Finished difference Result 1035 states and 2424 transitions. [2022-11-26 00:39:20,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-26 00:39:20,089 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-11-26 00:39:20,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:39:20,095 INFO L225 Difference]: With dead ends: 1035 [2022-11-26 00:39:20,095 INFO L226 Difference]: Without dead ends: 1035 [2022-11-26 00:39:20,095 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2022-11-26 00:39:20,096 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 115 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1057 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-26 00:39:20,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 0 Invalid, 1072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1057 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-26 00:39:20,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2022-11-26 00:39:20,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 773. [2022-11-26 00:39:20,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 773 states, 766 states have (on average 2.4073107049608353) internal successors, (1844), 772 states have internal predecessors, (1844), 0 states have call successors, (0), 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-11-26 00:39:20,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1844 transitions. [2022-11-26 00:39:20,126 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1844 transitions. Word has length 21 [2022-11-26 00:39:20,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:39:20,126 INFO L495 AbstractCegarLoop]: Abstraction has 773 states and 1844 transitions. [2022-11-26 00:39:20,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-11-26 00:39:20,127 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1844 transitions. [2022-11-26 00:39:20,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-26 00:39:20,128 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:39:20,128 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:39:20,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-26 00:39:20,129 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-26 00:39:20,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:39:20,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1827579220, now seen corresponding path program 3 times [2022-11-26 00:39:20,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:39:20,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758448150] [2022-11-26 00:39:20,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:39:20,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:39:20,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:39:21,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:39:21,179 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:39:21,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758448150] [2022-11-26 00:39:21,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758448150] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:39:21,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:39:21,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-26 00:39:21,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248841229] [2022-11-26 00:39:21,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:39:21,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-26 00:39:21,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:39:21,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-26 00:39:21,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-11-26 00:39:21,181 INFO L87 Difference]: Start difference. First operand 773 states and 1844 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-11-26 00:39:23,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:39:23,246 INFO L93 Difference]: Finished difference Result 990 states and 2300 transitions. [2022-11-26 00:39:23,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-26 00:39:23,247 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-11-26 00:39:23,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:39:23,252 INFO L225 Difference]: With dead ends: 990 [2022-11-26 00:39:23,253 INFO L226 Difference]: Without dead ends: 990 [2022-11-26 00:39:23,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=228, Invalid=764, Unknown=0, NotChecked=0, Total=992 [2022-11-26 00:39:23,254 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 157 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1076 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:39:23,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 0 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1076 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-26 00:39:23,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2022-11-26 00:39:23,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 628. [2022-11-26 00:39:23,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 621 states have (on average 2.347826086956522) internal successors, (1458), 627 states have internal predecessors, (1458), 0 states have call successors, (0), 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-11-26 00:39:23,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 1458 transitions. [2022-11-26 00:39:23,299 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 1458 transitions. Word has length 21 [2022-11-26 00:39:23,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:39:23,299 INFO L495 AbstractCegarLoop]: Abstraction has 628 states and 1458 transitions. [2022-11-26 00:39:23,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-11-26 00:39:23,300 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 1458 transitions. [2022-11-26 00:39:23,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-26 00:39:23,305 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:39:23,305 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:39:23,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-26 00:39:23,306 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-26 00:39:23,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:39:23,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1064121075, now seen corresponding path program 1 times [2022-11-26 00:39:23,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:39:23,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421265256] [2022-11-26 00:39:23,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:39:23,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:39:23,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:39:23,378 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:39:23,378 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:39:23,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421265256] [2022-11-26 00:39:23,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421265256] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:39:23,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65536782] [2022-11-26 00:39:23,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:39:23,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:39:23,380 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:39:23,381 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:39:23,421 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-26 00:39:23,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:39:23,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-26 00:39:23,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:39:23,575 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:39:23,575 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:39:23,603 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:39:23,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65536782] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:39:23,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [818404490] [2022-11-26 00:39:23,604 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-26 00:39:23,605 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:39:23,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-11-26 00:39:23,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433423764] [2022-11-26 00:39:23,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:39:23,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-26 00:39:23,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:39:23,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-26 00:39:23,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-26 00:39:23,608 INFO L87 Difference]: Start difference. First operand 628 states and 1458 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 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-11-26 00:39:23,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:39:23,852 INFO L93 Difference]: Finished difference Result 1476 states and 3313 transitions. [2022-11-26 00:39:23,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-26 00:39:23,853 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 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 23 [2022-11-26 00:39:23,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:39:23,867 INFO L225 Difference]: With dead ends: 1476 [2022-11-26 00:39:23,868 INFO L226 Difference]: Without dead ends: 1476 [2022-11-26 00:39:23,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-26 00:39:23,869 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 201 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:39:23,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 0 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 00:39:23,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1476 states. [2022-11-26 00:39:23,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1476 to 1428. [2022-11-26 00:39:23,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1428 states, 1421 states have (on average 2.3019000703729766) internal successors, (3271), 1427 states have internal predecessors, (3271), 0 states have call successors, (0), 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-11-26 00:39:23,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 3271 transitions. [2022-11-26 00:39:23,916 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 3271 transitions. Word has length 23 [2022-11-26 00:39:23,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:39:23,916 INFO L495 AbstractCegarLoop]: Abstraction has 1428 states and 3271 transitions. [2022-11-26 00:39:23,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 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-11-26 00:39:23,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 3271 transitions. [2022-11-26 00:39:23,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-26 00:39:23,918 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:39:23,919 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:39:23,931 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-26 00:39:24,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:39:24,126 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-26 00:39:24,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:39:24,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1070297079, now seen corresponding path program 1 times [2022-11-26 00:39:24,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:39:24,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591590584] [2022-11-26 00:39:24,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:39:24,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:39:24,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:39:24,584 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:39:24,584 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:39:24,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591590584] [2022-11-26 00:39:24,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591590584] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:39:24,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902164842] [2022-11-26 00:39:24,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:39:24,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:39:24,585 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:39:24,587 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:39:24,624 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-26 00:39:24,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:39:24,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-26 00:39:24,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:39:25,362 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:39:25,362 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:39:25,691 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:39:25,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 34 [2022-11-26 00:39:25,940 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:39:25,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1902164842] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:39:25,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [129859118] [2022-11-26 00:39:25,941 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-26 00:39:25,941 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:39:25,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-11-26 00:39:25,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337099637] [2022-11-26 00:39:25,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:39:25,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-26 00:39:25,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:39:25,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-26 00:39:25,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=892, Unknown=0, NotChecked=0, Total=992 [2022-11-26 00:39:25,944 INFO L87 Difference]: Start difference. First operand 1428 states and 3271 transitions. Second operand has 32 states, 31 states have (on average 2.3225806451612905) internal successors, (72), 31 states have internal predecessors, (72), 0 states have call successors, (0), 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-11-26 00:39:31,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:39:31,018 INFO L93 Difference]: Finished difference Result 2058 states and 4563 transitions. [2022-11-26 00:39:31,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-26 00:39:31,019 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.3225806451612905) internal successors, (72), 31 states have internal predecessors, (72), 0 states have call successors, (0), 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-11-26 00:39:31,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:39:31,030 INFO L225 Difference]: With dead ends: 2058 [2022-11-26 00:39:31,030 INFO L226 Difference]: Without dead ends: 2058 [2022-11-26 00:39:31,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 587 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=789, Invalid=3243, Unknown=0, NotChecked=0, Total=4032 [2022-11-26 00:39:31,032 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 668 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3079 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 668 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 3079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-26 00:39:31,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [668 Valid, 0 Invalid, 3129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 3079 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-11-26 00:39:31,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2058 states. [2022-11-26 00:39:31,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2058 to 1354. [2022-11-26 00:39:31,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1354 states, 1348 states have (on average 2.28486646884273) internal successors, (3080), 1353 states have internal predecessors, (3080), 0 states have call successors, (0), 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-11-26 00:39:31,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1354 states to 1354 states and 3080 transitions. [2022-11-26 00:39:31,085 INFO L78 Accepts]: Start accepts. Automaton has 1354 states and 3080 transitions. Word has length 24 [2022-11-26 00:39:31,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:39:31,086 INFO L495 AbstractCegarLoop]: Abstraction has 1354 states and 3080 transitions. [2022-11-26 00:39:31,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.3225806451612905) internal successors, (72), 31 states have internal predecessors, (72), 0 states have call successors, (0), 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-11-26 00:39:31,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 3080 transitions. [2022-11-26 00:39:31,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-26 00:39:31,088 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:39:31,088 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:39:31,107 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-26 00:39:31,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:39:31,306 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-26 00:39:31,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:39:31,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1070409469, now seen corresponding path program 1 times [2022-11-26 00:39:31,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:39:31,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662474740] [2022-11-26 00:39:31,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:39:31,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:39:31,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-26 00:39:31,351 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-26 00:39:31,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-26 00:39:31,454 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-26 00:39:31,455 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-26 00:39:31,457 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location t2Err2ASSERT_VIOLATIONMEMORY_LEAK (22 of 23 remaining) [2022-11-26 00:39:31,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 23 remaining) [2022-11-26 00:39:31,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 23 remaining) [2022-11-26 00:39:31,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 23 remaining) [2022-11-26 00:39:31,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 23 remaining) [2022-11-26 00:39:31,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 23 remaining) [2022-11-26 00:39:31,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 23 remaining) [2022-11-26 00:39:31,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 23 remaining) [2022-11-26 00:39:31,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 23 remaining) [2022-11-26 00:39:31,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (13 of 23 remaining) [2022-11-26 00:39:31,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 23 remaining) [2022-11-26 00:39:31,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 23 remaining) [2022-11-26 00:39:31,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 23 remaining) [2022-11-26 00:39:31,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 23 remaining) [2022-11-26 00:39:31,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONMEMORY_LEAK (8 of 23 remaining) [2022-11-26 00:39:31,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2ASSERT_VIOLATIONMEMORY_LEAK (7 of 23 remaining) [2022-11-26 00:39:31,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 23 remaining) [2022-11-26 00:39:31,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 23 remaining) [2022-11-26 00:39:31,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 23 remaining) [2022-11-26 00:39:31,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 23 remaining) [2022-11-26 00:39:31,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONMEMORY_LEAK (2 of 23 remaining) [2022-11-26 00:39:31,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 23 remaining) [2022-11-26 00:39:31,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 23 remaining) [2022-11-26 00:39:31,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-26 00:39:31,472 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:39:31,482 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-26 00:39:31,482 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-26 00:39:31,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 12:39:31 BasicIcfg [2022-11-26 00:39:31,589 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-26 00:39:31,590 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-26 00:39:31,590 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-26 00:39:31,591 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-26 00:39:31,591 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:38:54" (3/4) ... [2022-11-26 00:39:31,594 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-26 00:39:31,595 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-26 00:39:31,596 INFO L158 Benchmark]: Toolchain (without parser) took 38978.57ms. Allocated memory was 201.3MB in the beginning and 352.3MB in the end (delta: 151.0MB). Free memory was 169.9MB in the beginning and 252.0MB in the end (delta: -82.2MB). Peak memory consumption was 67.5MB. Max. memory is 16.1GB. [2022-11-26 00:39:31,597 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 132.1MB. Free memory is still 97.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-26 00:39:31,597 INFO L158 Benchmark]: CACSL2BoogieTranslator took 918.82ms. Allocated memory is still 201.3MB. Free memory was 169.7MB in the beginning and 143.1MB in the end (delta: 26.5MB). Peak memory consumption was 28.1MB. Max. memory is 16.1GB. [2022-11-26 00:39:31,597 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.70ms. Allocated memory is still 201.3MB. Free memory was 143.1MB in the beginning and 140.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-26 00:39:31,599 INFO L158 Benchmark]: Boogie Preprocessor took 62.60ms. Allocated memory is still 201.3MB. Free memory was 140.4MB in the beginning and 138.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-26 00:39:31,599 INFO L158 Benchmark]: RCFGBuilder took 876.35ms. Allocated memory is still 201.3MB. Free memory was 138.8MB in the beginning and 167.6MB in the end (delta: -28.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-11-26 00:39:31,602 INFO L158 Benchmark]: TraceAbstraction took 37021.60ms. Allocated memory was 201.3MB in the beginning and 352.3MB in the end (delta: 151.0MB). Free memory was 167.4MB in the beginning and 252.0MB in the end (delta: -84.6MB). Peak memory consumption was 65.5MB. Max. memory is 16.1GB. [2022-11-26 00:39:31,603 INFO L158 Benchmark]: Witness Printer took 4.59ms. Allocated memory is still 352.3MB. Free memory is still 252.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-26 00:39:31,612 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.31ms. Allocated memory is still 132.1MB. Free memory is still 97.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 918.82ms. Allocated memory is still 201.3MB. Free memory was 169.7MB in the beginning and 143.1MB in the end (delta: 26.5MB). Peak memory consumption was 28.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 85.70ms. Allocated memory is still 201.3MB. Free memory was 143.1MB in the beginning and 140.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.60ms. Allocated memory is still 201.3MB. Free memory was 140.4MB in the beginning and 138.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 876.35ms. Allocated memory is still 201.3MB. Free memory was 138.8MB in the beginning and 167.6MB in the end (delta: -28.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 37021.60ms. Allocated memory was 201.3MB in the beginning and 352.3MB in the end (delta: 151.0MB). Free memory was 167.4MB in the beginning and 252.0MB in the end (delta: -84.6MB). Peak memory consumption was 65.5MB. Max. memory is 16.1GB. * Witness Printer took 4.59ms. Allocated memory is still 352.3MB. Free memory is still 252.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.6s, 196 PlacesBefore, 51 PlacesAfterwards, 199 TransitionsBefore, 49 TransitionsAfterwards, 11140 CoEnabledTransitionPairs, 7 FixpointIterations, 55 TrivialSequentialCompositions, 126 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 22 ConcurrentYvCompositions, 5 ChoiceCompositions, 208 TotalNumberOfCompositions, 15845 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 13063, independent: 12837, independent conditional: 0, independent unconditional: 12837, dependent: 226, dependent conditional: 0, dependent unconditional: 226, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7990, independent: 7921, independent conditional: 0, independent unconditional: 7921, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7990, independent: 7895, independent conditional: 0, independent unconditional: 7895, dependent: 95, dependent conditional: 0, dependent unconditional: 95, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 95, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 304, independent: 64, independent conditional: 0, independent unconditional: 64, dependent: 240, dependent conditional: 0, dependent unconditional: 240, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 13063, independent: 4916, independent conditional: 0, independent unconditional: 4916, dependent: 157, dependent conditional: 0, dependent unconditional: 157, unknown: 7990, unknown conditional: 0, unknown unconditional: 7990] , Statistics on independence cache: Total cache size (in pairs): 438, Positive cache size: 411, Positive conditional cache size: 0, Positive unconditional cache size: 411, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - 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: 941]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 941. Possible FailurePath: [L935] 0 static int top=0; [L936] 0 static unsigned int arr[(5)]; [L937] 0 pthread_mutex_t m; [L938] 0 _Bool flag=(0); [L1021] 0 pthread_t id1, id2; [L1023] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [arr={3:0}, flag=0, id1={9:0}, id2={6:0}, m={4:0}, pthread_create(&id1, ((void *)0), t1, ((void *)0))=13, top=0] [L1024] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [arr={3:0}, flag=0, id1={9:0}, id2={6:0}, m={4:0}, pthread_create(&id2, ((void *)0), t2, ((void *)0))=14, top=0] [L1006] 2 int i; [L1007] 2 i=0 VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L990] 1 int i; [L991] 1 unsigned int tmp; [L992] 1 i=0 VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L992] COND TRUE 1 i<(5) [L995] 1 tmp = __VERIFIER_nondet_uint() [L996] CALL 1 assume_abort_if_not(tmp < (5)) [L23] COND FALSE 1 !(!cond) [L996] RET 1 assume_abort_if_not(tmp < (5)) [L997] CALL, EXPR 1 push(arr,tmp) [L962] COND FALSE 1 !(top==(5)) VAL [\old(x)=4, arr={3:0}, flag=0, m={4:0}, stack={3:0}, stack={3:0}, top=0, x=4] [L969] CALL, EXPR 1 get_top() [L954] 1 return top; [L969] RET, EXPR 1 get_top() [L969] 1 stack[get_top()] = x VAL [\old(x)=4, arr={3:0}, flag=0, get_top()=0, m={4:0}, stack={3:0}, stack={3:0}, top=0, x=4] [L970] CALL 1 inc_top() [L946] 1 top++ [L970] RET 1 inc_top() [L972] 1 return 0; [L997] RET, EXPR 1 push(arr,tmp) [L997] COND FALSE 1 !(push(arr,tmp)==(-1)) [L999] 1 flag=(1) VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=0, m={4:0}, tmp=4, top=1] [L992] 1 i++ VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, tmp=4, top=1] [L1007] COND TRUE 2 i<(5) [L1010] COND TRUE 2 \read(flag) [L1012] CALL, EXPR 2 pop(arr) [L976] CALL, EXPR 2 get_top() [L954] 2 return top; [L976] RET, EXPR 2 get_top() [L976] COND FALSE 2 !(get_top()==0) [L983] CALL 2 dec_top() [L950] 2 top-- [L983] RET 2 dec_top() [L984] CALL, EXPR 2 get_top() [L954] 2 return top; [L984] RET, EXPR 2 get_top() [L984] EXPR 2 stack[get_top()] [L984] 2 return stack[get_top()]; [L1012] RET, EXPR 2 pop(arr) [L1012] COND FALSE 2 !(!(pop(arr)!=(-2))) [L1007] 2 i++ VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, top=0] [L1007] COND TRUE 2 i<(5) [L1010] COND TRUE 2 \read(flag) [L1012] CALL, EXPR 2 pop(arr) [L976] CALL, EXPR 2 get_top() [L954] 2 return top; [L976] RET, EXPR 2 get_top() [L976] COND TRUE 2 get_top()==0 [L979] 2 return (-2); [L1012] RET, EXPR 2 pop(arr) [L1012] COND TRUE 2 !(pop(arr)!=(-2)) [L1013] CALL 2 error() [L941] 2 reach_error() VAL [arr={3:0}, flag=1, m={4:0}, top=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: 1019]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1023]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1024]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) 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: 941]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 312 locations, 23 error locations. Started 1 CEGAR loops. OverallTime: 36.6s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 15.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2451 SdHoareTripleChecker+Valid, 9.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2451 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 7.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 134 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10337 IncrementalHoareTripleChecker+Invalid, 10471 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 134 mSolverCounterUnsat, 0 mSDtfsCounter, 10337 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 353 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1217 ImplicationChecksByTransitivity, 7.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1428occurred in iteration=21, InterpolantAutomatonStates: 184, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 22 MinimizatonAttempts, 2709 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 8.6s InterpolantComputationTime, 380 NumberOfCodeBlocks, 380 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 401 ConstructedInterpolants, 0 QuantifiedInterpolants, 3622 SizeOfPredicates, 26 NumberOfNonLiveVariables, 935 ConjunctsInSsa, 81 ConjunctsInUnsatCore, 30 InterpolantComputations, 18 PerfectInterpolantSequences, 9/34 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-11-26 00:39:31,653 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/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/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread/stack-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1c5d098180a5596f0a60d3177354c69a5ee6da68b8191dc75b6c33b291ef0421 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-26 00:39:34,426 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-26 00:39:34,429 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-26 00:39:34,479 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-26 00:39:34,485 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-26 00:39:34,491 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-26 00:39:34,493 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-26 00:39:34,496 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-26 00:39:34,500 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-26 00:39:34,502 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-26 00:39:34,504 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-26 00:39:34,509 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-26 00:39:34,509 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-26 00:39:34,515 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-26 00:39:34,516 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-26 00:39:34,518 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-26 00:39:34,521 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-26 00:39:34,530 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-26 00:39:34,532 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-26 00:39:34,539 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-26 00:39:34,541 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-26 00:39:34,547 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-26 00:39:34,549 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-26 00:39:34,550 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-26 00:39:34,554 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-26 00:39:34,558 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-26 00:39:34,558 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-26 00:39:34,560 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-26 00:39:34,562 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-26 00:39:34,563 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-26 00:39:34,563 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-26 00:39:34,564 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-26 00:39:34,566 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-26 00:39:34,567 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-26 00:39:34,588 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-26 00:39:34,589 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-26 00:39:34,590 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-26 00:39:34,590 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-26 00:39:34,590 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-26 00:39:34,591 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-26 00:39:34,592 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-26 00:39:34,593 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-11-26 00:39:34,622 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-26 00:39:34,622 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-26 00:39:34,623 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-26 00:39:34,623 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-26 00:39:34,624 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-26 00:39:34,624 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-26 00:39:34,624 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-26 00:39:34,625 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-26 00:39:34,625 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-26 00:39:34,625 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-26 00:39:34,626 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-26 00:39:34,626 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-26 00:39:34,627 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-26 00:39:34,627 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-26 00:39:34,627 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-26 00:39:34,628 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-26 00:39:34,628 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-26 00:39:34,628 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-26 00:39:34,629 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-26 00:39:34,629 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-26 00:39:34,629 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-26 00:39:34,629 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-26 00:39:34,630 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-26 00:39:34,630 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-26 00:39:34,630 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-26 00:39:34,631 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-26 00:39:34,631 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-26 00:39:34,631 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-26 00:39:34,631 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-26 00:39:34,632 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-26 00:39:34,632 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-26 00:39:34,632 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-26 00:39:34,633 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:39:34,633 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-26 00:39:34,633 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-26 00:39:34,633 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-26 00:39:34,634 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-26 00:39:34,634 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-26 00:39:34,634 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-26 00:39:34,635 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur 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 -> Taipan 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 -> 1c5d098180a5596f0a60d3177354c69a5ee6da68b8191dc75b6c33b291ef0421 [2022-11-26 00:39:35,071 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-26 00:39:35,103 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-26 00:39:35,106 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-26 00:39:35,108 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-26 00:39:35,108 INFO L275 PluginConnector]: CDTParser initialized [2022-11-26 00:39:35,110 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/pthread/stack-2.i [2022-11-26 00:39:38,772 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-26 00:39:39,173 INFO L351 CDTParser]: Found 1 translation units. [2022-11-26 00:39:39,174 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/sv-benchmarks/c/pthread/stack-2.i [2022-11-26 00:39:39,210 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/data/bedc11265/2502993f730b41b2a9e2bc6a752fb757/FLAG5e5914747 [2022-11-26 00:39:39,260 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/data/bedc11265/2502993f730b41b2a9e2bc6a752fb757 [2022-11-26 00:39:39,263 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-26 00:39:39,265 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-26 00:39:39,267 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-26 00:39:39,267 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-26 00:39:39,271 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-26 00:39:39,272 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:39:39" (1/1) ... [2022-11-26 00:39:39,274 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f7651de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:39:39, skipping insertion in model container [2022-11-26 00:39:39,274 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:39:39" (1/1) ... [2022-11-26 00:39:39,283 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-26 00:39:39,340 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-26 00:39:39,917 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/sv-benchmarks/c/pthread/stack-2.i[41520,41533] [2022-11-26 00:39:39,969 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:39:39,992 INFO L203 MainTranslator]: Completed pre-run [2022-11-26 00:39:40,064 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/sv-benchmarks/c/pthread/stack-2.i[41520,41533] [2022-11-26 00:39:40,080 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:39:40,195 INFO L208 MainTranslator]: Completed translation [2022-11-26 00:39:40,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:39:40 WrapperNode [2022-11-26 00:39:40,196 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-26 00:39:40,198 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-26 00:39:40,198 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-26 00:39:40,198 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-26 00:39:40,207 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:39:40" (1/1) ... [2022-11-26 00:39:40,244 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:39:40" (1/1) ... [2022-11-26 00:39:40,303 INFO L138 Inliner]: procedures = 281, calls = 44, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 155 [2022-11-26 00:39:40,303 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-26 00:39:40,306 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-26 00:39:40,307 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-26 00:39:40,307 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-26 00:39:40,319 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:39:40" (1/1) ... [2022-11-26 00:39:40,319 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:39:40" (1/1) ... [2022-11-26 00:39:40,325 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:39:40" (1/1) ... [2022-11-26 00:39:40,325 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:39:40" (1/1) ... [2022-11-26 00:39:40,335 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:39:40" (1/1) ... [2022-11-26 00:39:40,340 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:39:40" (1/1) ... [2022-11-26 00:39:40,342 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:39:40" (1/1) ... [2022-11-26 00:39:40,344 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:39:40" (1/1) ... [2022-11-26 00:39:40,348 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-26 00:39:40,350 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-26 00:39:40,350 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-26 00:39:40,350 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-26 00:39:40,359 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:39:40" (1/1) ... [2022-11-26 00:39:40,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:39:40,390 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:39:40,406 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-26 00:39:40,436 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-26 00:39:40,463 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-26 00:39:40,465 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-26 00:39:40,466 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-26 00:39:40,466 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-26 00:39:40,466 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-26 00:39:40,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-26 00:39:40,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-26 00:39:40,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-26 00:39:40,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-26 00:39:40,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-11-26 00:39:40,467 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-26 00:39:40,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-26 00:39:40,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-26 00:39:40,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-26 00:39:40,470 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-26 00:39:40,717 INFO L235 CfgBuilder]: Building ICFG [2022-11-26 00:39:40,719 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-26 00:39:41,223 INFO L276 CfgBuilder]: Performing block encoding [2022-11-26 00:39:41,235 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-26 00:39:41,236 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-26 00:39:41,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:39:41 BoogieIcfgContainer [2022-11-26 00:39:41,239 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-26 00:39:41,243 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-26 00:39:41,243 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-26 00:39:41,248 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-26 00:39:41,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 12:39:39" (1/3) ... [2022-11-26 00:39:41,249 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@795ec5da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:39:41, skipping insertion in model container [2022-11-26 00:39:41,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:39:40" (2/3) ... [2022-11-26 00:39:41,250 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@795ec5da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:39:41, skipping insertion in model container [2022-11-26 00:39:41,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:39:41" (3/3) ... [2022-11-26 00:39:41,252 INFO L112 eAbstractionObserver]: Analyzing ICFG stack-2.i [2022-11-26 00:39:41,285 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-26 00:39:41,286 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 15 error locations. [2022-11-26 00:39:41,286 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-26 00:39:41,487 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-26 00:39:41,534 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-26 00:39:41,554 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 192 places, 195 transitions, 406 flow [2022-11-26 00:39:41,558 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 192 places, 195 transitions, 406 flow [2022-11-26 00:39:41,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 192 places, 195 transitions, 406 flow [2022-11-26 00:39:41,672 INFO L130 PetriNetUnfolder]: 10/193 cut-off events. [2022-11-26 00:39:41,673 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-26 00:39:41,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 193 events. 10/193 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 491 event pairs, 0 based on Foata normal form. 0/168 useless extension candidates. Maximal degree in co-relation 138. Up to 3 conditions per place. [2022-11-26 00:39:41,695 INFO L119 LiptonReduction]: Number of co-enabled transitions 10398 [2022-11-26 00:40:00,348 INFO L134 LiptonReduction]: Checked pairs total: 15857 [2022-11-26 00:40:00,349 INFO L136 LiptonReduction]: Total number of compositions: 203 [2022-11-26 00:40:00,358 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 51 places, 50 transitions, 116 flow [2022-11-26 00:40:00,452 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 786 states, 720 states have (on average 3.1902777777777778) internal successors, (2297), 785 states have internal predecessors, (2297), 0 states have call successors, (0), 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-11-26 00:40:00,474 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-26 00:40:00,482 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1f558810, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-26 00:40:00,483 INFO L358 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2022-11-26 00:40:00,487 INFO L276 IsEmpty]: Start isEmpty. Operand has 786 states, 720 states have (on average 3.1902777777777778) internal successors, (2297), 785 states have internal predecessors, (2297), 0 states have call successors, (0), 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-11-26 00:40:00,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-26 00:40:00,494 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:40:00,495 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-26 00:40:00,495 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-26 00:40:00,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:40:00,502 INFO L85 PathProgramCache]: Analyzing trace with hash 799, now seen corresponding path program 1 times [2022-11-26 00:40:00,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:40:00,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2126634547] [2022-11-26 00:40:00,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:40:00,519 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:40:00,520 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:40:00,527 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-26 00:40:00,575 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-26 00:40:00,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:40:00,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-26 00:40:00,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:40:00,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:40:00,649 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:40:00,650 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:40:00,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2126634547] [2022-11-26 00:40:00,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2126634547] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:40:00,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:40:00,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-26 00:40:00,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377959961] [2022-11-26 00:40:00,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:40:00,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-26 00:40:00,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:40:00,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-26 00:40:00,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-26 00:40:00,697 INFO L87 Difference]: Start difference. First operand has 786 states, 720 states have (on average 3.1902777777777778) internal successors, (2297), 785 states have internal predecessors, (2297), 0 states have call successors, (0), 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, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 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-11-26 00:40:00,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:40:00,942 INFO L93 Difference]: Finished difference Result 784 states and 2239 transitions. [2022-11-26 00:40:00,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-26 00:40:00,945 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 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 1 [2022-11-26 00:40:00,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:40:00,980 INFO L225 Difference]: With dead ends: 784 [2022-11-26 00:40:00,989 INFO L226 Difference]: Without dead ends: 784 [2022-11-26 00:40:00,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 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-11-26 00:40:01,003 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:40:01,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:40:01,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2022-11-26 00:40:01,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 784. [2022-11-26 00:40:01,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 784 states, 720 states have (on average 3.109722222222222) internal successors, (2239), 783 states have internal predecessors, (2239), 0 states have call successors, (0), 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-11-26 00:40:01,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 2239 transitions. [2022-11-26 00:40:01,143 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 2239 transitions. Word has length 1 [2022-11-26 00:40:01,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:40:01,144 INFO L495 AbstractCegarLoop]: Abstraction has 784 states and 2239 transitions. [2022-11-26 00:40:01,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 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-11-26 00:40:01,144 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 2239 transitions. [2022-11-26 00:40:01,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-26 00:40:01,145 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:40:01,145 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-26 00:40:01,163 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-26 00:40:01,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:40:01,359 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-26 00:40:01,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:40:01,360 INFO L85 PathProgramCache]: Analyzing trace with hash 787942, now seen corresponding path program 1 times [2022-11-26 00:40:01,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:40:01,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [213053627] [2022-11-26 00:40:01,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:40:01,361 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:40:01,361 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:40:01,365 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-26 00:40:01,370 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-26 00:40:01,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:40:01,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-26 00:40:01,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:40:01,634 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-26 00:40:01,636 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 9 treesize of output 19 [2022-11-26 00:40:01,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:40:01,655 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:40:01,656 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:40:01,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [213053627] [2022-11-26 00:40:01,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [213053627] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:40:01,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:40:01,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-26 00:40:01,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278165585] [2022-11-26 00:40:01,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:40:01,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:40:01,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:40:01,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:40:01,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:40:01,661 INFO L87 Difference]: Start difference. First operand 784 states and 2239 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:40:01,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:40:01,840 INFO L93 Difference]: Finished difference Result 758 states and 2184 transitions. [2022-11-26 00:40:01,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:40:01,841 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-26 00:40:01,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:40:01,849 INFO L225 Difference]: With dead ends: 758 [2022-11-26 00:40:01,850 INFO L226 Difference]: Without dead ends: 758 [2022-11-26 00:40:01,850 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-11-26 00:40:01,852 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 39 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:40:01,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 0 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 00:40:01,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2022-11-26 00:40:01,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 758. [2022-11-26 00:40:01,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 758 states, 702 states have (on average 3.111111111111111) internal successors, (2184), 757 states have internal predecessors, (2184), 0 states have call successors, (0), 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-11-26 00:40:01,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 2184 transitions. [2022-11-26 00:40:01,900 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 2184 transitions. Word has length 3 [2022-11-26 00:40:01,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:40:01,901 INFO L495 AbstractCegarLoop]: Abstraction has 758 states and 2184 transitions. [2022-11-26 00:40:01,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:40:01,901 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 2184 transitions. [2022-11-26 00:40:01,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-26 00:40:01,902 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:40:01,902 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-26 00:40:01,922 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-11-26 00:40:02,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:40:02,117 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-26 00:40:02,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:40:02,117 INFO L85 PathProgramCache]: Analyzing trace with hash 787943, now seen corresponding path program 1 times [2022-11-26 00:40:02,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:40:02,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [856572273] [2022-11-26 00:40:02,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:40:02,119 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:40:02,119 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:40:02,121 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-26 00:40:02,125 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-26 00:40:02,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:40:02,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-26 00:40:02,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:40:02,309 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-26 00:40:02,309 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-11-26 00:40: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-11-26 00:40:02,349 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:40:02,349 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:40:02,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [856572273] [2022-11-26 00:40:02,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [856572273] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:40:02,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:40:02,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-26 00:40:02,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176962352] [2022-11-26 00:40:02,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:40:02,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:40:02,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:40:02,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:40:02,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:40:02,353 INFO L87 Difference]: Start difference. First operand 758 states and 2184 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:40:02,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:40:02,536 INFO L93 Difference]: Finished difference Result 732 states and 2129 transitions. [2022-11-26 00:40:02,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:40:02,537 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-26 00:40:02,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:40:02,543 INFO L225 Difference]: With dead ends: 732 [2022-11-26 00:40:02,543 INFO L226 Difference]: Without dead ends: 732 [2022-11-26 00:40:02,544 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-11-26 00:40:02,545 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 37 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:40:02,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 0 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 00:40:02,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2022-11-26 00:40:02,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 732. [2022-11-26 00:40:02,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 732 states, 684 states have (on average 3.1125730994152048) internal successors, (2129), 731 states have internal predecessors, (2129), 0 states have call successors, (0), 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-11-26 00:40:02,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 2129 transitions. [2022-11-26 00:40:02,580 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 2129 transitions. Word has length 3 [2022-11-26 00:40:02,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:40:02,581 INFO L495 AbstractCegarLoop]: Abstraction has 732 states and 2129 transitions. [2022-11-26 00:40:02,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:40:02,581 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 2129 transitions. [2022-11-26 00:40:02,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-26 00:40:02,582 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:40:02,582 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-26 00:40:02,599 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-26 00:40:02,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:40:02,793 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-26 00:40:02,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:40:02,794 INFO L85 PathProgramCache]: Analyzing trace with hash 757232382, now seen corresponding path program 1 times [2022-11-26 00:40:02,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:40:02,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2008148291] [2022-11-26 00:40:02,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:40:02,795 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:40:02,795 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:40:02,797 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-26 00:40:02,835 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-26 00:40:02,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:40:02,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-26 00:40:02,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:40:02,983 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-26 00:40:02,984 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-11-26 00:40:03,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:40:03,039 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:40:03,040 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:40:03,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2008148291] [2022-11-26 00:40:03,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2008148291] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:40:03,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:40:03,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-26 00:40:03,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436808657] [2022-11-26 00:40:03,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:40:03,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:40:03,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:40:03,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:40:03,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:40:03,048 INFO L87 Difference]: Start difference. First operand 732 states and 2129 transitions. Second operand has 3 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-11-26 00:40:03,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:40:03,187 INFO L93 Difference]: Finished difference Result 563 states and 1583 transitions. [2022-11-26 00:40:03,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:40:03,188 INFO L78 Accepts]: Start accepts. Automaton has has 3 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-11-26 00:40:03,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:40:03,192 INFO L225 Difference]: With dead ends: 563 [2022-11-26 00:40:03,193 INFO L226 Difference]: Without dead ends: 563 [2022-11-26 00:40:03,193 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-11-26 00:40:03,194 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 34 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:40:03,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 0 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:40:03,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2022-11-26 00:40:03,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 563. [2022-11-26 00:40:03,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 531 states have (on average 2.981167608286252) internal successors, (1583), 562 states have internal predecessors, (1583), 0 states have call successors, (0), 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-11-26 00:40:03,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 1583 transitions. [2022-11-26 00:40:03,223 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 1583 transitions. Word has length 5 [2022-11-26 00:40:03,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:40:03,224 INFO L495 AbstractCegarLoop]: Abstraction has 563 states and 1583 transitions. [2022-11-26 00:40:03,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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-11-26 00:40:03,225 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 1583 transitions. [2022-11-26 00:40:03,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-26 00:40:03,226 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:40:03,226 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-26 00:40:03,240 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-11-26 00:40:03,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:40:03,441 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-26 00:40:03,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:40:03,441 INFO L85 PathProgramCache]: Analyzing trace with hash 757232383, now seen corresponding path program 1 times [2022-11-26 00:40:03,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:40:03,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [424664376] [2022-11-26 00:40:03,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:40:03,442 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:40:03,443 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:40:03,444 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-26 00:40:03,449 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-26 00:40:03,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:40:03,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-26 00:40:03,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:40:03,629 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:40:03,630 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 9 treesize of output 11 [2022-11-26 00:40:03,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:40:03,711 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:40:03,712 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:40:03,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [424664376] [2022-11-26 00:40:03,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [424664376] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:40:03,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:40:03,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-26 00:40:03,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261909122] [2022-11-26 00:40:03,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:40:03,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:40:03,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:40:03,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:40:03,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:40:03,715 INFO L87 Difference]: Start difference. First operand 563 states and 1583 transitions. Second operand has 3 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-11-26 00:40:03,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:40:03,848 INFO L93 Difference]: Finished difference Result 394 states and 1037 transitions. [2022-11-26 00:40:03,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:40:03,849 INFO L78 Accepts]: Start accepts. Automaton has has 3 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-11-26 00:40:03,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:40:03,852 INFO L225 Difference]: With dead ends: 394 [2022-11-26 00:40:03,852 INFO L226 Difference]: Without dead ends: 394 [2022-11-26 00:40:03,852 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-11-26 00:40:03,853 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 33 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:40:03,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 0 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:40:03,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2022-11-26 00:40:03,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2022-11-26 00:40:03,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 378 states have (on average 2.7433862433862433) internal successors, (1037), 393 states have internal predecessors, (1037), 0 states have call successors, (0), 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-11-26 00:40:03,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1037 transitions. [2022-11-26 00:40:03,875 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1037 transitions. Word has length 5 [2022-11-26 00:40:03,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:40:03,875 INFO L495 AbstractCegarLoop]: Abstraction has 394 states and 1037 transitions. [2022-11-26 00:40:03,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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-11-26 00:40:03,878 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1037 transitions. [2022-11-26 00:40:03,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-26 00:40:03,880 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:40:03,880 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-26 00:40:03,899 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-26 00:40:04,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:40:04,094 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-26 00:40:04,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:40:04,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1998931016, now seen corresponding path program 1 times [2022-11-26 00:40:04,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:40:04,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [445209360] [2022-11-26 00:40:04,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:40:04,096 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:40:04,096 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:40:04,097 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-26 00:40:04,100 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-26 00:40:04,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:40:04,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-26 00:40:04,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:40:04,325 INFO L321 Elim1Store]: treesize reduction 56, result has 25.3 percent of original size [2022-11-26 00:40:04,325 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 34 [2022-11-26 00:40:04,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:40:04,552 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:40:04,555 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:40:04,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [445209360] [2022-11-26 00:40:04,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [445209360] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:40:04,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:40:04,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:40:04,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090818194] [2022-11-26 00:40:04,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:40:04,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:40:04,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:40:04,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:40:04,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:40:04,559 INFO L87 Difference]: Start difference. First operand 394 states and 1037 transitions. Second operand has 4 states, 3 states have (on average 2.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-11-26 00:40:04,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:40:04,973 INFO L93 Difference]: Finished difference Result 477 states and 1269 transitions. [2022-11-26 00:40:04,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:40:04,974 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.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-11-26 00:40:04,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:40:04,977 INFO L225 Difference]: With dead ends: 477 [2022-11-26 00:40:04,977 INFO L226 Difference]: Without dead ends: 477 [2022-11-26 00:40:04,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:40:04,978 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 63 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-26 00:40:04,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 0 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-26 00:40:04,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2022-11-26 00:40:04,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 366. [2022-11-26 00:40:04,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 354 states have (on average 2.7231638418079096) internal successors, (964), 365 states have internal predecessors, (964), 0 states have call successors, (0), 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-11-26 00:40:05,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 964 transitions. [2022-11-26 00:40:05,002 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 964 transitions. Word has length 6 [2022-11-26 00:40:05,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:40:05,002 INFO L495 AbstractCegarLoop]: Abstraction has 366 states and 964 transitions. [2022-11-26 00:40:05,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.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-11-26 00:40:05,003 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 964 transitions. [2022-11-26 00:40:05,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-26 00:40:05,004 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:40:05,004 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-26 00:40:05,025 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-26 00:40:05,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:40:05,217 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-26 00:40:05,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:40:05,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1998931017, now seen corresponding path program 1 times [2022-11-26 00:40:05,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:40:05,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2125198273] [2022-11-26 00:40:05,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:40:05,219 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:40:05,219 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:40:05,223 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-26 00:40:05,271 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-26 00:40:05,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:40:05,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-26 00:40:05,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:40:05,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:40:05,450 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-26 00:40:05,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 27 [2022-11-26 00:40:05,483 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-26 00:40:05,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-26 00:40:05,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:40:05,772 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:40:05,772 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:40:05,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2125198273] [2022-11-26 00:40:05,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2125198273] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:40:05,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:40:05,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:40:05,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878843662] [2022-11-26 00:40:05,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:40:05,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:40:05,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:40:05,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:40:05,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:40:05,774 INFO L87 Difference]: Start difference. First operand 366 states and 964 transitions. Second operand has 4 states, 3 states have (on average 2.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-11-26 00:40:06,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:40:06,329 INFO L93 Difference]: Finished difference Result 542 states and 1421 transitions. [2022-11-26 00:40:06,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:40:06,330 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.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-11-26 00:40:06,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:40:06,333 INFO L225 Difference]: With dead ends: 542 [2022-11-26 00:40:06,334 INFO L226 Difference]: Without dead ends: 542 [2022-11-26 00:40:06,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:40:06,335 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 38 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-26 00:40:06,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 0 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-26 00:40:06,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2022-11-26 00:40:06,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 442. [2022-11-26 00:40:06,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 430 states have (on average 2.76046511627907) internal successors, (1187), 441 states have internal predecessors, (1187), 0 states have call successors, (0), 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-11-26 00:40:06,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 1187 transitions. [2022-11-26 00:40:06,356 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 1187 transitions. Word has length 6 [2022-11-26 00:40:06,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:40:06,356 INFO L495 AbstractCegarLoop]: Abstraction has 442 states and 1187 transitions. [2022-11-26 00:40:06,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.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-11-26 00:40:06,357 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 1187 transitions. [2022-11-26 00:40:06,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-26 00:40:06,359 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:40:06,359 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:40:06,381 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-26 00:40:06,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:40:06,573 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-26 00:40:06,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:40:06,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1541680764, now seen corresponding path program 1 times [2022-11-26 00:40:06,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:40:06,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [832649087] [2022-11-26 00:40:06,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:40:06,575 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:40:06,575 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:40:06,577 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-26 00:40:06,615 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-26 00:40:06,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:40:06,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-26 00:40:06,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:40:06,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:40:06,720 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:40:06,720 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:40:06,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [832649087] [2022-11-26 00:40:06,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [832649087] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:40:06,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:40:06,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:40:06,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470616656] [2022-11-26 00:40:06,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:40:06,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:40:06,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:40:06,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:40:06,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:40:06,724 INFO L87 Difference]: Start difference. First operand 442 states and 1187 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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-11-26 00:40:06,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:40:06,933 INFO L93 Difference]: Finished difference Result 510 states and 1319 transitions. [2022-11-26 00:40:06,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:40:06,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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-11-26 00:40:06,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:40:06,937 INFO L225 Difference]: With dead ends: 510 [2022-11-26 00:40:06,938 INFO L226 Difference]: Without dead ends: 506 [2022-11-26 00:40:06,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-11-26 00:40:06,939 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 20 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:40:06,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 0 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 00:40:06,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2022-11-26 00:40:06,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 480. [2022-11-26 00:40:06,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 466 states have (on average 2.723175965665236) internal successors, (1269), 479 states have internal predecessors, (1269), 0 states have call successors, (0), 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-11-26 00:40:06,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 1269 transitions. [2022-11-26 00:40:06,963 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 1269 transitions. Word has length 8 [2022-11-26 00:40:06,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:40:06,963 INFO L495 AbstractCegarLoop]: Abstraction has 480 states and 1269 transitions. [2022-11-26 00:40:06,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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-11-26 00:40:06,964 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 1269 transitions. [2022-11-26 00:40:06,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-26 00:40:06,966 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:40:06,966 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:40:06,987 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-26 00:40:07,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:40:07,180 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-26 00:40:07,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:40:07,181 INFO L85 PathProgramCache]: Analyzing trace with hash 447793374, now seen corresponding path program 1 times [2022-11-26 00:40:07,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:40:07,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [406728596] [2022-11-26 00:40:07,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:40:07,182 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:40:07,182 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:40:07,183 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-26 00:40:07,184 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-26 00:40:07,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:40:07,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-26 00:40:07,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:40:07,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:40:07,320 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:40:07,321 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:40:07,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [406728596] [2022-11-26 00:40:07,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [406728596] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:40:07,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:40:07,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:40:07,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039760369] [2022-11-26 00:40:07,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:40:07,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:40:07,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:40:07,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:40:07,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:40:07,323 INFO L87 Difference]: Start difference. First operand 480 states and 1269 transitions. Second operand has 3 states, 2 states have (on average 5.0) 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-11-26 00:40:07,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:40:07,535 INFO L93 Difference]: Finished difference Result 510 states and 1350 transitions. [2022-11-26 00:40:07,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:40:07,536 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) 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-11-26 00:40:07,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:40:07,539 INFO L225 Difference]: With dead ends: 510 [2022-11-26 00:40:07,539 INFO L226 Difference]: Without dead ends: 510 [2022-11-26 00:40:07,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-11-26 00:40:07,540 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 18 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:40:07,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 0 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 00:40:07,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2022-11-26 00:40:07,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 510. [2022-11-26 00:40:07,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 496 states have (on average 2.721774193548387) internal successors, (1350), 509 states have internal predecessors, (1350), 0 states have call successors, (0), 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-11-26 00:40:07,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 1350 transitions. [2022-11-26 00:40:07,568 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 1350 transitions. Word has length 10 [2022-11-26 00:40:07,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:40:07,591 INFO L495 AbstractCegarLoop]: Abstraction has 510 states and 1350 transitions. [2022-11-26 00:40:07,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) 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-11-26 00:40:07,591 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 1350 transitions. [2022-11-26 00:40:07,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-26 00:40:07,592 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:40:07,592 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:40:07,615 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-26 00:40:07,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:40:07,793 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-26 00:40:07,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:40:07,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1319265598, now seen corresponding path program 1 times [2022-11-26 00:40:07,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:40:07,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2004711243] [2022-11-26 00:40:07,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:40:07,794 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:40:07,795 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:40:07,796 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-26 00:40:07,831 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-26 00:40:07,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:40:07,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-26 00:40:07,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:40:07,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:40:07,953 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:40:07,953 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:40:07,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2004711243] [2022-11-26 00:40:07,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2004711243] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:40:07,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:40:07,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:40:07,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776117090] [2022-11-26 00:40:07,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:40:07,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:40:07,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:40:07,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:40:07,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:40:07,955 INFO L87 Difference]: Start difference. First operand 510 states and 1350 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:40:08,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:40:08,157 INFO L93 Difference]: Finished difference Result 570 states and 1501 transitions. [2022-11-26 00:40:08,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:40:08,158 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-26 00:40:08,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:40:08,162 INFO L225 Difference]: With dead ends: 570 [2022-11-26 00:40:08,162 INFO L226 Difference]: Without dead ends: 570 [2022-11-26 00:40:08,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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-11-26 00:40:08,163 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 22 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:40:08,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 0 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 00:40:08,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2022-11-26 00:40:08,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 504. [2022-11-26 00:40:08,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 490 states have (on average 2.716326530612245) internal successors, (1331), 503 states have internal predecessors, (1331), 0 states have call successors, (0), 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-11-26 00:40:08,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 1331 transitions. [2022-11-26 00:40:08,184 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 1331 transitions. Word has length 13 [2022-11-26 00:40:08,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:40:08,185 INFO L495 AbstractCegarLoop]: Abstraction has 504 states and 1331 transitions. [2022-11-26 00:40:08,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:40:08,185 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 1331 transitions. [2022-11-26 00:40:08,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-26 00:40:08,186 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:40:08,187 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:40:08,203 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-26 00:40:08,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:40:08,407 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-26 00:40:08,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:40:08,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1358788849, now seen corresponding path program 1 times [2022-11-26 00:40:08,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:40:08,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1406540804] [2022-11-26 00:40:08,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:40:08,409 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:40:08,409 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:40:08,410 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-26 00:40:08,422 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-26 00:40:08,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:40:08,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-26 00:40:08,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:40:08,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:40:08,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:40:08,628 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-26 00:40:08,628 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 23 [2022-11-26 00:40:08,681 INFO L321 Elim1Store]: treesize reduction 17, result has 45.2 percent of original size [2022-11-26 00:40:08,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 38 [2022-11-26 00:40:08,941 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:40:08,941 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:40:09,534 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:40:09,534 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:40:09,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1406540804] [2022-11-26 00:40:09,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1406540804] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:40:09,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1292818653] [2022-11-26 00:40:09,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:40:09,535 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-26 00:40:09,535 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-26 00:40:09,541 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-26 00:40:09,575 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2022-11-26 00:40:09,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:40:09,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-26 00:40:09,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:40:09,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:40:09,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:40:09,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:40:09,928 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2022-11-26 00:40:10,105 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:40:10,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:40:10,334 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:40:10,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1292818653] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:40:10,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614972870] [2022-11-26 00:40:10,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:40:10,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:40:10,335 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:40:10,342 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:40:10,359 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-26 00:40:10,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:40:10,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-26 00:40:10,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:40:10,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:40:10,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:40:10,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:40:10,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2022-11-26 00:40:10,697 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:40:10,697 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:40:10,939 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:40:10,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614972870] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:40:10,939 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-26 00:40:10,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4, 4, 4] total 8 [2022-11-26 00:40:10,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856653772] [2022-11-26 00:40:10,940 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-26 00:40:10,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-26 00:40:10,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:40:10,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-26 00:40:10,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-11-26 00:40:10,941 INFO L87 Difference]: Start difference. First operand 504 states and 1331 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 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-11-26 00:40:14,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:40:14,208 INFO L93 Difference]: Finished difference Result 1330 states and 3544 transitions. [2022-11-26 00:40:14,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-26 00:40:14,210 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 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 14 [2022-11-26 00:40:14,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:40:14,218 INFO L225 Difference]: With dead ends: 1330 [2022-11-26 00:40:14,219 INFO L226 Difference]: Without dead ends: 1330 [2022-11-26 00:40:14,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-11-26 00:40:14,222 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 212 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-11-26 00:40:14,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 0 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-11-26 00:40:14,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states. [2022-11-26 00:40:14,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 928. [2022-11-26 00:40:14,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 928 states, 914 states have (on average 2.8019693654266957) internal successors, (2561), 927 states have internal predecessors, (2561), 0 states have call successors, (0), 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-11-26 00:40:14,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 2561 transitions. [2022-11-26 00:40:14,289 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 2561 transitions. Word has length 14 [2022-11-26 00:40:14,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:40:14,289 INFO L495 AbstractCegarLoop]: Abstraction has 928 states and 2561 transitions. [2022-11-26 00:40:14,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 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-11-26 00:40:14,290 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 2561 transitions. [2022-11-26 00:40:14,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-26 00:40:14,294 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:40:14,294 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:40:14,307 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-26 00:40:14,503 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (13)] Forceful destruction successful, exit code 0 [2022-11-26 00:40:14,715 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-26 00:40:14,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:40:14,901 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-26 00:40:14,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:40:14,902 INFO L85 PathProgramCache]: Analyzing trace with hash 873706265, now seen corresponding path program 1 times [2022-11-26 00:40:14,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:40:14,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1825261592] [2022-11-26 00:40:14,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:40:14,902 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:40:14,903 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:40:14,903 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-26 00:40:14,906 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-11-26 00:40:15,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:40:15,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-26 00:40:15,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:40:15,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-11-26 00:40:15,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:40:15,077 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:40:15,077 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:40:15,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1825261592] [2022-11-26 00:40:15,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1825261592] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:40:15,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:40:15,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:40:15,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342891529] [2022-11-26 00:40:15,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:40:15,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:40:15,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:40:15,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:40:15,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:40:15,080 INFO L87 Difference]: Start difference. First operand 928 states and 2561 transitions. Second operand has 3 states, 3 states have (on average 6.0) 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-11-26 00:40:15,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:40:15,235 INFO L93 Difference]: Finished difference Result 428 states and 1007 transitions. [2022-11-26 00:40:15,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:40:15,237 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) 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-11-26 00:40:15,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:40:15,239 INFO L225 Difference]: With dead ends: 428 [2022-11-26 00:40:15,239 INFO L226 Difference]: Without dead ends: 418 [2022-11-26 00:40:15,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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-11-26 00:40:15,240 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 21 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:40:15,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 0 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:40:15,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2022-11-26 00:40:15,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 372. [2022-11-26 00:40:15,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 366 states have (on average 2.379781420765027) internal successors, (871), 371 states have internal predecessors, (871), 0 states have call successors, (0), 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-11-26 00:40:15,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 871 transitions. [2022-11-26 00:40:15,255 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 871 transitions. Word has length 18 [2022-11-26 00:40:15,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:40:15,255 INFO L495 AbstractCegarLoop]: Abstraction has 372 states and 871 transitions. [2022-11-26 00:40:15,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) 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-11-26 00:40:15,256 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 871 transitions. [2022-11-26 00:40:15,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-26 00:40:15,256 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:40:15,257 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:40:15,272 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-11-26 00:40:15,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:40:15,472 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-26 00:40:15,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:40:15,473 INFO L85 PathProgramCache]: Analyzing trace with hash -184743608, now seen corresponding path program 1 times [2022-11-26 00:40:15,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:40:15,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [30118848] [2022-11-26 00:40:15,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:40:15,474 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:40:15,474 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:40:15,477 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-26 00:40:15,485 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-11-26 00:40:15,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:40:15,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-26 00:40:15,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:40:16,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:40:16,075 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:40:16,075 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:40:16,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [30118848] [2022-11-26 00:40:16,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [30118848] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:40:16,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:40:16,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-26 00:40:16,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565465274] [2022-11-26 00:40:16,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:40:16,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-26 00:40:16,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:40:16,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-26 00:40:16,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-11-26 00:40:16,077 INFO L87 Difference]: Start difference. First operand 372 states and 871 transitions. Second operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:40:18,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:40:18,065 INFO L93 Difference]: Finished difference Result 556 states and 1272 transitions. [2022-11-26 00:40:18,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-26 00:40:18,066 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-26 00:40:18,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:40:18,069 INFO L225 Difference]: With dead ends: 556 [2022-11-26 00:40:18,069 INFO L226 Difference]: Without dead ends: 556 [2022-11-26 00:40:18,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2022-11-26 00:40:18,070 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 105 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 885 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-26 00:40:18,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 0 Invalid, 894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 885 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-26 00:40:18,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2022-11-26 00:40:18,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 444. [2022-11-26 00:40:18,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 438 states have (on average 2.410958904109589) internal successors, (1056), 443 states have internal predecessors, (1056), 0 states have call successors, (0), 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-11-26 00:40:18,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 1056 transitions. [2022-11-26 00:40:18,087 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 1056 transitions. Word has length 19 [2022-11-26 00:40:18,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:40:18,087 INFO L495 AbstractCegarLoop]: Abstraction has 444 states and 1056 transitions. [2022-11-26 00:40:18,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:40:18,088 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 1056 transitions. [2022-11-26 00:40:18,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-26 00:40:18,089 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:40:18,089 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:40:18,112 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2022-11-26 00:40:18,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:40:18,313 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-26 00:40:18,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:40:18,313 INFO L85 PathProgramCache]: Analyzing trace with hash -184743607, now seen corresponding path program 1 times [2022-11-26 00:40:18,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:40:18,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1592982728] [2022-11-26 00:40:18,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:40:18,314 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:40:18,314 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:40:18,315 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-26 00:40:18,316 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-11-26 00:40:18,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:40:18,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-26 00:40:18,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:40:18,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:40:18,532 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:40:18,532 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:40:18,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1592982728] [2022-11-26 00:40:18,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1592982728] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:40:18,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:40:18,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 00:40:18,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68351426] [2022-11-26 00:40:18,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:40:18,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 00:40:18,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:40:18,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 00:40:18,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:40:18,536 INFO L87 Difference]: Start difference. First operand 444 states and 1056 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:40:18,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:40:18,831 INFO L93 Difference]: Finished difference Result 545 states and 1312 transitions. [2022-11-26 00:40:18,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-26 00:40:18,832 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-26 00:40:18,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:40:18,835 INFO L225 Difference]: With dead ends: 545 [2022-11-26 00:40:18,835 INFO L226 Difference]: Without dead ends: 545 [2022-11-26 00:40:18,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 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-11-26 00:40:18,836 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 82 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-26 00:40:18,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 0 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-26 00:40:18,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2022-11-26 00:40:18,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 438. [2022-11-26 00:40:18,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 433 states have (on average 2.397228637413395) internal successors, (1038), 437 states have internal predecessors, (1038), 0 states have call successors, (0), 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-11-26 00:40:18,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 1038 transitions. [2022-11-26 00:40:18,851 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 1038 transitions. Word has length 19 [2022-11-26 00:40:18,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:40:18,852 INFO L495 AbstractCegarLoop]: Abstraction has 438 states and 1038 transitions. [2022-11-26 00:40:18,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:40:18,852 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 1038 transitions. [2022-11-26 00:40:18,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-26 00:40:18,853 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:40:18,853 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:40:18,871 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2022-11-26 00:40:19,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:40:19,066 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-26 00:40:19,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:40:19,067 INFO L85 PathProgramCache]: Analyzing trace with hash 2118828214, now seen corresponding path program 1 times [2022-11-26 00:40:19,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:40:19,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [548036093] [2022-11-26 00:40:19,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:40:19,067 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:40:19,068 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:40:19,069 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-26 00:40:19,115 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-11-26 00:40:19,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:40:19,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-26 00:40:19,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:40:19,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:40:19,217 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:40:19,217 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:40:19,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [548036093] [2022-11-26 00:40:19,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [548036093] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:40:19,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:40:19,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:40:19,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207270022] [2022-11-26 00:40:19,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:40:19,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:40:19,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:40:19,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:40:19,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:40:19,220 INFO L87 Difference]: Start difference. First operand 438 states and 1038 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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-11-26 00:40:19,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:40:19,404 INFO L93 Difference]: Finished difference Result 604 states and 1390 transitions. [2022-11-26 00:40:19,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:40:19,405 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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-11-26 00:40:19,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:40:19,409 INFO L225 Difference]: With dead ends: 604 [2022-11-26 00:40:19,409 INFO L226 Difference]: Without dead ends: 604 [2022-11-26 00:40:19,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 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-11-26 00:40:19,410 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 26 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:40:19,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 0 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 00:40:19,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2022-11-26 00:40:19,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 510. [2022-11-26 00:40:19,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 503 states have (on average 2.353876739562624) internal successors, (1184), 509 states have internal predecessors, (1184), 0 states have call successors, (0), 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-11-26 00:40:19,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 1184 transitions. [2022-11-26 00:40:19,427 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 1184 transitions. Word has length 21 [2022-11-26 00:40:19,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:40:19,428 INFO L495 AbstractCegarLoop]: Abstraction has 510 states and 1184 transitions. [2022-11-26 00:40:19,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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-11-26 00:40:19,428 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 1184 transitions. [2022-11-26 00:40:19,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-26 00:40:19,429 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:40:19,430 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:40:19,450 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-11-26 00:40:19,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:40:19,644 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-26 00:40:19,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:40:19,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1445042664, now seen corresponding path program 1 times [2022-11-26 00:40:19,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:40:19,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [440853380] [2022-11-26 00:40:19,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:40:19,646 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:40:19,646 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:40:19,647 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-26 00:40:19,652 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-11-26 00:40:19,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:40:19,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-26 00:40:19,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:40:19,862 INFO L321 Elim1Store]: treesize reduction 17, result has 45.2 percent of original size [2022-11-26 00:40:19,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 38 [2022-11-26 00:40:20,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 00:40:20,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-26 00:40:20,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-26 00:40:20,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:40:20,602 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:40:20,602 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:40:20,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [440853380] [2022-11-26 00:40:20,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [440853380] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:40:20,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:40:20,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-26 00:40:20,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039625558] [2022-11-26 00:40:20,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:40:20,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-26 00:40:20,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:40:20,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-26 00:40:20,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2022-11-26 00:40:20,604 INFO L87 Difference]: Start difference. First operand 510 states and 1184 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-11-26 00:40:22,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:40:22,590 INFO L93 Difference]: Finished difference Result 689 states and 1583 transitions. [2022-11-26 00:40:22,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-26 00:40:22,592 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-11-26 00:40:22,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:40:22,595 INFO L225 Difference]: With dead ends: 689 [2022-11-26 00:40:22,595 INFO L226 Difference]: Without dead ends: 689 [2022-11-26 00:40:22,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2022-11-26 00:40:22,596 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 120 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 987 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 987 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-26 00:40:22,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 0 Invalid, 994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 987 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-26 00:40:22,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2022-11-26 00:40:22,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 574. [2022-11-26 00:40:22,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 567 states have (on average 2.3439153439153437) internal successors, (1329), 573 states have internal predecessors, (1329), 0 states have call successors, (0), 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-11-26 00:40:22,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 1329 transitions. [2022-11-26 00:40:22,618 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 1329 transitions. Word has length 21 [2022-11-26 00:40:22,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:40:22,618 INFO L495 AbstractCegarLoop]: Abstraction has 574 states and 1329 transitions. [2022-11-26 00:40:22,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-11-26 00:40:22,619 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 1329 transitions. [2022-11-26 00:40:22,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-26 00:40:22,620 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:40:22,620 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:40:22,640 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-11-26 00:40:22,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:40:22,836 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-26 00:40:22,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:40:22,839 INFO L85 PathProgramCache]: Analyzing trace with hash 2099656058, now seen corresponding path program 2 times [2022-11-26 00:40:22,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:40:22,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [220116517] [2022-11-26 00:40:22,840 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-26 00:40:22,840 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:40:22,840 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:40:22,841 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-26 00:40:22,852 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-11-26 00:40:23,012 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-26 00:40:23,012 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:40:23,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-26 00:40:23,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:40:23,054 INFO L321 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2022-11-26 00:40:23,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 24 [2022-11-26 00:40:23,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 00:40:23,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-26 00:40:23,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-26 00:40:23,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:40:23,801 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:40:23,802 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:40:23,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [220116517] [2022-11-26 00:40:23,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [220116517] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:40:23,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:40:23,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-26 00:40:23,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255044746] [2022-11-26 00:40:23,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:40:23,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-26 00:40:23,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:40:23,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-26 00:40:23,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2022-11-26 00:40:23,804 INFO L87 Difference]: Start difference. First operand 574 states and 1329 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-11-26 00:40:26,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:40:26,587 INFO L93 Difference]: Finished difference Result 674 states and 1520 transitions. [2022-11-26 00:40:26,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-26 00:40:26,588 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-11-26 00:40:26,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:40:26,591 INFO L225 Difference]: With dead ends: 674 [2022-11-26 00:40:26,592 INFO L226 Difference]: Without dead ends: 674 [2022-11-26 00:40:26,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=147, Invalid=665, Unknown=0, NotChecked=0, Total=812 [2022-11-26 00:40:26,593 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 138 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1314 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-26 00:40:26,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 0 Invalid, 1324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1314 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-26 00:40:26,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2022-11-26 00:40:26,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 520. [2022-11-26 00:40:26,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 513 states have (on average 2.345029239766082) internal successors, (1203), 519 states have internal predecessors, (1203), 0 states have call successors, (0), 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-11-26 00:40:26,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 1203 transitions. [2022-11-26 00:40:26,610 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 1203 transitions. Word has length 21 [2022-11-26 00:40:26,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:40:26,611 INFO L495 AbstractCegarLoop]: Abstraction has 520 states and 1203 transitions. [2022-11-26 00:40:26,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-11-26 00:40:26,611 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 1203 transitions. [2022-11-26 00:40:26,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-26 00:40:26,612 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:40:26,613 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2022-11-26 00:40:26,651 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-11-26 00:40:26,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:40:26,847 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-26 00:40:26,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:40:26,848 INFO L85 PathProgramCache]: Analyzing trace with hash 105547241, now seen corresponding path program 1 times [2022-11-26 00:40:26,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:40:26,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1883782807] [2022-11-26 00:40:26,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:40:26,849 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:40:26,849 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:40:26,850 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-26 00:40:26,857 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-11-26 00:40:27,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:40:27,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-26 00:40:27,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:40:27,099 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:40:27,099 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:40:27,198 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:40:27,199 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:40:27,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1883782807] [2022-11-26 00:40:27,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1883782807] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:40:27,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [709101983] [2022-11-26 00:40:27,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:40:27,199 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-26 00:40:27,199 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-26 00:40:27,200 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-26 00:40:27,202 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2022-11-26 00:40:27,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:40:27,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-26 00:40:27,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:40:27,445 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:40:27,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:40:27,490 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:40:27,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [709101983] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:40:27,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [886038859] [2022-11-26 00:40:27,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:40:27,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:40:27,491 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:40:27,493 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:40:27,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-26 00:40:27,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:40:27,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-26 00:40:27,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:40:27,691 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:40:27,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:40:27,740 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:40:27,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [886038859] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:40:27,741 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-26 00:40:27,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6, 6] total 11 [2022-11-26 00:40:27,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199467661] [2022-11-26 00:40:27,742 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-26 00:40:27,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-26 00:40:27,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:40:27,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-26 00:40:27,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-11-26 00:40:27,744 INFO L87 Difference]: Start difference. First operand 520 states and 1203 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 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-11-26 00:40:28,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:40:28,857 INFO L93 Difference]: Finished difference Result 1200 states and 2736 transitions. [2022-11-26 00:40:28,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-26 00:40:28,857 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 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-11-26 00:40:28,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:40:28,863 INFO L225 Difference]: With dead ends: 1200 [2022-11-26 00:40:28,863 INFO L226 Difference]: Without dead ends: 1200 [2022-11-26 00:40:28,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2022-11-26 00:40:28,864 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 230 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-26 00:40:28,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 0 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-26 00:40:28,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2022-11-26 00:40:28,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 822. [2022-11-26 00:40:28,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 822 states, 815 states have (on average 2.4134969325153373) internal successors, (1967), 821 states have internal predecessors, (1967), 0 states have call successors, (0), 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-11-26 00:40:28,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1967 transitions. [2022-11-26 00:40:28,894 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1967 transitions. Word has length 22 [2022-11-26 00:40:28,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:40:28,894 INFO L495 AbstractCegarLoop]: Abstraction has 822 states and 1967 transitions. [2022-11-26 00:40:28,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 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-11-26 00:40:28,895 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1967 transitions. [2022-11-26 00:40:28,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-26 00:40:28,896 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:40:28,896 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:40:28,907 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-11-26 00:40:29,112 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-11-26 00:40:29,305 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (22)] Forceful destruction successful, exit code 0 [2022-11-26 00:40:29,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt [2022-11-26 00:40:29,503 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-26 00:40:29,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:40:29,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1280017083, now seen corresponding path program 1 times [2022-11-26 00:40:29,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:40:29,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [503033348] [2022-11-26 00:40:29,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:40:29,504 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:40:29,504 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:40:29,506 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-26 00:40:29,508 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-11-26 00:40:29,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:40:29,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-26 00:40:29,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:40:29,657 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:40:29,658 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:40:29,658 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:40:29,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [503033348] [2022-11-26 00:40:29,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [503033348] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:40:29,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:40:29,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:40:29,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907935137] [2022-11-26 00:40:29,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:40:29,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:40:29,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:40:29,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:40:29,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:40:29,662 INFO L87 Difference]: Start difference. First operand 822 states and 1967 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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-11-26 00:40:29,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:40:29,803 INFO L93 Difference]: Finished difference Result 770 states and 1733 transitions. [2022-11-26 00:40:29,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:40:29,804 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-11-26 00:40:29,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:40:29,808 INFO L225 Difference]: With dead ends: 770 [2022-11-26 00:40:29,808 INFO L226 Difference]: Without dead ends: 770 [2022-11-26 00:40:29,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 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-11-26 00:40:29,810 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 29 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:40:29,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 0 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:40:29,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2022-11-26 00:40:29,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 770. [2022-11-26 00:40:29,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 763 states have (on average 2.27129750982962) internal successors, (1733), 769 states have internal predecessors, (1733), 0 states have call successors, (0), 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-11-26 00:40:29,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1733 transitions. [2022-11-26 00:40:29,837 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1733 transitions. Word has length 23 [2022-11-26 00:40:29,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:40:29,837 INFO L495 AbstractCegarLoop]: Abstraction has 770 states and 1733 transitions. [2022-11-26 00:40:29,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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-11-26 00:40:29,838 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1733 transitions. [2022-11-26 00:40:29,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-26 00:40:29,842 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:40:29,842 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:40:29,861 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2022-11-26 00:40:30,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:40:30,056 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-26 00:40:30,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:40:30,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1789665085, now seen corresponding path program 2 times [2022-11-26 00:40:30,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:40:30,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1408552887] [2022-11-26 00:40:30,057 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-26 00:40:30,058 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:40:30,058 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:40:30,060 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-26 00:40:30,099 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-11-26 00:40:30,204 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-26 00:40:30,204 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:40:30,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-26 00:40:30,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:40:30,254 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-26 00:40:30,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:40:30,331 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-26 00:40:30,331 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:40:30,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1408552887] [2022-11-26 00:40:30,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1408552887] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:40:30,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [254798950] [2022-11-26 00:40:30,331 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-26 00:40:30,332 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-26 00:40:30,332 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-26 00:40:30,333 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-26 00:40:30,335 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2022-11-26 00:40:30,568 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-26 00:40:30,568 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:40:30,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-26 00:40:30,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:40:30,603 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-26 00:40:30,603 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:40:30,655 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-26 00:40:30,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [254798950] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:40:30,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807851571] [2022-11-26 00:40:30,656 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-26 00:40:30,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:40:30,656 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:40:30,657 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:40:30,683 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-11-26 00:40:30,805 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-26 00:40:30,805 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:40:30,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-26 00:40:30,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:40:30,839 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-26 00:40:30,839 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:40:30,888 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-26 00:40:30,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [807851571] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:40:30,888 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-26 00:40:30,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4, 4, 4] total 6 [2022-11-26 00:40:30,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061207696] [2022-11-26 00:40:30,888 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-26 00:40:30,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-26 00:40:30,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:40:30,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-26 00:40:30,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-26 00:40:30,890 INFO L87 Difference]: Start difference. First operand 770 states and 1733 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 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-11-26 00:40:31,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:40:31,310 INFO L93 Difference]: Finished difference Result 1272 states and 2782 transitions. [2022-11-26 00:40:31,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-26 00:40:31,311 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 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 23 [2022-11-26 00:40:31,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:40:31,316 INFO L225 Difference]: With dead ends: 1272 [2022-11-26 00:40:31,316 INFO L226 Difference]: Without dead ends: 1272 [2022-11-26 00:40:31,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-11-26 00:40:31,318 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 124 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-26 00:40:31,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 0 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-26 00:40:31,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1272 states. [2022-11-26 00:40:31,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1272 to 1248. [2022-11-26 00:40:31,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1248 states, 1239 states have (on average 2.229217110573043) internal successors, (2762), 1247 states have internal predecessors, (2762), 0 states have call successors, (0), 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-11-26 00:40:31,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1248 states to 1248 states and 2762 transitions. [2022-11-26 00:40:31,352 INFO L78 Accepts]: Start accepts. Automaton has 1248 states and 2762 transitions. Word has length 23 [2022-11-26 00:40:31,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:40:31,353 INFO L495 AbstractCegarLoop]: Abstraction has 1248 states and 2762 transitions. [2022-11-26 00:40:31,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 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-11-26 00:40:31,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1248 states and 2762 transitions. [2022-11-26 00:40:31,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-26 00:40:31,354 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:40:31,354 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:40:31,359 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (26)] Ended with exit code 0 [2022-11-26 00:40:31,565 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Ended with exit code 0 [2022-11-26 00:40:31,763 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-11-26 00:40:31,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:40:31,958 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-26 00:40:31,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:40:31,959 INFO L85 PathProgramCache]: Analyzing trace with hash -806831807, now seen corresponding path program 1 times [2022-11-26 00:40:31,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:40:31,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [768009948] [2022-11-26 00:40:31,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:40:31,959 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:40:31,959 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:40:31,960 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-26 00:40:31,961 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-11-26 00:40:32,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-26 00:40:32,154 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-26 00:40:32,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-26 00:40:32,305 INFO L130 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2022-11-26 00:40:32,306 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-26 00:40:32,307 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location t2Err2ASSERT_VIOLATIONMEMORY_LEAK (22 of 23 remaining) [2022-11-26 00:40:32,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 23 remaining) [2022-11-26 00:40:32,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 23 remaining) [2022-11-26 00:40:32,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 23 remaining) [2022-11-26 00:40:32,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 23 remaining) [2022-11-26 00:40:32,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 23 remaining) [2022-11-26 00:40:32,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 23 remaining) [2022-11-26 00:40:32,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 23 remaining) [2022-11-26 00:40:32,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 23 remaining) [2022-11-26 00:40:32,312 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (13 of 23 remaining) [2022-11-26 00:40:32,312 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 23 remaining) [2022-11-26 00:40:32,312 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 23 remaining) [2022-11-26 00:40:32,312 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 23 remaining) [2022-11-26 00:40:32,312 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 23 remaining) [2022-11-26 00:40:32,313 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONMEMORY_LEAK (8 of 23 remaining) [2022-11-26 00:40:32,313 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2ASSERT_VIOLATIONMEMORY_LEAK (7 of 23 remaining) [2022-11-26 00:40:32,313 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 23 remaining) [2022-11-26 00:40:32,313 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 23 remaining) [2022-11-26 00:40:32,313 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 23 remaining) [2022-11-26 00:40:32,314 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 23 remaining) [2022-11-26 00:40:32,314 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONMEMORY_LEAK (2 of 23 remaining) [2022-11-26 00:40:32,314 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 23 remaining) [2022-11-26 00:40:32,314 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 23 remaining) [2022-11-26 00:40:32,330 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2022-11-26 00:40:32,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:40:32,532 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:40:32,537 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-26 00:40:32,538 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-26 00:40:32,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 12:40:32 BasicIcfg [2022-11-26 00:40:32,633 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-26 00:40:32,634 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-26 00:40:32,634 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-26 00:40:32,634 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-26 00:40:32,635 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:39:41" (3/4) ... [2022-11-26 00:40:32,638 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-26 00:40:32,638 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-26 00:40:32,639 INFO L158 Benchmark]: Toolchain (without parser) took 53374.11ms. Allocated memory was 86.0MB in the beginning and 138.4MB in the end (delta: 52.4MB). Free memory was 66.2MB in the beginning and 84.9MB in the end (delta: -18.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2022-11-26 00:40:32,639 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 86.0MB. Free memory is still 63.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-26 00:40:32,640 INFO L158 Benchmark]: CACSL2BoogieTranslator took 929.67ms. Allocated memory is still 86.0MB. Free memory was 66.2MB in the beginning and 59.0MB in the end (delta: 7.2MB). Peak memory consumption was 30.8MB. Max. memory is 16.1GB. [2022-11-26 00:40:32,645 INFO L158 Benchmark]: Boogie Procedure Inliner took 106.75ms. Allocated memory is still 86.0MB. Free memory was 59.0MB in the beginning and 56.1MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-26 00:40:32,645 INFO L158 Benchmark]: Boogie Preprocessor took 42.86ms. Allocated memory is still 86.0MB. Free memory was 56.1MB in the beginning and 54.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-26 00:40:32,646 INFO L158 Benchmark]: RCFGBuilder took 889.99ms. Allocated memory was 86.0MB in the beginning and 115.3MB in the end (delta: 29.4MB). Free memory was 54.1MB in the beginning and 88.7MB in the end (delta: -34.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-26 00:40:32,646 INFO L158 Benchmark]: TraceAbstraction took 51390.37ms. Allocated memory was 115.3MB in the beginning and 138.4MB in the end (delta: 23.1MB). Free memory was 88.0MB in the beginning and 86.0MB in the end (delta: 2.1MB). Peak memory consumption was 25.8MB. Max. memory is 16.1GB. [2022-11-26 00:40:32,647 INFO L158 Benchmark]: Witness Printer took 4.46ms. Allocated memory is still 138.4MB. Free memory was 86.0MB in the beginning and 84.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-26 00:40:32,649 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.39ms. Allocated memory is still 86.0MB. Free memory is still 63.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 929.67ms. Allocated memory is still 86.0MB. Free memory was 66.2MB in the beginning and 59.0MB in the end (delta: 7.2MB). Peak memory consumption was 30.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 106.75ms. Allocated memory is still 86.0MB. Free memory was 59.0MB in the beginning and 56.1MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.86ms. Allocated memory is still 86.0MB. Free memory was 56.1MB in the beginning and 54.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 889.99ms. Allocated memory was 86.0MB in the beginning and 115.3MB in the end (delta: 29.4MB). Free memory was 54.1MB in the beginning and 88.7MB in the end (delta: -34.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 51390.37ms. Allocated memory was 115.3MB in the beginning and 138.4MB in the end (delta: 23.1MB). Free memory was 88.0MB in the beginning and 86.0MB in the end (delta: 2.1MB). Peak memory consumption was 25.8MB. Max. memory is 16.1GB. * Witness Printer took 4.46ms. Allocated memory is still 138.4MB. Free memory was 86.0MB in the beginning and 84.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 18.8s, 192 PlacesBefore, 51 PlacesAfterwards, 195 TransitionsBefore, 50 TransitionsAfterwards, 10398 CoEnabledTransitionPairs, 7 FixpointIterations, 56 TrivialSequentialCompositions, 120 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 23 ConcurrentYvCompositions, 4 ChoiceCompositions, 203 TotalNumberOfCompositions, 15857 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 12465, independent: 12227, independent conditional: 0, independent unconditional: 12227, dependent: 238, dependent conditional: 0, dependent unconditional: 238, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7411, independent: 7341, independent conditional: 0, independent unconditional: 7341, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7411, independent: 7314, independent conditional: 0, independent unconditional: 7314, dependent: 97, dependent conditional: 0, dependent unconditional: 97, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 97, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 547, independent: 52, independent conditional: 0, independent unconditional: 52, dependent: 495, dependent conditional: 0, dependent unconditional: 495, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12465, independent: 4886, independent conditional: 0, independent unconditional: 4886, dependent: 168, dependent conditional: 0, dependent unconditional: 168, unknown: 7411, unknown conditional: 0, unknown unconditional: 7411] , Statistics on independence cache: Total cache size (in pairs): 434, Positive cache size: 408, Positive conditional cache size: 0, Positive unconditional cache size: 408, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - 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: 941]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 941. Possible FailurePath: [L935] 0 static int top=0; [L936] 0 static unsigned int arr[(5)]; [L937] 0 pthread_mutex_t m; [L938] 0 _Bool flag=(0); [L1021] 0 pthread_t id1, id2; [L1023] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [arr={3:0}, flag=0, id1={15:0}, id2={7:0}, m={4:0}, pthread_create(&id1, ((void *)0), t1, ((void *)0))=-1, top=0] [L990] 1 int i; [L991] 1 unsigned int tmp; [L992] 1 i=0 VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L992] COND TRUE 1 i<(5) [L995] 1 tmp = __VERIFIER_nondet_uint() [L996] CALL 1 assume_abort_if_not(tmp < (5)) [L23] COND FALSE 1 !(!cond) [L996] RET 1 assume_abort_if_not(tmp < (5)) [L997] CALL, EXPR 1 push(arr,tmp) [L962] COND FALSE 1 !(top==(5)) [L969] CALL, EXPR 1 get_top() [L954] 1 return top; [L969] RET, EXPR 1 get_top() [L969] 1 stack[get_top()] = x [L1024] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [arr={3:0}, flag=0, id1={15:0}, id2={7:0}, m={4:0}, pthread_create(&id2, ((void *)0), t2, ((void *)0))=0, top=0] [L1006] 2 int i; [L1007] 2 i=0 VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L970] CALL 1 inc_top() [L946] 1 top++ [L970] RET 1 inc_top() [L972] 1 return 0; [L997] RET, EXPR 1 push(arr,tmp) [L997] COND FALSE 1 !(push(arr,tmp)==(-1)) [L999] 1 flag=(1) VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=0, m={4:0}, tmp=0, top=1] [L992] 1 i++ VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, tmp=0, top=1] [L1007] COND TRUE 2 i<(5) [L1010] COND TRUE 2 \read(flag) [L1012] CALL, EXPR 2 pop(arr) [L976] CALL, EXPR 2 get_top() [L954] 2 return top; [L976] RET, EXPR 2 get_top() [L976] COND FALSE 2 !(get_top()==0) [L983] CALL 2 dec_top() [L950] 2 top-- [L983] RET 2 dec_top() [L984] CALL, EXPR 2 get_top() [L954] 2 return top; [L984] RET, EXPR 2 get_top() [L984] EXPR 2 stack[get_top()] [L984] 2 return stack[get_top()]; [L1012] RET, EXPR 2 pop(arr) [L1012] COND FALSE 2 !(!(pop(arr)!=(-2))) [L1007] 2 i++ VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, top=0] [L1007] COND TRUE 2 i<(5) [L1010] COND TRUE 2 \read(flag) [L1012] CALL, EXPR 2 pop(arr) [L976] CALL, EXPR 2 get_top() [L954] 2 return top; [L976] RET, EXPR 2 get_top() [L976] COND TRUE 2 get_top()==0 [L979] 2 return (-2); [L1012] RET, EXPR 2 pop(arr) [L1012] COND TRUE 2 !(pop(arr)!=(-2)) [L1013] CALL 2 error() [L941] 2 reach_error() VAL [arr={3:0}, flag=1, m={4:0}, top=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: 1019]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1024]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1023]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) 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: 941]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 303 locations, 23 error locations. Started 1 CEGAR loops. OverallTime: 51.0s, OverallIterations: 21, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 15.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 18.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1391 SdHoareTripleChecker+Valid, 11.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1391 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 10.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 53 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5737 IncrementalHoareTripleChecker+Invalid, 5790 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 53 mSolverCounterUnsat, 0 mSDtfsCounter, 5737 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 573 GetRequests, 449 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1248occurred in iteration=20, InterpolantAutomatonStates: 123, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 20 MinimizatonAttempts, 1735 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 403 NumberOfCodeBlocks, 385 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 521 ConstructedInterpolants, 10 QuantifiedInterpolants, 3908 SizeOfPredicates, 114 NumberOfNonLiveVariables, 2790 ConjunctsInSsa, 239 ConjunctsInUnsatCore, 35 InterpolantComputations, 17 PerfectInterpolantSequences, 21/117 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-11-26 00:40:32,694 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80869250-ddaa-4eff-b148-ae62f966a0b6/bin/utaipan-ByfvJB40ur/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