./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix015.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix015.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4f8371a34a183593aa0efc399c0d4d9ea84f8dd0da99bba9eb7bddd73e7a457d --- 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 10:58:45,267 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 10:58:45,270 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 10:58:45,297 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 10:58:45,297 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 10:58:45,298 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 10:58:45,300 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 10:58:45,301 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 10:58:45,303 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 10:58:45,304 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 10:58:45,305 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 10:58:45,306 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 10:58:45,307 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 10:58:45,308 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 10:58:45,309 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 10:58:45,310 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 10:58:45,311 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 10:58:45,312 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 10:58:45,314 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 10:58:45,316 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 10:58:45,318 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 10:58:45,319 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 10:58:45,321 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 10:58:45,322 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 10:58:45,325 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 10:58:45,326 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 10:58:45,326 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 10:58:45,327 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 10:58:45,328 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 10:58:45,329 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 10:58:45,329 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 10:58:45,330 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 10:58:45,331 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 10:58:45,332 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 10:58:45,333 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 10:58:45,334 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 10:58:45,335 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 10:58:45,335 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 10:58:45,335 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 10:58:45,336 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 10:58:45,337 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 10:58:45,339 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-16 10:58:45,374 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 10:58:45,375 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 10:58:45,376 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 10:58:45,376 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 10:58:45,377 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 10:58:45,377 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 10:58:45,378 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 10:58:45,378 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 10:58:45,378 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 10:58:45,378 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 10:58:45,379 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 10:58:45,380 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 10:58:45,380 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 10:58:45,380 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 10:58:45,380 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 10:58:45,380 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-16 10:58:45,380 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-16 10:58:45,381 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-16 10:58:45,381 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 10:58:45,381 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 10:58:45,381 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 10:58:45,381 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 10:58:45,382 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 10:58:45,382 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 10:58:45,382 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 10:58:45,382 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 10:58:45,384 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 10:58:45,384 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 10:58:45,384 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 10:58:45,384 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 10:58:45,384 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_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/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_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4f8371a34a183593aa0efc399c0d4d9ea84f8dd0da99bba9eb7bddd73e7a457d [2022-11-16 10:58:45,667 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 10:58:45,699 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 10:58:45,703 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 10:58:45,705 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 10:58:45,706 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 10:58:45,707 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/pthread-wmm/mix015.opt.i [2022-11-16 10:58:45,797 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/data/88c1405a3/d277601da1a041e29c421c3736141923/FLAG1fdfcb625 [2022-11-16 10:58:46,359 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 10:58:46,360 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/sv-benchmarks/c/pthread-wmm/mix015.opt.i [2022-11-16 10:58:46,375 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/data/88c1405a3/d277601da1a041e29c421c3736141923/FLAG1fdfcb625 [2022-11-16 10:58:46,639 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/data/88c1405a3/d277601da1a041e29c421c3736141923 [2022-11-16 10:58:46,641 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 10:58:46,643 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 10:58:46,645 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 10:58:46,645 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 10:58:46,649 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 10:58:46,649 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:58:46" (1/1) ... [2022-11-16 10:58:46,651 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35d12f08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:46, skipping insertion in model container [2022-11-16 10:58:46,651 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:58:46" (1/1) ... [2022-11-16 10:58:46,658 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 10:58:46,718 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 10:58:46,921 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_d8366f8f-0a5b-4e19-8557-9d4168020571/sv-benchmarks/c/pthread-wmm/mix015.opt.i[944,957] [2022-11-16 10:58:47,118 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 10:58:47,126 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 10:58:47,138 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_d8366f8f-0a5b-4e19-8557-9d4168020571/sv-benchmarks/c/pthread-wmm/mix015.opt.i[944,957] [2022-11-16 10:58:47,182 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 10:58:47,212 INFO L208 MainTranslator]: Completed translation [2022-11-16 10:58:47,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:47 WrapperNode [2022-11-16 10:58:47,213 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 10:58:47,214 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 10:58:47,214 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 10:58:47,214 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 10:58:47,222 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:47" (1/1) ... [2022-11-16 10:58:47,258 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:47" (1/1) ... [2022-11-16 10:58:47,310 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 150 [2022-11-16 10:58:47,311 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 10:58:47,312 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 10:58:47,312 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 10:58:47,312 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 10:58:47,321 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:47" (1/1) ... [2022-11-16 10:58:47,322 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:47" (1/1) ... [2022-11-16 10:58:47,337 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:47" (1/1) ... [2022-11-16 10:58:47,339 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:47" (1/1) ... [2022-11-16 10:58:47,347 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:47" (1/1) ... [2022-11-16 10:58:47,363 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:47" (1/1) ... [2022-11-16 10:58:47,365 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:47" (1/1) ... [2022-11-16 10:58:47,367 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:47" (1/1) ... [2022-11-16 10:58:47,374 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 10:58:47,382 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 10:58:47,382 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 10:58:47,382 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 10:58:47,383 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:47" (1/1) ... [2022-11-16 10:58:47,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 10:58:47,403 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 10:58:47,421 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 10:58:47,449 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 10:58:47,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 10:58:47,470 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 10:58:47,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 10:58:47,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 10:58:47,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 10:58:47,470 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-16 10:58:47,471 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-16 10:58:47,471 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-16 10:58:47,471 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-16 10:58:47,471 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-16 10:58:47,471 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-16 10:58:47,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 10:58:47,472 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 10:58:47,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 10:58:47,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 10:58:47,474 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 10:58:47,673 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 10:58:47,675 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 10:58:48,107 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 10:58:48,308 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 10:58:48,308 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-16 10:58:48,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 10:58:48 BoogieIcfgContainer [2022-11-16 10:58:48,311 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 10:58:48,314 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 10:58:48,314 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 10:58:48,317 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 10:58:48,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 10:58:46" (1/3) ... [2022-11-16 10:58:48,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d436d3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:58:48, skipping insertion in model container [2022-11-16 10:58:48,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:47" (2/3) ... [2022-11-16 10:58:48,319 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d436d3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:58:48, skipping insertion in model container [2022-11-16 10:58:48,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 10:58:48" (3/3) ... [2022-11-16 10:58:48,321 INFO L112 eAbstractionObserver]: Analyzing ICFG mix015.opt.i [2022-11-16 10:58:48,344 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 10:58:48,345 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-11-16 10:58:48,345 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 10:58:48,435 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-16 10:58:48,470 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-16 10:58:48,485 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 130 transitions, 275 flow [2022-11-16 10:58:48,488 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 130 transitions, 275 flow [2022-11-16 10:58:48,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 130 transitions, 275 flow [2022-11-16 10:58:48,555 INFO L130 PetriNetUnfolder]: 2/127 cut-off events. [2022-11-16 10:58:48,555 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 10:58:48,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/116 useless extension candidates. Maximal degree in co-relation 81. Up to 2 conditions per place. [2022-11-16 10:58:48,565 INFO L119 LiptonReduction]: Number of co-enabled transitions 2400 [2022-11-16 10:58:54,614 INFO L134 LiptonReduction]: Checked pairs total: 5971 [2022-11-16 10:58:54,614 INFO L136 LiptonReduction]: Total number of compositions: 132 [2022-11-16 10:58:54,623 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 44 places, 35 transitions, 85 flow [2022-11-16 10:58:54,697 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 984 states, 973 states have (on average 3.317574511819116) internal successors, (3228), 983 states have internal predecessors, (3228), 0 states have call successors, (0), 0 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 10:58:54,715 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 10:58:54,722 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;@196041d9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 10:58:54,722 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-11-16 10:58:54,727 INFO L276 IsEmpty]: Start isEmpty. Operand has 984 states, 973 states have (on average 3.317574511819116) internal successors, (3228), 983 states have internal predecessors, (3228), 0 states have call successors, (0), 0 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 10:58:54,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-16 10:58:54,732 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:58:54,732 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-16 10:58:54,733 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 10:58:54,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:58:54,738 INFO L85 PathProgramCache]: Analyzing trace with hash 575, now seen corresponding path program 1 times [2022-11-16 10:58:54,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:58:54,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878002033] [2022-11-16 10:58:54,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:58:54,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:58:54,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:58:54,853 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 10:58:54,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:58:54,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878002033] [2022-11-16 10:58:54,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878002033] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:58:54,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:58:54,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-16 10:58:54,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326611761] [2022-11-16 10:58:54,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:58:54,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 10:58:54,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:58:54,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 10:58:54,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 10:58:54,907 INFO L87 Difference]: Start difference. First operand has 984 states, 973 states have (on average 3.317574511819116) internal successors, (3228), 983 states have internal predecessors, (3228), 0 states have call successors, (0), 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 10:58:55,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:58:55,013 INFO L93 Difference]: Finished difference Result 932 states and 2966 transitions. [2022-11-16 10:58:55,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 10:58:55,019 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 10:58:55,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:58:55,050 INFO L225 Difference]: With dead ends: 932 [2022-11-16 10:58:55,050 INFO L226 Difference]: Without dead ends: 932 [2022-11-16 10:58:55,051 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 10:58:55,056 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 10:58:55,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 10:58:55,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2022-11-16 10:58:55,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 932. [2022-11-16 10:58:55,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 927 states have (on average 3.199568500539374) internal successors, (2966), 931 states have internal predecessors, (2966), 0 states have call successors, (0), 0 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 10:58:55,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 2966 transitions. [2022-11-16 10:58:55,166 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 2966 transitions. Word has length 1 [2022-11-16 10:58:55,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:58:55,166 INFO L495 AbstractCegarLoop]: Abstraction has 932 states and 2966 transitions. [2022-11-16 10:58:55,170 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 10:58:55,172 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 2966 transitions. [2022-11-16 10:58:55,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-16 10:58:55,173 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:58:55,173 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:58:55,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 10:58:55,173 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 10:58:55,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:58:55,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1025041505, now seen corresponding path program 1 times [2022-11-16 10:58:55,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:58:55,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115978352] [2022-11-16 10:58:55,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:58:55,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:58:55,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:58:55,561 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 10:58:55,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:58:55,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115978352] [2022-11-16 10:58:55,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115978352] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:58:55,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:58:55,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 10:58:55,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283080605] [2022-11-16 10:58:55,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:58:55,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 10:58:55,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:58:55,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 10:58:55,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 10:58:55,565 INFO L87 Difference]: Start difference. First operand 932 states and 2966 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 10:58:55,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:58:55,631 INFO L93 Difference]: Finished difference Result 792 states and 2489 transitions. [2022-11-16 10:58:55,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 10:58:55,632 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 10:58:55,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:58:55,636 INFO L225 Difference]: With dead ends: 792 [2022-11-16 10:58:55,637 INFO L226 Difference]: Without dead ends: 772 [2022-11-16 10:58:55,637 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 10:58:55,638 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 11 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 10:58:55,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 6 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 10:58:55,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2022-11-16 10:58:55,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 772. [2022-11-16 10:58:55,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 772 states, 770 states have (on average 3.1662337662337663) internal successors, (2438), 771 states have internal predecessors, (2438), 0 states have call successors, (0), 0 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 10:58:55,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 2438 transitions. [2022-11-16 10:58:55,665 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 2438 transitions. Word has length 7 [2022-11-16 10:58:55,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:58:55,666 INFO L495 AbstractCegarLoop]: Abstraction has 772 states and 2438 transitions. [2022-11-16 10:58:55,667 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 10:58:55,667 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 2438 transitions. [2022-11-16 10:58:55,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-16 10:58:55,668 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:58:55,668 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:58:55,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 10:58:55,668 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 10:58:55,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:58:55,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1517471098, now seen corresponding path program 1 times [2022-11-16 10:58:55,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:58:55,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119295298] [2022-11-16 10:58:55,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:58:55,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:58:55,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:58:55,973 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 10:58:55,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:58:55,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119295298] [2022-11-16 10:58:55,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119295298] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:58:55,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:58:55,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 10:58:55,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49024120] [2022-11-16 10:58:55,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:58:55,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 10:58:55,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:58:55,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 10:58:55,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 10:58:55,977 INFO L87 Difference]: Start difference. First operand 772 states and 2438 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 10:58:56,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:58:56,073 INFO L93 Difference]: Finished difference Result 988 states and 3042 transitions. [2022-11-16 10:58:56,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 10:58:56,074 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 10:58:56,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:58:56,080 INFO L225 Difference]: With dead ends: 988 [2022-11-16 10:58:56,080 INFO L226 Difference]: Without dead ends: 988 [2022-11-16 10:58:56,081 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 10:58:56,084 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 9 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 10:58:56,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 5 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 10:58:56,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2022-11-16 10:58:56,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 764. [2022-11-16 10:58:56,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 764 states, 762 states have (on average 3.15748031496063) internal successors, (2406), 763 states have internal predecessors, (2406), 0 states have call successors, (0), 0 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 10:58:56,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 2406 transitions. [2022-11-16 10:58:56,159 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 2406 transitions. Word has length 9 [2022-11-16 10:58:56,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:58:56,160 INFO L495 AbstractCegarLoop]: Abstraction has 764 states and 2406 transitions. [2022-11-16 10:58:56,160 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 10:58:56,160 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 2406 transitions. [2022-11-16 10:58:56,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-16 10:58:56,163 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:58:56,163 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:58:56,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 10:58:56,164 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 10:58:56,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:58:56,165 INFO L85 PathProgramCache]: Analyzing trace with hash -203035597, now seen corresponding path program 1 times [2022-11-16 10:58:56,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:58:56,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863513448] [2022-11-16 10:58:56,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:58:56,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:58:56,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:58:56,679 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 10:58:56,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:58:56,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863513448] [2022-11-16 10:58:56,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863513448] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:58:56,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:58:56,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 10:58:56,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504041313] [2022-11-16 10:58:56,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:58:56,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 10:58:56,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:58:56,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 10:58:56,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 10:58:56,690 INFO L87 Difference]: Start difference. First operand 764 states and 2406 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:58:56,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:58:56,940 INFO L93 Difference]: Finished difference Result 772 states and 2338 transitions. [2022-11-16 10:58:56,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 10:58:56,941 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-16 10:58:56,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:58:56,945 INFO L225 Difference]: With dead ends: 772 [2022-11-16 10:58:56,945 INFO L226 Difference]: Without dead ends: 652 [2022-11-16 10:58:56,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 10:58:56,948 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 31 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 10:58:56,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 41 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 10:58:56,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2022-11-16 10:58:56,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 652. [2022-11-16 10:58:56,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 650 states have (on average 3.0953846153846154) internal successors, (2012), 651 states have internal predecessors, (2012), 0 states have call successors, (0), 0 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 10:58:56,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 2012 transitions. [2022-11-16 10:58:56,976 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 2012 transitions. Word has length 10 [2022-11-16 10:58:56,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:58:56,976 INFO L495 AbstractCegarLoop]: Abstraction has 652 states and 2012 transitions. [2022-11-16 10:58:56,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:58:56,977 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 2012 transitions. [2022-11-16 10:58:56,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-16 10:58:56,983 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:58:56,984 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:58:56,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 10:58:56,984 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 10:58:56,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:58:56,985 INFO L85 PathProgramCache]: Analyzing trace with hash -2077634128, now seen corresponding path program 1 times [2022-11-16 10:58:56,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:58:56,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963361997] [2022-11-16 10:58:56,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:58:56,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:58:57,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:58:57,262 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 10:58:57,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:58:57,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963361997] [2022-11-16 10:58:57,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963361997] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:58:57,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:58:57,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 10:58:57,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52103613] [2022-11-16 10:58:57,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:58:57,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 10:58:57,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:58:57,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 10:58:57,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 10:58:57,271 INFO L87 Difference]: Start difference. First operand 652 states and 2012 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 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 10:58:57,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:58:57,350 INFO L93 Difference]: Finished difference Result 620 states and 1900 transitions. [2022-11-16 10:58:57,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 10:58:57,351 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 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 10:58:57,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:58:57,362 INFO L225 Difference]: With dead ends: 620 [2022-11-16 10:58:57,362 INFO L226 Difference]: Without dead ends: 620 [2022-11-16 10:58:57,363 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 10:58:57,364 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 9 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 10:58:57,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 5 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 10:58:57,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2022-11-16 10:58:57,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2022-11-16 10:58:57,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 618 states have (on average 3.074433656957929) internal successors, (1900), 619 states have internal predecessors, (1900), 0 states have call successors, (0), 0 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 10:58:57,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 1900 transitions. [2022-11-16 10:58:57,392 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 1900 transitions. Word has length 11 [2022-11-16 10:58:57,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:58:57,393 INFO L495 AbstractCegarLoop]: Abstraction has 620 states and 1900 transitions. [2022-11-16 10:58:57,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 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 10:58:57,394 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 1900 transitions. [2022-11-16 10:58:57,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-16 10:58:57,396 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:58:57,396 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:58:57,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 10:58:57,397 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 10:58:57,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:58:57,397 INFO L85 PathProgramCache]: Analyzing trace with hash 17852093, now seen corresponding path program 1 times [2022-11-16 10:58:57,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:58:57,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084677802] [2022-11-16 10:58:57,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:58:57,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:58:57,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:58:58,341 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 10:58:58,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:58:58,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084677802] [2022-11-16 10:58:58,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084677802] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:58:58,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:58:58,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 10:58:58,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737734387] [2022-11-16 10:58:58,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:58:58,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 10:58:58,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:58:58,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 10:58:58,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-16 10:58:58,344 INFO L87 Difference]: Start difference. First operand 620 states and 1900 transitions. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:58:58,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:58:58,692 INFO L93 Difference]: Finished difference Result 908 states and 2744 transitions. [2022-11-16 10:58:58,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 10:58:58,692 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-16 10:58:58,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:58:58,697 INFO L225 Difference]: With dead ends: 908 [2022-11-16 10:58:58,697 INFO L226 Difference]: Without dead ends: 828 [2022-11-16 10:58:58,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-16 10:58:58,698 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 43 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 10:58:58,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 83 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 10:58:58,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2022-11-16 10:58:58,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 780. [2022-11-16 10:58:58,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 780 states, 778 states have (on average 3.0539845758354756) internal successors, (2376), 779 states have internal predecessors, (2376), 0 states have call successors, (0), 0 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 10:58:58,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 2376 transitions. [2022-11-16 10:58:58,725 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 2376 transitions. Word has length 12 [2022-11-16 10:58:58,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:58:58,726 INFO L495 AbstractCegarLoop]: Abstraction has 780 states and 2376 transitions. [2022-11-16 10:58:58,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:58:58,726 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 2376 transitions. [2022-11-16 10:58:58,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-16 10:58:58,727 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:58:58,727 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:58:58,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 10:58:58,728 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 10:58:58,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:58:58,728 INFO L85 PathProgramCache]: Analyzing trace with hash 113452373, now seen corresponding path program 2 times [2022-11-16 10:58:58,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:58:58,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531575704] [2022-11-16 10:58:58,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:58:58,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:58:58,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:58:59,626 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 10:58:59,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:58:59,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531575704] [2022-11-16 10:58:59,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531575704] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:58:59,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:58:59,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 10:58:59,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359739035] [2022-11-16 10:58:59,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:58:59,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 10:58:59,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:58:59,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 10:58:59,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-16 10:58:59,629 INFO L87 Difference]: Start difference. First operand 780 states and 2376 transitions. Second operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:58:59,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:58:59,927 INFO L93 Difference]: Finished difference Result 1004 states and 2981 transitions. [2022-11-16 10:58:59,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 10:58:59,928 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-16 10:58:59,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:58:59,933 INFO L225 Difference]: With dead ends: 1004 [2022-11-16 10:58:59,933 INFO L226 Difference]: Without dead ends: 924 [2022-11-16 10:58:59,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-16 10:58:59,934 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 65 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 10:58:59,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 58 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 10:58:59,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2022-11-16 10:58:59,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 730. [2022-11-16 10:58:59,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 730 states, 728 states have (on average 2.9766483516483517) internal successors, (2167), 729 states have internal predecessors, (2167), 0 states have call successors, (0), 0 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 10:58:59,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 2167 transitions. [2022-11-16 10:58:59,960 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 2167 transitions. Word has length 12 [2022-11-16 10:58:59,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:58:59,961 INFO L495 AbstractCegarLoop]: Abstraction has 730 states and 2167 transitions. [2022-11-16 10:58:59,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:58:59,961 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 2167 transitions. [2022-11-16 10:58:59,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 10:58:59,963 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:58:59,963 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:58:59,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 10:58:59,963 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 10:58:59,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:58:59,964 INFO L85 PathProgramCache]: Analyzing trace with hash 553356266, now seen corresponding path program 1 times [2022-11-16 10:58:59,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:58:59,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326941728] [2022-11-16 10:58:59,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:58:59,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:58:59,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:59:00,130 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 10:59:00,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:59:00,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326941728] [2022-11-16 10:59:00,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326941728] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:59:00,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:59:00,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 10:59:00,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053264005] [2022-11-16 10:59:00,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:59:00,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 10:59:00,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:59:00,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 10:59:00,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 10:59:00,137 INFO L87 Difference]: Start difference. First operand 730 states and 2167 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:59:00,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:59:00,270 INFO L93 Difference]: Finished difference Result 708 states and 1847 transitions. [2022-11-16 10:59:00,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 10:59:00,270 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-16 10:59:00,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:59:00,273 INFO L225 Difference]: With dead ends: 708 [2022-11-16 10:59:00,274 INFO L226 Difference]: Without dead ends: 528 [2022-11-16 10:59:00,274 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 10:59:00,274 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 32 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 10:59:00,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 15 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 10:59:00,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2022-11-16 10:59:00,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2022-11-16 10:59:00,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 526 states have (on average 2.5722433460076046) internal successors, (1353), 527 states have internal predecessors, (1353), 0 states have call successors, (0), 0 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 10:59:00,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 1353 transitions. [2022-11-16 10:59:00,301 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 1353 transitions. Word has length 13 [2022-11-16 10:59:00,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:59:00,301 INFO L495 AbstractCegarLoop]: Abstraction has 528 states and 1353 transitions. [2022-11-16 10:59:00,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:59:00,301 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 1353 transitions. [2022-11-16 10:59:00,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-16 10:59:00,302 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:59:00,303 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:59:00,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 10:59:00,303 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 10:59:00,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:59:00,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1300181479, now seen corresponding path program 1 times [2022-11-16 10:59:00,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:59:00,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523054509] [2022-11-16 10:59:00,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:59:00,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:59:00,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:59:00,563 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 10:59:00,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:59:00,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523054509] [2022-11-16 10:59:00,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523054509] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:59:00,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:59:00,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 10:59:00,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261012856] [2022-11-16 10:59:00,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:59:00,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 10:59:00,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:59:00,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 10:59:00,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 10:59:00,567 INFO L87 Difference]: Start difference. First operand 528 states and 1353 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:59:00,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:59:00,710 INFO L93 Difference]: Finished difference Result 417 states and 959 transitions. [2022-11-16 10:59:00,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 10:59:00,711 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-16 10:59:00,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:59:00,712 INFO L225 Difference]: With dead ends: 417 [2022-11-16 10:59:00,713 INFO L226 Difference]: Without dead ends: 317 [2022-11-16 10:59:00,713 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 10:59:00,714 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 56 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 10:59:00,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 21 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 10:59:00,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2022-11-16 10:59:00,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2022-11-16 10:59:00,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 315 states have (on average 2.250793650793651) internal successors, (709), 316 states have internal predecessors, (709), 0 states have call successors, (0), 0 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 10:59:00,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 709 transitions. [2022-11-16 10:59:00,731 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 709 transitions. Word has length 15 [2022-11-16 10:59:00,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:59:00,732 INFO L495 AbstractCegarLoop]: Abstraction has 317 states and 709 transitions. [2022-11-16 10:59:00,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:59:00,732 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 709 transitions. [2022-11-16 10:59:00,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 10:59:00,733 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:59:00,734 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:59:00,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 10:59:00,734 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 10:59:00,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:59:00,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1296534862, now seen corresponding path program 1 times [2022-11-16 10:59:00,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:59:00,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673428965] [2022-11-16 10:59:00,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:59:00,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:59:00,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:59:00,983 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 10:59:00,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:59:00,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673428965] [2022-11-16 10:59:00,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673428965] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:59:00,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:59:00,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 10:59:00,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84339963] [2022-11-16 10:59:00,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:59:00,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 10:59:00,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:59:00,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 10:59:00,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-16 10:59:00,986 INFO L87 Difference]: Start difference. First operand 317 states and 709 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:59:01,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:59:01,117 INFO L93 Difference]: Finished difference Result 273 states and 611 transitions. [2022-11-16 10:59:01,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 10:59:01,117 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-16 10:59:01,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:59:01,119 INFO L225 Difference]: With dead ends: 273 [2022-11-16 10:59:01,119 INFO L226 Difference]: Without dead ends: 249 [2022-11-16 10:59:01,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-16 10:59:01,120 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 53 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 10:59:01,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 18 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 10:59:01,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-11-16 10:59:01,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2022-11-16 10:59:01,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 247 states have (on average 2.2955465587044532) internal successors, (567), 248 states have internal predecessors, (567), 0 states have call successors, (0), 0 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 10:59:01,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 567 transitions. [2022-11-16 10:59:01,130 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 567 transitions. Word has length 18 [2022-11-16 10:59:01,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:59:01,130 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 567 transitions. [2022-11-16 10:59:01,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:59:01,130 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 567 transitions. [2022-11-16 10:59:01,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-16 10:59:01,131 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:59:01,131 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:59:01,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 10:59:01,132 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 10:59:01,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:59:01,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1893730752, now seen corresponding path program 1 times [2022-11-16 10:59:01,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:59:01,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731236017] [2022-11-16 10:59:01,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:59:01,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:59:01,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:59:01,375 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 10:59:01,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:59:01,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731236017] [2022-11-16 10:59:01,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731236017] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:59:01,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:59:01,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 10:59:01,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175016931] [2022-11-16 10:59:01,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:59:01,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 10:59:01,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:59:01,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 10:59:01,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 10:59:01,379 INFO L87 Difference]: Start difference. First operand 249 states and 567 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:59:01,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:59:01,485 INFO L93 Difference]: Finished difference Result 329 states and 722 transitions. [2022-11-16 10:59:01,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 10:59:01,486 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-16 10:59:01,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:59:01,487 INFO L225 Difference]: With dead ends: 329 [2022-11-16 10:59:01,487 INFO L226 Difference]: Without dead ends: 297 [2022-11-16 10:59:01,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 10:59:01,488 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 35 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 10:59:01,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 8 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 10:59:01,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2022-11-16 10:59:01,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 245. [2022-11-16 10:59:01,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 243 states have (on average 2.205761316872428) internal successors, (536), 244 states have internal predecessors, (536), 0 states have call successors, (0), 0 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 10:59:01,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 536 transitions. [2022-11-16 10:59:01,496 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 536 transitions. Word has length 21 [2022-11-16 10:59:01,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:59:01,496 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 536 transitions. [2022-11-16 10:59:01,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:59:01,497 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 536 transitions. [2022-11-16 10:59:01,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-16 10:59:01,497 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:59:01,498 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:59:01,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 10:59:01,499 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 10:59:01,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:59:01,499 INFO L85 PathProgramCache]: Analyzing trace with hash -960184704, now seen corresponding path program 2 times [2022-11-16 10:59:01,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:59:01,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648120112] [2022-11-16 10:59:01,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:59:01,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:59:01,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:59:01,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 10:59:01,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:59:01,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648120112] [2022-11-16 10:59:01,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648120112] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:59:01,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:59:01,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 10:59:01,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946973977] [2022-11-16 10:59:01,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:59:01,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 10:59:01,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:59:01,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 10:59:01,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 10:59:01,723 INFO L87 Difference]: Start difference. First operand 245 states and 536 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:59:01,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:59:01,867 INFO L93 Difference]: Finished difference Result 327 states and 692 transitions. [2022-11-16 10:59:01,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 10:59:01,868 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-16 10:59:01,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:59:01,869 INFO L225 Difference]: With dead ends: 327 [2022-11-16 10:59:01,869 INFO L226 Difference]: Without dead ends: 238 [2022-11-16 10:59:01,870 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-16 10:59:01,870 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 49 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 10:59:01,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 12 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 10:59:01,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-11-16 10:59:01,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 222. [2022-11-16 10:59:01,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 220 states have (on average 2.0454545454545454) internal successors, (450), 221 states have internal predecessors, (450), 0 states have call successors, (0), 0 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 10:59:01,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 450 transitions. [2022-11-16 10:59:01,879 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 450 transitions. Word has length 21 [2022-11-16 10:59:01,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:59:01,879 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 450 transitions. [2022-11-16 10:59:01,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:59:01,879 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 450 transitions. [2022-11-16 10:59:01,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-16 10:59:01,880 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:59:01,880 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:59:01,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-16 10:59:01,881 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 10:59:01,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:59:01,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1437885966, now seen corresponding path program 3 times [2022-11-16 10:59:01,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:59:01,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556231723] [2022-11-16 10:59:01,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:59:01,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:59:01,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:59:02,893 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 10:59:02,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:59:02,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556231723] [2022-11-16 10:59:02,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556231723] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:59:02,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:59:02,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 10:59:02,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377005165] [2022-11-16 10:59:02,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:59:02,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 10:59:02,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:59:02,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 10:59:02,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 10:59:02,895 INFO L87 Difference]: Start difference. First operand 222 states and 450 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:59:03,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:59:03,135 INFO L93 Difference]: Finished difference Result 232 states and 464 transitions. [2022-11-16 10:59:03,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 10:59:03,136 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-16 10:59:03,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:59:03,137 INFO L225 Difference]: With dead ends: 232 [2022-11-16 10:59:03,137 INFO L226 Difference]: Without dead ends: 208 [2022-11-16 10:59:03,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-16 10:59:03,138 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 57 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 10:59:03,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 21 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 10:59:03,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-11-16 10:59:03,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2022-11-16 10:59:03,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 206 states have (on average 2.029126213592233) internal successors, (418), 207 states have internal predecessors, (418), 0 states have call successors, (0), 0 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 10:59:03,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 418 transitions. [2022-11-16 10:59:03,144 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 418 transitions. Word has length 21 [2022-11-16 10:59:03,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:59:03,144 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 418 transitions. [2022-11-16 10:59:03,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:59:03,145 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 418 transitions. [2022-11-16 10:59:03,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-16 10:59:03,145 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:59:03,145 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:59:03,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-16 10:59:03,146 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 10:59:03,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:59:03,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1253016498, now seen corresponding path program 4 times [2022-11-16 10:59:03,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:59:03,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874120940] [2022-11-16 10:59:03,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:59:03,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:59:03,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 10:59:03,187 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 10:59:03,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 10:59:03,247 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 10:59:03,247 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 10:59:03,248 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2022-11-16 10:59:03,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2022-11-16 10:59:03,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-11-16 10:59:03,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-11-16 10:59:03,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-11-16 10:59:03,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-11-16 10:59:03,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-11-16 10:59:03,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-11-16 10:59:03,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2022-11-16 10:59:03,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2022-11-16 10:59:03,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2022-11-16 10:59:03,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2022-11-16 10:59:03,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-11-16 10:59:03,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-16 10:59:03,255 INFO L444 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:59:03,260 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-16 10:59:03,260 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 10:59:03,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 10:59:03 BasicIcfg [2022-11-16 10:59:03,351 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 10:59:03,352 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 10:59:03,352 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 10:59:03,352 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 10:59:03,353 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 10:58:48" (3/4) ... [2022-11-16 10:59:03,355 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-16 10:59:03,355 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 10:59:03,356 INFO L158 Benchmark]: Toolchain (without parser) took 16713.18ms. Allocated memory was 155.2MB in the beginning and 302.0MB in the end (delta: 146.8MB). Free memory was 119.7MB in the beginning and 162.2MB in the end (delta: -42.5MB). Peak memory consumption was 103.4MB. Max. memory is 16.1GB. [2022-11-16 10:59:03,356 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 92.3MB. Free memory is still 46.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 10:59:03,357 INFO L158 Benchmark]: CACSL2BoogieTranslator took 568.37ms. Allocated memory is still 155.2MB. Free memory was 119.7MB in the beginning and 115.8MB in the end (delta: 3.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-16 10:59:03,357 INFO L158 Benchmark]: Boogie Procedure Inliner took 97.19ms. Allocated memory is still 155.2MB. Free memory was 115.8MB in the beginning and 112.9MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 10:59:03,357 INFO L158 Benchmark]: Boogie Preprocessor took 69.41ms. Allocated memory is still 155.2MB. Free memory was 112.9MB in the beginning and 111.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 10:59:03,358 INFO L158 Benchmark]: RCFGBuilder took 929.76ms. Allocated memory is still 155.2MB. Free memory was 111.1MB in the beginning and 74.0MB in the end (delta: 37.1MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2022-11-16 10:59:03,358 INFO L158 Benchmark]: TraceAbstraction took 15037.90ms. Allocated memory was 155.2MB in the beginning and 302.0MB in the end (delta: 146.8MB). Free memory was 73.4MB in the beginning and 162.2MB in the end (delta: -88.8MB). Peak memory consumption was 59.7MB. Max. memory is 16.1GB. [2022-11-16 10:59:03,358 INFO L158 Benchmark]: Witness Printer took 3.60ms. Allocated memory is still 302.0MB. Free memory is still 162.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 10:59:03,360 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.29ms. Allocated memory is still 92.3MB. Free memory is still 46.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 568.37ms. Allocated memory is still 155.2MB. Free memory was 119.7MB in the beginning and 115.8MB in the end (delta: 3.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 97.19ms. Allocated memory is still 155.2MB. Free memory was 115.8MB in the beginning and 112.9MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.41ms. Allocated memory is still 155.2MB. Free memory was 112.9MB in the beginning and 111.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 929.76ms. Allocated memory is still 155.2MB. Free memory was 111.1MB in the beginning and 74.0MB in the end (delta: 37.1MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 15037.90ms. Allocated memory was 155.2MB in the beginning and 302.0MB in the end (delta: 146.8MB). Free memory was 73.4MB in the beginning and 162.2MB in the end (delta: -88.8MB). Peak memory consumption was 59.7MB. Max. memory is 16.1GB. * Witness Printer took 3.60ms. Allocated memory is still 302.0MB. Free memory is still 162.2MB. 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: 6.1s, 138 PlacesBefore, 44 PlacesAfterwards, 130 TransitionsBefore, 35 TransitionsAfterwards, 2400 CoEnabledTransitionPairs, 7 FixpointIterations, 56 TrivialSequentialCompositions, 67 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 132 TotalNumberOfCompositions, 5971 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3450, independent: 3278, independent conditional: 0, independent unconditional: 3278, dependent: 172, dependent conditional: 0, dependent unconditional: 172, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1739, independent: 1693, independent conditional: 0, independent unconditional: 1693, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1739, independent: 1673, independent conditional: 0, independent unconditional: 1673, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 66, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 340, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 301, dependent conditional: 0, dependent unconditional: 301, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3450, independent: 1585, independent conditional: 0, independent unconditional: 1585, dependent: 126, dependent conditional: 0, dependent unconditional: 126, unknown: 1739, unknown conditional: 0, unknown unconditional: 1739] , Statistics on independence cache: Total cache size (in pairs): 199, Positive cache size: 176, Positive conditional cache size: 0, Positive unconditional cache size: 176, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23, 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: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L719] 0 int __unbuffered_p2_EBX = 0; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L746] 0 _Bool weak$$choice0; [L744] 0 int z$w_buff1; [L747] 0 _Bool weak$$choice2; [L711] 0 int __unbuffered_p0_EAX = 0; [L730] 0 _Bool z$flush_delayed; [L742] 0 int z$w_buff0; [L733] 0 _Bool z$r_buff0_thd1; [L734] 0 _Bool z$r_buff0_thd2; [L715] 0 int __unbuffered_p1_EAX = 0; [L732] 0 _Bool z$r_buff0_thd0; [L735] 0 _Bool z$r_buff0_thd3; [L731] 0 int z$mem_tmp; [L740] 0 _Bool z$read_delayed; [L721] 0 int a = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L741] 0 int *z$read_delayed_var; [L745] 0 _Bool z$w_buff1_used; [L709] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L723] 0 _Bool main$tmp_guard1; [L722] 0 _Bool main$tmp_guard0; [L743] 0 _Bool z$w_buff0_used; [L725] 0 int x = 0; [L727] 0 int y = 0; [L729] 0 int z = 0; [L853] 0 pthread_t t388; [L854] FCALL, FORK 0 pthread_create(&t388, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t388, ((void *)0), P0, ((void *)0))=-1, t388={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] 0 pthread_t t389; [L856] FCALL, FORK 0 pthread_create(&t389, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t389, ((void *)0), P1, ((void *)0))=0, t388={5:0}, t389={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] 0 pthread_t t390; [L858] FCALL, FORK 0 pthread_create(&t390, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t390, ((void *)0), P2, ((void *)0))=1, t388={5:0}, t389={6:0}, t390={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L800] 3 z$w_buff1 = z$w_buff0 [L801] 3 z$w_buff0 = 1 [L802] 3 z$w_buff1_used = z$w_buff0_used [L803] 3 z$w_buff0_used = (_Bool)1 [L804] CALL 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L804] RET 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L805] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L806] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L807] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L808] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L809] 3 z$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0: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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L812] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 3 z$flush_delayed = weak$$choice2 [L815] 3 z$mem_tmp = z [L816] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L817] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L818] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L819] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L820] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L822] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L823] 3 __unbuffered_p2_EAX = z [L824] 3 z = z$flush_delayed ? z$mem_tmp : z [L825] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L828] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 a = 1 [L754] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L772] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 z$flush_delayed = weak$$choice2 [L778] 2 z$mem_tmp = z [L779] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L780] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L781] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L782] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L783] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L785] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EAX = z [L787] 2 z = z$flush_delayed ? z$mem_tmp : z [L788] 2 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L831] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L832] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L833] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L834] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L835] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 3 return 0; [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L865] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L866] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L867] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L868] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t388={5:0}, t389={6:0}, t390={3:0}, weak$$choice0=2, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L871] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L873] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: 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: -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: 851]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 858]: 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: 856]: 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: 854]: 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 7 procedures, 158 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 14.8s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 450 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 450 mSDsluCounter, 296 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 211 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1344 IncrementalHoareTripleChecker+Invalid, 1377 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 85 mSDtfsCounter, 1344 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=984occurred in iteration=0, InterpolantAutomatonStates: 70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 13 MinimizatonAttempts, 534 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 192 NumberOfCodeBlocks, 192 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 158 ConstructedInterpolants, 0 QuantifiedInterpolants, 1735 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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 10:59:03,383 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix015.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4f8371a34a183593aa0efc399c0d4d9ea84f8dd0da99bba9eb7bddd73e7a457d --- 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 10:59:05,747 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 10:59:05,750 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 10:59:05,787 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 10:59:05,788 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 10:59:05,792 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 10:59:05,794 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 10:59:05,800 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 10:59:05,802 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 10:59:05,808 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 10:59:05,809 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 10:59:05,811 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 10:59:05,812 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 10:59:05,814 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 10:59:05,816 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 10:59:05,817 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 10:59:05,819 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 10:59:05,821 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 10:59:05,826 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 10:59:05,833 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 10:59:05,835 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 10:59:05,837 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 10:59:05,839 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 10:59:05,840 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 10:59:05,848 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 10:59:05,849 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 10:59:05,850 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 10:59:05,852 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 10:59:05,852 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 10:59:05,853 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 10:59:05,854 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 10:59:05,855 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 10:59:05,856 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 10:59:05,857 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 10:59:05,858 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 10:59:05,858 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 10:59:05,860 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 10:59:05,860 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 10:59:05,860 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 10:59:05,862 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 10:59:05,863 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 10:59:05,872 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-16 10:59:05,913 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 10:59:05,913 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 10:59:05,914 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 10:59:05,914 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 10:59:05,915 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 10:59:05,915 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 10:59:05,916 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 10:59:05,917 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 10:59:05,917 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 10:59:05,917 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 10:59:05,918 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 10:59:05,918 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 10:59:05,919 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 10:59:05,919 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 10:59:05,919 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 10:59:05,920 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-16 10:59:05,920 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-16 10:59:05,920 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-16 10:59:05,920 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 10:59:05,920 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 10:59:05,921 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-16 10:59:05,921 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-16 10:59:05,921 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 10:59:05,921 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 10:59:05,921 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 10:59:05,922 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 10:59:05,922 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 10:59:05,922 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 10:59:05,923 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 10:59:05,923 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 10:59:05,923 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-16 10:59:05,923 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-16 10:59:05,924 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-16 10:59:05,924 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_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/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_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4f8371a34a183593aa0efc399c0d4d9ea84f8dd0da99bba9eb7bddd73e7a457d [2022-11-16 10:59:06,315 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 10:59:06,340 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 10:59:06,343 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 10:59:06,344 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 10:59:06,345 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 10:59:06,347 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/pthread-wmm/mix015.opt.i [2022-11-16 10:59:06,414 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/data/3a5738c59/d360d6d9ed6e42668017927f20265f2b/FLAG58bf64a84 [2022-11-16 10:59:07,015 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 10:59:07,016 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/sv-benchmarks/c/pthread-wmm/mix015.opt.i [2022-11-16 10:59:07,044 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/data/3a5738c59/d360d6d9ed6e42668017927f20265f2b/FLAG58bf64a84 [2022-11-16 10:59:07,346 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/data/3a5738c59/d360d6d9ed6e42668017927f20265f2b [2022-11-16 10:59:07,350 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 10:59:07,352 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 10:59:07,355 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 10:59:07,355 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 10:59:07,360 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 10:59:07,361 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:59:07" (1/1) ... [2022-11-16 10:59:07,362 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50136a27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:59:07, skipping insertion in model container [2022-11-16 10:59:07,363 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:59:07" (1/1) ... [2022-11-16 10:59:07,370 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 10:59:07,433 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 10:59:07,608 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_d8366f8f-0a5b-4e19-8557-9d4168020571/sv-benchmarks/c/pthread-wmm/mix015.opt.i[944,957] [2022-11-16 10:59:07,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 10:59:07,891 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 10:59:07,903 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_d8366f8f-0a5b-4e19-8557-9d4168020571/sv-benchmarks/c/pthread-wmm/mix015.opt.i[944,957] [2022-11-16 10:59:07,964 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 10:59:08,026 INFO L208 MainTranslator]: Completed translation [2022-11-16 10:59:08,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:59:08 WrapperNode [2022-11-16 10:59:08,027 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 10:59:08,029 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 10:59:08,029 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 10:59:08,029 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 10:59:08,036 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:59:08" (1/1) ... [2022-11-16 10:59:08,067 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:59:08" (1/1) ... [2022-11-16 10:59:08,120 INFO L138 Inliner]: procedures = 179, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 151 [2022-11-16 10:59:08,120 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 10:59:08,121 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 10:59:08,122 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 10:59:08,122 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 10:59:08,130 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:59:08" (1/1) ... [2022-11-16 10:59:08,131 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:59:08" (1/1) ... [2022-11-16 10:59:08,145 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:59:08" (1/1) ... [2022-11-16 10:59:08,146 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:59:08" (1/1) ... [2022-11-16 10:59:08,154 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:59:08" (1/1) ... [2022-11-16 10:59:08,168 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:59:08" (1/1) ... [2022-11-16 10:59:08,170 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:59:08" (1/1) ... [2022-11-16 10:59:08,188 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:59:08" (1/1) ... [2022-11-16 10:59:08,191 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 10:59:08,192 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 10:59:08,192 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 10:59:08,193 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 10:59:08,193 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:59:08" (1/1) ... [2022-11-16 10:59:08,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 10:59:08,229 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 10:59:08,241 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 10:59:08,253 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 10:59:08,288 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 10:59:08,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 10:59:08,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 10:59:08,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 10:59:08,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-16 10:59:08,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-16 10:59:08,289 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-16 10:59:08,291 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-16 10:59:08,292 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-16 10:59:08,292 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-16 10:59:08,292 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-16 10:59:08,292 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-16 10:59:08,293 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 10:59:08,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 10:59:08,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 10:59:08,295 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 10:59:08,450 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 10:59:08,452 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 10:59:08,939 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 10:59:09,146 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 10:59:09,146 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-16 10:59:09,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 10:59:09 BoogieIcfgContainer [2022-11-16 10:59:09,148 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 10:59:09,151 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 10:59:09,151 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 10:59:09,154 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 10:59:09,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 10:59:07" (1/3) ... [2022-11-16 10:59:09,155 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@292496e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:59:09, skipping insertion in model container [2022-11-16 10:59:09,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:59:08" (2/3) ... [2022-11-16 10:59:09,155 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@292496e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:59:09, skipping insertion in model container [2022-11-16 10:59:09,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 10:59:09" (3/3) ... [2022-11-16 10:59:09,157 INFO L112 eAbstractionObserver]: Analyzing ICFG mix015.opt.i [2022-11-16 10:59:09,175 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 10:59:09,175 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-11-16 10:59:09,175 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 10:59:09,256 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-16 10:59:09,289 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-16 10:59:09,303 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 131 transitions, 277 flow [2022-11-16 10:59:09,306 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 131 transitions, 277 flow [2022-11-16 10:59:09,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 131 transitions, 277 flow [2022-11-16 10:59:09,358 INFO L130 PetriNetUnfolder]: 2/128 cut-off events. [2022-11-16 10:59:09,358 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 10:59:09,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 128 events. 2/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 81. Up to 2 conditions per place. [2022-11-16 10:59:09,365 INFO L119 LiptonReduction]: Number of co-enabled transitions 2400 [2022-11-16 10:59:18,527 INFO L134 LiptonReduction]: Checked pairs total: 6276 [2022-11-16 10:59:18,527 INFO L136 LiptonReduction]: Total number of compositions: 127 [2022-11-16 10:59:18,535 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 44 places, 35 transitions, 85 flow [2022-11-16 10:59:18,637 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 984 states, 973 states have (on average 3.317574511819116) internal successors, (3228), 983 states have internal predecessors, (3228), 0 states have call successors, (0), 0 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 10:59:18,658 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 10:59:18,664 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;@2dc58486, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 10:59:18,665 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-11-16 10:59:18,669 INFO L276 IsEmpty]: Start isEmpty. Operand has 984 states, 973 states have (on average 3.317574511819116) internal successors, (3228), 983 states have internal predecessors, (3228), 0 states have call successors, (0), 0 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 10:59:18,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-16 10:59:18,674 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:59:18,675 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-16 10:59:18,675 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 10:59:18,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:59:18,680 INFO L85 PathProgramCache]: Analyzing trace with hash 570, now seen corresponding path program 1 times [2022-11-16 10:59:18,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 10:59:18,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1259286689] [2022-11-16 10:59:18,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:59:18,693 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 10:59:18,693 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 10:59:18,699 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/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 10:59:18,711 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/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 10:59:18,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:59:18,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-16 10:59:18,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:59:18,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 10:59:18,829 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 10:59:18,830 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 10:59:18,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1259286689] [2022-11-16 10:59:18,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1259286689] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:59:18,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:59:18,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-16 10:59:18,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6655885] [2022-11-16 10:59:18,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:59:18,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 10:59:18,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 10:59:18,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 10:59:18,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 10:59:18,869 INFO L87 Difference]: Start difference. First operand has 984 states, 973 states have (on average 3.317574511819116) internal successors, (3228), 983 states have internal predecessors, (3228), 0 states have call successors, (0), 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 10:59:19,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:59:19,078 INFO L93 Difference]: Finished difference Result 932 states and 2966 transitions. [2022-11-16 10:59:19,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 10:59:19,080 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 10:59:19,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:59:19,102 INFO L225 Difference]: With dead ends: 932 [2022-11-16 10:59:19,102 INFO L226 Difference]: Without dead ends: 932 [2022-11-16 10:59:19,103 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 10:59:19,106 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 10:59:19,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 10:59:19,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2022-11-16 10:59:19,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 932. [2022-11-16 10:59:19,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 927 states have (on average 3.199568500539374) internal successors, (2966), 931 states have internal predecessors, (2966), 0 states have call successors, (0), 0 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 10:59:19,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 2966 transitions. [2022-11-16 10:59:19,288 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 2966 transitions. Word has length 1 [2022-11-16 10:59:19,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:59:19,288 INFO L495 AbstractCegarLoop]: Abstraction has 932 states and 2966 transitions. [2022-11-16 10:59:19,288 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 10:59:19,289 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 2966 transitions. [2022-11-16 10:59:19,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-16 10:59:19,289 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:59:19,289 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:59:19,303 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/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 10:59:19,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/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 10:59:19,490 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 10:59:19,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:59:19,491 INFO L85 PathProgramCache]: Analyzing trace with hash -699115439, now seen corresponding path program 1 times [2022-11-16 10:59:19,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 10:59:19,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [7447383] [2022-11-16 10:59:19,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:59:19,493 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 10:59:19,493 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 10:59:19,494 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/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 10:59:19,499 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/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 10:59:19,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:59:19,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 10:59:19,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:59:19,673 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 10:59:19,674 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 10:59:19,674 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 10:59:19,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [7447383] [2022-11-16 10:59:19,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [7447383] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:59:19,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:59:19,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 10:59:19,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318015183] [2022-11-16 10:59:19,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:59:19,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 10:59:19,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 10:59:19,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 10:59:19,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 10:59:19,683 INFO L87 Difference]: Start difference. First operand 932 states and 2966 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 10:59:19,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:59:19,794 INFO L93 Difference]: Finished difference Result 792 states and 2489 transitions. [2022-11-16 10:59:19,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 10:59:19,795 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 10:59:19,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:59:19,801 INFO L225 Difference]: With dead ends: 792 [2022-11-16 10:59:19,801 INFO L226 Difference]: Without dead ends: 772 [2022-11-16 10:59:19,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 10:59:19,803 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 11 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 10:59:19,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 6 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 10:59:19,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2022-11-16 10:59:19,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 772. [2022-11-16 10:59:19,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 772 states, 770 states have (on average 3.1662337662337663) internal successors, (2438), 771 states have internal predecessors, (2438), 0 states have call successors, (0), 0 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 10:59:19,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 2438 transitions. [2022-11-16 10:59:19,844 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 2438 transitions. Word has length 7 [2022-11-16 10:59:19,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:59:19,845 INFO L495 AbstractCegarLoop]: Abstraction has 772 states and 2438 transitions. [2022-11-16 10:59:19,845 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 10:59:19,846 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 2438 transitions. [2022-11-16 10:59:19,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-16 10:59:19,848 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:59:19,848 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:59:19,871 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/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 10:59:20,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/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 10:59:20,060 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 10:59:20,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:59:20,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1048604699, now seen corresponding path program 1 times [2022-11-16 10:59:20,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 10:59:20,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1150374931] [2022-11-16 10:59:20,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:59:20,063 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 10:59:20,063 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 10:59:20,064 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/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 10:59:20,107 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/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 10:59:20,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:59:20,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 10:59:20,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:59:20,245 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 10:59:20,246 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 10:59:20,246 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 10:59:20,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1150374931] [2022-11-16 10:59:20,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1150374931] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:59:20,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:59:20,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 10:59:20,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719736412] [2022-11-16 10:59:20,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:59:20,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 10:59:20,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 10:59:20,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 10:59:20,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 10:59:20,249 INFO L87 Difference]: Start difference. First operand 772 states and 2438 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:59:20,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:59:20,434 INFO L93 Difference]: Finished difference Result 592 states and 1584 transitions. [2022-11-16 10:59:20,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 10:59:20,435 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-16 10:59:20,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:59:20,438 INFO L225 Difference]: With dead ends: 592 [2022-11-16 10:59:20,438 INFO L226 Difference]: Without dead ends: 472 [2022-11-16 10:59:20,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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 10:59:20,440 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 34 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 10:59:20,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 15 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 10:59:20,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2022-11-16 10:59:20,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 472. [2022-11-16 10:59:20,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 470 states have (on average 2.6340425531914895) internal successors, (1238), 471 states have internal predecessors, (1238), 0 states have call successors, (0), 0 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 10:59:20,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 1238 transitions. [2022-11-16 10:59:20,462 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 1238 transitions. Word has length 10 [2022-11-16 10:59:20,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:59:20,462 INFO L495 AbstractCegarLoop]: Abstraction has 472 states and 1238 transitions. [2022-11-16 10:59:20,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:59:20,463 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 1238 transitions. [2022-11-16 10:59:20,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 10:59:20,464 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:59:20,465 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:59:20,484 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/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 10:59:20,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/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 10:59:20,677 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 10:59:20,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:59:20,677 INFO L85 PathProgramCache]: Analyzing trace with hash -195184198, now seen corresponding path program 1 times [2022-11-16 10:59:20,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 10:59:20,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1444021206] [2022-11-16 10:59:20,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:59:20,678 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 10:59:20,679 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 10:59:20,680 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/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 10:59:20,685 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/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 10:59:20,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:59:20,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 10:59:20,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:59:20,871 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 10:59:20,871 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 10:59:20,872 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 10:59:20,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1444021206] [2022-11-16 10:59:20,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1444021206] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:59:20,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:59:20,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 10:59:20,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908959466] [2022-11-16 10:59:20,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:59:20,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 10:59:20,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 10:59:20,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 10:59:20,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 10:59:20,874 INFO L87 Difference]: Start difference. First operand 472 states and 1238 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 10:59:21,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:59:21,081 INFO L93 Difference]: Finished difference Result 297 states and 686 transitions. [2022-11-16 10:59:21,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 10:59:21,082 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 10:59:21,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:59:21,083 INFO L225 Difference]: With dead ends: 297 [2022-11-16 10:59:21,083 INFO L226 Difference]: Without dead ends: 237 [2022-11-16 10:59:21,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 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 10:59:21,084 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 45 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 10:59:21,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 27 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 10:59:21,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-11-16 10:59:21,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2022-11-16 10:59:21,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 235 states have (on average 2.2680851063829786) internal successors, (533), 236 states have internal predecessors, (533), 0 states have call successors, (0), 0 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 10:59:21,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 533 transitions. [2022-11-16 10:59:21,097 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 533 transitions. Word has length 13 [2022-11-16 10:59:21,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:59:21,097 INFO L495 AbstractCegarLoop]: Abstraction has 237 states and 533 transitions. [2022-11-16 10:59:21,098 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 10:59:21,098 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 533 transitions. [2022-11-16 10:59:21,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-16 10:59:21,099 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:59:21,099 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:59:21,115 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/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 10:59:21,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/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 10:59:21,311 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 10:59:21,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:59:21,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1059680707, now seen corresponding path program 1 times [2022-11-16 10:59:21,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 10:59:21,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [715238530] [2022-11-16 10:59:21,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:59:21,313 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 10:59:21,313 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 10:59:21,314 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/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 10:59:21,319 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/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 10:59:21,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:59:21,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-16 10:59:21,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:59:21,509 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 10:59:21,509 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 10:59:21,509 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 10:59:21,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [715238530] [2022-11-16 10:59:21,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [715238530] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:59:21,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:59:21,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 10:59:21,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649788538] [2022-11-16 10:59:21,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:59:21,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 10:59:21,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 10:59:21,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 10:59:21,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 10:59:21,511 INFO L87 Difference]: Start difference. First operand 237 states and 533 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:59:21,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:59:21,854 INFO L93 Difference]: Finished difference Result 190 states and 437 transitions. [2022-11-16 10:59:21,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 10:59:21,854 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-16 10:59:21,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:59:21,855 INFO L225 Difference]: With dead ends: 190 [2022-11-16 10:59:21,855 INFO L226 Difference]: Without dead ends: 177 [2022-11-16 10:59:21,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-16 10:59:21,856 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 41 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 10:59:21,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 45 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 10:59:21,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-11-16 10:59:21,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2022-11-16 10:59:21,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 175 states have (on average 2.36) internal successors, (413), 176 states have internal predecessors, (413), 0 states have call successors, (0), 0 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 10:59:21,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 413 transitions. [2022-11-16 10:59:21,863 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 413 transitions. Word has length 17 [2022-11-16 10:59:21,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:59:21,863 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 413 transitions. [2022-11-16 10:59:21,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:59:21,863 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 413 transitions. [2022-11-16 10:59:21,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-16 10:59:21,865 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:59:21,865 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:59:21,877 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/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 10:59:22,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/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 10:59:22,066 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 10:59:22,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:59:22,066 INFO L85 PathProgramCache]: Analyzing trace with hash -828143658, now seen corresponding path program 1 times [2022-11-16 10:59:22,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 10:59:22,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [171491285] [2022-11-16 10:59:22,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:59:22,067 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 10:59:22,067 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 10:59:22,068 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/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 10:59:22,069 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/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 10:59:22,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:59:22,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-16 10:59:22,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:59:22,637 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 10:59:22,637 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 10:59:22,637 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 10:59:22,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [171491285] [2022-11-16 10:59:22,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [171491285] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:59:22,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:59:22,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 10:59:22,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441233984] [2022-11-16 10:59:22,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:59:22,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 10:59:22,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 10:59:22,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 10:59:22,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 10:59:22,639 INFO L87 Difference]: Start difference. First operand 177 states and 413 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 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 10:59:22,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:59:22,725 INFO L93 Difference]: Finished difference Result 292 states and 681 transitions. [2022-11-16 10:59:22,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 10:59:22,726 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-16 10:59:22,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:59:22,727 INFO L225 Difference]: With dead ends: 292 [2022-11-16 10:59:22,727 INFO L226 Difference]: Without dead ends: 292 [2022-11-16 10:59:22,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 10:59:22,728 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 9 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 10:59:22,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 22 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 30 Unchecked, 0.1s Time] [2022-11-16 10:59:22,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2022-11-16 10:59:22,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 208. [2022-11-16 10:59:22,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 206 states have (on average 2.2427184466019416) internal successors, (462), 207 states have internal predecessors, (462), 0 states have call successors, (0), 0 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 10:59:22,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 462 transitions. [2022-11-16 10:59:22,739 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 462 transitions. Word has length 22 [2022-11-16 10:59:22,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:59:22,739 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 462 transitions. [2022-11-16 10:59:22,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 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 10:59:22,739 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 462 transitions. [2022-11-16 10:59:22,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-16 10:59:22,741 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:59:22,741 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:59:22,759 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/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 10:59:22,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/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 10:59:22,954 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 10:59:22,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:59:22,954 INFO L85 PathProgramCache]: Analyzing trace with hash -828143718, now seen corresponding path program 1 times [2022-11-16 10:59:22,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 10:59:22,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1625263103] [2022-11-16 10:59:22,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:59:22,955 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 10:59:22,955 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 10:59:22,956 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/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 10:59:22,965 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-16 10:59:23,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:59:23,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 10:59:23,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:59:23,162 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 10:59:23,163 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 10:59:23,163 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 10:59:23,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1625263103] [2022-11-16 10:59:23,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1625263103] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:59:23,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:59:23,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 10:59:23,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993744201] [2022-11-16 10:59:23,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:59:23,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 10:59:23,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 10:59:23,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 10:59:23,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 10:59:23,165 INFO L87 Difference]: Start difference. First operand 208 states and 462 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 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 10:59:23,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:59:23,345 INFO L93 Difference]: Finished difference Result 260 states and 569 transitions. [2022-11-16 10:59:23,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 10:59:23,346 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-16 10:59:23,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:59:23,347 INFO L225 Difference]: With dead ends: 260 [2022-11-16 10:59:23,347 INFO L226 Difference]: Without dead ends: 223 [2022-11-16 10:59:23,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-16 10:59:23,348 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 23 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 10:59:23,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 12 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 10:59:23,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-11-16 10:59:23,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 222. [2022-11-16 10:59:23,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 220 states have (on average 2.3) internal successors, (506), 221 states have internal predecessors, (506), 0 states have call successors, (0), 0 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 10:59:23,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 506 transitions. [2022-11-16 10:59:23,356 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 506 transitions. Word has length 22 [2022-11-16 10:59:23,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:59:23,356 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 506 transitions. [2022-11-16 10:59:23,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 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 10:59:23,356 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 506 transitions. [2022-11-16 10:59:23,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-16 10:59:23,357 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:59:23,357 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:59:23,376 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-16 10:59:23,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/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 10:59:23,570 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 10:59:23,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:59:23,570 INFO L85 PathProgramCache]: Analyzing trace with hash -454977258, now seen corresponding path program 2 times [2022-11-16 10:59:23,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 10:59:23,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2085260196] [2022-11-16 10:59:23,571 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 10:59:23,571 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 10:59:23,571 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 10:59:23,572 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/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 10:59:23,576 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-16 10:59:23,776 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-16 10:59:23,776 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 10:59:23,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-16 10:59:23,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:59:24,126 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 10:59:24,126 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 10:59:24,127 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 10:59:24,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2085260196] [2022-11-16 10:59:24,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2085260196] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:59:24,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:59:24,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 10:59:24,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733869857] [2022-11-16 10:59:24,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:59:24,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 10:59:24,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 10:59:24,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 10:59:24,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 10:59:24,128 INFO L87 Difference]: Start difference. First operand 222 states and 506 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 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 10:59:24,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:59:24,197 INFO L93 Difference]: Finished difference Result 337 states and 773 transitions. [2022-11-16 10:59:24,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 10:59:24,198 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-16 10:59:24,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:59:24,199 INFO L225 Difference]: With dead ends: 337 [2022-11-16 10:59:24,199 INFO L226 Difference]: Without dead ends: 204 [2022-11-16 10:59:24,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 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 10:59:24,200 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 8 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 10:59:24,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 22 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 24 Unchecked, 0.1s Time] [2022-11-16 10:59:24,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-11-16 10:59:24,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2022-11-16 10:59:24,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 202 states have (on average 2.282178217821782) internal successors, (461), 203 states have internal predecessors, (461), 0 states have call successors, (0), 0 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 10:59:24,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 461 transitions. [2022-11-16 10:59:24,207 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 461 transitions. Word has length 22 [2022-11-16 10:59:24,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:59:24,208 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 461 transitions. [2022-11-16 10:59:24,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 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 10:59:24,208 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 461 transitions. [2022-11-16 10:59:24,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-16 10:59:24,209 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:59:24,209 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:59:24,224 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-16 10:59:24,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/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 10:59:24,423 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 10:59:24,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:59:24,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1537982642, now seen corresponding path program 3 times [2022-11-16 10:59:24,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 10:59:24,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [485193025] [2022-11-16 10:59:24,424 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 10:59:24,424 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 10:59:24,424 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 10:59:24,425 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/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 10:59:24,426 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-16 10:59:24,624 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-16 10:59:24,624 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 10:59:24,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-16 10:59:24,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:59:24,983 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 10:59:24,984 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 10:59:24,984 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 10:59:24,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [485193025] [2022-11-16 10:59:24,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [485193025] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:59:24,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:59:24,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 10:59:24,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985460020] [2022-11-16 10:59:24,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:59:24,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 10:59:24,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 10:59:24,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 10:59:24,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 10:59:24,986 INFO L87 Difference]: Start difference. First operand 204 states and 461 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 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 10:59:25,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:59:25,025 INFO L93 Difference]: Finished difference Result 203 states and 459 transitions. [2022-11-16 10:59:25,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 10:59:25,026 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-16 10:59:25,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:59:25,027 INFO L225 Difference]: With dead ends: 203 [2022-11-16 10:59:25,027 INFO L226 Difference]: Without dead ends: 88 [2022-11-16 10:59:25,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 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 10:59:25,028 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 3 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 21 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 10:59:25,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 9 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 21 Unchecked, 0.0s Time] [2022-11-16 10:59:25,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-11-16 10:59:25,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-11-16 10:59:25,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 2.0229885057471266) internal successors, (176), 87 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:59:25,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 176 transitions. [2022-11-16 10:59:25,031 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 176 transitions. Word has length 22 [2022-11-16 10:59:25,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:59:25,031 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 176 transitions. [2022-11-16 10:59:25,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 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 10:59:25,032 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 176 transitions. [2022-11-16 10:59:25,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-16 10:59:25,032 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:59:25,032 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:59:25,047 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-16 10:59:25,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/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 10:59:25,248 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 10:59:25,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:59:25,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1615690842, now seen corresponding path program 2 times [2022-11-16 10:59:25,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 10:59:25,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1819849646] [2022-11-16 10:59:25,249 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 10:59:25,249 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 10:59:25,249 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 10:59:25,249 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/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 10:59:25,254 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-16 10:59:25,395 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-16 10:59:25,396 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 10:59:25,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-16 10:59:25,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:59:25,934 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 10:59:25,935 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 10:59:25,935 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 10:59:25,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1819849646] [2022-11-16 10:59:25,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1819849646] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:59:25,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:59:25,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 10:59:25,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302491045] [2022-11-16 10:59:25,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:59:25,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 10:59:25,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 10:59:25,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 10:59:25,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-16 10:59:25,937 INFO L87 Difference]: Start difference. First operand 88 states and 176 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 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 10:59:26,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:59:26,271 INFO L93 Difference]: Finished difference Result 111 states and 215 transitions. [2022-11-16 10:59:26,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 10:59:26,271 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-16 10:59:26,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:59:26,272 INFO L225 Difference]: With dead ends: 111 [2022-11-16 10:59:26,272 INFO L226 Difference]: Without dead ends: 68 [2022-11-16 10:59:26,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-11-16 10:59:26,273 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 39 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 10:59:26,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 32 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 10:59:26,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-11-16 10:59:26,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-11-16 10:59:26,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.791044776119403) internal successors, (120), 67 states have internal predecessors, (120), 0 states have call successors, (0), 0 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 10:59:26,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 120 transitions. [2022-11-16 10:59:26,276 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 120 transitions. Word has length 22 [2022-11-16 10:59:26,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:59:26,276 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 120 transitions. [2022-11-16 10:59:26,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 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 10:59:26,277 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 120 transitions. [2022-11-16 10:59:26,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-16 10:59:26,277 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:59:26,277 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:59:26,290 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-16 10:59:26,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/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 10:59:26,487 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 10:59:26,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:59:26,487 INFO L85 PathProgramCache]: Analyzing trace with hash 996360892, now seen corresponding path program 3 times [2022-11-16 10:59:26,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 10:59:26,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1305385466] [2022-11-16 10:59:26,488 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 10:59:26,488 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 10:59:26,488 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 10:59:26,489 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/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 10:59:26,494 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-16 10:59:26,642 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-16 10:59:26,643 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-16 10:59:26,643 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 10:59:26,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 10:59:26,817 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-16 10:59:26,817 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 10:59:26,818 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2022-11-16 10:59:26,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2022-11-16 10:59:26,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-11-16 10:59:26,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-11-16 10:59:26,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-11-16 10:59:26,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-11-16 10:59:26,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-11-16 10:59:26,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-11-16 10:59:26,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2022-11-16 10:59:26,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2022-11-16 10:59:26,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2022-11-16 10:59:26,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2022-11-16 10:59:26,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-11-16 10:59:26,852 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-16 10:59:27,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/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 10:59:27,036 INFO L444 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1] [2022-11-16 10:59:27,039 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-16 10:59:27,039 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 10:59:27,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 10:59:27 BasicIcfg [2022-11-16 10:59:27,129 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 10:59:27,130 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 10:59:27,130 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 10:59:27,130 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 10:59:27,131 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 10:59:09" (3/4) ... [2022-11-16 10:59:27,134 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-16 10:59:27,134 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 10:59:27,134 INFO L158 Benchmark]: Toolchain (without parser) took 19782.21ms. Allocated memory was 58.7MB in the beginning and 119.5MB in the end (delta: 60.8MB). Free memory was 35.4MB in the beginning and 42.7MB in the end (delta: -7.3MB). Peak memory consumption was 55.0MB. Max. memory is 16.1GB. [2022-11-16 10:59:27,135 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 58.7MB. Free memory is still 40.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 10:59:27,135 INFO L158 Benchmark]: CACSL2BoogieTranslator took 672.56ms. Allocated memory is still 58.7MB. Free memory was 35.2MB in the beginning and 29.9MB in the end (delta: 5.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-16 10:59:27,135 INFO L158 Benchmark]: Boogie Procedure Inliner took 92.18ms. Allocated memory is still 58.7MB. Free memory was 29.7MB in the beginning and 27.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 10:59:27,136 INFO L158 Benchmark]: Boogie Preprocessor took 70.44ms. Allocated memory is still 58.7MB. Free memory was 27.0MB in the beginning and 24.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 10:59:27,136 INFO L158 Benchmark]: RCFGBuilder took 956.28ms. Allocated memory was 58.7MB in the beginning and 77.6MB in the end (delta: 18.9MB). Free memory was 24.9MB in the beginning and 38.4MB in the end (delta: -13.5MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. [2022-11-16 10:59:27,136 INFO L158 Benchmark]: TraceAbstraction took 17978.81ms. Allocated memory was 77.6MB in the beginning and 119.5MB in the end (delta: 41.9MB). Free memory was 37.4MB in the beginning and 42.7MB in the end (delta: -5.2MB). Peak memory consumption was 37.5MB. Max. memory is 16.1GB. [2022-11-16 10:59:27,137 INFO L158 Benchmark]: Witness Printer took 3.88ms. Allocated memory is still 119.5MB. Free memory is still 42.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 10:59:27,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.29ms. Allocated memory is still 58.7MB. Free memory is still 40.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 672.56ms. Allocated memory is still 58.7MB. Free memory was 35.2MB in the beginning and 29.9MB in the end (delta: 5.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 92.18ms. Allocated memory is still 58.7MB. Free memory was 29.7MB in the beginning and 27.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.44ms. Allocated memory is still 58.7MB. Free memory was 27.0MB in the beginning and 24.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 956.28ms. Allocated memory was 58.7MB in the beginning and 77.6MB in the end (delta: 18.9MB). Free memory was 24.9MB in the beginning and 38.4MB in the end (delta: -13.5MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. * TraceAbstraction took 17978.81ms. Allocated memory was 77.6MB in the beginning and 119.5MB in the end (delta: 41.9MB). Free memory was 37.4MB in the beginning and 42.7MB in the end (delta: -5.2MB). Peak memory consumption was 37.5MB. Max. memory is 16.1GB. * Witness Printer took 3.88ms. Allocated memory is still 119.5MB. Free memory is still 42.7MB. 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: 9.2s, 139 PlacesBefore, 44 PlacesAfterwards, 131 TransitionsBefore, 35 TransitionsAfterwards, 2400 CoEnabledTransitionPairs, 8 FixpointIterations, 53 TrivialSequentialCompositions, 64 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 127 TotalNumberOfCompositions, 6276 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3833, independent: 3645, independent conditional: 0, independent unconditional: 3645, dependent: 188, dependent conditional: 0, dependent unconditional: 188, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1732, independent: 1686, independent conditional: 0, independent unconditional: 1686, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1732, independent: 1659, independent conditional: 0, independent unconditional: 1659, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 73, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 408, independent: 53, independent conditional: 0, independent unconditional: 53, dependent: 355, dependent conditional: 0, dependent unconditional: 355, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3833, independent: 1959, independent conditional: 0, independent unconditional: 1959, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 1732, unknown conditional: 0, unknown unconditional: 1732] , Statistics on independence cache: Total cache size (in pairs): 199, Positive cache size: 176, Positive conditional cache size: 0, Positive unconditional cache size: 176, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23, 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: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L719] 0 int __unbuffered_p2_EBX = 0; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L746] 0 _Bool weak$$choice0; [L744] 0 int z$w_buff1; [L747] 0 _Bool weak$$choice2; [L711] 0 int __unbuffered_p0_EAX = 0; [L730] 0 _Bool z$flush_delayed; [L742] 0 int z$w_buff0; [L733] 0 _Bool z$r_buff0_thd1; [L734] 0 _Bool z$r_buff0_thd2; [L715] 0 int __unbuffered_p1_EAX = 0; [L732] 0 _Bool z$r_buff0_thd0; [L735] 0 _Bool z$r_buff0_thd3; [L731] 0 int z$mem_tmp; [L740] 0 _Bool z$read_delayed; [L721] 0 int a = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L741] 0 int *z$read_delayed_var; [L745] 0 _Bool z$w_buff1_used; [L709] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L723] 0 _Bool main$tmp_guard1; [L722] 0 _Bool main$tmp_guard0; [L743] 0 _Bool z$w_buff0_used; [L725] 0 int x = 0; [L727] 0 int y = 0; [L729] 0 int z = 0; [L853] 0 pthread_t t388; [L854] FCALL, FORK 0 pthread_create(&t388, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t388, ((void *)0), P0, ((void *)0))=-1, t388={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] 0 pthread_t t389; [L856] FCALL, FORK 0 pthread_create(&t389, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t389, ((void *)0), P1, ((void *)0))=0, t388={3:0}, t389={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] 0 pthread_t t390; [L858] FCALL, FORK 0 pthread_create(&t390, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t390, ((void *)0), P2, ((void *)0))=1, t388={3:0}, t389={7:0}, t390={15:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L800] 3 z$w_buff1 = z$w_buff0 [L801] 3 z$w_buff0 = 1 [L802] 3 z$w_buff1_used = z$w_buff0_used [L803] 3 z$w_buff0_used = (_Bool)1 [L804] CALL 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L804] RET 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L805] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L806] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L807] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L808] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L809] 3 z$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0: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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L812] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 3 z$flush_delayed = weak$$choice2 [L815] 3 z$mem_tmp = z [L816] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L817] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L818] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L819] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L820] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L822] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L823] 3 __unbuffered_p2_EAX = z [L824] 3 z = z$flush_delayed ? z$mem_tmp : z [L825] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0: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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L828] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0: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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 a = 1 [L754] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0: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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0: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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0: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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L772] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0: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=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 z$flush_delayed = weak$$choice2 [L778] 2 z$mem_tmp = z [L779] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L780] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L781] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L782] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L783] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L785] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EAX = z [L787] 2 z = z$flush_delayed ? z$mem_tmp : z [L788] 2 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L831] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L832] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L833] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L834] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L835] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0: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, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 3 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L865] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L866] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L867] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L868] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t388={3:0}, t389={7:0}, t390={15:0}, weak$$choice0=3, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L871] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L873] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: 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: -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: 851]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 858]: 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: 856]: 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: 854]: 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 7 procedures, 159 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 17.7s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 213 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 213 mSDsluCounter, 193 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 75 IncrementalHoareTripleChecker+Unchecked, 131 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 824 IncrementalHoareTripleChecker+Invalid, 920 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 62 mSDtfsCounter, 824 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 156 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=984occurred in iteration=0, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 85 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 180 NumberOfCodeBlocks, 180 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 148 ConstructedInterpolants, 44 QuantifiedInterpolants, 2453 SizeOfPredicates, 19 NumberOfNonLiveVariables, 1380 ConjunctsInSsa, 90 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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 10:59:27,166 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8366f8f-0a5b-4e19-8557-9d4168020571/bin/uautomizer-tPACEb0tL8/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