./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix009.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4588e1a9-8acb-491a-82e3-194ba0513df7/bin/utaipan-Xvt2sAort0/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4588e1a9-8acb-491a-82e3-194ba0513df7/bin/utaipan-Xvt2sAort0/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4588e1a9-8acb-491a-82e3-194ba0513df7/bin/utaipan-Xvt2sAort0/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4588e1a9-8acb-491a-82e3-194ba0513df7/bin/utaipan-Xvt2sAort0/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix009.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4588e1a9-8acb-491a-82e3-194ba0513df7/bin/utaipan-Xvt2sAort0/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4588e1a9-8acb-491a-82e3-194ba0513df7/bin/utaipan-Xvt2sAort0 --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 f715026b68e9c0bb30969d2f1713e0cf615763357ccfdf3c82e016d450119958 --- 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-e04fb08 [2022-11-16 19:25:55,227 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 19:25:55,229 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 19:25:55,254 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 19:25:55,257 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 19:25:55,261 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 19:25:55,264 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 19:25:55,266 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 19:25:55,270 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 19:25:55,273 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 19:25:55,281 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 19:25:55,282 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 19:25:55,284 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 19:25:55,286 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 19:25:55,288 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 19:25:55,290 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 19:25:55,291 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 19:25:55,293 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 19:25:55,294 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 19:25:55,301 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 19:25:55,303 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 19:25:55,304 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 19:25:55,305 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 19:25:55,306 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 19:25:55,309 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 19:25:55,310 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 19:25:55,310 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 19:25:55,311 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 19:25:55,311 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 19:25:55,312 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 19:25:55,313 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 19:25:55,313 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 19:25:55,314 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 19:25:55,315 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 19:25:55,316 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 19:25:55,316 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 19:25:55,317 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 19:25:55,317 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 19:25:55,318 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 19:25:55,319 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 19:25:55,319 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 19:25:55,320 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4588e1a9-8acb-491a-82e3-194ba0513df7/bin/utaipan-Xvt2sAort0/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-16 19:25:55,341 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 19:25:55,342 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 19:25:55,342 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 19:25:55,342 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 19:25:55,343 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 19:25:55,343 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 19:25:55,344 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-16 19:25:55,344 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-16 19:25:55,344 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-16 19:25:55,344 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-16 19:25:55,345 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-16 19:25:55,345 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-16 19:25:55,345 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-16 19:25:55,345 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-16 19:25:55,345 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-16 19:25:55,346 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-16 19:25:55,346 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-16 19:25:55,346 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-16 19:25:55,347 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 19:25:55,347 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 19:25:55,347 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 19:25:55,348 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 19:25:55,348 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 19:25:55,348 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 19:25:55,348 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 19:25:55,349 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 19:25:55,349 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-16 19:25:55,349 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-16 19:25:55,349 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-16 19:25:55,349 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 19:25:55,350 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 19:25:55,350 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 19:25:55,350 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 19:25:55,350 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 19:25:55,350 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 19:25:55,351 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 19:25:55,351 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 19:25:55,351 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-16 19:25:55,351 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 19:25:55,351 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-16 19:25:55,351 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 19:25:55,352 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-16 19:25:55,352 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_4588e1a9-8acb-491a-82e3-194ba0513df7/bin/utaipan-Xvt2sAort0/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_4588e1a9-8acb-491a-82e3-194ba0513df7/bin/utaipan-Xvt2sAort0 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 -> f715026b68e9c0bb30969d2f1713e0cf615763357ccfdf3c82e016d450119958 [2022-11-16 19:25:55,622 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 19:25:55,643 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 19:25:55,645 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 19:25:55,647 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 19:25:55,647 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 19:25:55,649 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4588e1a9-8acb-491a-82e3-194ba0513df7/bin/utaipan-Xvt2sAort0/../../sv-benchmarks/c/pthread-wmm/mix009.opt.i [2022-11-16 19:25:55,723 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4588e1a9-8acb-491a-82e3-194ba0513df7/bin/utaipan-Xvt2sAort0/data/9d28c4d3c/9dd9f7fe6edd456db60807206427d026/FLAGe7b523746 [2022-11-16 19:25:56,344 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 19:25:56,344 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4588e1a9-8acb-491a-82e3-194ba0513df7/sv-benchmarks/c/pthread-wmm/mix009.opt.i [2022-11-16 19:25:56,373 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4588e1a9-8acb-491a-82e3-194ba0513df7/bin/utaipan-Xvt2sAort0/data/9d28c4d3c/9dd9f7fe6edd456db60807206427d026/FLAGe7b523746 [2022-11-16 19:25:56,700 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4588e1a9-8acb-491a-82e3-194ba0513df7/bin/utaipan-Xvt2sAort0/data/9d28c4d3c/9dd9f7fe6edd456db60807206427d026 [2022-11-16 19:25:56,703 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 19:25:56,706 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 19:25:56,709 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 19:25:56,709 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 19:25:56,712 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 19:25:56,713 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:25:56" (1/1) ... [2022-11-16 19:25:56,714 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ebd2e72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:25:56, skipping insertion in model container [2022-11-16 19:25:56,715 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:25:56" (1/1) ... [2022-11-16 19:25:56,722 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 19:25:56,783 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 19:25:57,025 WARN L229 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_4588e1a9-8acb-491a-82e3-194ba0513df7/sv-benchmarks/c/pthread-wmm/mix009.opt.i[987,1000] [2022-11-16 19:25:57,253 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 19:25:57,270 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 19:25:57,285 WARN L229 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_4588e1a9-8acb-491a-82e3-194ba0513df7/sv-benchmarks/c/pthread-wmm/mix009.opt.i[987,1000] [2022-11-16 19:25:57,358 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 19:25:57,407 INFO L208 MainTranslator]: Completed translation [2022-11-16 19:25:57,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:25:57 WrapperNode [2022-11-16 19:25:57,408 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 19:25:57,409 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 19:25:57,409 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 19:25:57,409 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 19:25:57,418 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:25:57" (1/1) ... [2022-11-16 19:25:57,451 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:25:57" (1/1) ... [2022-11-16 19:25:57,490 INFO L138 Inliner]: procedures = 175, calls = 47, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 134 [2022-11-16 19:25:57,493 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 19:25:57,494 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 19:25:57,494 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 19:25:57,495 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 19:25:57,503 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:25:57" (1/1) ... [2022-11-16 19:25:57,505 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:25:57" (1/1) ... [2022-11-16 19:25:57,518 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:25:57" (1/1) ... [2022-11-16 19:25:57,519 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:25:57" (1/1) ... [2022-11-16 19:25:57,530 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:25:57" (1/1) ... [2022-11-16 19:25:57,550 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:25:57" (1/1) ... [2022-11-16 19:25:57,552 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:25:57" (1/1) ... [2022-11-16 19:25:57,553 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:25:57" (1/1) ... [2022-11-16 19:25:57,556 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 19:25:57,557 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 19:25:57,557 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 19:25:57,557 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 19:25:57,558 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:25:57" (1/1) ... [2022-11-16 19:25:57,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 19:25:57,588 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4588e1a9-8acb-491a-82e3-194ba0513df7/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 19:25:57,601 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4588e1a9-8acb-491a-82e3-194ba0513df7/bin/utaipan-Xvt2sAort0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 19:25:57,627 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4588e1a9-8acb-491a-82e3-194ba0513df7/bin/utaipan-Xvt2sAort0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 19:25:57,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 19:25:57,655 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 19:25:57,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 19:25:57,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 19:25:57,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 19:25:57,655 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-16 19:25:57,655 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-16 19:25:57,655 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-16 19:25:57,656 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-16 19:25:57,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 19:25:57,656 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 19:25:57,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 19:25:57,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 19:25:57,657 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 19:25:57,872 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 19:25:57,874 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 19:25:58,211 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 19:25:58,367 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 19:25:58,367 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-16 19:25:58,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 07:25:58 BoogieIcfgContainer [2022-11-16 19:25:58,370 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 19:25:58,372 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 19:25:58,372 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 19:25:58,375 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 19:25:58,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 07:25:56" (1/3) ... [2022-11-16 19:25:58,376 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@83f9ed5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:25:58, skipping insertion in model container [2022-11-16 19:25:58,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:25:57" (2/3) ... [2022-11-16 19:25:58,377 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@83f9ed5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:25:58, skipping insertion in model container [2022-11-16 19:25:58,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 07:25:58" (3/3) ... [2022-11-16 19:25:58,378 INFO L112 eAbstractionObserver]: Analyzing ICFG mix009.opt.i [2022-11-16 19:25:58,396 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 19:25:58,396 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2022-11-16 19:25:58,397 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 19:25:58,472 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-16 19:25:58,520 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-16 19:25:58,535 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 108 transitions, 226 flow [2022-11-16 19:25:58,538 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 108 transitions, 226 flow [2022-11-16 19:25:58,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 108 transitions, 226 flow [2022-11-16 19:25:58,616 INFO L130 PetriNetUnfolder]: 2/106 cut-off events. [2022-11-16 19:25:58,617 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 19:25:58,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 106 events. 2/106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 65 event pairs, 0 based on Foata normal form. 0/97 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2022-11-16 19:25:58,624 INFO L119 LiptonReduction]: Number of co-enabled transitions 1444 [2022-11-16 19:26:03,949 INFO L134 LiptonReduction]: Checked pairs total: 3623 [2022-11-16 19:26:03,949 INFO L136 LiptonReduction]: Total number of compositions: 110 [2022-11-16 19:26:03,963 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 33 places, 27 transitions, 64 flow [2022-11-16 19:26:04,022 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 244 states, 235 states have (on average 2.6425531914893616) internal successors, (621), 243 states have internal predecessors, (621), 0 states have call successors, (0), 0 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-16 19:26:04,046 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 19:26:04,057 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;@50066594, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 19:26:04,057 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2022-11-16 19:26:04,062 INFO L276 IsEmpty]: Start isEmpty. Operand has 244 states, 235 states have (on average 2.6425531914893616) internal successors, (621), 243 states have internal predecessors, (621), 0 states have call successors, (0), 0 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-16 19:26:04,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-16 19:26:04,068 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:26:04,069 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-16 19:26:04,070 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 19:26:04,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:26:04,078 INFO L85 PathProgramCache]: Analyzing trace with hash 498, now seen corresponding path program 1 times [2022-11-16 19:26:04,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:26:04,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276566585] [2022-11-16 19:26:04,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:26:04,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:26:04,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:26:04,225 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-16 19:26:04,226 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:26:04,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276566585] [2022-11-16 19:26:04,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276566585] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:26:04,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:26:04,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-16 19:26:04,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721099637] [2022-11-16 19:26:04,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:26:04,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 19:26:04,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:26:04,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 19:26:04,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 19:26:04,264 INFO L87 Difference]: Start difference. First operand has 244 states, 235 states have (on average 2.6425531914893616) internal successors, (621), 243 states have internal predecessors, (621), 0 states have call successors, (0), 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-16 19:26:04,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:26:04,364 INFO L93 Difference]: Finished difference Result 232 states and 566 transitions. [2022-11-16 19:26:04,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 19:26:04,366 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-16 19:26:04,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:26:04,383 INFO L225 Difference]: With dead ends: 232 [2022-11-16 19:26:04,383 INFO L226 Difference]: Without dead ends: 232 [2022-11-16 19:26:04,384 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-16 19:26:04,389 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 19:26:04,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 19:26:04,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-11-16 19:26:04,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2022-11-16 19:26:04,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 227 states have (on average 2.4933920704845813) internal successors, (566), 231 states have internal predecessors, (566), 0 states have call successors, (0), 0 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-16 19:26:04,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 566 transitions. [2022-11-16 19:26:04,469 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 566 transitions. Word has length 1 [2022-11-16 19:26:04,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:26:04,470 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 566 transitions. [2022-11-16 19:26:04,473 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-16 19:26:04,474 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 566 transitions. [2022-11-16 19:26:04,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-16 19:26:04,476 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:26:04,476 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-16 19:26:04,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 19:26:04,477 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 19:26:04,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:26:04,478 INFO L85 PathProgramCache]: Analyzing trace with hash 472003756, now seen corresponding path program 1 times [2022-11-16 19:26:04,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:26:04,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563227421] [2022-11-16 19:26:04,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:26:04,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:26:04,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:26:04,826 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-16 19:26:04,827 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:26:04,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563227421] [2022-11-16 19:26:04,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563227421] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:26:04,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:26:04,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 19:26:04,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963056334] [2022-11-16 19:26:04,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:26:04,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 19:26:04,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:26:04,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 19:26:04,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 19:26:04,841 INFO L87 Difference]: Start difference. First operand 232 states and 566 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-16 19:26:04,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:26:04,911 INFO L93 Difference]: Finished difference Result 197 states and 473 transitions. [2022-11-16 19:26:04,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 19:26:04,912 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-16 19:26:04,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:26:04,916 INFO L225 Difference]: With dead ends: 197 [2022-11-16 19:26:04,916 INFO L226 Difference]: Without dead ends: 192 [2022-11-16 19:26:04,918 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-16 19:26:04,919 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 8 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 19:26:04,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 19:26:04,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-11-16 19:26:04,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2022-11-16 19:26:04,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 190 states have (on average 2.442105263157895) internal successors, (464), 191 states have internal predecessors, (464), 0 states have call successors, (0), 0 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-16 19:26:04,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 464 transitions. [2022-11-16 19:26:04,941 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 464 transitions. Word has length 5 [2022-11-16 19:26:04,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:26:04,941 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 464 transitions. [2022-11-16 19:26:04,941 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-16 19:26:04,942 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 464 transitions. [2022-11-16 19:26:04,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-16 19:26:04,942 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:26:04,942 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:26:04,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 19:26:04,943 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 19:26:04,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:26:04,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1670862337, now seen corresponding path program 1 times [2022-11-16 19:26:04,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:26:04,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848286472] [2022-11-16 19:26:04,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:26:04,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:26:05,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:26:05,280 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-16 19:26:05,281 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:26:05,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848286472] [2022-11-16 19:26:05,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848286472] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:26:05,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:26:05,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 19:26:05,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978529687] [2022-11-16 19:26:05,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:26:05,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 19:26:05,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:26:05,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 19:26:05,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 19:26:05,283 INFO L87 Difference]: Start difference. First operand 192 states and 464 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:26:05,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:26:05,368 INFO L93 Difference]: Finished difference Result 240 states and 560 transitions. [2022-11-16 19:26:05,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 19:26:05,369 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-16 19:26:05,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:26:05,372 INFO L225 Difference]: With dead ends: 240 [2022-11-16 19:26:05,372 INFO L226 Difference]: Without dead ends: 240 [2022-11-16 19:26:05,373 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-16 19:26:05,374 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 7 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 19:26:05,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 19:26:05,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2022-11-16 19:26:05,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 188. [2022-11-16 19:26:05,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 186 states have (on average 2.4301075268817205) internal successors, (452), 187 states have internal predecessors, (452), 0 states have call successors, (0), 0 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-16 19:26:05,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 452 transitions. [2022-11-16 19:26:05,384 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 452 transitions. Word has length 7 [2022-11-16 19:26:05,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:26:05,384 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 452 transitions. [2022-11-16 19:26:05,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:26:05,385 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 452 transitions. [2022-11-16 19:26:05,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-16 19:26:05,386 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:26:05,386 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:26:05,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 19:26:05,386 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 19:26:05,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:26:05,387 INFO L85 PathProgramCache]: Analyzing trace with hash -257124223, now seen corresponding path program 1 times [2022-11-16 19:26:05,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:26:05,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346908546] [2022-11-16 19:26:05,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:26:05,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:26:05,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:26:05,745 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-16 19:26:05,745 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:26:05,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346908546] [2022-11-16 19:26:05,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346908546] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:26:05,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:26:05,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 19:26:05,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762250872] [2022-11-16 19:26:05,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:26:05,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 19:26:05,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:26:05,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 19:26:05,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 19:26:05,754 INFO L87 Difference]: Start difference. First operand 188 states and 452 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 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-16 19:26:05,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:26:05,869 INFO L93 Difference]: Finished difference Result 158 states and 373 transitions. [2022-11-16 19:26:05,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 19:26:05,870 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 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-16 19:26:05,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:26:05,871 INFO L225 Difference]: With dead ends: 158 [2022-11-16 19:26:05,871 INFO L226 Difference]: Without dead ends: 128 [2022-11-16 19:26:05,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 19:26:05,872 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 23 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 19:26:05,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 6 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 19:26:05,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-11-16 19:26:05,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2022-11-16 19:26:05,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 2.3149606299212597) internal successors, (294), 127 states have internal predecessors, (294), 0 states have call successors, (0), 0 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-16 19:26:05,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 294 transitions. [2022-11-16 19:26:05,879 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 294 transitions. Word has length 8 [2022-11-16 19:26:05,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:26:05,879 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 294 transitions. [2022-11-16 19:26:05,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 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-16 19:26:05,879 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 294 transitions. [2022-11-16 19:26:05,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-16 19:26:05,880 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:26:05,880 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:26:05,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 19:26:05,881 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 19:26:05,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:26:05,881 INFO L85 PathProgramCache]: Analyzing trace with hash 619015560, now seen corresponding path program 1 times [2022-11-16 19:26:05,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:26:05,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498872190] [2022-11-16 19:26:05,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:26:05,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:26:05,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:26:06,027 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-16 19:26:06,027 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:26:06,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498872190] [2022-11-16 19:26:06,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498872190] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:26:06,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:26:06,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 19:26:06,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018267999] [2022-11-16 19:26:06,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:26:06,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 19:26:06,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:26:06,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 19:26:06,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 19:26:06,031 INFO L87 Difference]: Start difference. First operand 128 states and 294 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:26:06,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:26:06,083 INFO L93 Difference]: Finished difference Result 120 states and 272 transitions. [2022-11-16 19:26:06,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 19:26:06,083 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-16 19:26:06,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:26:06,084 INFO L225 Difference]: With dead ends: 120 [2022-11-16 19:26:06,084 INFO L226 Difference]: Without dead ends: 120 [2022-11-16 19:26:06,085 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-16 19:26:06,087 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 4 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 19:26:06,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 19:26:06,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-11-16 19:26:06,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-11-16 19:26:06,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 119 states have (on average 2.2857142857142856) internal successors, (272), 119 states have internal predecessors, (272), 0 states have call successors, (0), 0 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-16 19:26:06,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 272 transitions. [2022-11-16 19:26:06,096 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 272 transitions. Word has length 9 [2022-11-16 19:26:06,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:26:06,096 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 272 transitions. [2022-11-16 19:26:06,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:26:06,097 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 272 transitions. [2022-11-16 19:26:06,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-16 19:26:06,099 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:26:06,099 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:26:06,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 19:26:06,099 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 19:26:06,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:26:06,100 INFO L85 PathProgramCache]: Analyzing trace with hash 619019280, now seen corresponding path program 1 times [2022-11-16 19:26:06,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:26:06,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875974700] [2022-11-16 19:26:06,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:26:06,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:26:06,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:26:06,290 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-16 19:26:06,290 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:26:06,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875974700] [2022-11-16 19:26:06,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875974700] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:26:06,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:26:06,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 19:26:06,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983791580] [2022-11-16 19:26:06,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:26:06,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 19:26:06,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:26:06,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 19:26:06,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 19:26:06,293 INFO L87 Difference]: Start difference. First operand 120 states and 272 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:26:06,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:26:06,345 INFO L93 Difference]: Finished difference Result 114 states and 256 transitions. [2022-11-16 19:26:06,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 19:26:06,347 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-16 19:26:06,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:26:06,348 INFO L225 Difference]: With dead ends: 114 [2022-11-16 19:26:06,348 INFO L226 Difference]: Without dead ends: 114 [2022-11-16 19:26:06,348 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-16 19:26:06,350 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 13 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 19:26:06,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 19:26:06,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-11-16 19:26:06,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2022-11-16 19:26:06,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 113 states have (on average 2.265486725663717) internal successors, (256), 113 states have internal predecessors, (256), 0 states have call successors, (0), 0 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-16 19:26:06,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 256 transitions. [2022-11-16 19:26:06,357 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 256 transitions. Word has length 9 [2022-11-16 19:26:06,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:26:06,358 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 256 transitions. [2022-11-16 19:26:06,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:26:06,358 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 256 transitions. [2022-11-16 19:26:06,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-16 19:26:06,360 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:26:06,360 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:26:06,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 19:26:06,361 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 19:26:06,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:26:06,362 INFO L85 PathProgramCache]: Analyzing trace with hash -2125250921, now seen corresponding path program 1 times [2022-11-16 19:26:06,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:26:06,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333062775] [2022-11-16 19:26:06,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:26:06,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:26:06,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:26:06,612 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-16 19:26:06,612 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:26:06,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333062775] [2022-11-16 19:26:06,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333062775] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:26:06,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:26:06,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 19:26:06,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713273506] [2022-11-16 19:26:06,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:26:06,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 19:26:06,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:26:06,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 19:26:06,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 19:26:06,615 INFO L87 Difference]: Start difference. First operand 114 states and 256 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 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-16 19:26:06,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:26:06,727 INFO L93 Difference]: Finished difference Result 98 states and 187 transitions. [2022-11-16 19:26:06,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 19:26:06,728 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-11-16 19:26:06,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:26:06,729 INFO L225 Difference]: With dead ends: 98 [2022-11-16 19:26:06,729 INFO L226 Difference]: Without dead ends: 68 [2022-11-16 19:26:06,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 19:26:06,730 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 26 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 19:26:06,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 5 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 19:26:06,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-11-16 19:26:06,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-11-16 19:26:06,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.7611940298507462) internal successors, (118), 67 states have internal predecessors, (118), 0 states have call successors, (0), 0 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-16 19:26:06,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 118 transitions. [2022-11-16 19:26:06,733 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 118 transitions. Word has length 11 [2022-11-16 19:26:06,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:26:06,734 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 118 transitions. [2022-11-16 19:26:06,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 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-16 19:26:06,734 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 118 transitions. [2022-11-16 19:26:06,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 19:26:06,735 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:26:06,735 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:26:06,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 19:26:06,736 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 19:26:06,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:26:06,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1180278514, now seen corresponding path program 1 times [2022-11-16 19:26:06,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:26:06,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986776917] [2022-11-16 19:26:06,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:26:06,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:26:06,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:26:06,979 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-16 19:26:06,979 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:26:06,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986776917] [2022-11-16 19:26:06,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986776917] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:26:06,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:26:06,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 19:26:06,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516150967] [2022-11-16 19:26:06,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:26:06,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 19:26:06,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:26:06,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 19:26:06,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 19:26:06,982 INFO L87 Difference]: Start difference. First operand 68 states and 118 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:26:07,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:26:07,077 INFO L93 Difference]: Finished difference Result 55 states and 90 transitions. [2022-11-16 19:26:07,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 19:26:07,078 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-16 19:26:07,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:26:07,078 INFO L225 Difference]: With dead ends: 55 [2022-11-16 19:26:07,078 INFO L226 Difference]: Without dead ends: 45 [2022-11-16 19:26:07,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-16 19:26:07,079 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 32 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 19:26:07,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 5 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 19:26:07,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-11-16 19:26:07,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-11-16 19:26:07,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.6363636363636365) internal successors, (72), 44 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-16 19:26:07,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 72 transitions. [2022-11-16 19:26:07,082 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 72 transitions. Word has length 13 [2022-11-16 19:26:07,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:26:07,082 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 72 transitions. [2022-11-16 19:26:07,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:26:07,082 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 72 transitions. [2022-11-16 19:26:07,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-16 19:26:07,083 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:26:07,083 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:26:07,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 19:26:07,083 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 19:26:07,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:26:07,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1003816594, now seen corresponding path program 1 times [2022-11-16 19:26:07,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:26:07,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410191415] [2022-11-16 19:26:07,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:26:07,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:26:07,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:26:07,941 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-16 19:26:07,941 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:26:07,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410191415] [2022-11-16 19:26:07,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410191415] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:26:07,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:26:07,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 19:26:07,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578791118] [2022-11-16 19:26:07,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:26:07,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 19:26:07,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:26:07,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 19:26:07,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 19:26:07,944 INFO L87 Difference]: Start difference. First operand 45 states and 72 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:26:08,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:26:08,269 INFO L93 Difference]: Finished difference Result 63 states and 98 transitions. [2022-11-16 19:26:08,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 19:26:08,270 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-16 19:26:08,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:26:08,270 INFO L225 Difference]: With dead ends: 63 [2022-11-16 19:26:08,270 INFO L226 Difference]: Without dead ends: 43 [2022-11-16 19:26:08,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2022-11-16 19:26:08,271 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 39 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 19:26:08,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 3 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 19:26:08,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-11-16 19:26:08,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 35. [2022-11-16 19:26:08,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.5294117647058822) internal successors, (52), 34 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:26:08,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 52 transitions. [2022-11-16 19:26:08,274 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 52 transitions. Word has length 16 [2022-11-16 19:26:08,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:26:08,274 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 52 transitions. [2022-11-16 19:26:08,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:26:08,274 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 52 transitions. [2022-11-16 19:26:08,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-16 19:26:08,275 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:26:08,275 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:26:08,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 19:26:08,275 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 19:26:08,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:26:08,276 INFO L85 PathProgramCache]: Analyzing trace with hash -2016680012, now seen corresponding path program 2 times [2022-11-16 19:26:08,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:26:08,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422375327] [2022-11-16 19:26:08,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:26:08,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:26:08,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:26:08,483 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-16 19:26:08,483 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:26:08,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422375327] [2022-11-16 19:26:08,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422375327] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:26:08,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:26:08,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 19:26:08,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207824857] [2022-11-16 19:26:08,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:26:08,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 19:26:08,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:26:08,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 19:26:08,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 19:26:08,485 INFO L87 Difference]: Start difference. First operand 35 states and 52 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:26:08,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:26:08,556 INFO L93 Difference]: Finished difference Result 49 states and 71 transitions. [2022-11-16 19:26:08,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 19:26:08,557 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-16 19:26:08,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:26:08,557 INFO L225 Difference]: With dead ends: 49 [2022-11-16 19:26:08,557 INFO L226 Difference]: Without dead ends: 25 [2022-11-16 19:26:08,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 19:26:08,558 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 18 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 19:26:08,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 1 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 19:26:08,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-11-16 19:26:08,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-11-16 19:26:08,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:26:08,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2022-11-16 19:26:08,560 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 16 [2022-11-16 19:26:08,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:26:08,560 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-11-16 19:26:08,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:26:08,561 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-11-16 19:26:08,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-16 19:26:08,561 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:26:08,561 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:26:08,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 19:26:08,562 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 19:26:08,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:26:08,563 INFO L85 PathProgramCache]: Analyzing trace with hash -421600718, now seen corresponding path program 3 times [2022-11-16 19:26:08,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:26:08,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217781429] [2022-11-16 19:26:08,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:26:08,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:26:08,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:26:09,768 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-16 19:26:09,768 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:26:09,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217781429] [2022-11-16 19:26:09,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217781429] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:26:09,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:26:09,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 19:26:09,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856191588] [2022-11-16 19:26:09,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:26:09,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 19:26:09,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:26:09,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 19:26:09,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 19:26:09,771 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:26:09,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:26:09,940 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2022-11-16 19:26:09,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 19:26:09,941 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-16 19:26:09,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:26:09,942 INFO L225 Difference]: With dead ends: 31 [2022-11-16 19:26:09,942 INFO L226 Difference]: Without dead ends: 19 [2022-11-16 19:26:09,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-11-16 19:26:09,942 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 12 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 19:26:09,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 5 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 19:26:09,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-11-16 19:26:09,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-11-16 19:26:09,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:26:09,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2022-11-16 19:26:09,944 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2022-11-16 19:26:09,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:26:09,944 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2022-11-16 19:26:09,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:26:09,945 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-11-16 19:26:09,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-16 19:26:09,945 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:26:09,945 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:26:09,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 19:26:09,945 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 19:26:09,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:26:09,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1559026818, now seen corresponding path program 4 times [2022-11-16 19:26:09,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:26:09,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169641173] [2022-11-16 19:26:09,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:26:09,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:26:09,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 19:26:09,992 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 19:26:10,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 19:26:10,051 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-16 19:26:10,051 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 19:26:10,052 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2022-11-16 19:26:10,054 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2022-11-16 19:26:10,055 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2022-11-16 19:26:10,055 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2022-11-16 19:26:10,055 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2022-11-16 19:26:10,055 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2022-11-16 19:26:10,056 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2022-11-16 19:26:10,056 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2022-11-16 19:26:10,056 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2022-11-16 19:26:10,056 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2022-11-16 19:26:10,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-16 19:26:10,059 INFO L444 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:26:10,065 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-16 19:26:10,065 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 19:26:10,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 07:26:10 BasicIcfg [2022-11-16 19:26:10,123 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 19:26:10,123 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 19:26:10,123 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 19:26:10,124 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 19:26:10,124 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 07:25:58" (3/4) ... [2022-11-16 19:26:10,127 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-16 19:26:10,127 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 19:26:10,127 INFO L158 Benchmark]: Toolchain (without parser) took 13421.57ms. Allocated memory was 113.2MB in the beginning and 222.3MB in the end (delta: 109.1MB). Free memory was 71.4MB in the beginning and 193.4MB in the end (delta: -122.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 19:26:10,128 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 113.2MB. Free memory is still 90.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 19:26:10,128 INFO L158 Benchmark]: CACSL2BoogieTranslator took 699.42ms. Allocated memory is still 113.2MB. Free memory was 71.3MB in the beginning and 74.1MB in the end (delta: -2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-16 19:26:10,128 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.44ms. Allocated memory is still 113.2MB. Free memory was 74.1MB in the beginning and 71.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 19:26:10,128 INFO L158 Benchmark]: Boogie Preprocessor took 62.61ms. Allocated memory is still 113.2MB. Free memory was 71.6MB in the beginning and 69.4MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 19:26:10,135 INFO L158 Benchmark]: RCFGBuilder took 812.76ms. Allocated memory is still 113.2MB. Free memory was 69.4MB in the beginning and 81.0MB in the end (delta: -11.6MB). Peak memory consumption was 35.3MB. Max. memory is 16.1GB. [2022-11-16 19:26:10,136 INFO L158 Benchmark]: TraceAbstraction took 11751.04ms. Allocated memory was 113.2MB in the beginning and 222.3MB in the end (delta: 109.1MB). Free memory was 80.2MB in the beginning and 193.4MB in the end (delta: -113.2MB). Peak memory consumption was 118.5MB. Max. memory is 16.1GB. [2022-11-16 19:26:10,137 INFO L158 Benchmark]: Witness Printer took 3.55ms. Allocated memory is still 222.3MB. Free memory is still 193.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 19:26:10,138 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.26ms. Allocated memory is still 113.2MB. Free memory is still 90.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 699.42ms. Allocated memory is still 113.2MB. Free memory was 71.3MB in the beginning and 74.1MB in the end (delta: -2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 84.44ms. Allocated memory is still 113.2MB. Free memory was 74.1MB in the beginning and 71.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.61ms. Allocated memory is still 113.2MB. Free memory was 71.6MB in the beginning and 69.4MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 812.76ms. Allocated memory is still 113.2MB. Free memory was 69.4MB in the beginning and 81.0MB in the end (delta: -11.6MB). Peak memory consumption was 35.3MB. Max. memory is 16.1GB. * TraceAbstraction took 11751.04ms. Allocated memory was 113.2MB in the beginning and 222.3MB in the end (delta: 109.1MB). Free memory was 80.2MB in the beginning and 193.4MB in the end (delta: -113.2MB). Peak memory consumption was 118.5MB. Max. memory is 16.1GB. * Witness Printer took 3.55ms. Allocated memory is still 222.3MB. Free memory is still 193.4MB. 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: 5.4s, 113 PlacesBefore, 33 PlacesAfterwards, 108 TransitionsBefore, 27 TransitionsAfterwards, 1444 CoEnabledTransitionPairs, 7 FixpointIterations, 52 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 110 TotalNumberOfCompositions, 3623 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1842, independent: 1699, independent conditional: 0, independent unconditional: 1699, dependent: 143, dependent conditional: 0, dependent unconditional: 143, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1004, independent: 957, independent conditional: 0, independent unconditional: 957, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1004, independent: 943, independent conditional: 0, independent unconditional: 943, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 61, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 513, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 494, dependent conditional: 0, dependent unconditional: 494, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1842, independent: 742, independent conditional: 0, independent unconditional: 742, dependent: 96, dependent conditional: 0, dependent unconditional: 96, unknown: 1004, unknown conditional: 0, unknown unconditional: 1004] , Statistics on independence cache: Total cache size (in pairs): 108, Positive cache size: 93, Positive conditional cache size: 0, Positive unconditional cache size: 93, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, 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: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L734] 0 int y$w_buff0; [L736] 0 int y$w_buff1; [L711] 0 int __unbuffered_p0_EAX = 0; [L728] 0 _Bool y$r_buff0_thd2; [L725] 0 int y$mem_tmp; [L715] 0 int __unbuffered_p1_EAX = 0; [L726] 0 _Bool y$r_buff0_thd0; [L727] 0 _Bool y$r_buff0_thd1; [L732] 0 _Bool y$read_delayed; [L709] 0 int __unbuffered_cnt = 0; [L724] 0 _Bool y$flush_delayed; [L713] 0 int __unbuffered_p0_EBX = 0; [L737] 0 _Bool y$w_buff1_used; [L719] 0 _Bool main$tmp_guard1; [L718] 0 _Bool main$tmp_guard0; [L717] 0 int __unbuffered_p1_EBX = 0; [L733] 0 int *y$read_delayed_var; [L735] 0 _Bool y$w_buff0_used; [L721] 0 int x = 0; [L729] 0 _Bool y$r_buff1_thd0; [L723] 0 int y = 0; [L731] 0 _Bool y$r_buff1_thd2; [L739] 0 int z = 0; [L730] 0 _Bool y$r_buff1_thd1; [L831] 0 pthread_t t243; [L832] FCALL, FORK 0 pthread_create(&t243, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t243, ((void *)0), P0, ((void *)0))=-1, t243={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L833] 0 pthread_t t244; [L834] FCALL, FORK 0 pthread_create(&t244, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t244, ((void *)0), P1, ((void *)0))=0, t243={5:0}, t244={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L779] 2 y$w_buff1 = y$w_buff0 [L780] 2 y$w_buff0 = 1 [L781] 2 y$w_buff1_used = y$w_buff0_used [L782] 2 y$w_buff0_used = (_Bool)1 [L783] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L783] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L784] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L785] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L786] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L787] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L790] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 2 y$flush_delayed = weak$$choice2 [L793] 2 y$mem_tmp = y [L794] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L795] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L796] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L797] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L798] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L799] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L800] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L801] 2 __unbuffered_p1_EAX = y [L802] 2 y = y$flush_delayed ? y$mem_tmp : y [L803] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L806] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L745] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 1 x = 1 [L751] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] 1 y$mem_tmp = y [L758] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L759] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L760] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L761] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L762] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L764] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 __unbuffered_p0_EBX = y [L766] 1 y = y$flush_delayed ? y$mem_tmp : y [L767] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L809] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L810] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L811] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L812] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L813] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L772] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L774] 1 return 0; [L816] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 2 return 0; [L836] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L838] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L838] RET 0 assume_abort_if_not(main$tmp_guard0) [L840] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L841] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L842] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L843] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L844] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t243={5:0}, t244={3:0}, weak$$choice0=50, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L847] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L849] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 19]: 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. - 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: 829]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 834]: 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: 832]: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 128 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 11.5s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 182 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 182 mSDsluCounter, 33 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 18 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 611 IncrementalHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 15 mSDtfsCounter, 611 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=244occurred in iteration=0, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 60 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 127 NumberOfCodeBlocks, 127 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 100 ConstructedInterpolants, 0 QuantifiedInterpolants, 842 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 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-16 19:26:10,175 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4588e1a9-8acb-491a-82e3-194ba0513df7/bin/utaipan-Xvt2sAort0/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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4588e1a9-8acb-491a-82e3-194ba0513df7/bin/utaipan-Xvt2sAort0/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4588e1a9-8acb-491a-82e3-194ba0513df7/bin/utaipan-Xvt2sAort0/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4588e1a9-8acb-491a-82e3-194ba0513df7/bin/utaipan-Xvt2sAort0/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4588e1a9-8acb-491a-82e3-194ba0513df7/bin/utaipan-Xvt2sAort0/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix009.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4588e1a9-8acb-491a-82e3-194ba0513df7/bin/utaipan-Xvt2sAort0/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4588e1a9-8acb-491a-82e3-194ba0513df7/bin/utaipan-Xvt2sAort0 --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 f715026b68e9c0bb30969d2f1713e0cf615763357ccfdf3c82e016d450119958 --- 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-e04fb08 [2022-11-16 19:26:12,420 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 19:26:12,424 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 19:26:12,458 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 19:26:12,458 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 19:26:12,463 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 19:26:12,466 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 19:26:12,471 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 19:26:12,474 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 19:26:12,481 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 19:26:12,482 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 19:26:12,483 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 19:26:12,484 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 19:26:12,484 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 19:26:12,485 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 19:26:12,486 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 19:26:12,487 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 19:26:12,488 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 19:26:12,489 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 19:26:12,498 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 19:26:12,504 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 19:26:12,506 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 19:26:12,509 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 19:26:12,511 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 19:26:12,519 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 19:26:12,519 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 19:26:12,519 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 19:26:12,520 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 19:26:12,521 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 19:26:12,522 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 19:26:12,522 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 19:26:12,523 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 19:26:12,523 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 19:26:12,524 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 19:26:12,525 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 19:26:12,525 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 19:26:12,526 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 19:26:12,526 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 19:26:12,527 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 19:26:12,534 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 19:26:12,535 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 19:26:12,536 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4588e1a9-8acb-491a-82e3-194ba0513df7/bin/utaipan-Xvt2sAort0/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-11-16 19:26:12,577 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 19:26:12,577 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 19:26:12,579 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 19:26:12,579 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 19:26:12,580 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 19:26:12,580 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 19:26:12,581 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-16 19:26:12,581 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-16 19:26:12,581 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-16 19:26:12,581 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-16 19:26:12,583 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-16 19:26:12,583 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-16 19:26:12,585 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 19:26:12,585 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 19:26:12,585 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 19:26:12,586 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 19:26:12,586 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 19:26:12,586 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 19:26:12,586 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 19:26:12,587 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 19:26:12,587 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-16 19:26:12,587 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-16 19:26:12,587 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-16 19:26:12,587 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 19:26:12,588 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 19:26:12,588 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-16 19:26:12,588 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-16 19:26:12,588 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 19:26:12,588 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 19:26:12,589 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 19:26:12,589 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 19:26:12,589 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 19:26:12,590 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 19:26:12,590 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 19:26:12,590 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 19:26:12,590 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-16 19:26:12,591 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-16 19:26:12,591 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-16 19:26:12,591 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-16 19:26:12,591 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_4588e1a9-8acb-491a-82e3-194ba0513df7/bin/utaipan-Xvt2sAort0/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_4588e1a9-8acb-491a-82e3-194ba0513df7/bin/utaipan-Xvt2sAort0 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 -> f715026b68e9c0bb30969d2f1713e0cf615763357ccfdf3c82e016d450119958 [2022-11-16 19:26:12,995 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 19:26:13,023 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 19:26:13,028 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 19:26:13,029 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 19:26:13,030 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 19:26:13,032 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4588e1a9-8acb-491a-82e3-194ba0513df7/bin/utaipan-Xvt2sAort0/../../sv-benchmarks/c/pthread-wmm/mix009.opt.i [2022-11-16 19:26:13,117 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4588e1a9-8acb-491a-82e3-194ba0513df7/bin/utaipan-Xvt2sAort0/data/5611c7220/85387086f83a45a6ac6a64008fd7a0ea/FLAGe0cdca141 [2022-11-16 19:26:13,740 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 19:26:13,741 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4588e1a9-8acb-491a-82e3-194ba0513df7/sv-benchmarks/c/pthread-wmm/mix009.opt.i [2022-11-16 19:26:13,759 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4588e1a9-8acb-491a-82e3-194ba0513df7/bin/utaipan-Xvt2sAort0/data/5611c7220/85387086f83a45a6ac6a64008fd7a0ea/FLAGe0cdca141 [2022-11-16 19:26:13,982 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4588e1a9-8acb-491a-82e3-194ba0513df7/bin/utaipan-Xvt2sAort0/data/5611c7220/85387086f83a45a6ac6a64008fd7a0ea [2022-11-16 19:26:13,986 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 19:26:13,988 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 19:26:13,992 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 19:26:13,992 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 19:26:13,997 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 19:26:13,998 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:26:13" (1/1) ... [2022-11-16 19:26:13,999 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ac25927 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:26:13, skipping insertion in model container [2022-11-16 19:26:13,999 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:26:13" (1/1) ... [2022-11-16 19:26:14,007 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 19:26:14,062 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 19:26:14,238 WARN L229 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_4588e1a9-8acb-491a-82e3-194ba0513df7/sv-benchmarks/c/pthread-wmm/mix009.opt.i[987,1000] [2022-11-16 19:26:14,532 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 19:26:14,545 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 19:26:14,566 WARN L229 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_4588e1a9-8acb-491a-82e3-194ba0513df7/sv-benchmarks/c/pthread-wmm/mix009.opt.i[987,1000] [2022-11-16 19:26:14,621 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 19:26:14,659 INFO L208 MainTranslator]: Completed translation [2022-11-16 19:26:14,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:26:14 WrapperNode [2022-11-16 19:26:14,660 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 19:26:14,661 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 19:26:14,661 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 19:26:14,661 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 19:26:14,669 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:26:14" (1/1) ... [2022-11-16 19:26:14,697 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:26:14" (1/1) ... [2022-11-16 19:26:14,746 INFO L138 Inliner]: procedures = 178, calls = 47, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 135 [2022-11-16 19:26:14,749 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 19:26:14,751 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 19:26:14,751 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 19:26:14,751 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 19:26:14,761 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:26:14" (1/1) ... [2022-11-16 19:26:14,761 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:26:14" (1/1) ... [2022-11-16 19:26:14,777 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:26:14" (1/1) ... [2022-11-16 19:26:14,778 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:26:14" (1/1) ... [2022-11-16 19:26:14,787 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:26:14" (1/1) ... [2022-11-16 19:26:14,804 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:26:14" (1/1) ... [2022-11-16 19:26:14,806 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:26:14" (1/1) ... [2022-11-16 19:26:14,808 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:26:14" (1/1) ... [2022-11-16 19:26:14,812 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 19:26:14,826 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 19:26:14,826 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 19:26:14,826 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 19:26:14,827 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:26:14" (1/1) ... [2022-11-16 19:26:14,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 19:26:14,849 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4588e1a9-8acb-491a-82e3-194ba0513df7/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 19:26:14,869 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4588e1a9-8acb-491a-82e3-194ba0513df7/bin/utaipan-Xvt2sAort0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 19:26:14,896 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4588e1a9-8acb-491a-82e3-194ba0513df7/bin/utaipan-Xvt2sAort0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 19:26:14,921 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 19:26:14,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 19:26:14,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 19:26:14,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 19:26:14,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-16 19:26:14,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-16 19:26:14,923 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-16 19:26:14,923 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-16 19:26:14,923 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-16 19:26:14,923 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-16 19:26:14,924 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 19:26:14,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 19:26:14,924 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 19:26:14,945 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 19:26:15,191 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 19:26:15,193 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 19:26:15,662 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 19:26:15,874 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 19:26:15,874 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-16 19:26:15,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 07:26:15 BoogieIcfgContainer [2022-11-16 19:26:15,877 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 19:26:15,879 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 19:26:15,879 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 19:26:15,883 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 19:26:15,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 07:26:13" (1/3) ... [2022-11-16 19:26:15,884 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2136714f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:26:15, skipping insertion in model container [2022-11-16 19:26:15,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:26:14" (2/3) ... [2022-11-16 19:26:15,885 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2136714f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:26:15, skipping insertion in model container [2022-11-16 19:26:15,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 07:26:15" (3/3) ... [2022-11-16 19:26:15,887 INFO L112 eAbstractionObserver]: Analyzing ICFG mix009.opt.i [2022-11-16 19:26:15,906 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 19:26:15,907 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2022-11-16 19:26:15,907 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 19:26:15,990 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-16 19:26:16,036 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-16 19:26:16,056 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 109 transitions, 228 flow [2022-11-16 19:26:16,061 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 109 transitions, 228 flow [2022-11-16 19:26:16,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 109 transitions, 228 flow [2022-11-16 19:26:16,147 INFO L130 PetriNetUnfolder]: 2/107 cut-off events. [2022-11-16 19:26:16,148 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 19:26:16,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 65 event pairs, 0 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2022-11-16 19:26:16,157 INFO L119 LiptonReduction]: Number of co-enabled transitions 1444 [2022-11-16 19:26:24,194 INFO L134 LiptonReduction]: Checked pairs total: 3589 [2022-11-16 19:26:24,195 INFO L136 LiptonReduction]: Total number of compositions: 109 [2022-11-16 19:26:24,203 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 33 places, 27 transitions, 64 flow [2022-11-16 19:26:24,238 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 244 states, 235 states have (on average 2.6425531914893616) internal successors, (621), 243 states have internal predecessors, (621), 0 states have call successors, (0), 0 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-16 19:26:24,257 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 19:26:24,263 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;@e6cdb2a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 19:26:24,264 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2022-11-16 19:26:24,267 INFO L276 IsEmpty]: Start isEmpty. Operand has 244 states, 235 states have (on average 2.6425531914893616) internal successors, (621), 243 states have internal predecessors, (621), 0 states have call successors, (0), 0 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-16 19:26:24,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-16 19:26:24,272 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:26:24,273 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-16 19:26:24,273 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 19:26:24,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:26:24,278 INFO L85 PathProgramCache]: Analyzing trace with hash 501, now seen corresponding path program 1 times [2022-11-16 19:26:24,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 19:26:24,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1175879099] [2022-11-16 19:26:24,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:26:24,292 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-16 19:26:24,292 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4588e1a9-8acb-491a-82e3-194ba0513df7/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 19:26:24,299 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4588e1a9-8acb-491a-82e3-194ba0513df7/bin/utaipan-Xvt2sAort0/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-16 19:26:24,343 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4588e1a9-8acb-491a-82e3-194ba0513df7/bin/utaipan-Xvt2sAort0/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-16 19:26:24,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:26:24,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-16 19:26:24,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 19:26:24,399 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-16 19:26:24,399 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 19:26:24,400 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 19:26:24,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1175879099] [2022-11-16 19:26:24,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1175879099] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:26:24,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:26:24,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-16 19:26:24,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442346677] [2022-11-16 19:26:24,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:26:24,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 19:26:24,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 19:26:24,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 19:26:24,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 19:26:24,443 INFO L87 Difference]: Start difference. First operand has 244 states, 235 states have (on average 2.6425531914893616) internal successors, (621), 243 states have internal predecessors, (621), 0 states have call successors, (0), 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-16 19:26:24,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:26:24,545 INFO L93 Difference]: Finished difference Result 232 states and 566 transitions. [2022-11-16 19:26:24,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 19:26:24,548 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-16 19:26:24,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:26:24,559 INFO L225 Difference]: With dead ends: 232 [2022-11-16 19:26:24,575 INFO L226 Difference]: Without dead ends: 232 [2022-11-16 19:26:24,576 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-16 19:26:24,579 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 19:26:24,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 19:26:24,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-11-16 19:26:24,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2022-11-16 19:26:24,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 227 states have (on average 2.4933920704845813) internal successors, (566), 231 states have internal predecessors, (566), 0 states have call successors, (0), 0 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-16 19:26:24,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 566 transitions. [2022-11-16 19:26:24,702 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 566 transitions. Word has length 1 [2022-11-16 19:26:24,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:26:24,702 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 566 transitions. [2022-11-16 19:26:24,703 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-16 19:26:24,703 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 566 transitions. [2022-11-16 19:26:24,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-16 19:26:24,703 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:26:24,704 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-16 19:26:24,720 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4588e1a9-8acb-491a-82e3-194ba0513df7/bin/utaipan-Xvt2sAort0/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-16 19:26:24,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4588e1a9-8acb-491a-82e3-194ba0513df7/bin/utaipan-Xvt2sAort0/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-16 19:26:24,905 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 19:26:24,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:26:24,905 INFO L85 PathProgramCache]: Analyzing trace with hash 472985001, now seen corresponding path program 1 times [2022-11-16 19:26:24,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 19:26:24,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [677946511] [2022-11-16 19:26:24,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:26:24,906 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-16 19:26:24,906 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4588e1a9-8acb-491a-82e3-194ba0513df7/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 19:26:24,911 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4588e1a9-8acb-491a-82e3-194ba0513df7/bin/utaipan-Xvt2sAort0/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-16 19:26:24,915 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4588e1a9-8acb-491a-82e3-194ba0513df7/bin/utaipan-Xvt2sAort0/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-16 19:26:24,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:26:24,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 19:26:24,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 19:26:25,020 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-16 19:26:25,021 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 19:26:25,021 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 19:26:25,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [677946511] [2022-11-16 19:26:25,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [677946511] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:26:25,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:26:25,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 19:26:25,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853362732] [2022-11-16 19:26:25,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:26:25,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 19:26:25,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 19:26:25,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 19:26:25,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 19:26:25,025 INFO L87 Difference]: Start difference. First operand 232 states and 566 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-16 19:26:25,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:26:25,131 INFO L93 Difference]: Finished difference Result 197 states and 473 transitions. [2022-11-16 19:26:25,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 19:26:25,132 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-16 19:26:25,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:26:25,134 INFO L225 Difference]: With dead ends: 197 [2022-11-16 19:26:25,137 INFO L226 Difference]: Without dead ends: 192 [2022-11-16 19:26:25,138 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-16 19:26:25,140 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 8 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 19:26:25,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 19:26:25,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-11-16 19:26:25,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2022-11-16 19:26:25,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 190 states have (on average 2.442105263157895) internal successors, (464), 191 states have internal predecessors, (464), 0 states have call successors, (0), 0 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-16 19:26:25,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 464 transitions. [2022-11-16 19:26:25,179 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 464 transitions. Word has length 5 [2022-11-16 19:26:25,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:26:25,180 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 464 transitions. [2022-11-16 19:26:25,181 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-16 19:26:25,181 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 464 transitions. [2022-11-16 19:26:25,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-16 19:26:25,182 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:26:25,182 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:26:25,196 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4588e1a9-8acb-491a-82e3-194ba0513df7/bin/utaipan-Xvt2sAort0/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)] Forceful destruction successful, exit code 0 [2022-11-16 19:26:25,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4588e1a9-8acb-491a-82e3-194ba0513df7/bin/utaipan-Xvt2sAort0/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-16 19:26:25,393 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 19:26:25,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:26:25,394 INFO L85 PathProgramCache]: Analyzing trace with hash -727893610, now seen corresponding path program 1 times [2022-11-16 19:26:25,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 19:26:25,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1462784917] [2022-11-16 19:26:25,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:26:25,395 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-16 19:26:25,395 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4588e1a9-8acb-491a-82e3-194ba0513df7/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 19:26:25,396 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4588e1a9-8acb-491a-82e3-194ba0513df7/bin/utaipan-Xvt2sAort0/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-16 19:26:25,437 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4588e1a9-8acb-491a-82e3-194ba0513df7/bin/utaipan-Xvt2sAort0/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-16 19:26:25,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:26:25,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 19:26:25,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 19:26:25,550 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-16 19:26:25,550 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 19:26:25,550 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 19:26:25,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1462784917] [2022-11-16 19:26:25,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1462784917] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:26:25,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:26:25,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 19:26:25,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669236499] [2022-11-16 19:26:25,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:26:25,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 19:26:25,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 19:26:25,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 19:26:25,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 19:26:25,553 INFO L87 Difference]: Start difference. First operand 192 states and 464 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:26:25,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:26:25,746 INFO L93 Difference]: Finished difference Result 122 states and 233 transitions. [2022-11-16 19:26:25,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 19:26:25,748 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-16 19:26:25,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:26:25,749 INFO L225 Difference]: With dead ends: 122 [2022-11-16 19:26:25,749 INFO L226 Difference]: Without dead ends: 92 [2022-11-16 19:26:25,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 19:26:25,751 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 26 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 19:26:25,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 5 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 19:26:25,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-11-16 19:26:25,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-11-16 19:26:25,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 90 states have (on average 1.8222222222222222) internal successors, (164), 91 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:26:25,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 164 transitions. [2022-11-16 19:26:25,758 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 164 transitions. Word has length 7 [2022-11-16 19:26:25,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:26:25,758 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 164 transitions. [2022-11-16 19:26:25,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:26:25,759 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 164 transitions. [2022-11-16 19:26:25,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-16 19:26:25,760 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:26:25,760 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:26:25,776 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4588e1a9-8acb-491a-82e3-194ba0513df7/bin/utaipan-Xvt2sAort0/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-16 19:26:25,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4588e1a9-8acb-491a-82e3-194ba0513df7/bin/utaipan-Xvt2sAort0/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-16 19:26:25,972 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 19:26:25,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:26:25,972 INFO L85 PathProgramCache]: Analyzing trace with hash 2061544490, now seen corresponding path program 1 times [2022-11-16 19:26:25,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 19:26:25,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [594584644] [2022-11-16 19:26:25,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:26:25,973 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-16 19:26:25,973 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4588e1a9-8acb-491a-82e3-194ba0513df7/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 19:26:25,974 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4588e1a9-8acb-491a-82e3-194ba0513df7/bin/utaipan-Xvt2sAort0/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-16 19:26:25,991 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4588e1a9-8acb-491a-82e3-194ba0513df7/bin/utaipan-Xvt2sAort0/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-16 19:26:26,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:26:26,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 19:26:26,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 19:26:26,149 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-16 19:26:26,149 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 19:26:26,150 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 19:26:26,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [594584644] [2022-11-16 19:26:26,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [594584644] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:26:26,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:26:26,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 19:26:26,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868817086] [2022-11-16 19:26:26,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:26:26,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 19:26:26,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 19:26:26,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 19:26:26,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 19:26:26,154 INFO L87 Difference]: Start difference. First operand 92 states and 164 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 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-16 19:26:26,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:26:26,327 INFO L93 Difference]: Finished difference Result 57 states and 92 transitions. [2022-11-16 19:26:26,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 19:26:26,327 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-11-16 19:26:26,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:26:26,328 INFO L225 Difference]: With dead ends: 57 [2022-11-16 19:26:26,328 INFO L226 Difference]: Without dead ends: 47 [2022-11-16 19:26:26,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-16 19:26:26,329 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 23 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 19:26:26,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 8 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 19:26:26,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-16 19:26:26,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-11-16 19:26:26,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 45 states have (on average 1.6444444444444444) internal successors, (74), 46 states have internal predecessors, (74), 0 states have call successors, (0), 0 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-16 19:26:26,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 74 transitions. [2022-11-16 19:26:26,333 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 74 transitions. Word has length 11 [2022-11-16 19:26:26,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:26:26,333 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 74 transitions. [2022-11-16 19:26:26,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 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-16 19:26:26,333 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 74 transitions. [2022-11-16 19:26:26,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-16 19:26:26,334 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:26:26,334 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:26:26,349 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4588e1a9-8acb-491a-82e3-194ba0513df7/bin/utaipan-Xvt2sAort0/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)] Forceful destruction successful, exit code 0 [2022-11-16 19:26:26,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4588e1a9-8acb-491a-82e3-194ba0513df7/bin/utaipan-Xvt2sAort0/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-16 19:26:26,543 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 19:26:26,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:26:26,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1336913099, now seen corresponding path program 1 times [2022-11-16 19:26:26,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 19:26:26,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [430673589] [2022-11-16 19:26:26,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:26:26,545 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-16 19:26:26,545 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4588e1a9-8acb-491a-82e3-194ba0513df7/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 19:26:26,546 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4588e1a9-8acb-491a-82e3-194ba0513df7/bin/utaipan-Xvt2sAort0/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-16 19:26:26,551 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4588e1a9-8acb-491a-82e3-194ba0513df7/bin/utaipan-Xvt2sAort0/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-16 19:26:26,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:26:26,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-16 19:26:26,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 19:26:27,317 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-16 19:26:27,317 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 19:26:27,317 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 19:26:27,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [430673589] [2022-11-16 19:26:27,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [430673589] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:26:27,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:26:27,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 19:26:27,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575403419] [2022-11-16 19:26:27,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:26:27,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 19:26:27,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 19:26:27,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 19:26:27,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 19:26:27,320 INFO L87 Difference]: Start difference. First operand 47 states and 74 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:26:27,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:26:27,609 INFO L93 Difference]: Finished difference Result 55 states and 82 transitions. [2022-11-16 19:26:27,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 19:26:27,609 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-16 19:26:27,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:26:27,610 INFO L225 Difference]: With dead ends: 55 [2022-11-16 19:26:27,610 INFO L226 Difference]: Without dead ends: 55 [2022-11-16 19:26:27,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-16 19:26:27,611 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 22 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 19:26:27,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 5 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 19:26:27,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-16 19:26:27,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2022-11-16 19:26:27,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 51 states have (on average 1.588235294117647) internal successors, (81), 52 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:26:27,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 81 transitions. [2022-11-16 19:26:27,616 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 81 transitions. Word has length 16 [2022-11-16 19:26:27,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:26:27,616 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 81 transitions. [2022-11-16 19:26:27,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:26:27,616 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 81 transitions. [2022-11-16 19:26:27,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-16 19:26:27,617 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:26:27,617 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:26:27,635 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4588e1a9-8acb-491a-82e3-194ba0513df7/bin/utaipan-Xvt2sAort0/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-16 19:26:27,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4588e1a9-8acb-491a-82e3-194ba0513df7/bin/utaipan-Xvt2sAort0/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-16 19:26:27,818 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 19:26:27,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:26:27,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1088030817, now seen corresponding path program 2 times [2022-11-16 19:26:27,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 19:26:27,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [87443089] [2022-11-16 19:26:27,819 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 19:26:27,819 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-16 19:26:27,820 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4588e1a9-8acb-491a-82e3-194ba0513df7/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 19:26:27,823 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4588e1a9-8acb-491a-82e3-194ba0513df7/bin/utaipan-Xvt2sAort0/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-16 19:26:27,863 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4588e1a9-8acb-491a-82e3-194ba0513df7/bin/utaipan-Xvt2sAort0/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-16 19:26:27,954 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-16 19:26:27,954 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-16 19:26:27,954 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 19:26:28,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 19:26:28,071 INFO L130 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2022-11-16 19:26:28,071 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 19:26:28,072 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2022-11-16 19:26:28,074 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2022-11-16 19:26:28,074 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2022-11-16 19:26:28,075 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2022-11-16 19:26:28,075 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2022-11-16 19:26:28,075 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2022-11-16 19:26:28,075 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2022-11-16 19:26:28,076 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2022-11-16 19:26:28,076 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2022-11-16 19:26:28,076 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2022-11-16 19:26:28,094 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4588e1a9-8acb-491a-82e3-194ba0513df7/bin/utaipan-Xvt2sAort0/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-16 19:26:28,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4588e1a9-8acb-491a-82e3-194ba0513df7/bin/utaipan-Xvt2sAort0/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-16 19:26:28,287 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2022-11-16 19:26:28,292 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-16 19:26:28,292 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 19:26:28,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 07:26:28 BasicIcfg [2022-11-16 19:26:28,342 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 19:26:28,342 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 19:26:28,342 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 19:26:28,342 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 19:26:28,343 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 07:26:15" (3/4) ... [2022-11-16 19:26:28,346 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-16 19:26:28,346 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 19:26:28,346 INFO L158 Benchmark]: Toolchain (without parser) took 14358.38ms. Allocated memory was 69.2MB in the beginning and 157.3MB in the end (delta: 88.1MB). Free memory was 49.9MB in the beginning and 66.8MB in the end (delta: -16.9MB). Peak memory consumption was 73.7MB. Max. memory is 16.1GB. [2022-11-16 19:26:28,347 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 69.2MB. Free memory was 51.2MB in the beginning and 51.1MB in the end (delta: 59.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 19:26:28,347 INFO L158 Benchmark]: CACSL2BoogieTranslator took 668.39ms. Allocated memory is still 69.2MB. Free memory was 49.8MB in the beginning and 39.8MB in the end (delta: 10.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-16 19:26:28,347 INFO L158 Benchmark]: Boogie Procedure Inliner took 88.96ms. Allocated memory is still 69.2MB. Free memory was 39.8MB in the beginning and 37.1MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-16 19:26:28,348 INFO L158 Benchmark]: Boogie Preprocessor took 74.43ms. Allocated memory is still 69.2MB. Free memory was 37.1MB in the beginning and 35.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 19:26:28,348 INFO L158 Benchmark]: RCFGBuilder took 1050.95ms. Allocated memory was 69.2MB in the beginning and 98.6MB in the end (delta: 29.4MB). Free memory was 35.0MB in the beginning and 74.3MB in the end (delta: -39.3MB). Peak memory consumption was 20.6MB. Max. memory is 16.1GB. [2022-11-16 19:26:28,349 INFO L158 Benchmark]: TraceAbstraction took 12462.46ms. Allocated memory was 98.6MB in the beginning and 157.3MB in the end (delta: 58.7MB). Free memory was 74.3MB in the beginning and 66.8MB in the end (delta: 7.5MB). Peak memory consumption was 66.6MB. Max. memory is 16.1GB. [2022-11-16 19:26:28,349 INFO L158 Benchmark]: Witness Printer took 3.74ms. Allocated memory is still 157.3MB. Free memory is still 66.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 19:26:28,351 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.33ms. Allocated memory is still 69.2MB. Free memory was 51.2MB in the beginning and 51.1MB in the end (delta: 59.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 668.39ms. Allocated memory is still 69.2MB. Free memory was 49.8MB in the beginning and 39.8MB in the end (delta: 10.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 88.96ms. Allocated memory is still 69.2MB. Free memory was 39.8MB in the beginning and 37.1MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.43ms. Allocated memory is still 69.2MB. Free memory was 37.1MB in the beginning and 35.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1050.95ms. Allocated memory was 69.2MB in the beginning and 98.6MB in the end (delta: 29.4MB). Free memory was 35.0MB in the beginning and 74.3MB in the end (delta: -39.3MB). Peak memory consumption was 20.6MB. Max. memory is 16.1GB. * TraceAbstraction took 12462.46ms. Allocated memory was 98.6MB in the beginning and 157.3MB in the end (delta: 58.7MB). Free memory was 74.3MB in the beginning and 66.8MB in the end (delta: 7.5MB). Peak memory consumption was 66.6MB. Max. memory is 16.1GB. * Witness Printer took 3.74ms. Allocated memory is still 157.3MB. Free memory is still 66.8MB. 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.1s, 114 PlacesBefore, 33 PlacesAfterwards, 109 TransitionsBefore, 27 TransitionsAfterwards, 1444 CoEnabledTransitionPairs, 7 FixpointIterations, 51 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 109 TotalNumberOfCompositions, 3589 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1829, independent: 1686, independent conditional: 0, independent unconditional: 1686, dependent: 143, dependent conditional: 0, dependent unconditional: 143, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1014, independent: 965, independent conditional: 0, independent unconditional: 965, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1014, independent: 950, independent conditional: 0, independent unconditional: 950, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 64, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 498, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 461, dependent conditional: 0, dependent unconditional: 461, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1829, independent: 721, independent conditional: 0, independent unconditional: 721, dependent: 94, dependent conditional: 0, dependent unconditional: 94, unknown: 1014, unknown conditional: 0, unknown unconditional: 1014] , Statistics on independence cache: Total cache size (in pairs): 112, Positive cache size: 97, Positive conditional cache size: 0, Positive unconditional cache size: 97, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, 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: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L734] 0 int y$w_buff0; [L736] 0 int y$w_buff1; [L711] 0 int __unbuffered_p0_EAX = 0; [L728] 0 _Bool y$r_buff0_thd2; [L725] 0 int y$mem_tmp; [L715] 0 int __unbuffered_p1_EAX = 0; [L726] 0 _Bool y$r_buff0_thd0; [L727] 0 _Bool y$r_buff0_thd1; [L732] 0 _Bool y$read_delayed; [L709] 0 int __unbuffered_cnt = 0; [L724] 0 _Bool y$flush_delayed; [L713] 0 int __unbuffered_p0_EBX = 0; [L737] 0 _Bool y$w_buff1_used; [L719] 0 _Bool main$tmp_guard1; [L718] 0 _Bool main$tmp_guard0; [L717] 0 int __unbuffered_p1_EBX = 0; [L733] 0 int *y$read_delayed_var; [L735] 0 _Bool y$w_buff0_used; [L721] 0 int x = 0; [L729] 0 _Bool y$r_buff1_thd0; [L723] 0 int y = 0; [L731] 0 _Bool y$r_buff1_thd2; [L739] 0 int z = 0; [L730] 0 _Bool y$r_buff1_thd1; [L831] 0 pthread_t t243; [L832] FCALL, FORK 0 pthread_create(&t243, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t243, ((void *)0), P0, ((void *)0))=-1, t243={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L833] 0 pthread_t t244; [L834] FCALL, FORK 0 pthread_create(&t244, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t244, ((void *)0), P1, ((void *)0))=0, t243={3:0}, t244={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L779] 2 y$w_buff1 = y$w_buff0 [L780] 2 y$w_buff0 = 1 [L781] 2 y$w_buff1_used = y$w_buff0_used [L782] 2 y$w_buff0_used = (_Bool)1 [L783] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L783] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L784] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L785] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L786] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L787] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L790] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 2 y$flush_delayed = weak$$choice2 [L793] 2 y$mem_tmp = y [L794] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L795] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L796] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L797] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L798] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L799] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L800] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L801] 2 __unbuffered_p1_EAX = y [L802] 2 y = y$flush_delayed ? y$mem_tmp : y [L803] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=2, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L806] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=2, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L745] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=2, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 1 x = 1 [L751] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=2, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] 1 y$mem_tmp = y [L758] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L759] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L760] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L761] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L762] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L764] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 __unbuffered_p0_EBX = y [L766] 1 y = y$flush_delayed ? y$mem_tmp : y [L767] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L809] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L810] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L811] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L812] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L813] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L772] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L774] 1 return 0; [L816] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 2 return 0; [L836] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L838] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L838] RET 0 assume_abort_if_not(main$tmp_guard0) [L840] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L841] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L842] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L843] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L844] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t243={3:0}, t244={7:0}, weak$$choice0=3, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L847] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L849] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 19]: 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. - 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: 829]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 834]: 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: 832]: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 129 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 12.3s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 79 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 79 mSDsluCounter, 21 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 332 IncrementalHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 8 mSDtfsCounter, 332 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=244occurred in iteration=0, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 56 NumberOfCodeBlocks, 56 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 35 ConstructedInterpolants, 0 QuantifiedInterpolants, 225 SizeOfPredicates, 10 NumberOfNonLiveVariables, 421 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 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-16 19:26:28,387 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4588e1a9-8acb-491a-82e3-194ba0513df7/bin/utaipan-Xvt2sAort0/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